TSTP Solution File: LCL064-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL064-2 : TPTP v8.1.2. Released v1.0.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 10:47:17 EDT 2023
% Result : Unsatisfiable 4.63s 2.19s
% Output : CNFRefutation 5.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 25 ( 10 unt; 5 typ; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 17 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 45 (; 45 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(b,type,
b: $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_39,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_37,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
file(unknown,unknown) ).
tff(f_35,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_41,axiom,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file(unknown,unknown) ).
tff(c_6,plain,
! [X_5,Y_6,Z_7] : is_a_theorem(implies(implies(X_5,implies(Y_6,Z_7)),implies(implies(X_5,Y_6),implies(X_5,Z_7)))),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_4,plain,
! [X_3,Y_4] : is_a_theorem(implies(X_3,implies(Y_4,X_3))),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_10,plain,
! [Y_10,X_11] :
( is_a_theorem(Y_10)
| ~ is_a_theorem(X_11)
| ~ is_a_theorem(implies(X_11,Y_10)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_14,plain,
! [Y_4,X_3] :
( is_a_theorem(implies(Y_4,X_3))
| ~ is_a_theorem(X_3) ),
inference(resolution,[status(thm)],[c_4,c_10]) ).
tff(c_28,plain,
! [X_14,Y_15,Z_16] : is_a_theorem(implies(implies(X_14,implies(Y_15,Z_16)),implies(implies(X_14,Y_15),implies(X_14,Z_16)))),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( is_a_theorem(Y_2)
| ~ is_a_theorem(X_1)
| ~ is_a_theorem(implies(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_37,plain,
! [X_17,Y_18,Z_19] :
( is_a_theorem(implies(implies(X_17,Y_18),implies(X_17,Z_19)))
| ~ is_a_theorem(implies(X_17,implies(Y_18,Z_19))) ),
inference(resolution,[status(thm)],[c_28,c_2]) ).
tff(c_42,plain,
! [X_20,Z_21,Y_22] :
( is_a_theorem(implies(X_20,Z_21))
| ~ is_a_theorem(implies(X_20,Y_22))
| ~ is_a_theorem(implies(X_20,implies(Y_22,Z_21))) ),
inference(resolution,[status(thm)],[c_37,c_2]) ).
tff(c_85,plain,
! [Y_26,Z_27,Y_28] :
( is_a_theorem(implies(Y_26,Z_27))
| ~ is_a_theorem(implies(Y_26,Y_28))
| ~ is_a_theorem(implies(Y_28,Z_27)) ),
inference(resolution,[status(thm)],[c_14,c_42]) ).
tff(c_149,plain,
! [X_38,Z_39,Y_40] :
( is_a_theorem(implies(X_38,Z_39))
| ~ is_a_theorem(implies(implies(Y_40,X_38),Z_39)) ),
inference(resolution,[status(thm)],[c_4,c_85]) ).
tff(c_621,plain,
! [Y_75,Z_76,X_77] : is_a_theorem(implies(implies(Y_75,Z_76),implies(implies(X_77,Y_75),implies(X_77,Z_76)))),
inference(resolution,[status(thm)],[c_6,c_149]) ).
tff(c_32,plain,
! [X_14,Y_15,Z_16] :
( is_a_theorem(implies(implies(X_14,Y_15),implies(X_14,Z_16)))
| ~ is_a_theorem(implies(X_14,implies(Y_15,Z_16))) ),
inference(resolution,[status(thm)],[c_28,c_2]) ).
tff(c_175,plain,
! [Y_15,X_14,Z_16] :
( is_a_theorem(implies(Y_15,implies(X_14,Z_16)))
| ~ is_a_theorem(implies(X_14,implies(Y_15,Z_16))) ),
inference(resolution,[status(thm)],[c_32,c_149]) ).
tff(c_638,plain,
! [X_77,Y_75,Z_76] : is_a_theorem(implies(implies(X_77,Y_75),implies(implies(Y_75,Z_76),implies(X_77,Z_76)))),
inference(resolution,[status(thm)],[c_621,c_175]) ).
tff(c_8,plain,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_3040,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_638,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL064-2 : TPTP v8.1.2. Released v1.0.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.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 14:11:37 EDT 2023
% 0.15/0.36 % CPUTime :
% 4.63/2.19 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.63/2.20
% 4.63/2.20 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.02/2.23
% 5.02/2.23 Inference rules
% 5.02/2.23 ----------------------
% 5.02/2.23 #Ref : 0
% 5.02/2.23 #Sup : 665
% 5.02/2.23 #Fact : 0
% 5.02/2.23 #Define : 0
% 5.02/2.23 #Split : 1
% 5.02/2.23 #Chain : 0
% 5.02/2.23 #Close : 0
% 5.02/2.23
% 5.02/2.23 Ordering : KBO
% 5.02/2.23
% 5.02/2.23 Simplification rules
% 5.02/2.23 ----------------------
% 5.02/2.23 #Subsume : 147
% 5.02/2.23 #Demod : 198
% 5.02/2.23 #Tautology : 220
% 5.02/2.23 #SimpNegUnit : 0
% 5.02/2.23 #BackRed : 1
% 5.02/2.23
% 5.02/2.23 #Partial instantiations: 0
% 5.02/2.23 #Strategies tried : 1
% 5.02/2.23
% 5.02/2.23 Timing (in seconds)
% 5.02/2.23 ----------------------
% 5.02/2.24 Preprocessing : 0.39
% 5.02/2.24 Parsing : 0.22
% 5.02/2.24 CNF conversion : 0.02
% 5.02/2.24 Main loop : 0.76
% 5.02/2.24 Inferencing : 0.30
% 5.02/2.24 Reduction : 0.20
% 5.02/2.24 Demodulation : 0.15
% 5.02/2.24 BG Simplification : 0.02
% 5.02/2.24 Subsumption : 0.18
% 5.02/2.24 Abstraction : 0.03
% 5.02/2.24 MUC search : 0.00
% 5.02/2.24 Cooper : 0.00
% 5.02/2.24 Total : 1.21
% 5.02/2.24 Index Insertion : 0.00
% 5.02/2.24 Index Deletion : 0.00
% 5.02/2.24 Index Matching : 0.00
% 5.02/2.24 BG Taut test : 0.00
%------------------------------------------------------------------------------