TSTP Solution File: LCL321-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL321-3 : TPTP v8.1.2. Released v2.3.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:55 EDT 2023
% Result : Unsatisfiable 3.58s 1.97s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 35 ( 18 unt; 7 typ; 0 def)
% Number of atoms : 42 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 19 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 47 (; 47 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > #nlpp > not > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(theorem,type,
theorem: $i > $o ).
tff(or,type,
or: ( $i * $i ) > $i ).
tff(not,type,
not: $i > $i ).
tff(q,type,
q: $i ).
tff(axiom,type,
axiom: $i > $o ).
tff(p,type,
p: $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_56,axiom,
! [X,Y] : ( implies(X,Y) = or(not(X),Y) ),
file(unknown,unknown) ).
tff(f_48,axiom,
! [A,B] : axiom(implies(A,or(B,A))),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
file(unknown,unknown) ).
tff(f_69,axiom,
! [X,Y] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_77,axiom,
~ theorem(or(implies(p,q),implies(p,not(q)))),
file(unknown,unknown) ).
tff(c_22,plain,
! [X_21,Y_22] : ( or(not(X_21),Y_22) = implies(X_21,Y_22) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_4,plain,
! [A_2,B_3] : axiom(implies(A_2,or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_32,plain,
! [Y_22,X_21] : axiom(implies(Y_22,implies(X_21,Y_22))),
inference(superposition,[status(thm),theory(equality)],[c_22,c_4]) ).
tff(c_12,plain,
! [X_12,Y_13] : ( or(not(X_12),Y_13) = implies(X_12,Y_13) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_14,plain,
! [X_14] :
( ~ axiom(X_14)
| theorem(X_14) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_6,plain,
! [A_4,B_5] : axiom(implies(or(A_4,B_5),or(B_5,A_4))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_39,plain,
! [Y_25,X_26] :
( ~ theorem(Y_25)
| ~ theorem(implies(Y_25,X_26))
| theorem(X_26) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_52,plain,
! [Y_30,X_31] :
( ~ theorem(Y_30)
| theorem(X_31)
| ~ axiom(implies(Y_30,X_31)) ),
inference(resolution,[status(thm)],[c_14,c_39]) ).
tff(c_167,plain,
! [A_45,B_46] :
( ~ theorem(or(A_45,B_46))
| theorem(or(B_46,A_45)) ),
inference(resolution,[status(thm)],[c_6,c_52]) ).
tff(c_176,plain,
! [B_46,A_45] :
( theorem(or(B_46,A_45))
| ~ axiom(or(A_45,B_46)) ),
inference(resolution,[status(thm)],[c_14,c_167]) ).
tff(c_70,plain,
! [Y_22,X_21] :
( ~ theorem(Y_22)
| theorem(implies(X_21,Y_22)) ),
inference(resolution,[status(thm)],[c_32,c_52]) ).
tff(c_102,plain,
! [A_36,B_37,C_38] : axiom(implies(or(A_36,or(B_37,C_38)),or(B_37,or(A_36,C_38)))),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_112,plain,
! [X_12,B_37,C_38] : axiom(implies(implies(X_12,or(B_37,C_38)),or(B_37,or(not(X_12),C_38)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_102]) ).
tff(c_409,plain,
! [X_83,B_84,C_85] : axiom(implies(implies(X_83,or(B_84,C_85)),or(B_84,implies(X_83,C_85)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_112]) ).
tff(c_43,plain,
! [Y_25,X_26] :
( ~ theorem(Y_25)
| theorem(X_26)
| ~ axiom(implies(Y_25,X_26)) ),
inference(resolution,[status(thm)],[c_14,c_39]) ).
tff(c_704,plain,
! [X_123,B_124,C_125] :
( ~ theorem(implies(X_123,or(B_124,C_125)))
| theorem(or(B_124,implies(X_123,C_125))) ),
inference(resolution,[status(thm)],[c_409,c_43]) ).
tff(c_18,plain,
~ theorem(or(implies(p,q),implies(p,not(q)))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_729,plain,
~ theorem(implies(p,or(implies(p,q),not(q)))),
inference(resolution,[status(thm)],[c_704,c_18]) ).
tff(c_749,plain,
~ theorem(or(implies(p,q),not(q))),
inference(resolution,[status(thm)],[c_70,c_729]) ).
tff(c_759,plain,
~ axiom(or(not(q),implies(p,q))),
inference(resolution,[status(thm)],[c_176,c_749]) ).
tff(c_774,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_12,c_759]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL321-3 : TPTP v8.1.2. Released v2.3.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.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:12:07 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.58/1.97 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.58/1.98
% 3.58/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.99/2.00
% 3.99/2.00 Inference rules
% 3.99/2.00 ----------------------
% 3.99/2.00 #Ref : 0
% 3.99/2.00 #Sup : 171
% 3.99/2.00 #Fact : 0
% 3.99/2.00 #Define : 0
% 3.99/2.00 #Split : 1
% 3.99/2.00 #Chain : 0
% 3.99/2.00 #Close : 0
% 3.99/2.00
% 3.99/2.00 Ordering : KBO
% 3.99/2.00
% 3.99/2.00 Simplification rules
% 3.99/2.00 ----------------------
% 3.99/2.00 #Subsume : 55
% 3.99/2.00 #Demod : 27
% 3.99/2.00 #Tautology : 14
% 3.99/2.00 #SimpNegUnit : 0
% 3.99/2.00 #BackRed : 0
% 3.99/2.00
% 3.99/2.00 #Partial instantiations: 0
% 3.99/2.00 #Strategies tried : 1
% 3.99/2.00
% 3.99/2.00 Timing (in seconds)
% 3.99/2.00 ----------------------
% 3.99/2.01 Preprocessing : 0.41
% 3.99/2.01 Parsing : 0.22
% 3.99/2.01 CNF conversion : 0.02
% 3.99/2.01 Main loop : 0.51
% 3.99/2.01 Inferencing : 0.22
% 3.99/2.01 Reduction : 0.13
% 3.99/2.01 Demodulation : 0.09
% 3.99/2.01 BG Simplification : 0.02
% 3.99/2.01 Subsumption : 0.11
% 3.99/2.01 Abstraction : 0.02
% 3.99/2.01 MUC search : 0.00
% 3.99/2.01 Cooper : 0.00
% 3.99/2.01 Total : 0.97
% 3.99/2.01 Index Insertion : 0.00
% 3.99/2.01 Index Deletion : 0.00
% 3.99/2.01 Index Matching : 0.00
% 3.99/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------