TSTP Solution File: LCL297-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL297-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/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 : 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:53 EDT 2023
% Result : Unsatisfiable 6.43s 2.69s
% Output : CNFRefutation 6.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of formulae : 68 ( 34 unt; 9 typ; 0 def)
% Number of atoms : 91 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 67 ( 35 ~; 32 |; 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(p,not(q))),and(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_169,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_179,plain,
! [X_12,B_52,C_53] : axiom(implies(implies(X_12,or(B_52,C_53)),or(B_52,or(not(X_12),C_53)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_169]) ).
tff(c_1046,plain,
! [X_154,B_155,C_156] : axiom(implies(implies(X_154,or(B_155,C_156)),or(B_155,implies(X_154,C_156)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_179]) ).
tff(c_74,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_78,plain,
! [Y_33,X_34] :
( ~ theorem(Y_33)
| theorem(X_34)
| ~ axiom(implies(Y_33,X_34)) ),
inference(resolution,[status(thm)],[c_14,c_74]) ).
tff(c_1064,plain,
! [X_154,B_155,C_156] :
( ~ theorem(implies(X_154,or(B_155,C_156)))
| theorem(or(B_155,implies(X_154,C_156))) ),
inference(resolution,[status(thm)],[c_1046,c_78]) ).
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_88,plain,
! [Y_37,X_38] :
( ~ theorem(Y_37)
| theorem(X_38)
| ~ axiom(implies(Y_37,X_38)) ),
inference(resolution,[status(thm)],[c_14,c_74]) ).
tff(c_104,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_88]) ).
tff(c_186,plain,
! [A_51,X_12,C_53] : axiom(implies(or(A_51,or(not(X_12),C_53)),implies(X_12,or(A_51,C_53)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_169]) ).
tff(c_580,plain,
! [A_91,X_92,C_93] : axiom(implies(or(A_91,implies(X_92,C_93)),implies(X_92,or(A_91,C_93)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_186]) ).
tff(c_1417,plain,
! [A_207,X_208,C_209] :
( ~ theorem(or(A_207,implies(X_208,C_209)))
| theorem(implies(X_208,or(A_207,C_209))) ),
inference(resolution,[status(thm)],[c_580,c_78]) ).
tff(c_1500,plain,
! [X_216,B_217,C_218] :
( theorem(implies(X_216,or(B_217,C_218)))
| ~ theorem(implies(X_216,C_218)) ),
inference(resolution,[status(thm)],[c_104,c_1417]) ).
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_1538,plain,
! [X_222,B_223,C_224] :
( ~ theorem(X_222)
| theorem(or(B_223,C_224))
| ~ theorem(implies(X_222,C_224)) ),
inference(resolution,[status(thm)],[c_1500,c_16]) ).
tff(c_1890,plain,
! [X_252,B_253,C_254] :
( ~ theorem(X_252)
| theorem(or(B_253,C_254))
| ~ axiom(implies(X_252,C_254)) ),
inference(resolution,[status(thm)],[c_14,c_1538]) ).
tff(c_2479,plain,
! [A_303,B_304,B_305] :
( ~ theorem(or(A_303,B_304))
| theorem(or(B_305,or(B_304,A_303))) ),
inference(resolution,[status(thm)],[c_6,c_1890]) ).
tff(c_187,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_169,c_78]) ).
tff(c_2711,plain,
! [B_327,B_328,A_329] :
( theorem(or(B_327,or(B_328,A_329)))
| ~ theorem(or(A_329,B_327)) ),
inference(resolution,[status(thm)],[c_2479,c_187]) ).
tff(c_2,plain,
! [A_1] : axiom(implies(or(A_1,A_1),A_1)),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_103,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_88]) ).
tff(c_3351,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_2711,c_103]) ).
tff(c_3446,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_3351]) ).
tff(c_3623,plain,
! [X_395,Y_396] :
( theorem(implies(X_395,Y_396))
| ~ theorem(or(Y_396,implies(X_395,Y_396))) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_3446]) ).
tff(c_3820,plain,
! [X_404,C_405] :
( theorem(implies(X_404,C_405))
| ~ theorem(implies(X_404,or(C_405,C_405))) ),
inference(resolution,[status(thm)],[c_1064,c_3623]) ).
tff(c_3926,plain,
! [X_408,C_409] :
( theorem(implies(X_408,C_409))
| ~ axiom(implies(X_408,or(C_409,C_409))) ),
inference(resolution,[status(thm)],[c_14,c_3820]) ).
tff(c_3966,plain,
! [A_2] : theorem(implies(A_2,A_2)),
inference(resolution,[status(thm)],[c_4,c_3926]) ).
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_56,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_65,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_56,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_417,plain,
! [X_75] : axiom(or(and(X_75,X_75),not(X_75))),
inference(demodulation,[status(thm),theory(equality)],[c_65,c_35]) ).
tff(c_421,plain,
! [Q_20] : axiom(or(equivalent(Q_20,Q_20),not(implies(Q_20,Q_20)))),
inference(superposition,[status(thm),theory(equality)],[c_20,c_417]) ).
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_270,plain,
! [Y_66,X_67] : axiom(implies(or(Y_66,not(X_67)),implies(X_67,Y_66))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_45]) ).
tff(c_299,plain,
! [Y_70,X_71] :
( ~ theorem(or(Y_70,not(X_71)))
| theorem(implies(X_71,Y_70)) ),
inference(resolution,[status(thm)],[c_270,c_78]) ).
tff(c_445,plain,
! [X_79,Y_80] :
( theorem(implies(X_79,Y_80))
| ~ axiom(or(Y_80,not(X_79))) ),
inference(resolution,[status(thm)],[c_14,c_299]) ).
tff(c_480,plain,
! [Q_83] : theorem(implies(implies(Q_83,Q_83),equivalent(Q_83,Q_83))),
inference(resolution,[status(thm)],[c_421,c_445]) ).
tff(c_492,plain,
! [Q_83] :
( ~ theorem(implies(Q_83,Q_83))
| theorem(equivalent(Q_83,Q_83)) ),
inference(resolution,[status(thm)],[c_480,c_16]) ).
tff(c_3974,plain,
! [Q_83] : theorem(equivalent(Q_83,Q_83)),
inference(demodulation,[status(thm),theory(equality)],[c_3966,c_492]) ).
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(p,not(q))),and(p,q))),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_24,plain,
~ theorem(equivalent(and(p,q),and(p,q))),
inference(demodulation,[status(thm),theory(equality)],[c_23,c_22]) ).
tff(c_4056,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_3974,c_24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL297-3 : TPTP v8.1.2. Released v2.3.0.
% 0.13/0.13 % 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.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 13:47:11 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.43/2.69 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.43/2.70
% 6.43/2.70 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.43/2.73
% 6.43/2.73 Inference rules
% 6.43/2.73 ----------------------
% 6.43/2.73 #Ref : 0
% 6.43/2.73 #Sup : 930
% 6.43/2.73 #Fact : 0
% 6.43/2.73 #Define : 0
% 6.43/2.73 #Split : 2
% 6.43/2.73 #Chain : 0
% 6.43/2.73 #Close : 0
% 6.43/2.73
% 6.43/2.73 Ordering : KBO
% 6.43/2.73
% 6.43/2.73 Simplification rules
% 6.43/2.73 ----------------------
% 6.43/2.73 #Subsume : 403
% 6.43/2.73 #Demod : 312
% 6.43/2.73 #Tautology : 80
% 6.43/2.73 #SimpNegUnit : 0
% 6.43/2.73 #BackRed : 6
% 6.43/2.73
% 6.43/2.73 #Partial instantiations: 0
% 6.43/2.73 #Strategies tried : 1
% 6.43/2.73
% 6.43/2.73 Timing (in seconds)
% 6.43/2.73 ----------------------
% 6.43/2.74 Preprocessing : 0.44
% 6.43/2.74 Parsing : 0.24
% 6.43/2.74 CNF conversion : 0.02
% 6.43/2.74 Main loop : 1.21
% 6.43/2.74 Inferencing : 0.45
% 6.43/2.74 Reduction : 0.35
% 6.43/2.74 Demodulation : 0.25
% 6.43/2.74 BG Simplification : 0.03
% 6.43/2.74 Subsumption : 0.29
% 6.43/2.74 Abstraction : 0.04
% 6.43/2.74 MUC search : 0.00
% 6.43/2.74 Cooper : 0.00
% 6.43/2.74 Total : 1.71
% 6.43/2.74 Index Insertion : 0.00
% 6.43/2.74 Index Deletion : 0.00
% 6.43/2.74 Index Matching : 0.00
% 6.43/2.74 BG Taut test : 0.00
%------------------------------------------------------------------------------