TSTP Solution File: SYN562-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN562-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 : 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:18 EDT 2023
% Result : Unsatisfiable 5.22s 2.38s
% Output : CNFRefutation 5.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 17
% Syntax : Number of formulae : 29 ( 11 unt; 11 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 16 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 19 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 9 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-1 aty)
% Number of variables : 23 (; 23 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p6 > p2 > p10 > #nlpp > f9 > f8 > f7 > f5 > f4 > f3 > c12 > c11
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f3,type,
f3: $i > $i ).
tff(c12,type,
c12: $i ).
tff(f7,type,
f7: $i > $i ).
tff(p2,type,
p2: ( $i * $i ) > $o ).
tff(f5,type,
f5: $i > $i ).
tff(c11,type,
c11: $i ).
tff(f9,type,
f9: $i > $i ).
tff(f8,type,
f8: $i > $i ).
tff(p10,type,
p10: ( $i * $i ) > $o ).
tff(f4,type,
f4: $i > $i ).
tff(p6,type,
p6: ( $i * $i ) > $o ).
tff(f_28,axiom,
! [X22] : ~ p10(X22,X22),
file(unknown,unknown) ).
tff(f_23,axiom,
! [X4] : p2(X4,X4),
file(unknown,unknown) ).
tff(f_88,axiom,
p2(f7(c11),f3(f4(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(c12))))))))))))))))))),
file(unknown,unknown) ).
tff(f_68,axiom,
! [X5,X6,X4] :
( p2(X5,X6)
| ~ p2(X4,X5)
| ~ p2(X4,X6) ),
file(unknown,unknown) ).
tff(f_89,axiom,
p10(f7(c11),f3(f4(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(c12))))))))))))))))))),
file(unknown,unknown) ).
tff(f_87,axiom,
! [X0,X1,X2,X3] :
( p10(X0,X1)
| ~ p2(X2,X0)
| ~ p2(X3,X1)
| ~ p10(X2,X3) ),
file(unknown,unknown) ).
tff(c_6,plain,
! [X22_3] : ~ p10(X22_3,X22_3),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_2,plain,
! [X4_1] : p2(X4_1,X4_1),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_30,plain,
p2(f7(c11),f3(f4(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(c12))))))))))))))))))),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_42,plain,
! [X4_41,X6_42,X5_43] :
( ~ p2(X4_41,X6_42)
| ~ p2(X4_41,X5_43)
| p2(X5_43,X6_42) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_69,plain,
! [X4_1,X5_43] :
( ~ p2(X4_1,X5_43)
| p2(X5_43,X4_1) ),
inference(resolution,[status(thm)],[c_2,c_42]) ).
tff(c_206,plain,
p2(f3(f4(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(c12)))))))))))))))))),f7(c11)),
inference(resolution,[status(thm)],[c_30,c_69]) ).
tff(c_32,plain,
p10(f7(c11),f3(f4(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(c12))))))))))))))))))),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_28,plain,
! [X2_24,X3_25,X1_23,X0_22] :
( ~ p10(X2_24,X3_25)
| ~ p2(X3_25,X1_23)
| ~ p2(X2_24,X0_22)
| p10(X0_22,X1_23) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_235,plain,
! [X1_23,X0_22] :
( ~ p2(f3(f4(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(f5(c12)))))))))))))))))),X1_23)
| ~ p2(f7(c11),X0_22)
| p10(X0_22,X1_23) ),
inference(resolution,[status(thm)],[c_32,c_28]) ).
tff(c_1802,plain,
! [X0_155] :
( ~ p2(f7(c11),X0_155)
| p10(X0_155,f7(c11)) ),
inference(resolution,[status(thm)],[c_206,c_235]) ).
tff(c_1821,plain,
p10(f7(c11),f7(c11)),
inference(resolution,[status(thm)],[c_2,c_1802]) ).
tff(c_1831,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_1821]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN562-1 : TPTP v8.1.2. Released v2.5.0.
% 0.08/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.16/0.36 % Computer : n023.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 17:28:52 EDT 2023
% 0.16/0.36 % CPUTime :
% 5.22/2.38 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.22/2.39
% 5.22/2.39 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.22/2.41
% 5.22/2.41 Inference rules
% 5.22/2.41 ----------------------
% 5.22/2.41 #Ref : 0
% 5.22/2.41 #Sup : 516
% 5.22/2.41 #Fact : 0
% 5.22/2.41 #Define : 0
% 5.22/2.41 #Split : 0
% 5.22/2.41 #Chain : 0
% 5.22/2.41 #Close : 0
% 5.22/2.41
% 5.22/2.41 Ordering : KBO
% 5.22/2.41
% 5.22/2.41 Simplification rules
% 5.22/2.41 ----------------------
% 5.22/2.41 #Subsume : 67
% 5.22/2.41 #Demod : 73
% 5.22/2.41 #Tautology : 47
% 5.22/2.41 #SimpNegUnit : 1
% 5.22/2.41 #BackRed : 0
% 5.22/2.41
% 5.22/2.41 #Partial instantiations: 0
% 5.22/2.41 #Strategies tried : 1
% 5.22/2.41
% 5.22/2.41 Timing (in seconds)
% 5.22/2.41 ----------------------
% 5.22/2.42 Preprocessing : 0.48
% 5.22/2.42 Parsing : 0.26
% 5.22/2.42 CNF conversion : 0.02
% 5.22/2.42 Main loop : 0.79
% 5.22/2.42 Inferencing : 0.28
% 5.22/2.42 Reduction : 0.20
% 5.22/2.42 Demodulation : 0.14
% 5.22/2.42 BG Simplification : 0.03
% 5.22/2.42 Subsumption : 0.23
% 5.22/2.42 Abstraction : 0.03
% 5.22/2.42 MUC search : 0.00
% 5.22/2.42 Cooper : 0.00
% 5.22/2.42 Total : 1.31
% 5.22/2.42 Index Insertion : 0.00
% 5.22/2.42 Index Deletion : 0.00
% 5.22/2.42 Index Matching : 0.00
% 5.22/2.42 BG Taut test : 0.00
%------------------------------------------------------------------------------