TSTP Solution File: SYN116-10 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN116-10 : TPTP v8.1.2. Released v7.5.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 : n011.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:39 EDT 2023

% Result   : Unsatisfiable 14.32s 4.79s
% Output   : CNFRefutation 14.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   69
% Syntax   : Number of formulae    :  106 (  51 unt;  55 typ;   0 def)
%            Number of atoms       :   51 (  50 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :   94 (  49   >;  45   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   55 (  55 usr;   6 con; 0-4 aty)
%            Number of variables   :   78 (;  78   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ ifeq > 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 > #nlpp > s5 > s4 > s2 > s1 > s0 > r4 > r2 > r1 > r0 > n3 > n2 > m2 > l5 > l4 > l0 > k5 > k4 > k1 > k0 > true > e > d > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(n5,type,
    n5: ( $i * $i ) > $i ).

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

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

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

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

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

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

tff(ifeq,type,
    ifeq: ( $i * $i * $i * $i ) > $i ).

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

tff(f_24,axiom,
    ! [A,B,C] : ( ifeq(A,A,B,C) = B ),
    file(unknown,unknown) ).

tff(f_40,axiom,
    ! [X] : ( p0(b,X) = true ),
    file(unknown,unknown) ).

tff(f_216,axiom,
    ! [C,B] : ( ifeq(p0(C,B),true,p1(B,B,B),true) = true ),
    file(unknown,unknown) ).

tff(f_308,axiom,
    ! [B,C,A] : ( ifeq(p1(B,C,A),true,n2(A),true) = true ),
    file(unknown,unknown) ).

tff(f_496,axiom,
    ! [H] : ( ifeq(n2(H),true,p3(H,H,H),true) = true ),
    file(unknown,unknown) ).

tff(f_27,axiom,
    n0(d,e) = true,
    file(unknown,unknown) ).

tff(f_70,axiom,
    ! [H,G] : ( ifeq(n0(H,G),true,l1(G,G),true) = true ),
    file(unknown,unknown) ).

tff(f_597,axiom,
    ! [B,C,D,A] : ( ifeq(p3(B,C,D),true,ifeq(l1(A,C),true,s4(A),true),true) = true ),
    file(unknown,unknown) ).

tff(f_47,axiom,
    ! [X,Y] : ( m0(X,d,Y) = true ),
    file(unknown,unknown) ).

tff(f_280,axiom,
    ! [J,A,I] : ( ifeq(m0(J,A,I),true,q1(I,I,I),true) = true ),
    file(unknown,unknown) ).

tff(f_337,axiom,
    ! [A] : ( ifeq(q1(A,A,A),true,p2(A,A,A),true) = true ),
    file(unknown,unknown) ).

tff(f_541,axiom,
    ! [B,D,C] : ( ifeq(p2(B,D,C),true,r3(B,C,B),true) = true ),
    file(unknown,unknown) ).

tff(f_599,axiom,
    ! [F,G,E] : ( ifeq(s4(F),true,ifeq(r3(G,E,E),true,k5(E),true),true) = true ),
    file(unknown,unknown) ).

tff(f_657,axiom,
    k5(b) != true,
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [A_1,B_2,C_3] : ( ifeq(A_1,A_1,B_2,C_3) = B_2 ),
    inference(cnfTransformation,[status(thm)],[f_24]) ).

tff(c_30,plain,
    ! [X_5] : ( p0(b,X_5) = true ),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_3111,plain,
    ! [C_704,B_705] : ( ifeq(p0(C_704,B_705),true,p1(B_705,B_705,B_705),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_216]) ).

tff(c_4455,plain,
    ! [X_755] : ( ifeq(true,true,p1(X_755,X_755,X_755),true) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_30,c_3111]) ).

tff(c_4507,plain,
    ! [X_758] : ( p1(X_758,X_758,X_758) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_4455]) ).

tff(c_346,plain,
    ! [B_256,C_257,A_258] : ( ifeq(p1(B_256,C_257,A_258),true,n2(A_258),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_308]) ).

tff(c_4611,plain,
    ! [X_763] : ( ifeq(true,true,n2(X_763),true) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_4507,c_346]) ).

tff(c_4616,plain,
    ! [X_763] : ( n2(X_763) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_4611,c_2]) ).

tff(c_556,plain,
    ! [H_437] : ( ifeq(n2(H_437),true,p3(H_437,H_437,H_437),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_496]) ).

tff(c_6452,plain,
    ! [H_870] : ( ifeq(true,true,p3(H_870,H_870,H_870),true) = true ),
    inference(demodulation,[status(thm),theory(equality)],[c_4616,c_556]) ).

tff(c_6457,plain,
    ! [H_870] : ( p3(H_870,H_870,H_870) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_6452,c_2]) ).

tff(c_8,plain,
    n0(d,e) = true,
    inference(cnfTransformation,[status(thm)],[f_27]) ).

tff(c_2369,plain,
    ! [H_681,G_682] : ( ifeq(n0(H_681,G_682),true,l1(G_682,G_682),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_70]) ).

tff(c_2397,plain,
    ifeq(true,true,l1(e,e),true) = true,
    inference(superposition,[status(thm),theory(equality)],[c_8,c_2369]) ).

tff(c_2622,plain,
    l1(e,e) = true,
    inference(superposition,[status(thm),theory(equality)],[c_2397,c_2]) ).

tff(c_7576,plain,
    ! [B_922,C_923,D_924,A_925] : ( ifeq(p3(B_922,C_923,D_924),true,ifeq(l1(A_925,C_923),true,s4(A_925),true),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_597]) ).

tff(c_7586,plain,
    ! [B_922,D_924] : ( ifeq(p3(B_922,e,D_924),true,ifeq(true,true,s4(e),true),true) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_2622,c_7576]) ).

tff(c_8934,plain,
    ! [B_965,D_966] : ( ifeq(p3(B_965,e,D_966),true,s4(e),true) = true ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_7586]) ).

tff(c_8941,plain,
    ifeq(true,true,s4(e),true) = true,
    inference(superposition,[status(thm),theory(equality)],[c_6457,c_8934]) ).

tff(c_8947,plain,
    s4(e) = true,
    inference(superposition,[status(thm),theory(equality)],[c_8941,c_2]) ).

tff(c_40,plain,
    ! [X_7,Y_8] : ( m0(X_7,d,Y_8) = true ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_5124,plain,
    ! [J_791,A_792,I_793] : ( ifeq(m0(J_791,A_792,I_793),true,q1(I_793,I_793,I_793),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_280]) ).

tff(c_5192,plain,
    ! [Y_794] : ( ifeq(true,true,q1(Y_794,Y_794,Y_794),true) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_40,c_5124]) ).

tff(c_5197,plain,
    ! [Y_794] : ( q1(Y_794,Y_794,Y_794) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_5192,c_2]) ).

tff(c_380,plain,
    ! [A_282] : ( ifeq(q1(A_282,A_282,A_282),true,p2(A_282,A_282,A_282),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_337]) ).

tff(c_5275,plain,
    ! [A_796] : ( ifeq(true,true,p2(A_796,A_796,A_796),true) = true ),
    inference(demodulation,[status(thm),theory(equality)],[c_5197,c_380]) ).

tff(c_5318,plain,
    ! [A_797] : ( p2(A_797,A_797,A_797) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_5275,c_2]) ).

tff(c_602,plain,
    ! [B_486,D_487,C_488] : ( ifeq(p2(B_486,D_487,C_488),true,r3(B_486,C_488,B_486),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_541]) ).

tff(c_6393,plain,
    ! [A_865] : ( ifeq(true,true,r3(A_865,A_865,A_865),true) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_5318,c_602]) ).

tff(c_6398,plain,
    ! [A_865] : ( r3(A_865,A_865,A_865) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_6393,c_2]) ).

tff(c_6673,plain,
    ! [F_884,G_885,E_886] : ( ifeq(s4(F_884),true,ifeq(r3(G_885,E_886,E_886),true,k5(E_886),true),true) = true ),
    inference(cnfTransformation,[status(thm)],[f_599]) ).

tff(c_6680,plain,
    ! [F_884,A_865] : ( ifeq(s4(F_884),true,ifeq(true,true,k5(A_865),true),true) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_6398,c_6673]) ).

tff(c_6683,plain,
    ! [F_884,A_865] : ( ifeq(s4(F_884),true,k5(A_865),true) = true ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_6680]) ).

tff(c_9042,plain,
    ! [A_970] : ( ifeq(true,true,k5(A_970),true) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_8947,c_6683]) ).

tff(c_9047,plain,
    ! [A_970] : ( k5(A_970) = true ),
    inference(superposition,[status(thm),theory(equality)],[c_9042,c_2]) ).

tff(c_726,plain,
    k5(b) != true,
    inference(cnfTransformation,[status(thm)],[f_657]) ).

tff(c_9062,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_9047,c_726]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN116-10 : TPTP v8.1.2. Released v7.5.0.
% 0.00/0.14  % 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.14/0.35  % Computer : n011.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu Aug  3 17:17:50 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 14.32/4.79  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.32/4.80  
% 14.32/4.80  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.50/4.84  
% 14.50/4.84  Inference rules
% 14.50/4.84  ----------------------
% 14.50/4.84  #Ref     : 0
% 14.50/4.84  #Sup     : 2389
% 14.50/4.84  #Fact    : 0
% 14.50/4.84  #Define  : 0
% 14.50/4.84  #Split   : 0
% 14.50/4.84  #Chain   : 0
% 14.50/4.84  #Close   : 0
% 14.50/4.84  
% 14.50/4.84  Ordering : KBO
% 14.50/4.84  
% 14.50/4.84  Simplification rules
% 14.50/4.84  ----------------------
% 14.50/4.84  #Subsume      : 0
% 14.50/4.84  #Demod        : 2164
% 14.50/4.84  #Tautology    : 2296
% 14.50/4.84  #SimpNegUnit  : 0
% 14.50/4.84  #BackRed      : 193
% 14.50/4.84  
% 14.50/4.84  #Partial instantiations: 0
% 14.50/4.84  #Strategies tried      : 1
% 14.50/4.84  
% 14.50/4.84  Timing (in seconds)
% 14.50/4.84  ----------------------
% 14.50/4.84  Preprocessing        : 1.02
% 14.50/4.84  Parsing              : 0.59
% 14.50/4.84  CNF conversion       : 0.07
% 14.50/4.84  Main loop            : 2.74
% 14.50/4.84  Inferencing          : 0.68
% 14.50/4.84  Reduction            : 1.38
% 14.50/4.84  Demodulation         : 1.15
% 14.50/4.84  BG Simplification    : 0.06
% 14.50/4.84  Subsumption          : 0.43
% 14.50/4.84  Abstraction          : 0.04
% 14.50/4.84  MUC search           : 0.00
% 14.50/4.84  Cooper               : 0.00
% 14.50/4.84  Total                : 3.82
% 14.50/4.84  Index Insertion      : 0.00
% 14.50/4.84  Index Deletion       : 0.00
% 14.50/4.84  Index Matching       : 0.00
% 14.50/4.84  BG Taut test         : 0.00
%------------------------------------------------------------------------------