TSTP Solution File: SYN584-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN584-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n023.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:11:22 EDT 2023
% Result : Unsatisfiable 40.80s 28.29s
% Output : CNFRefutation 40.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 28
% Syntax : Number of formulae : 41 ( 13 unt; 21 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 15 >; 12 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 23 (; 23 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p6 > p5 > p3 > p2 > p16 > p15 > p12 > f9 > f8 > f7 > f14 > f13 > #nlpp > f4 > f11 > f10 > c22 > c21 > c20 > c19 > c18 > c17
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p15,type,
p15: ( $i * $i ) > $o ).
tff(p16,type,
p16: ( $i * $i ) > $o ).
tff(f13,type,
f13: ( $i * $i ) > $i ).
tff(f9,type,
f9: ( $i * $i ) > $i ).
tff(p2,type,
p2: ( $i * $i ) > $o ).
tff(c21,type,
c21: $i ).
tff(f14,type,
f14: ( $i * $i ) > $i ).
tff(c17,type,
c17: $i ).
tff(c22,type,
c22: $i ).
tff(f7,type,
f7: ( $i * $i ) > $i ).
tff(p5,type,
p5: ( $i * $i ) > $o ).
tff(p3,type,
p3: ( $i * $i ) > $o ).
tff(f8,type,
f8: ( $i * $i ) > $i ).
tff(c18,type,
c18: $i ).
tff(f4,type,
f4: $i > $i ).
tff(p6,type,
p6: ( $i * $i ) > $o ).
tff(c19,type,
c19: $i ).
tff(c20,type,
c20: $i ).
tff(f11,type,
f11: $i > $i ).
tff(p12,type,
p12: ( $i * $i ) > $o ).
tff(f10,type,
f10: $i > $i ).
tff(f_149,axiom,
p15(c22,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))),
file(unknown,unknown) ).
tff(f_29,axiom,
! [X26] : p3(X26,X26),
file(unknown,unknown) ).
tff(f_151,axiom,
p12(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),c22),
file(unknown,unknown) ).
tff(f_23,axiom,
! [X0] : p12(X0,X0),
file(unknown,unknown) ).
tff(f_54,axiom,
! [X1,X2,X0] :
( p12(X1,X2)
| ~ p12(X0,X1)
| ~ p12(X0,X2) ),
file(unknown,unknown) ).
tff(f_108,axiom,
! [X11,X12,X13,X14] :
( p15(X11,X12)
| ~ p15(X13,X14)
| ~ p3(X14,X12)
| ~ p12(X13,X11) ),
file(unknown,unknown) ).
tff(f_162,axiom,
~ p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))),
file(unknown,unknown) ).
tff(c_42,plain,
p15(c22,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_8,plain,
! [X26_4] : p3(X26_4,X26_4),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_46,plain,
p12(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),c22),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_2,plain,
! [X0_1] : p12(X0_1,X0_1),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_63,plain,
! [X0_70,X2_71,X1_72] :
( ~ p12(X0_70,X2_71)
| ~ p12(X0_70,X1_72)
| p12(X1_72,X2_71) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_66,plain,
! [X0_1,X1_72] :
( ~ p12(X0_1,X1_72)
| p12(X1_72,X0_1) ),
inference(resolution,[status(thm)],[c_2,c_63]) ).
tff(c_778,plain,
p12(c22,f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17))),
inference(resolution,[status(thm)],[c_46,c_66]) ).
tff(c_30,plain,
! [X13_33,X11_31,X14_34,X12_32] :
( ~ p12(X13_33,X11_31)
| ~ p3(X14_34,X12_32)
| ~ p15(X13_33,X14_34)
| p15(X11_31,X12_32) ),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_16300,plain,
! [X14_1258,X12_1259] :
( ~ p3(X14_1258,X12_1259)
| ~ p15(c22,X14_1258)
| p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),X12_1259) ),
inference(resolution,[status(thm)],[c_778,c_30]) ).
tff(c_87665,plain,
! [X26_2850] :
( ~ p15(c22,X26_2850)
| p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),X26_2850) ),
inference(resolution,[status(thm)],[c_8,c_16300]) ).
tff(c_50,plain,
~ p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_87693,plain,
~ p15(c22,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))),
inference(resolution,[status(thm)],[c_87665,c_50]) ).
tff(c_87716,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_42,c_87693]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN584-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:29:52 EDT 2023
% 0.14/0.36 % CPUTime :
% 40.80/28.29 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 40.80/28.29
% 40.80/28.29 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 40.92/28.32
% 40.92/28.32 Inference rules
% 40.92/28.32 ----------------------
% 40.92/28.32 #Ref : 0
% 40.92/28.32 #Sup : 28667
% 40.92/28.32 #Fact : 0
% 40.92/28.32 #Define : 0
% 40.92/28.32 #Split : 1
% 40.92/28.32 #Chain : 0
% 40.92/28.32 #Close : 0
% 40.92/28.32
% 40.92/28.32 Ordering : KBO
% 40.92/28.32
% 40.92/28.32 Simplification rules
% 40.92/28.32 ----------------------
% 40.92/28.32 #Subsume : 1855
% 40.92/28.32 #Demod : 19
% 40.92/28.32 #Tautology : 17
% 40.92/28.32 #SimpNegUnit : 0
% 40.92/28.32 #BackRed : 0
% 40.92/28.32
% 40.92/28.32 #Partial instantiations: 0
% 40.92/28.32 #Strategies tried : 1
% 40.92/28.32
% 40.92/28.32 Timing (in seconds)
% 40.92/28.32 ----------------------
% 40.92/28.32 Preprocessing : 0.49
% 40.92/28.32 Parsing : 0.27
% 40.92/28.32 CNF conversion : 0.03
% 40.92/28.32 Main loop : 26.77
% 40.92/28.32 Inferencing : 1.55
% 40.92/28.32 Reduction : 2.39
% 40.92/28.32 Demodulation : 1.52
% 40.92/28.32 BG Simplification : 0.19
% 40.92/28.32 Subsumption : 20.18
% 40.92/28.32 Abstraction : 0.26
% 40.92/28.32 MUC search : 0.00
% 40.92/28.32 Cooper : 0.00
% 40.92/28.32 Total : 27.31
% 40.92/28.33 Index Insertion : 0.00
% 40.92/28.33 Index Deletion : 0.00
% 40.92/28.33 Index Matching : 0.00
% 40.92/28.33 BG Taut test : 0.00
%------------------------------------------------------------------------------