TSTP Solution File: SYN619-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN619-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 : 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:26 EDT 2023
% Result : Unsatisfiable 5.35s 2.34s
% Output : CNFRefutation 5.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 34
% Syntax : Number of formulae : 57 ( 13 unt; 24 typ; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 68 ( 32 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 17 >; 10 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-2 aty)
% Number of variables : 23 (; 23 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p8 > p5 > p4 > p2 > p18 > p17 > p10 > f9 > f7 > f13 > #nlpp > f6 > f3 > f16 > f15 > f14 > f12 > f11 > c25 > c24 > c23 > c22 > c21 > c20 > c19
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f3,type,
f3: $i > $i ).
tff(f12,type,
f12: $i > $i ).
tff(p4,type,
p4: ( $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 ).
tff(c23,type,
c23: $i ).
tff(p17,type,
p17: ( $i * $i ) > $o ).
tff(p8,type,
p8: ( $i * $i ) > $o ).
tff(c22,type,
c22: $i ).
tff(f7,type,
f7: ( $i * $i ) > $i ).
tff(p5,type,
p5: ( $i * $i ) > $o ).
tff(f16,type,
f16: $i > $i ).
tff(f6,type,
f6: $i > $i ).
tff(c25,type,
c25: $i ).
tff(p10,type,
p10: ( $i * $i ) > $o ).
tff(c19,type,
c19: $i ).
tff(c20,type,
c20: $i ).
tff(f11,type,
f11: $i > $i ).
tff(p18,type,
p18: ( $i * $i ) > $o ).
tff(c24,type,
c24: $i ).
tff(f15,type,
f15: $i > $i ).
tff(f_36,axiom,
~ p18(c24,f6(f7(c22,c23))),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X18] : p2(X18,X18),
file(unknown,unknown) ).
tff(f_33,axiom,
! [X9] : p17(X9,X9),
file(unknown,unknown) ).
tff(f_217,axiom,
! [X17] :
( p18(X17,f6(f7(c22,c23)))
| p8(X17,f9(f13(c20,c21),f11(f12(f7(c22,c23)))))
| ~ p18(X17,f6(c19)) ),
file(unknown,unknown) ).
tff(f_203,axiom,
! [X59,X58,X60] :
( ~ p2(X59,c20)
| ~ p17(c21,X58)
| ~ p8(c24,f9(f13(X59,X58),X60)) ),
file(unknown,unknown) ).
tff(f_34,axiom,
p18(c24,f6(c25)),
file(unknown,unknown) ).
tff(f_133,axiom,
! [X12] :
( p18(X12,f6(c19))
| p2(f14(X12),c20)
| ~ p18(X12,f6(c25)) ),
file(unknown,unknown) ).
tff(f_162,axiom,
! [X12] :
( p18(X12,f6(c19))
| p17(f3(c21),f15(X12))
| ~ p18(X12,f6(c25)) ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [X10,X11] :
( p17(X10,X11)
| ~ p17(f3(X10),X11) ),
file(unknown,unknown) ).
tff(f_210,axiom,
! [X12] :
( p18(X12,f6(c19))
| p8(X12,f9(f13(f14(X12),f15(X12)),f16(X12)))
| ~ p18(X12,f6(c25)) ),
file(unknown,unknown) ).
tff(c_16,plain,
~ p18(c24,f6(f7(c22,c23))),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_10,plain,
! [X18_5] : p2(X18_5,X18_5),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_12,plain,
! [X9_6] : p17(X9_6,X9_6),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_815,plain,
! [X17_254] :
( ~ p18(X17_254,f6(c19))
| p8(X17_254,f9(f13(c20,c21),f11(f12(f7(c22,c23)))))
| p18(X17_254,f6(f7(c22,c23))) ),
inference(cnfTransformation,[status(thm)],[f_217]) ).
tff(c_64,plain,
! [X59_72,X58_73,X60_74] :
( ~ p8(c24,f9(f13(X59_72,X58_73),X60_74))
| ~ p17(c21,X58_73)
| ~ p2(X59_72,c20) ),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_822,plain,
( ~ p17(c21,c21)
| ~ p2(c20,c20)
| ~ p18(c24,f6(c19))
| p18(c24,f6(f7(c22,c23))) ),
inference(resolution,[status(thm)],[c_815,c_64]) ).
tff(c_832,plain,
( ~ p18(c24,f6(c19))
| p18(c24,f6(f7(c22,c23))) ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_12,c_822]) ).
tff(c_833,plain,
~ p18(c24,f6(c19)),
inference(negUnitSimplification,[status(thm)],[c_16,c_832]) ).
tff(c_14,plain,
p18(c24,f6(c25)),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_48,plain,
! [X12_46] :
( ~ p18(X12_46,f6(c25))
| p2(f14(X12_46),c20)
| p18(X12_46,f6(c19)) ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_625,plain,
! [X12_230] :
( ~ p18(X12_230,f6(c25))
| p17(f3(c21),f15(X12_230))
| p18(X12_230,f6(c19)) ),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_18,plain,
! [X10_7,X11_8] :
( ~ p17(f3(X10_7),X11_8)
| p17(X10_7,X11_8) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_958,plain,
! [X12_282] :
( p17(c21,f15(X12_282))
| ~ p18(X12_282,f6(c25))
| p18(X12_282,f6(c19)) ),
inference(resolution,[status(thm)],[c_625,c_18]) ).
tff(c_969,plain,
( p17(c21,f15(c24))
| p18(c24,f6(c19)) ),
inference(resolution,[status(thm)],[c_14,c_958]) ).
tff(c_980,plain,
p17(c21,f15(c24)),
inference(negUnitSimplification,[status(thm)],[c_833,c_969]) ).
tff(c_698,plain,
! [X12_245] :
( ~ p18(X12_245,f6(c25))
| p8(X12_245,f9(f13(f14(X12_245),f15(X12_245)),f16(X12_245)))
| p18(X12_245,f6(c19)) ),
inference(cnfTransformation,[status(thm)],[f_210]) ).
tff(c_705,plain,
( ~ p17(c21,f15(c24))
| ~ p2(f14(c24),c20)
| ~ p18(c24,f6(c25))
| p18(c24,f6(c19)) ),
inference(resolution,[status(thm)],[c_698,c_64]) ).
tff(c_715,plain,
( ~ p17(c21,f15(c24))
| ~ p2(f14(c24),c20)
| p18(c24,f6(c19)) ),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_705]) ).
tff(c_1068,plain,
( ~ p2(f14(c24),c20)
| p18(c24,f6(c19)) ),
inference(demodulation,[status(thm),theory(equality)],[c_980,c_715]) ).
tff(c_1069,plain,
~ p2(f14(c24),c20),
inference(negUnitSimplification,[status(thm)],[c_833,c_1068]) ).
tff(c_1072,plain,
( ~ p18(c24,f6(c25))
| p18(c24,f6(c19)) ),
inference(resolution,[status(thm)],[c_48,c_1069]) ).
tff(c_1075,plain,
p18(c24,f6(c19)),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_1072]) ).
tff(c_1077,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_833,c_1075]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN619-1 : TPTP v8.1.2. Released v2.5.0.
% 0.13/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.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 17:43:50 EDT 2023
% 0.15/0.35 % CPUTime :
% 5.35/2.34 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.35/2.34
% 5.35/2.34 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.58/2.38
% 5.58/2.38 Inference rules
% 5.58/2.38 ----------------------
% 5.58/2.38 #Ref : 0
% 5.58/2.38 #Sup : 251
% 5.58/2.38 #Fact : 0
% 5.58/2.38 #Define : 0
% 5.58/2.38 #Split : 0
% 5.58/2.38 #Chain : 0
% 5.58/2.38 #Close : 0
% 5.58/2.38
% 5.58/2.38 Ordering : KBO
% 5.58/2.38
% 5.58/2.38 Simplification rules
% 5.58/2.38 ----------------------
% 5.58/2.38 #Subsume : 29
% 5.58/2.38 #Demod : 23
% 5.58/2.38 #Tautology : 17
% 5.58/2.38 #SimpNegUnit : 7
% 5.58/2.38 #BackRed : 0
% 5.58/2.38
% 5.58/2.38 #Partial instantiations: 0
% 5.58/2.38 #Strategies tried : 1
% 5.58/2.38
% 5.58/2.38 Timing (in seconds)
% 5.58/2.38 ----------------------
% 5.58/2.38 Preprocessing : 0.61
% 5.58/2.38 Parsing : 0.33
% 5.58/2.38 CNF conversion : 0.03
% 5.58/2.38 Main loop : 0.69
% 5.58/2.38 Inferencing : 0.27
% 5.58/2.38 Reduction : 0.17
% 5.58/2.38 Demodulation : 0.11
% 5.58/2.38 BG Simplification : 0.03
% 5.58/2.38 Subsumption : 0.18
% 5.58/2.38 Abstraction : 0.02
% 5.58/2.38 MUC search : 0.00
% 5.58/2.38 Cooper : 0.00
% 5.58/2.38 Total : 1.36
% 5.58/2.38 Index Insertion : 0.00
% 5.58/2.38 Index Deletion : 0.00
% 5.58/2.38 Index Matching : 0.00
% 5.58/2.38 BG Taut test : 0.00
%------------------------------------------------------------------------------