TSTP Solution File: LCL170-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL170-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 : n025.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:31 EDT 2023
% Result : Unsatisfiable 2.21s 1.57s
% Output : CNFRefutation 2.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of formulae : 14 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 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 : 6 (; 6 !; 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_86,axiom,
~ theorem(or(not(q),or(not(p),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_18,plain,
~ theorem(or(not(q),or(not(p),q))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_24,plain,
~ axiom(or(not(q),or(not(p),q))),
inference(resolution,[status(thm)],[c_12,c_18]) ).
tff(c_28,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL170-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/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.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 14:01:49 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.21/1.57 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.21/1.58
% 2.21/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.21/1.60
% 2.21/1.60 Inference rules
% 2.21/1.60 ----------------------
% 2.21/1.60 #Ref : 0
% 2.21/1.60 #Sup : 1
% 2.21/1.60 #Fact : 0
% 2.21/1.60 #Define : 0
% 2.21/1.60 #Split : 0
% 2.21/1.60 #Chain : 0
% 2.21/1.60 #Close : 0
% 2.21/1.60
% 2.21/1.60 Ordering : KBO
% 2.21/1.60
% 2.21/1.60 Simplification rules
% 2.21/1.60 ----------------------
% 2.21/1.60 #Subsume : 0
% 2.21/1.60 #Demod : 1
% 2.21/1.60 #Tautology : 0
% 2.21/1.60 #SimpNegUnit : 0
% 2.21/1.60 #BackRed : 0
% 2.21/1.60
% 2.21/1.60 #Partial instantiations: 0
% 2.21/1.60 #Strategies tried : 1
% 2.21/1.60
% 2.21/1.60 Timing (in seconds)
% 2.21/1.60 ----------------------
% 2.21/1.61 Preprocessing : 0.41
% 2.21/1.61 Parsing : 0.22
% 2.21/1.61 CNF conversion : 0.02
% 2.21/1.61 Main loop : 0.15
% 2.21/1.61 Inferencing : 0.06
% 2.21/1.61 Reduction : 0.03
% 2.21/1.61 Demodulation : 0.03
% 2.21/1.61 BG Simplification : 0.01
% 2.21/1.61 Subsumption : 0.03
% 2.21/1.61 Abstraction : 0.00
% 2.21/1.61 MUC search : 0.00
% 2.21/1.61 Cooper : 0.00
% 2.21/1.61 Total : 0.60
% 2.21/1.61 Index Insertion : 0.00
% 2.21/1.61 Index Deletion : 0.00
% 2.21/1.61 Index Matching : 0.00
% 2.21/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------