TSTP Solution File: SYN567-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN567-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/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 : n025.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:19 EDT 2023
% Result : Unsatisfiable 7.23s 2.92s
% Output : CNFRefutation 7.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 27 ( 11 unt; 9 typ; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 32 ( 13 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 7 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-1 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p5 > p2 > #nlpp > f8 > f7 > f6 > f4 > f3 > c9 > c10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f3,type,
f3: $i > $i ).
tff(f7,type,
f7: $i > $i ).
tff(p2,type,
p2: ( $i * $i ) > $o ).
tff(c9,type,
c9: $i ).
tff(c10,type,
c10: $i ).
tff(p5,type,
p5: ( $i * $i ) > $o ).
tff(f6,type,
f6: $i > $i ).
tff(f8,type,
f8: $i > $i ).
tff(f4,type,
f4: $i > $i ).
tff(f_29,axiom,
~ p2(f6(c9),f3(f4(c10))),
file(unknown,unknown) ).
tff(f_31,axiom,
~ p2(f6(c9),f3(f7(f4(c10)))),
file(unknown,unknown) ).
tff(f_33,axiom,
~ p2(f6(c9),f3(f7(f7(f4(c10))))),
file(unknown,unknown) ).
tff(f_27,axiom,
! [X17] : p5(f8(f6(X17)),X17),
file(unknown,unknown) ).
tff(f_53,axiom,
! [X8,X9] :
( p2(f6(X8),f6(X9))
| ~ p5(X8,X9) ),
file(unknown,unknown) ).
tff(f_107,axiom,
! [X3] :
( p2(X3,f3(f4(c10)))
| p2(X3,f3(f7(f4(c10))))
| p2(X3,f3(f7(f7(f4(c10)))))
| p2(X3,f3(f7(f7(f7(f4(c10))))))
| ~ p2(f6(f8(X3)),X3) ),
file(unknown,unknown) ).
tff(f_60,axiom,
~ p2(f6(c9),f3(f7(f7(f7(f4(c10)))))),
file(unknown,unknown) ).
tff(c_8,plain,
~ p2(f6(c9),f3(f4(c10))),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_10,plain,
~ p2(f6(c9),f3(f7(f4(c10)))),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_12,plain,
~ p2(f6(c9),f3(f7(f7(f4(c10))))),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_6,plain,
! [X17_3] : p5(f8(f6(X17_3)),X17_3),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_20,plain,
! [X8_10,X9_11] :
( ~ p5(X8_10,X9_11)
| p2(f6(X8_10),f6(X9_11)) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_647,plain,
! [X3_96] :
( ~ p2(f6(f8(X3_96)),X3_96)
| p2(X3_96,f3(f7(f7(f7(f4(c10))))))
| p2(X3_96,f3(f7(f7(f4(c10)))))
| p2(X3_96,f3(f7(f4(c10))))
| p2(X3_96,f3(f4(c10))) ),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_655,plain,
! [X9_11] :
( p2(f6(X9_11),f3(f7(f7(f7(f4(c10))))))
| p2(f6(X9_11),f3(f7(f7(f4(c10)))))
| p2(f6(X9_11),f3(f7(f4(c10))))
| p2(f6(X9_11),f3(f4(c10)))
| ~ p5(f8(f6(X9_11)),X9_11) ),
inference(resolution,[status(thm)],[c_20,c_647]) ).
tff(c_7327,plain,
! [X9_309] :
( p2(f6(X9_309),f3(f7(f7(f7(f4(c10))))))
| p2(f6(X9_309),f3(f7(f7(f4(c10)))))
| p2(f6(X9_309),f3(f7(f4(c10))))
| p2(f6(X9_309),f3(f4(c10))) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_655]) ).
tff(c_24,plain,
~ p2(f6(c9),f3(f7(f7(f7(f4(c10)))))),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_7399,plain,
( p2(f6(c9),f3(f7(f7(f4(c10)))))
| p2(f6(c9),f3(f7(f4(c10))))
| p2(f6(c9),f3(f4(c10))) ),
inference(resolution,[status(thm)],[c_7327,c_24]) ).
tff(c_7435,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_10,c_12,c_7399]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN567-1 : TPTP v8.1.2. Released v2.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.36 % Computer : n025.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:21:04 EDT 2023
% 0.14/0.36 % CPUTime :
% 7.23/2.92 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.23/2.92
% 7.23/2.92 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.23/2.96
% 7.23/2.96 Inference rules
% 7.23/2.96 ----------------------
% 7.23/2.96 #Ref : 0
% 7.23/2.96 #Sup : 1944
% 7.23/2.96 #Fact : 0
% 7.23/2.96 #Define : 0
% 7.23/2.96 #Split : 0
% 7.23/2.96 #Chain : 0
% 7.23/2.96 #Close : 0
% 7.23/2.96
% 7.23/2.96 Ordering : KBO
% 7.23/2.96
% 7.23/2.96 Simplification rules
% 7.23/2.96 ----------------------
% 7.23/2.96 #Subsume : 548
% 7.23/2.96 #Demod : 190
% 7.23/2.96 #Tautology : 198
% 7.23/2.96 #SimpNegUnit : 1
% 7.23/2.96 #BackRed : 0
% 7.23/2.96
% 7.23/2.96 #Partial instantiations: 0
% 7.23/2.96 #Strategies tried : 1
% 7.23/2.96
% 7.23/2.96 Timing (in seconds)
% 7.23/2.96 ----------------------
% 7.23/2.96 Preprocessing : 0.46
% 7.23/2.96 Parsing : 0.25
% 7.23/2.96 CNF conversion : 0.03
% 7.23/2.96 Main loop : 1.35
% 7.23/2.96 Inferencing : 0.42
% 7.23/2.96 Reduction : 0.36
% 7.23/2.96 Demodulation : 0.25
% 7.23/2.96 BG Simplification : 0.04
% 7.23/2.96 Subsumption : 0.45
% 7.23/2.96 Abstraction : 0.04
% 7.23/2.96 MUC search : 0.00
% 7.23/2.96 Cooper : 0.00
% 7.23/2.96 Total : 1.87
% 7.23/2.96 Index Insertion : 0.00
% 7.23/2.96 Index Deletion : 0.00
% 7.23/2.97 Index Matching : 0.00
% 7.23/2.97 BG Taut test : 0.00
%------------------------------------------------------------------------------