TSTP Solution File: LCL301-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL301-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 : n020.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:53 EDT 2023
% Result : Unsatisfiable 7.22s 2.84s
% Output : CNFRefutation 7.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 19
% Syntax : Number of formulae : 68 ( 31 unt; 9 typ; 0 def)
% Number of atoms : 94 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 73 ( 38 ~; 35 |; 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 : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 113 (; 113 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > equivalent > and > #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(equivalent,type,
equivalent: ( $i * $i ) > $i ).
tff(and,type,
and: ( $i * $i ) > $i ).
tff(axiom,type,
axiom: $i > $o ).
tff(p,type,
p: $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
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_56,axiom,
! [X,Y] : ( implies(X,Y) = or(not(X),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_69,axiom,
! [X,Y] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
file(unknown,unknown) ).
tff(f_46,axiom,
! [A] : axiom(implies(or(A,A),A)),
file(unknown,unknown) ).
tff(f_119,axiom,
! [P,Q] : ( equivalent(P,Q) = and(implies(P,Q),implies(Q,P)) ),
file(unknown,unknown) ).
tff(f_96,axiom,
! [P,Q] : ( and(P,Q) = not(or(not(P),not(Q))) ),
file(unknown,unknown) ).
tff(f_123,axiom,
~ theorem(equivalent(not(implies(not(p),not(q))),and(not(p),q))),
file(unknown,unknown) ).
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_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_182,plain,
! [A_51,B_52,C_53] : axiom(implies(or(A_51,or(B_52,C_53)),or(B_52,or(A_51,C_53)))),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_195,plain,
! [X_12,B_52,Y_13] : axiom(implies(or(not(X_12),or(B_52,Y_13)),or(B_52,implies(X_12,Y_13)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_182]) ).
tff(c_895,plain,
! [X_145,B_146,Y_147] : axiom(implies(implies(X_145,or(B_146,Y_147)),or(B_146,implies(X_145,Y_147)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_195]) ).
tff(c_70,plain,
! [Y_33,X_34] :
( ~ theorem(Y_33)
| ~ theorem(implies(Y_33,X_34))
| theorem(X_34) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_74,plain,
! [Y_33,X_34] :
( ~ theorem(Y_33)
| theorem(X_34)
| ~ axiom(implies(Y_33,X_34)) ),
inference(resolution,[status(thm)],[c_14,c_70]) ).
tff(c_913,plain,
! [X_145,B_146,Y_147] :
( ~ theorem(implies(X_145,or(B_146,Y_147)))
| theorem(or(B_146,implies(X_145,Y_147))) ),
inference(resolution,[status(thm)],[c_895,c_74]) ).
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_93,plain,
! [Y_38,X_39] :
( ~ theorem(Y_38)
| theorem(X_39)
| ~ axiom(implies(Y_38,X_39)) ),
inference(resolution,[status(thm)],[c_14,c_70]) ).
tff(c_113,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_93]) ).
tff(c_1404,plain,
! [A_211,B_212,C_213] :
( ~ theorem(or(A_211,or(B_212,C_213)))
| theorem(or(B_212,or(A_211,C_213))) ),
inference(resolution,[status(thm)],[c_182,c_74]) ).
tff(c_1565,plain,
! [B_235,B_236,C_237] :
( theorem(or(B_235,or(B_236,C_237)))
| ~ theorem(or(B_235,C_237)) ),
inference(resolution,[status(thm)],[c_113,c_1404]) ).
tff(c_1580,plain,
! [X_12,B_236,C_237] :
( theorem(implies(X_12,or(B_236,C_237)))
| ~ theorem(or(not(X_12),C_237)) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_1565]) ).
tff(c_1740,plain,
! [X_250,B_251,C_252] :
( theorem(implies(X_250,or(B_251,C_252)))
| ~ theorem(implies(X_250,C_252)) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_1580]) ).
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_1802,plain,
! [X_259,B_260,C_261] :
( ~ theorem(X_259)
| theorem(or(B_260,C_261))
| ~ theorem(implies(X_259,C_261)) ),
inference(resolution,[status(thm)],[c_1740,c_16]) ).
tff(c_2175,plain,
! [X_284,B_285,C_286] :
( ~ theorem(X_284)
| theorem(or(B_285,C_286))
| ~ axiom(implies(X_284,C_286)) ),
inference(resolution,[status(thm)],[c_14,c_1802]) ).
tff(c_2764,plain,
! [A_343,B_344,B_345] :
( ~ theorem(or(A_343,B_344))
| theorem(or(B_345,or(B_344,A_343))) ),
inference(resolution,[status(thm)],[c_6,c_2175]) ).
tff(c_200,plain,
! [A_51,B_52,C_53] :
( ~ theorem(or(A_51,or(B_52,C_53)))
| theorem(or(B_52,or(A_51,C_53))) ),
inference(resolution,[status(thm)],[c_182,c_74]) ).
tff(c_3033,plain,
! [B_368,B_369,A_370] :
( theorem(or(B_368,or(B_369,A_370)))
| ~ theorem(or(A_370,B_368)) ),
inference(resolution,[status(thm)],[c_2764,c_200]) ).
tff(c_2,plain,
! [A_1] : axiom(implies(or(A_1,A_1),A_1)),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_112,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_93]) ).
tff(c_3238,plain,
! [B_380,A_381] :
( theorem(or(B_380,A_381))
| ~ theorem(or(A_381,or(B_380,A_381))) ),
inference(resolution,[status(thm)],[c_3033,c_112]) ).
tff(c_3321,plain,
! [X_12,Y_13] :
( theorem(or(not(X_12),Y_13))
| ~ theorem(or(Y_13,implies(X_12,Y_13))) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_3238]) ).
tff(c_3913,plain,
! [X_417,Y_418] :
( theorem(implies(X_417,Y_418))
| ~ theorem(or(Y_418,implies(X_417,Y_418))) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_3321]) ).
tff(c_4109,plain,
! [X_426,Y_427] :
( theorem(implies(X_426,Y_427))
| ~ theorem(implies(X_426,or(Y_427,Y_427))) ),
inference(resolution,[status(thm)],[c_913,c_3913]) ).
tff(c_4219,plain,
! [X_430,Y_431] :
( theorem(implies(X_430,Y_431))
| ~ axiom(implies(X_430,or(Y_431,Y_431))) ),
inference(resolution,[status(thm)],[c_14,c_4109]) ).
tff(c_4259,plain,
! [A_2] : theorem(implies(A_2,A_2)),
inference(resolution,[status(thm)],[c_4,c_4219]) ).
tff(c_20,plain,
! [P_19,Q_20] : ( and(implies(P_19,Q_20),implies(Q_20,P_19)) = equivalent(P_19,Q_20) ),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_18,plain,
! [P_17,Q_18] : ( not(or(not(P_17),not(Q_18))) = and(P_17,Q_18) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_52,plain,
! [P_31,Q_32] : ( not(implies(P_31,not(Q_32))) = and(P_31,Q_32) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_18]) ).
tff(c_61,plain,
! [P_31,Q_32,Y_13] : ( implies(implies(P_31,not(Q_32)),Y_13) = or(and(P_31,Q_32),Y_13) ),
inference(superposition,[status(thm),theory(equality)],[c_52,c_12]) ).
tff(c_28,plain,
! [X_25,Y_26] : ( or(not(X_25),Y_26) = implies(X_25,Y_26) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_35,plain,
! [X_25] : axiom(implies(implies(X_25,not(X_25)),not(X_25))),
inference(superposition,[status(thm),theory(equality)],[c_28,c_2]) ).
tff(c_503,plain,
! [X_93] : axiom(or(and(X_93,X_93),not(X_93))),
inference(demodulation,[status(thm),theory(equality)],[c_61,c_35]) ).
tff(c_45,plain,
! [A_29,B_30] : axiom(implies(or(A_29,B_30),or(B_30,A_29))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_258,plain,
! [Y_64,X_65] : axiom(implies(or(Y_64,not(X_65)),implies(X_65,Y_64))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_45]) ).
tff(c_282,plain,
! [Y_68,X_69] :
( ~ theorem(or(Y_68,not(X_69)))
| theorem(implies(X_69,Y_68)) ),
inference(resolution,[status(thm)],[c_258,c_74]) ).
tff(c_309,plain,
! [X_69,Y_68] :
( theorem(implies(X_69,Y_68))
| ~ axiom(or(Y_68,not(X_69))) ),
inference(resolution,[status(thm)],[c_14,c_282]) ).
tff(c_515,plain,
! [X_94] : theorem(implies(X_94,and(X_94,X_94))),
inference(resolution,[status(thm)],[c_503,c_309]) ).
tff(c_528,plain,
! [X_95] :
( ~ theorem(X_95)
| theorem(and(X_95,X_95)) ),
inference(resolution,[status(thm)],[c_515,c_16]) ).
tff(c_538,plain,
! [Q_20] :
( ~ theorem(implies(Q_20,Q_20))
| theorem(equivalent(Q_20,Q_20)) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_528]) ).
tff(c_4267,plain,
! [Q_20] : theorem(equivalent(Q_20,Q_20)),
inference(demodulation,[status(thm),theory(equality)],[c_4259,c_538]) ).
tff(c_23,plain,
! [P_17,Q_18] : ( not(implies(P_17,not(Q_18))) = and(P_17,Q_18) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_18]) ).
tff(c_22,plain,
~ theorem(equivalent(not(implies(not(p),not(q))),and(not(p),q))),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_24,plain,
~ theorem(equivalent(and(not(p),q),and(not(p),q))),
inference(demodulation,[status(thm),theory(equality)],[c_23,c_22]) ).
tff(c_4315,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4267,c_24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL301-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/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.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 14:14:07 EDT 2023
% 0.14/0.36 % CPUTime :
% 7.22/2.84 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.22/2.85
% 7.22/2.85 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.22/2.89
% 7.22/2.89 Inference rules
% 7.22/2.89 ----------------------
% 7.22/2.89 #Ref : 0
% 7.22/2.89 #Sup : 1011
% 7.22/2.89 #Fact : 0
% 7.22/2.89 #Define : 0
% 7.22/2.89 #Split : 2
% 7.22/2.89 #Chain : 0
% 7.22/2.89 #Close : 0
% 7.22/2.89
% 7.22/2.89 Ordering : KBO
% 7.22/2.89
% 7.22/2.89 Simplification rules
% 7.22/2.89 ----------------------
% 7.22/2.89 #Subsume : 403
% 7.22/2.89 #Demod : 328
% 7.22/2.89 #Tautology : 81
% 7.22/2.89 #SimpNegUnit : 0
% 7.22/2.89 #BackRed : 7
% 7.22/2.89
% 7.22/2.89 #Partial instantiations: 0
% 7.22/2.89 #Strategies tried : 1
% 7.22/2.89
% 7.22/2.89 Timing (in seconds)
% 7.22/2.89 ----------------------
% 7.22/2.90 Preprocessing : 0.44
% 7.22/2.90 Parsing : 0.25
% 7.22/2.90 CNF conversion : 0.02
% 7.22/2.90 Main loop : 1.35
% 7.22/2.90 Inferencing : 0.52
% 7.22/2.90 Reduction : 0.37
% 7.22/2.90 Demodulation : 0.26
% 7.22/2.90 BG Simplification : 0.03
% 7.22/2.90 Subsumption : 0.33
% 7.22/2.90 Abstraction : 0.04
% 7.22/2.90 MUC search : 0.00
% 7.22/2.90 Cooper : 0.00
% 7.22/2.90 Total : 1.86
% 7.22/2.90 Index Insertion : 0.00
% 7.22/2.90 Index Deletion : 0.00
% 7.22/2.90 Index Matching : 0.00
% 7.22/2.90 BG Taut test : 0.00
%------------------------------------------------------------------------------