TSTP Solution File: LCL206-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL206-1 : TPTP v8.1.2. Released v1.1.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 : 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:40 EDT 2023
% Result : Unsatisfiable 8.73s 3.23s
% Output : CNFRefutation 8.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 43 ( 18 unt; 6 typ; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 28 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 74 (; 74 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #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(f_55,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_74,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file(unknown,unknown) ).
tff(f_53,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file(unknown,unknown) ).
tff(f_82,axiom,
! [X,Z,Y] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) ),
file(unknown,unknown) ).
tff(f_86,axiom,
~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),not(q)))),
file(unknown,unknown) ).
tff(c_4,plain,
! [A_2,B_3] : axiom(or(not(A_2),or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_12,plain,
! [X_12] :
( ~ axiom(X_12)
| theorem(X_12) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_56,plain,
! [A_32,B_33,C_34] : axiom(or(not(or(A_32,or(B_33,C_34))),or(B_33,or(A_32,C_34)))),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_14,plain,
! [Y_14,X_13] :
( ~ theorem(Y_14)
| ~ axiom(or(not(Y_14),X_13))
| theorem(X_13) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_79,plain,
! [A_39,B_40,C_41] :
( ~ theorem(or(A_39,or(B_40,C_41)))
| theorem(or(B_40,or(A_39,C_41))) ),
inference(resolution,[status(thm)],[c_56,c_14]) ).
tff(c_320,plain,
! [B_70,A_71,C_72] :
( theorem(or(B_70,or(A_71,C_72)))
| ~ axiom(or(A_71,or(B_70,C_72))) ),
inference(resolution,[status(thm)],[c_12,c_79]) ).
tff(c_36,plain,
! [A_25,B_26] : axiom(or(not(or(A_25,B_26)),or(B_26,A_25))),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_40,plain,
! [A_25,B_26] :
( ~ theorem(or(A_25,B_26))
| theorem(or(B_26,A_25)) ),
inference(resolution,[status(thm)],[c_36,c_14]) ).
tff(c_425,plain,
! [A_84,C_85,B_86] :
( theorem(or(or(A_84,C_85),B_86))
| ~ axiom(or(A_84,or(B_86,C_85))) ),
inference(resolution,[status(thm)],[c_320,c_40]) ).
tff(c_22,plain,
! [Y_22,X_23] :
( ~ theorem(Y_22)
| ~ axiom(or(not(Y_22),X_23))
| theorem(X_23) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_30,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_22]) ).
tff(c_195,plain,
! [B_54,B_55,C_56] :
( theorem(or(B_54,or(B_55,C_56)))
| ~ theorem(or(B_54,C_56)) ),
inference(resolution,[status(thm)],[c_30,c_79]) ).
tff(c_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_29,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_22]) ).
tff(c_214,plain,
! [B_55,C_56] :
( theorem(or(B_55,C_56))
| ~ theorem(or(or(B_55,C_56),C_56)) ),
inference(resolution,[status(thm)],[c_195,c_29]) ).
tff(c_457,plain,
! [A_90,B_91] :
( theorem(or(A_90,B_91))
| ~ axiom(or(A_90,or(B_91,B_91))) ),
inference(resolution,[status(thm)],[c_425,c_214]) ).
tff(c_478,plain,
! [A_92] : theorem(or(not(A_92),A_92)),
inference(resolution,[status(thm)],[c_4,c_457]) ).
tff(c_488,plain,
! [A_92] : theorem(or(A_92,not(A_92))),
inference(resolution,[status(thm)],[c_478,c_40]) ).
tff(c_16,plain,
! [Y_17,Z_16,X_15] :
( ~ theorem(or(not(Y_17),Z_16))
| ~ axiom(or(not(X_15),Y_17))
| theorem(or(not(X_15),Z_16)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_4447,plain,
! [X_583,Y_584,B_585,C_586] :
( ~ axiom(or(not(X_583),Y_584))
| theorem(or(not(X_583),or(B_585,C_586)))
| ~ theorem(or(not(Y_584),C_586)) ),
inference(resolution,[status(thm)],[c_195,c_16]) ).
tff(c_4897,plain,
! [A_648,B_649,C_650,B_651] :
( theorem(or(not(A_648),or(B_649,C_650)))
| ~ theorem(or(not(or(B_651,A_648)),C_650)) ),
inference(resolution,[status(thm)],[c_4,c_4447]) ).
tff(c_6062,plain,
! [A_751,B_752,B_753] : theorem(or(not(A_751),or(B_752,not(not(or(B_753,A_751)))))),
inference(resolution,[status(thm)],[c_488,c_4897]) ).
tff(c_60,plain,
! [A_32,B_33,C_34] :
( ~ theorem(or(A_32,or(B_33,C_34)))
| theorem(or(B_33,or(A_32,C_34))) ),
inference(resolution,[status(thm)],[c_56,c_14]) ).
tff(c_6111,plain,
! [B_758,A_759,B_760] : theorem(or(B_758,or(not(A_759),not(not(or(B_760,A_759)))))),
inference(resolution,[status(thm)],[c_6062,c_60]) ).
tff(c_6152,plain,
! [A_761,B_762] : theorem(or(not(A_761),not(not(or(B_762,A_761))))),
inference(resolution,[status(thm)],[c_6111,c_29]) ).
tff(c_6162,plain,
! [B_762,A_761] : theorem(or(not(not(or(B_762,A_761))),not(A_761))),
inference(resolution,[status(thm)],[c_6152,c_40]) ).
tff(c_18,plain,
~ theorem(or(not(not(or(not(p),q))),or(not(not(p)),not(q)))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_211,plain,
~ theorem(or(not(not(or(not(p),q))),not(q))),
inference(resolution,[status(thm)],[c_195,c_18]) ).
tff(c_6165,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6162,c_211]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL206-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.15 % 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.15/0.36 % Computer : n020.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.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 14:14:52 EDT 2023
% 0.15/0.37 % CPUTime :
% 8.73/3.23 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.85/3.24
% 8.85/3.24 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.89/3.27
% 8.89/3.27 Inference rules
% 8.89/3.27 ----------------------
% 8.89/3.27 #Ref : 0
% 8.89/3.27 #Sup : 1394
% 8.89/3.27 #Fact : 0
% 8.89/3.27 #Define : 0
% 8.89/3.27 #Split : 0
% 8.89/3.27 #Chain : 0
% 8.89/3.27 #Close : 0
% 8.89/3.27
% 8.89/3.27 Ordering : KBO
% 8.89/3.27
% 8.89/3.27 Simplification rules
% 8.89/3.27 ----------------------
% 8.89/3.27 #Subsume : 216
% 8.89/3.27 #Demod : 461
% 8.89/3.27 #Tautology : 463
% 8.89/3.27 #SimpNegUnit : 0
% 8.89/3.27 #BackRed : 1
% 8.89/3.27
% 8.89/3.27 #Partial instantiations: 0
% 8.89/3.27 #Strategies tried : 1
% 8.89/3.27
% 8.89/3.27 Timing (in seconds)
% 8.89/3.27 ----------------------
% 8.89/3.28 Preprocessing : 0.41
% 8.89/3.28 Parsing : 0.22
% 8.89/3.28 CNF conversion : 0.02
% 8.89/3.28 Main loop : 1.78
% 8.89/3.28 Inferencing : 0.59
% 8.89/3.28 Reduction : 0.51
% 8.89/3.28 Demodulation : 0.38
% 8.89/3.28 BG Simplification : 0.03
% 8.89/3.28 Subsumption : 0.54
% 8.89/3.28 Abstraction : 0.04
% 8.89/3.28 MUC search : 0.00
% 8.89/3.28 Cooper : 0.00
% 8.89/3.28 Total : 2.24
% 8.89/3.28 Index Insertion : 0.00
% 8.89/3.28 Index Deletion : 0.00
% 8.89/3.28 Index Matching : 0.00
% 8.89/3.28 BG Taut test : 0.00
%------------------------------------------------------------------------------