TSTP Solution File: LCL171-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL171-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n009.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 3.21s 1.90s
% Output : CNFRefutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 19 ( 10 unt; 7 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 : 4 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > #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(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_56,axiom,
! [X,Y] : ( implies(X,Y) = or(not(X),Y) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_77,axiom,
~ theorem(implies(implies(p,not(q)),implies(q,not(p)))),
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_44,plain,
! [A_27,B_28] : axiom(implies(or(A_27,B_28),or(B_28,A_27))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_232,plain,
! [X_56,Y_57] : axiom(implies(implies(X_56,Y_57),or(Y_57,not(X_56)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_44]) ).
tff(c_239,plain,
! [X_56,X_12] : axiom(implies(implies(X_56,not(X_12)),implies(X_12,not(X_56)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_232]) ).
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(p,not(q)),implies(q,not(p)))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_76,plain,
~ axiom(implies(implies(p,not(q)),implies(q,not(p)))),
inference(resolution,[status(thm)],[c_14,c_18]) ).
tff(c_303,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_239,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL171-3 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n009.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:15:38 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.21/1.90 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.21/1.90
% 3.21/1.90 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.39/1.92
% 3.39/1.92 Inference rules
% 3.39/1.92 ----------------------
% 3.39/1.92 #Ref : 0
% 3.39/1.92 #Sup : 63
% 3.39/1.92 #Fact : 0
% 3.39/1.92 #Define : 0
% 3.39/1.92 #Split : 1
% 3.39/1.92 #Chain : 0
% 3.39/1.92 #Close : 0
% 3.39/1.92
% 3.39/1.92 Ordering : KBO
% 3.39/1.92
% 3.39/1.92 Simplification rules
% 3.39/1.92 ----------------------
% 3.39/1.92 #Subsume : 12
% 3.39/1.92 #Demod : 9
% 3.39/1.92 #Tautology : 9
% 3.39/1.92 #SimpNegUnit : 0
% 3.39/1.92 #BackRed : 1
% 3.39/1.92
% 3.39/1.92 #Partial instantiations: 0
% 3.39/1.92 #Strategies tried : 1
% 3.39/1.92
% 3.39/1.92 Timing (in seconds)
% 3.39/1.92 ----------------------
% 3.39/1.93 Preprocessing : 0.44
% 3.39/1.93 Parsing : 0.24
% 3.39/1.93 CNF conversion : 0.02
% 3.39/1.93 Main loop : 0.36
% 3.39/1.93 Inferencing : 0.15
% 3.39/1.93 Reduction : 0.09
% 3.39/1.93 Demodulation : 0.06
% 3.39/1.93 BG Simplification : 0.01
% 3.39/1.93 Subsumption : 0.08
% 3.39/1.93 Abstraction : 0.01
% 3.39/1.93 MUC search : 0.00
% 3.39/1.93 Cooper : 0.00
% 3.39/1.93 Total : 0.84
% 3.39/1.93 Index Insertion : 0.00
% 3.39/1.93 Index Deletion : 0.00
% 3.39/1.93 Index Matching : 0.00
% 3.39/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------