TSTP Solution File: LCL200-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL200-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 : n013.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:38 EDT 2023
% Result : Unsatisfiable 7.22s 2.94s
% Output : CNFRefutation 7.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 41 ( 17 unt; 6 typ; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 54 ( 28 ~; 26 |; 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 : 73 (; 73 !; 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_53,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file(unknown,unknown) ).
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_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_57,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file(unknown,unknown) ).
tff(f_74,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
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_86,axiom,
~ theorem(or(not(not(or(p,q))),not(q))),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_53]) ).
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_90,plain,
! [Y_37,Z_38,X_39] :
( ~ theorem(or(not(Y_37),Z_38))
| ~ axiom(or(not(X_39),Y_37))
| theorem(or(not(X_39),Z_38)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_333,plain,
! [X_81,Y_82,Z_83] :
( ~ axiom(or(not(X_81),Y_82))
| theorem(or(not(X_81),Z_83))
| ~ axiom(or(not(Y_82),Z_83)) ),
inference(resolution,[status(thm)],[c_12,c_90]) ).
tff(c_394,plain,
! [A_89,Z_90,B_91] :
( theorem(or(not(A_89),Z_90))
| ~ axiom(or(not(or(B_91,A_89)),Z_90)) ),
inference(resolution,[status(thm)],[c_4,c_333]) ).
tff(c_416,plain,
! [A_92] : theorem(or(not(A_92),A_92)),
inference(resolution,[status(thm)],[c_2,c_394]) ).
tff(c_6,plain,
! [A_4,B_5] : axiom(or(not(or(A_4,B_5)),or(B_5,A_4))),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_27,plain,
! [Y_24,X_25] :
( ~ theorem(Y_24)
| ~ axiom(or(not(Y_24),X_25))
| theorem(X_25) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_37,plain,
! [A_4,B_5] :
( ~ theorem(or(A_4,B_5))
| theorem(or(B_5,A_4)) ),
inference(resolution,[status(thm)],[c_6,c_27]) ).
tff(c_426,plain,
! [A_92] : theorem(or(A_92,not(A_92))),
inference(resolution,[status(thm)],[c_416,c_37]) ).
tff(c_39,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_27]) ).
tff(c_59,plain,
! [A_29,B_30,C_31] : axiom(or(not(or(A_29,or(B_30,C_31))),or(B_30,or(A_29,C_31)))),
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_125,plain,
! [A_45,B_46,C_47] :
( ~ theorem(or(A_45,or(B_46,C_47)))
| theorem(or(B_46,or(A_45,C_47))) ),
inference(resolution,[status(thm)],[c_59,c_14]) ).
tff(c_171,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_39,c_125]) ).
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_3697,plain,
! [X_491,Y_492,B_493,C_494] :
( ~ axiom(or(not(X_491),Y_492))
| theorem(or(not(X_491),or(B_493,C_494)))
| ~ theorem(or(not(Y_492),C_494)) ),
inference(resolution,[status(thm)],[c_171,c_16]) ).
tff(c_3973,plain,
! [A_534,B_535,C_536,B_537] :
( theorem(or(not(A_534),or(B_535,C_536)))
| ~ theorem(or(not(or(B_537,A_534)),C_536)) ),
inference(resolution,[status(thm)],[c_4,c_3697]) ).
tff(c_4423,plain,
! [A_550,B_551,B_552] : theorem(or(not(A_550),or(B_551,not(not(or(B_552,A_550)))))),
inference(resolution,[status(thm)],[c_426,c_3973]) ).
tff(c_63,plain,
! [A_29,B_30,C_31] :
( ~ theorem(or(A_29,or(B_30,C_31)))
| theorem(or(B_30,or(A_29,C_31))) ),
inference(resolution,[status(thm)],[c_59,c_14]) ).
tff(c_5008,plain,
! [B_638,A_639,B_640] : theorem(or(B_638,or(not(A_639),not(not(or(B_640,A_639)))))),
inference(resolution,[status(thm)],[c_4423,c_63]) ).
tff(c_38,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_27]) ).
tff(c_5049,plain,
! [A_641,B_642] : theorem(or(not(A_641),not(not(or(B_642,A_641))))),
inference(resolution,[status(thm)],[c_5008,c_38]) ).
tff(c_5059,plain,
! [B_642,A_641] : theorem(or(not(not(or(B_642,A_641))),not(A_641))),
inference(resolution,[status(thm)],[c_5049,c_37]) ).
tff(c_18,plain,
~ theorem(or(not(not(or(p,q))),not(q))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_5062,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_5059,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : LCL200-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.37 % Computer : n013.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 13:23:47 EDT 2023
% 0.15/0.37 % CPUTime :
% 7.22/2.94 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.22/2.94
% 7.22/2.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.99/2.98
% 7.99/2.98 Inference rules
% 7.99/2.98 ----------------------
% 7.99/2.98 #Ref : 0
% 7.99/2.98 #Sup : 1138
% 7.99/2.98 #Fact : 0
% 7.99/2.98 #Define : 0
% 7.99/2.98 #Split : 0
% 7.99/2.98 #Chain : 0
% 7.99/2.98 #Close : 0
% 7.99/2.98
% 7.99/2.98 Ordering : KBO
% 7.99/2.98
% 7.99/2.98 Simplification rules
% 7.99/2.98 ----------------------
% 7.99/2.98 #Subsume : 113
% 7.99/2.98 #Demod : 418
% 7.99/2.98 #Tautology : 420
% 7.99/2.98 #SimpNegUnit : 0
% 7.99/2.98 #BackRed : 1
% 7.99/2.98
% 7.99/2.98 #Partial instantiations: 0
% 7.99/2.98 #Strategies tried : 1
% 7.99/2.98
% 7.99/2.98 Timing (in seconds)
% 7.99/2.98 ----------------------
% 7.99/2.98 Preprocessing : 0.43
% 7.99/2.98 Parsing : 0.23
% 7.99/2.98 CNF conversion : 0.02
% 7.99/2.98 Main loop : 1.45
% 7.99/2.98 Inferencing : 0.51
% 7.99/2.98 Reduction : 0.42
% 7.99/2.98 Demodulation : 0.31
% 7.99/2.98 BG Simplification : 0.03
% 7.99/2.98 Subsumption : 0.42
% 7.99/2.98 Abstraction : 0.03
% 7.99/2.98 MUC search : 0.00
% 7.99/2.98 Cooper : 0.00
% 7.99/2.98 Total : 1.93
% 7.99/2.98 Index Insertion : 0.00
% 7.99/2.98 Index Deletion : 0.00
% 7.99/2.98 Index Matching : 0.00
% 7.99/2.98 BG Taut test : 0.00
%------------------------------------------------------------------------------