TSTP Solution File: LCL173-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL173-3 : TPTP v8.1.2. Released v2.3.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 3.25s 1.85s
% Output : CNFRefutation 3.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of formulae : 20 ( 10 unt; 8 typ; 0 def)
% Number of atoms : 14 ( 2 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 : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > #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(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_56,axiom,
! [X,Y] : ( implies(X,Y) = or(not(X),Y) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_77,axiom,
~ theorem(implies(implies(q,r),implies(implies(p,q),implies(p,r)))),
file(unknown,unknown) ).
tff(c_12,plain,
! [X_12,Y_13] : ( or(not(X_12),Y_13) = implies(X_12,Y_13) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_164,plain,
! [A_46,B_47,C_48] : axiom(implies(implies(A_46,B_47),implies(or(C_48,A_46),or(C_48,B_47)))),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_170,plain,
! [Y_13,B_47,X_12] : axiom(implies(implies(Y_13,B_47),implies(implies(X_12,Y_13),or(not(X_12),B_47)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_164]) ).
tff(c_175,plain,
! [Y_13,B_47,X_12] : axiom(implies(implies(Y_13,B_47),implies(implies(X_12,Y_13),implies(X_12,B_47)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_170]) ).
tff(c_14,plain,
! [X_14] :
( ~ axiom(X_14)
| theorem(X_14) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_18,plain,
~ theorem(implies(implies(q,r),implies(implies(p,q),implies(p,r)))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_76,plain,
~ axiom(implies(implies(q,r),implies(implies(p,q),implies(p,r)))),
inference(resolution,[status(thm)],[c_14,c_18]) ).
tff(c_406,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_175,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL173-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13 % 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.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 14:14:51 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.25/1.85 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.25/1.86
% 3.25/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.25/1.88
% 3.25/1.88 Inference rules
% 3.25/1.88 ----------------------
% 3.25/1.88 #Ref : 0
% 3.25/1.88 #Sup : 85
% 3.25/1.88 #Fact : 0
% 3.25/1.88 #Define : 0
% 3.25/1.88 #Split : 1
% 3.25/1.88 #Chain : 0
% 3.25/1.88 #Close : 0
% 3.25/1.88
% 3.25/1.88 Ordering : KBO
% 3.25/1.88
% 3.25/1.88 Simplification rules
% 3.25/1.88 ----------------------
% 3.25/1.88 #Subsume : 23
% 3.25/1.88 #Demod : 13
% 3.25/1.88 #Tautology : 10
% 3.25/1.88 #SimpNegUnit : 0
% 3.25/1.88 #BackRed : 0
% 3.25/1.88
% 3.25/1.88 #Partial instantiations: 0
% 3.25/1.88 #Strategies tried : 1
% 3.25/1.88
% 3.25/1.88 Timing (in seconds)
% 3.25/1.88 ----------------------
% 3.25/1.88 Preprocessing : 0.42
% 3.25/1.88 Parsing : 0.22
% 3.25/1.88 CNF conversion : 0.02
% 3.25/1.88 Main loop : 0.41
% 3.25/1.88 Inferencing : 0.18
% 3.25/1.88 Reduction : 0.10
% 3.25/1.88 Demodulation : 0.07
% 3.25/1.88 BG Simplification : 0.01
% 3.25/1.88 Subsumption : 0.08
% 3.56/1.88 Abstraction : 0.01
% 3.56/1.88 MUC search : 0.00
% 3.56/1.88 Cooper : 0.00
% 3.56/1.88 Total : 0.87
% 3.56/1.88 Index Insertion : 0.00
% 3.56/1.88 Index Deletion : 0.00
% 3.56/1.88 Index Matching : 0.00
% 3.56/1.88 BG Taut test : 0.00
%------------------------------------------------------------------------------