TSTP Solution File: SYN193-10 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN193-10 : TPTP v8.1.2. Released v7.3.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 : n009.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:53 EDT 2023
% Result : Unsatisfiable 17.14s 6.45s
% Output : CNFRefutation 17.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 68
% Syntax : Number of formulae : 102 ( 47 unt; 55 typ; 0 def)
% Number of atoms : 47 ( 46 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 : 5 ( 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 : 74 (; 74 !; 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_60,axiom,
k0(b) = true,
file(unknown,unknown) ).
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_380,axiom,
! [E,F] : ( ifeq(p1(E,E,E),true,ifeq(k0(F),true,q2(E,F,F),true),true) = true ),
file(unknown,unknown) ).
tff(f_35,axiom,
n0(e,b) = true,
file(unknown,unknown) ).
tff(f_517,axiom,
! [I,G,H] : ( ifeq(q2(I,G,H),true,ifeq(n0(I,G),true,q3(G,H),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_488,axiom,
! [E,F,D] : ( ifeq(p2(E,F,D),true,n3(D),true) = true ),
file(unknown,unknown) ).
tff(f_595,axiom,
! [H,I,G,J] : ( ifeq(q3(H,I),true,ifeq(n3(G),true,ifeq(p0(J,G),true,r4(G),true),true),true) = true ),
file(unknown,unknown) ).
tff(f_657,axiom,
r4(b) != true,
file(unknown,unknown) ).
tff(c_66,plain,
k0(b) = true,
inference(cnfTransformation,[status(thm)],[f_60]) ).
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_4474,plain,
! [X_755] : ( p1(X_755,X_755,X_755) = true ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_4455]) ).
tff(c_426,plain,
! [E_320,F_321] : ( ifeq(p1(E_320,E_320,E_320),true,ifeq(k0(F_321),true,q2(E_320,F_321,F_321),true),true) = true ),
inference(cnfTransformation,[status(thm)],[f_380]) ).
tff(c_11475,plain,
! [F_1082,E_1083] : ( ifeq(k0(F_1082),true,q2(E_1083,F_1082,F_1082),true) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4474,c_426]) ).
tff(c_11606,plain,
! [E_1087] : ( ifeq(true,true,q2(E_1087,b,b),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_66,c_11475]) ).
tff(c_11611,plain,
! [E_1087] : ( q2(E_1087,b,b) = true ),
inference(superposition,[status(thm),theory(equality)],[c_11606,c_2]) ).
tff(c_24,plain,
n0(e,b) = true,
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_9759,plain,
! [I_1000,G_1001,H_1002] : ( ifeq(q2(I_1000,G_1001,H_1002),true,ifeq(n0(I_1000,G_1001),true,q3(G_1001,H_1002),true),true) = true ),
inference(cnfTransformation,[status(thm)],[f_517]) ).
tff(c_9784,plain,
! [H_1002] : ( ifeq(q2(e,b,H_1002),true,ifeq(true,true,q3(b,H_1002),true),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_24,c_9759]) ).
tff(c_12594,plain,
! [H_1131] : ( ifeq(q2(e,b,H_1131),true,q3(b,H_1131),true) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_9784]) ).
tff(c_12602,plain,
ifeq(true,true,q3(b,b),true) = true,
inference(superposition,[status(thm),theory(equality)],[c_11611,c_12594]) ).
tff(c_12609,plain,
q3(b,b) = true,
inference(superposition,[status(thm),theory(equality)],[c_12602,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_548,plain,
! [E_426,F_427,D_428] : ( ifeq(p2(E_426,F_427,D_428),true,n3(D_428),true) = true ),
inference(cnfTransformation,[status(thm)],[f_488]) ).
tff(c_5364,plain,
! [A_799] : ( ifeq(true,true,n3(A_799),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_5318,c_548]) ).
tff(c_5369,plain,
! [A_799] : ( n3(A_799) = true ),
inference(superposition,[status(thm),theory(equality)],[c_5364,c_2]) ).
tff(c_660,plain,
! [H_554,I_555,G_556,J_557] : ( ifeq(q3(H_554,I_555),true,ifeq(n3(G_556),true,ifeq(p0(J_557,G_556),true,r4(G_556),true),true),true) = true ),
inference(cnfTransformation,[status(thm)],[f_595]) ).
tff(c_15048,plain,
! [H_1219,I_1220,J_1221,G_1222] : ( ifeq(q3(H_1219,I_1220),true,ifeq(p0(J_1221,G_1222),true,r4(G_1222),true),true) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_5369,c_660]) ).
tff(c_15059,plain,
! [H_1219,I_1220,X_5] : ( ifeq(q3(H_1219,I_1220),true,ifeq(true,true,r4(X_5),true),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_30,c_15048]) ).
tff(c_15068,plain,
! [H_1223,I_1224,X_1225] : ( ifeq(q3(H_1223,I_1224),true,r4(X_1225),true) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_15059]) ).
tff(c_15079,plain,
! [X_1226] : ( ifeq(true,true,r4(X_1226),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_12609,c_15068]) ).
tff(c_15084,plain,
! [X_1226] : ( r4(X_1226) = true ),
inference(superposition,[status(thm),theory(equality)],[c_15079,c_2]) ).
tff(c_726,plain,
r4(b) != true,
inference(cnfTransformation,[status(thm)],[f_657]) ).
tff(c_15104,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_15084,c_726]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN193-10 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % 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.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:09:08 EDT 2023
% 0.13/0.35 % CPUTime :
% 17.14/6.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.16/6.46
% 17.16/6.46 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 17.16/6.50
% 17.16/6.50 Inference rules
% 17.16/6.50 ----------------------
% 17.16/6.50 #Ref : 0
% 17.16/6.50 #Sup : 3978
% 17.16/6.50 #Fact : 0
% 17.16/6.50 #Define : 0
% 17.16/6.50 #Split : 0
% 17.16/6.50 #Chain : 0
% 17.16/6.50 #Close : 0
% 17.16/6.50
% 17.16/6.50 Ordering : KBO
% 17.16/6.50
% 17.16/6.50 Simplification rules
% 17.16/6.50 ----------------------
% 17.16/6.50 #Subsume : 0
% 17.16/6.50 #Demod : 3933
% 17.16/6.50 #Tautology : 3698
% 17.16/6.50 #SimpNegUnit : 0
% 17.16/6.50 #BackRed : 284
% 17.16/6.50
% 17.16/6.50 #Partial instantiations: 0
% 17.16/6.50 #Strategies tried : 1
% 17.16/6.50
% 17.16/6.50 Timing (in seconds)
% 17.16/6.50 ----------------------
% 17.16/6.51 Preprocessing : 1.14
% 17.16/6.51 Parsing : 0.70
% 17.16/6.51 CNF conversion : 0.07
% 17.16/6.51 Main loop : 4.29
% 17.16/6.51 Inferencing : 1.14
% 17.16/6.51 Reduction : 2.13
% 17.16/6.51 Demodulation : 1.79
% 17.16/6.51 BG Simplification : 0.07
% 17.16/6.51 Subsumption : 0.69
% 17.16/6.51 Abstraction : 0.04
% 17.16/6.51 MUC search : 0.00
% 17.16/6.51 Cooper : 0.00
% 17.16/6.51 Total : 5.49
% 17.16/6.51 Index Insertion : 0.00
% 17.16/6.51 Index Deletion : 0.00
% 17.16/6.51 Index Matching : 0.00
% 17.16/6.51 BG Taut test : 0.00
%------------------------------------------------------------------------------