TSTP Solution File: LCL172-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL172-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 : n021.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:32 EDT 2023
% Result : Unsatisfiable 2.96s 2.13s
% Output : CNFRefutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 15 ( 6 unt; 7 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 : 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 (; 8 !; 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_59,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_86,axiom,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))),
file(unknown,unknown) ).
tff(c_8,plain,
! [A_6,B_7,C_8] : axiom(or(not(or(A_6,or(B_7,C_8))),or(B_7,or(A_6,C_8)))),
inference(cnfTransformation,[status(thm)],[f_59]) ).
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(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_269,plain,
~ axiom(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))),
inference(resolution,[status(thm)],[c_12,c_18]) ).
tff(c_278,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_269]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL172-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.12 % 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.13/0.32 % Computer : n021.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Thu Aug 3 13:55:51 EDT 2023
% 0.13/0.32 % CPUTime :
% 2.96/2.13 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.96/2.14
% 2.96/2.14 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.39/2.17
% 3.39/2.17 Inference rules
% 3.39/2.17 ----------------------
% 3.39/2.17 #Ref : 0
% 3.39/2.17 #Sup : 57
% 3.39/2.17 #Fact : 0
% 3.39/2.17 #Define : 0
% 3.39/2.17 #Split : 0
% 3.39/2.17 #Chain : 0
% 3.39/2.17 #Close : 0
% 3.39/2.17
% 3.39/2.17 Ordering : KBO
% 3.39/2.18
% 3.39/2.18 Simplification rules
% 3.39/2.18 ----------------------
% 3.39/2.18 #Subsume : 19
% 3.39/2.18 #Demod : 1
% 3.39/2.18 #Tautology : 3
% 3.39/2.18 #SimpNegUnit : 0
% 3.39/2.18 #BackRed : 0
% 3.39/2.18
% 3.39/2.18 #Partial instantiations: 0
% 3.39/2.18 #Strategies tried : 1
% 3.39/2.18
% 3.39/2.18 Timing (in seconds)
% 3.39/2.18 ----------------------
% 3.39/2.18 Preprocessing : 0.56
% 3.39/2.18 Parsing : 0.31
% 3.39/2.18 CNF conversion : 0.03
% 3.39/2.18 Main loop : 0.43
% 3.39/2.18 Inferencing : 0.19
% 3.39/2.18 Reduction : 0.09
% 3.39/2.18 Demodulation : 0.07
% 3.39/2.18 BG Simplification : 0.01
% 3.39/2.18 Subsumption : 0.11
% 3.39/2.18 Abstraction : 0.02
% 3.39/2.18 MUC search : 0.00
% 3.39/2.18 Cooper : 0.00
% 3.39/2.18 Total : 1.06
% 3.39/2.18 Index Insertion : 0.00
% 3.39/2.18 Index Deletion : 0.00
% 3.39/2.18 Index Matching : 0.00
% 3.39/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------