TSTP Solution File: LCL193-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL193-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/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 : n007.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:37 EDT 2023
% Result : Unsatisfiable 8.71s 3.27s
% Output : CNFRefutation 8.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 35 ( 15 unt; 7 typ; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 44 ( 24 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 55 (; 55 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #nlpp > not > r > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(r,type,
r: $i ).
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_61,axiom,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file(unknown,unknown) ).
tff(f_74,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_86,axiom,
~ theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))),
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_191,plain,
! [Y_59,Z_60,X_61] :
( ~ theorem(or(not(Y_59),Z_60))
| ~ axiom(or(not(X_61),Y_59))
| theorem(or(not(X_61),Z_60)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_381,plain,
! [X_71,Y_72,Z_73] :
( ~ axiom(or(not(X_71),Y_72))
| theorem(or(not(X_71),Z_73))
| ~ axiom(or(not(Y_72),Z_73)) ),
inference(resolution,[status(thm)],[c_12,c_191]) ).
tff(c_518,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_381]) ).
tff(c_538,plain,
! [A_1] : theorem(or(not(A_1),A_1)),
inference(resolution,[status(thm)],[c_2,c_518]) ).
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_121,plain,
! [A_48,B_49,C_50] : axiom(or(not(or(not(A_48),B_49)),or(not(or(C_50,A_48)),or(C_50,B_49)))),
inference(cnfTransformation,[status(thm)],[f_61]) ).
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_331,plain,
! [A_68,B_69,C_70] :
( ~ theorem(or(not(A_68),B_69))
| theorem(or(not(or(C_70,A_68)),or(C_70,B_69))) ),
inference(resolution,[status(thm)],[c_121,c_14]) ).
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_1109,plain,
! [X_182,C_183,A_184,B_185] :
( ~ axiom(or(not(X_182),or(C_183,A_184)))
| theorem(or(not(X_182),or(C_183,B_185)))
| ~ theorem(or(not(A_184),B_185)) ),
inference(resolution,[status(thm)],[c_331,c_16]) ).
tff(c_1123,plain,
! [A_4,B_5,B_185] :
( theorem(or(not(or(A_4,B_5)),or(B_5,B_185)))
| ~ theorem(or(not(A_4),B_185)) ),
inference(resolution,[status(thm)],[c_6,c_1109]) ).
tff(c_10,plain,
! [A_9,B_10,C_11] : axiom(or(not(or(not(A_9),B_10)),or(not(or(C_11,A_9)),or(C_11,B_10)))),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_6403,plain,
! [A_760,B_761,C_762,B_763] :
( theorem(or(not(or(not(A_760),B_761)),or(not(or(C_762,A_760)),B_763)))
| ~ theorem(or(not(or(C_762,B_761)),B_763)) ),
inference(resolution,[status(thm)],[c_10,c_1109]) ).
tff(c_18,plain,
~ theorem(or(not(or(not(q),r)),or(not(or(p,q)),or(r,p)))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_6416,plain,
~ theorem(or(not(or(p,r)),or(r,p))),
inference(resolution,[status(thm)],[c_6403,c_18]) ).
tff(c_6428,plain,
~ theorem(or(not(p),p)),
inference(resolution,[status(thm)],[c_1123,c_6416]) ).
tff(c_6470,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_538,c_6428]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : LCL193-1 : TPTP v8.1.2. Released v1.1.0.
% 0.14/0.15 % 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.15/0.37 % Computer : n007.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:57:23 EDT 2023
% 0.15/0.37 % CPUTime :
% 8.71/3.27 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.71/3.28
% 8.71/3.28 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.76/3.30
% 8.76/3.30 Inference rules
% 8.76/3.30 ----------------------
% 8.76/3.30 #Ref : 0
% 8.76/3.30 #Sup : 1459
% 8.76/3.30 #Fact : 0
% 8.76/3.30 #Define : 0
% 8.76/3.30 #Split : 0
% 8.76/3.30 #Chain : 0
% 8.76/3.30 #Close : 0
% 8.76/3.30
% 8.76/3.30 Ordering : KBO
% 8.76/3.30
% 8.76/3.30 Simplification rules
% 8.76/3.30 ----------------------
% 8.76/3.30 #Subsume : 149
% 8.76/3.30 #Demod : 539
% 8.76/3.30 #Tautology : 541
% 8.76/3.30 #SimpNegUnit : 0
% 8.76/3.31 #BackRed : 0
% 8.76/3.31
% 8.76/3.31 #Partial instantiations: 0
% 8.76/3.31 #Strategies tried : 1
% 8.76/3.31
% 8.76/3.31 Timing (in seconds)
% 8.76/3.31 ----------------------
% 8.76/3.31 Preprocessing : 0.43
% 8.76/3.31 Parsing : 0.23
% 8.76/3.31 CNF conversion : 0.02
% 8.76/3.31 Main loop : 1.80
% 8.76/3.31 Inferencing : 0.63
% 8.76/3.31 Reduction : 0.54
% 8.76/3.31 Demodulation : 0.40
% 8.76/3.31 BG Simplification : 0.03
% 8.76/3.31 Subsumption : 0.50
% 8.76/3.31 Abstraction : 0.04
% 8.76/3.31 MUC search : 0.00
% 8.76/3.31 Cooper : 0.00
% 8.76/3.31 Total : 2.27
% 8.76/3.31 Index Insertion : 0.00
% 8.76/3.31 Index Deletion : 0.00
% 8.76/3.31 Index Matching : 0.00
% 8.76/3.31 BG Taut test : 0.00
%------------------------------------------------------------------------------