TSTP Solution File: LCL190-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL190-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 : n024.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:36 EDT 2023
% Result : Unsatisfiable 3.21s 1.95s
% Output : CNFRefutation 3.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 21 ( 9 unt; 7 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 11 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 19 (; 19 !; 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_57,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
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(p,or(q,r))),or(p,or(r,q)))),
file(unknown,unknown) ).
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_12,plain,
! [X_12] :
( ~ axiom(X_12)
| theorem(X_12) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_135,plain,
! [A_40,B_41,C_42] : axiom(or(not(or(not(A_40),B_41)),or(not(or(C_42,A_40)),or(C_42,B_41)))),
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_373,plain,
! [A_74,B_75,C_76] :
( ~ theorem(or(not(A_74),B_75))
| theorem(or(not(or(C_76,A_74)),or(C_76,B_75))) ),
inference(resolution,[status(thm)],[c_135,c_14]) ).
tff(c_18,plain,
~ theorem(or(not(or(p,or(q,r))),or(p,or(r,q)))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_385,plain,
~ theorem(or(not(or(q,r)),or(r,q))),
inference(resolution,[status(thm)],[c_373,c_18]) ).
tff(c_404,plain,
~ axiom(or(not(or(q,r)),or(r,q))),
inference(resolution,[status(thm)],[c_12,c_385]) ).
tff(c_413,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_404]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL190-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/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.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 14:03:30 EDT 2023
% 0.15/0.35 % CPUTime :
% 3.21/1.95 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.21/1.95
% 3.21/1.95 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.21/1.98
% 3.21/1.98 Inference rules
% 3.21/1.98 ----------------------
% 3.21/1.98 #Ref : 0
% 3.21/1.98 #Sup : 91
% 3.21/1.98 #Fact : 0
% 3.21/1.98 #Define : 0
% 3.21/1.98 #Split : 0
% 3.21/1.98 #Chain : 0
% 3.21/1.98 #Close : 0
% 3.21/1.98
% 3.21/1.98 Ordering : KBO
% 3.21/1.98
% 3.21/1.98 Simplification rules
% 3.21/1.98 ----------------------
% 3.21/1.98 #Subsume : 31
% 3.21/1.98 #Demod : 1
% 3.21/1.98 #Tautology : 3
% 3.21/1.98 #SimpNegUnit : 0
% 3.21/1.98 #BackRed : 0
% 3.21/1.98
% 3.21/1.98 #Partial instantiations: 0
% 3.21/1.98 #Strategies tried : 1
% 3.21/1.98
% 3.21/1.98 Timing (in seconds)
% 3.21/1.98 ----------------------
% 3.21/1.98 Preprocessing : 0.42
% 3.21/1.98 Parsing : 0.24
% 3.21/1.98 CNF conversion : 0.02
% 3.21/1.98 Main loop : 0.38
% 3.21/1.98 Inferencing : 0.17
% 3.21/1.98 Reduction : 0.09
% 3.21/1.98 Demodulation : 0.06
% 3.21/1.98 BG Simplification : 0.01
% 3.21/1.98 Subsumption : 0.09
% 3.21/1.98 Abstraction : 0.01
% 3.21/1.98 MUC search : 0.00
% 3.21/1.98 Cooper : 0.00
% 3.21/1.99 Total : 0.85
% 3.21/1.99 Index Insertion : 0.00
% 3.21/1.99 Index Deletion : 0.00
% 3.21/1.99 Index Matching : 0.00
% 3.21/1.99 BG Taut test : 0.00
%------------------------------------------------------------------------------