TSTP Solution File: SYN259-1 by Beagle---0.9.47

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.47
% Problem  : SYN259-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xms512M -Xmx4G -Xss10M -XX:MaxPermSize=384M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n029.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Thu Jul 21 02:36:07 EDT 2022

% Result   : Unsatisfiable 6.60s 2.20s
% Output   : CNFRefutation 6.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   62
% Syntax   : Number of formulae    :   73 (  11 unt;  56 typ;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   25 (  14   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    5 (   0 usr;   3 ari)
%            Number of type conns  :   96 (  51   >;  45   *;   0   +;   0  <<)
%            Number of predicates  :   49 (  48 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   10 (  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ r3 > q2 > q1 > p5 > p4 > p3 > p2 > p1 > n1 > m3 > m1 > m0 > k3 > s3 > r5 > q5 > q4 > q3 > q0 > p0 > n5 > n4 > n0 > m5 > m4 > l3 > l2 > l1 > k2 > s5 > s4 > s2 > s1 > s0 > r4 > r2 > r1 > r0 > n3 > n2 > m2 > l5 > l4 > l0 > k5 > k4 > k1 > k0 > #nlpp > e > d > c > b > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(n5,type,
    n5: ( $i * $i ) > $o ).

tff(p2,type,
    p2: ( $i * $i * $i ) > $o ).

tff(m2,type,
    m2: $i > $o ).

tff(s5,type,
    s5: $i > $o ).

tff(s1,type,
    s1: $i > $o ).

tff(m5,type,
    m5: ( $i * $i ) > $o ).

tff(q4,type,
    q4: ( $i * $i ) > $o ).

tff(m4,type,
    m4: ( $i * $i ) > $o ).

tff('#nlpp',type,
    '#nlpp': ( $real * $real ) > $real ).

tff(a,type,
    a: $i ).

tff(k1,type,
    k1: $i > $o ).

tff(l1,type,
    l1: ( $i * $i ) > $o ).

tff(s0,type,
    s0: $i > $o ).

tff(q2,type,
    q2: ( $i * $i * $i ) > $o ).

tff(n0,type,
    n0: ( $i * $i ) > $o ).

tff(k0,type,
    k0: $i > $o ).

tff(m3,type,
    m3: ( $i * $i * $i ) > $o ).

tff(r4,type,
    r4: $i > $o ).

tff(l0,type,
    l0: $i > $o ).

tff(q0,type,
    q0: ( $i * $i ) > $o ).

tff(k4,type,
    k4: $i > $o ).

tff(m1,type,
    m1: ( $i * $i * $i ) > $o ).

tff(b,type,
    b: $i ).

tff(p0,type,
    p0: ( $i * $i ) > $o ).

tff(r0,type,
    r0: $i > $o ).

tff(q1,type,
    q1: ( $i * $i * $i ) > $o ).

tff(s4,type,
    s4: $i > $o ).

tff(r3,type,
    r3: ( $i * $i * $i ) > $o ).

tff(k2,type,
    k2: ( $i * $i ) > $o ).

tff(n2,type,
    n2: $i > $o ).

tff(s3,type,
    s3: ( $i * $i ) > $o ).

tff(l3,type,
    l3: ( $i * $i ) > $o ).

tff(p3,type,
    p3: ( $i * $i * $i ) > $o ).

tff(p4,type,
    p4: ( $i * $i * $i ) > $o ).

tff('#nlpp_001',type,
    '#nlpp': ( $rat * $rat ) > $rat ).

tff(s2,type,
    s2: $i > $o ).

tff(r5,type,
    r5: ( $i * $i ) > $o ).

tff(k3,type,
    k3: ( $i * $i * $i ) > $o ).

tff(d,type,
    d: $i ).

tff(l2,type,
    l2: ( $i * $i ) > $o ).

tff(l4,type,
    l4: $i > $o ).

tff(l5,type,
    l5: $i > $o ).

tff(k5,type,
    k5: $i > $o ).

tff(p5,type,
    p5: ( $i * $i * $i ) > $o ).

tff(n4,type,
    n4: ( $i * $i ) > $o ).

tff('#nlpp_002',type,
    '#nlpp': ( $int * $int ) > $int ).

tff(q3,type,
    q3: ( $i * $i ) > $o ).

tff(m0,type,
    m0: ( $i * $i * $i ) > $o ).

tff(q5,type,
    q5: ( $i * $i ) > $o ).

tff(e,type,
    e: $i ).

tff(n1,type,
    n1: ( $i * $i * $i ) > $o ).

tff(r1,type,
    r1: $i > $o ).

tff(n3,type,
    n3: $i > $o ).

tff(r2,type,
    r2: $i > $o ).

tff(p1,type,
    p1: ( $i * $i * $i ) > $o ).

tff(c,type,
    c: $i ).

tff(f_81,axiom,
    n0(c,d),
    file(unknown,unknown) ).

tff(f_91,axiom,
    ! [I,J] :
      ( k1(I)
      | ~ n0(J,I) ),
    file(unknown,unknown) ).

tff(f_71,axiom,
    l0(c),
    file(unknown,unknown) ).

tff(f_75,axiom,
    k0(e),
    file(unknown,unknown) ).

tff(f_710,axiom,
    ! [A] :
      ( p1(A,A,A)
      | ~ k0(e)
      | ~ k1(A)
      | ~ l0(c) ),
    file(unknown,unknown) ).

tff(f_2765,axiom,
    ! [X] : ~ p1(X,d,X),
    file(unknown,unknown) ).

tff(c_68,plain,
    n0(c,d),
    inference(cnfTransformation,[status(thm)],[f_81]) ).

tff(c_886,plain,
    ! [J_642,I_643] :
      ( ~ n0(J_642,I_643)
      | k1(I_643) ),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

tff(c_911,plain,
    k1(d),
    inference(resolution,[status(thm)],[c_68,c_886]) ).

tff(c_48,plain,
    l0(c),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_56,plain,
    k0(e),
    inference(cnfTransformation,[status(thm)],[f_75]) ).

tff(c_234,plain,
    ! [A_144] :
      ( ~ l0(c)
      | ~ k1(A_144)
      | ~ k0(e)
      | p1(A_144,A_144,A_144) ),
    inference(cnfTransformation,[status(thm)],[f_710]) ).

tff(c_750,plain,
    ! [A_144] :
      ( ~ l0(c)
      | ~ k1(A_144)
      | p1(A_144,A_144,A_144) ),
    inference(demodulation,[status(thm),theory(equality)],[c_56,c_234]) ).

tff(c_965,plain,
    ! [A_668] :
      ( ~ k1(A_668)
      | p1(A_668,A_668,A_668) ),
    inference(demodulation,[status(thm),theory(equality)],[c_48,c_750]) ).

tff(c_738,plain,
    ! [X_627] : ~ p1(X_627,d,X_627),
    inference(cnfTransformation,[status(thm)],[f_2765]) ).

tff(c_972,plain,
    ~ k1(d),
    inference(resolution,[status(thm)],[c_965,c_738]) ).

tff(c_977,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_911,c_972]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN259-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13  % Command  : java -Xms512M -Xmx4G -Xss10M -XX:MaxPermSize=384M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.34  % Computer : n029.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jul 11 22:56:47 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.35  OpenJDK 64-Bit Server VM warning: ignoring option MaxPermSize=384M; support was removed in 8.0
% 6.60/2.20  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.60/2.20  
% 6.60/2.20  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.60/2.21  
% 6.60/2.21  Inference rules
% 6.60/2.21  ----------------------
% 6.60/2.21  #Ref     : 0
% 6.60/2.21  #Sup     : 22
% 6.60/2.21  #Fact    : 0
% 6.60/2.21  #Define  : 0
% 6.60/2.21  #Split   : 10
% 6.60/2.21  #Chain   : 0
% 6.60/2.21  #Close   : 0
% 6.60/2.21  
% 6.60/2.21  Ordering : KBO
% 6.60/2.21  
% 6.60/2.21  Simplification rules
% 6.60/2.21  ----------------------
% 6.60/2.21  #Subsume      : 31
% 6.60/2.21  #Demod        : 60
% 6.60/2.21  #Tautology    : 18
% 6.60/2.21  #SimpNegUnit  : 1
% 6.60/2.21  #BackRed      : 0
% 6.60/2.21  
% 6.60/2.21  #Partial instantiations: 0
% 6.60/2.21  #Strategies tried      : 1
% 6.60/2.21  
% 6.60/2.21  Timing (in seconds)
% 6.60/2.21  ----------------------
% 6.60/2.21  Preprocessing        : 0.80
% 6.60/2.22  Parsing              : 0.45
% 6.60/2.22  CNF conversion       : 0.07
% 6.60/2.22  Main loop            : 0.66
% 6.60/2.22  Inferencing          : 0.09
% 6.60/2.22  Reduction            : 0.27
% 6.60/2.22  Demodulation         : 0.17
% 6.60/2.22  BG Simplification    : 0.09
% 6.60/2.22  Subsumption          : 0.17
% 6.60/2.22  Abstraction          : 0.02
% 6.60/2.22  MUC search           : 0.00
% 6.60/2.22  Cooper               : 0.00
% 6.60/2.22  Total                : 1.48
% 6.60/2.22  Index Insertion      : 0.00
% 6.60/2.22  Index Deletion       : 0.00
% 6.60/2.22  Index Matching       : 0.00
% 6.60/2.22  BG Taut test         : 0.00
%------------------------------------------------------------------------------