TSTP Solution File: SYN123-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN123-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -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 : n016.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  : 300s
% DateTime : Tue Aug 22 11:09:41 EDT 2023

% Result   : Unsatisfiable 30.13s 17.49s
% Output   : CNFRefutation 30.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   60
% Syntax   : Number of formulae    :   78 (  16 unt;  53 typ;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   36 (  20   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   90 (  48   >;  42   *;   0   +;   0  <<)
%            Number of predicates  :   49 (  48 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   37 (;  37   !;   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(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(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(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_66,axiom,
    ! [X,Y] : m0(X,d,Y),
    file(unknown,unknown) ).

tff(f_59,axiom,
    ! [X] : p0(b,X),
    file(unknown,unknown) ).

tff(f_63,axiom,
    ! [X] : q0(X,d),
    file(unknown,unknown) ).

tff(f_1081,axiom,
    ! [F,G,H] :
      ( s1(F)
      | ~ q0(F,G)
      | ~ s1(H) ),
    file(unknown,unknown) ).

tff(f_1073,axiom,
    ! [I] :
      ( s1(I)
      | ~ p0(I,I) ),
    file(unknown,unknown) ).

tff(f_1141,axiom,
    ! [J,A,B,C] :
      ( l2(J,J)
      | ~ p0(A,A)
      | ~ s1(B)
      | ~ m0(C,B,J) ),
    file(unknown,unknown) ).

tff(f_2764,axiom,
    ~ l2(d,d),
    file(unknown,unknown) ).

tff(c_38,plain,
    ! [X_4,Y_5] : m0(X_4,d,Y_5),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_28,plain,
    ! [X_2] : p0(b,X_2),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_34,plain,
    ! [X_3] : q0(X_3,d),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_328,plain,
    ! [H_236,F_234,G_235] :
      ( ~ s1(H_236)
      | ~ q0(F_234,G_235)
      | s1(F_234) ),
    inference(cnfTransformation,[status(thm)],[f_1081]) ).

tff(c_48122,plain,
    ! [H_236] : ~ s1(H_236),
    inference(splitLeft,[status(thm)],[c_328]) ).

tff(c_1416,plain,
    ! [I_755] :
      ( ~ p0(I_755,I_755)
      | s1(I_755) ),
    inference(cnfTransformation,[status(thm)],[f_1073]) ).

tff(c_1421,plain,
    s1(b),
    inference(resolution,[status(thm)],[c_28,c_1416]) ).

tff(c_48126,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_48122,c_1421]) ).

tff(c_48130,plain,
    ! [F_6814,G_6815] :
      ( ~ q0(F_6814,G_6815)
      | s1(F_6814) ),
    inference(splitRight,[status(thm)],[c_328]) ).

tff(c_48153,plain,
    ! [X_3] : s1(X_3),
    inference(resolution,[status(thm)],[c_34,c_48130]) ).

tff(c_342,plain,
    ! [C_249,B_248,J_246,A_247] :
      ( ~ m0(C_249,B_248,J_246)
      | ~ s1(B_248)
      | ~ p0(A_247,A_247)
      | l2(J_246,J_246) ),
    inference(cnfTransformation,[status(thm)],[f_1141]) ).

tff(c_75702,plain,
    ! [C_249,B_248,J_246,A_247] :
      ( ~ m0(C_249,B_248,J_246)
      | ~ p0(A_247,A_247)
      | l2(J_246,J_246) ),
    inference(demodulation,[status(thm),theory(equality)],[c_48153,c_342]) ).

tff(c_75704,plain,
    ! [A_9938] : ~ p0(A_9938,A_9938),
    inference(splitLeft,[status(thm)],[c_75702]) ).

tff(c_75709,plain,
    $false,
    inference(resolution,[status(thm)],[c_28,c_75704]) ).

tff(c_75711,plain,
    ! [C_9939,B_9940,J_9941] :
      ( ~ m0(C_9939,B_9940,J_9941)
      | l2(J_9941,J_9941) ),
    inference(splitRight,[status(thm)],[c_75702]) ).

tff(c_75729,plain,
    ! [Y_5] : l2(Y_5,Y_5),
    inference(resolution,[status(thm)],[c_38,c_75711]) ).

tff(c_738,plain,
    ~ l2(d,d),
    inference(cnfTransformation,[status(thm)],[f_2764]) ).

tff(c_75749,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_75729,c_738]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SYN123-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.12  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -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.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Thu Aug  3 18:00:22 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 30.13/17.49  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.13/17.49  
% 30.13/17.49  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 30.24/17.52  
% 30.24/17.52  Inference rules
% 30.24/17.52  ----------------------
% 30.24/17.52  #Ref     : 0
% 30.24/17.52  #Sup     : 13042
% 30.24/17.52  #Fact    : 0
% 30.24/17.52  #Define  : 0
% 30.24/17.52  #Split   : 1375
% 30.24/17.52  #Chain   : 0
% 30.24/17.52  #Close   : 0
% 30.24/17.52  
% 30.24/17.52  Ordering : KBO
% 30.24/17.52  
% 30.24/17.52  Simplification rules
% 30.24/17.52  ----------------------
% 30.24/17.52  #Subsume      : 3815
% 30.24/17.52  #Demod        : 14863
% 30.24/17.52  #Tautology    : 9927
% 30.24/17.52  #SimpNegUnit  : 920
% 30.24/17.52  #BackRed      : 989
% 30.24/17.52  
% 30.24/17.52  #Partial instantiations: 0
% 30.24/17.52  #Strategies tried      : 1
% 30.24/17.52  
% 30.24/17.52  Timing (in seconds)
% 30.24/17.53  ----------------------
% 30.24/17.53  Preprocessing        : 1.04
% 30.24/17.53  Parsing              : 0.59
% 30.24/17.53  CNF conversion       : 0.09
% 30.24/17.53  Main loop            : 15.39
% 30.24/17.53  Inferencing          : 4.75
% 30.24/17.53  Reduction            : 5.99
% 30.24/17.53  Demodulation         : 3.96
% 30.24/17.53  BG Simplification    : 0.15
% 30.24/17.53  Subsumption          : 3.24
% 30.24/17.53  Abstraction          : 0.15
% 30.24/17.53  MUC search           : 0.00
% 30.24/17.53  Cooper               : 0.00
% 30.24/17.53  Total                : 16.48
% 30.24/17.53  Index Insertion      : 0.00
% 30.24/17.53  Index Deletion       : 0.00
% 30.24/17.53  Index Matching       : 0.00
% 30.24/17.53  BG Taut test         : 0.00
%------------------------------------------------------------------------------