TSTP Solution File: LCL320-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL320-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 : n004.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 20.63s 11.74s
% Output : CNFRefutation 20.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 41 ( 18 unt; 7 typ; 0 def)
% Number of atoms : 59 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 28 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 71 (; 71 !; 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_50,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
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_54,axiom,
! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
file(unknown,unknown) ).
tff(f_69,axiom,
! [X,Y] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_77,axiom,
~ theorem(or(implies(p,q),implies(not(p),q))),
file(unknown,unknown) ).
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_44,plain,
! [A_27,B_28] : axiom(implies(or(A_27,B_28),or(B_28,A_27))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_50,plain,
! [Y_13,X_12] : axiom(implies(or(Y_13,not(X_12)),implies(X_12,Y_13))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_44]) ).
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_14,plain,
! [X_14] :
( ~ axiom(X_14)
| theorem(X_14) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_139,plain,
! [A_40,B_41,C_42] : axiom(implies(implies(A_40,B_41),implies(or(C_42,A_40),or(C_42,B_41)))),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_148,plain,
! [A_40,Y_13,X_12] : axiom(implies(implies(A_40,Y_13),implies(or(not(X_12),A_40),implies(X_12,Y_13)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_139]) ).
tff(c_416,plain,
! [A_83,Y_84,X_85] : axiom(implies(implies(A_83,Y_84),implies(implies(X_85,A_83),implies(X_85,Y_84)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_148]) ).
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_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_468,plain,
! [A_89,Y_90,X_91] :
( ~ theorem(implies(A_89,Y_90))
| theorem(implies(implies(X_91,A_89),implies(X_91,Y_90))) ),
inference(resolution,[status(thm)],[c_416,c_43]) ).
tff(c_16,plain,
! [Y_16,X_15] :
( ~ theorem(Y_16)
| ~ theorem(implies(Y_16,X_15))
| theorem(X_15) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_1714,plain,
! [X_212,A_213,Y_214] :
( ~ theorem(implies(X_212,A_213))
| theorem(implies(X_212,Y_214))
| ~ theorem(implies(A_213,Y_214)) ),
inference(resolution,[status(thm)],[c_468,c_16]) ).
tff(c_3560,plain,
! [X_319,Y_320,A_321] :
( theorem(implies(X_319,Y_320))
| ~ theorem(implies(A_321,Y_320))
| ~ axiom(implies(X_319,A_321)) ),
inference(resolution,[status(thm)],[c_14,c_1714]) ).
tff(c_15538,plain,
! [X_804,Y_805,A_806] :
( theorem(implies(X_804,Y_805))
| ~ axiom(implies(X_804,A_806))
| ~ axiom(implies(A_806,Y_805)) ),
inference(resolution,[status(thm)],[c_14,c_3560]) ).
tff(c_15995,plain,
! [A_819,Y_820,B_821] :
( theorem(implies(A_819,Y_820))
| ~ axiom(implies(or(B_821,A_819),Y_820)) ),
inference(resolution,[status(thm)],[c_4,c_15538]) ).
tff(c_16023,plain,
! [X_12,Y_13] : theorem(implies(not(X_12),implies(X_12,Y_13))),
inference(resolution,[status(thm)],[c_50,c_15995]) ).
tff(c_16150,plain,
! [X_824,Y_825] : theorem(implies(not(X_824),implies(X_824,Y_825))),
inference(resolution,[status(thm)],[c_50,c_15995]) ).
tff(c_260,plain,
! [X_58,Y_59] : axiom(implies(implies(X_58,Y_59),or(Y_59,not(X_58)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_44]) ).
tff(c_268,plain,
! [X_58,Y_59] :
( ~ theorem(implies(X_58,Y_59))
| theorem(or(Y_59,not(X_58))) ),
inference(resolution,[status(thm)],[c_260,c_43]) ).
tff(c_633,plain,
! [A_117,B_118,C_119] :
( ~ theorem(implies(A_117,B_118))
| theorem(implies(or(C_119,A_117),or(C_119,B_118))) ),
inference(resolution,[status(thm)],[c_139,c_43]) ).
tff(c_1895,plain,
! [C_229,A_230,B_231] :
( ~ theorem(or(C_229,A_230))
| theorem(or(C_229,B_231))
| ~ theorem(implies(A_230,B_231)) ),
inference(resolution,[status(thm)],[c_633,c_16]) ).
tff(c_1960,plain,
! [Y_59,B_231,X_58] :
( theorem(or(Y_59,B_231))
| ~ theorem(implies(not(X_58),B_231))
| ~ theorem(implies(X_58,Y_59)) ),
inference(resolution,[status(thm)],[c_268,c_1895]) ).
tff(c_53430,plain,
! [Y_1778,X_1779,Y_1780] :
( theorem(or(Y_1778,implies(X_1779,Y_1780)))
| ~ theorem(implies(X_1779,Y_1778)) ),
inference(resolution,[status(thm)],[c_16150,c_1960]) ).
tff(c_18,plain,
~ theorem(or(implies(p,q),implies(not(p),q))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_53510,plain,
~ theorem(implies(not(p),implies(p,q))),
inference(resolution,[status(thm)],[c_53430,c_18]) ).
tff(c_53543,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16023,c_53510]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL320-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 13:19:41 EDT 2023
% 0.13/0.35 % CPUTime :
% 20.63/11.74 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.63/11.75
% 20.63/11.75 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 20.63/11.78
% 20.63/11.78 Inference rules
% 20.63/11.78 ----------------------
% 20.63/11.78 #Ref : 0
% 20.63/11.78 #Sup : 13068
% 20.63/11.78 #Fact : 0
% 20.63/11.78 #Define : 0
% 20.63/11.78 #Split : 4
% 20.63/11.78 #Chain : 0
% 20.63/11.78 #Close : 0
% 20.63/11.78
% 20.63/11.78 Ordering : KBO
% 20.63/11.78
% 20.63/11.78 Simplification rules
% 20.63/11.78 ----------------------
% 20.63/11.78 #Subsume : 4000
% 20.63/11.78 #Demod : 2726
% 20.63/11.78 #Tautology : 2224
% 20.63/11.78 #SimpNegUnit : 321
% 20.63/11.78 #BackRed : 118
% 20.63/11.78
% 20.63/11.78 #Partial instantiations: 0
% 20.63/11.78 #Strategies tried : 1
% 20.63/11.78
% 20.63/11.78 Timing (in seconds)
% 20.63/11.78 ----------------------
% 20.84/11.78 Preprocessing : 0.42
% 20.84/11.78 Parsing : 0.22
% 20.84/11.78 CNF conversion : 0.02
% 20.84/11.78 Main loop : 10.31
% 20.84/11.78 Inferencing : 1.55
% 20.84/11.78 Reduction : 3.36
% 20.84/11.78 Demodulation : 2.43
% 20.84/11.78 BG Simplification : 0.07
% 20.84/11.78 Subsumption : 4.69
% 20.84/11.78 Abstraction : 0.09
% 20.84/11.78 MUC search : 0.00
% 20.84/11.78 Cooper : 0.00
% 20.84/11.78 Total : 10.78
% 20.84/11.78 Index Insertion : 0.00
% 20.84/11.78 Index Deletion : 0.00
% 20.84/11.78 Index Matching : 0.00
% 20.84/11.78 BG Taut test : 0.00
%------------------------------------------------------------------------------