TSTP Solution File: LCL169-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : LCL169-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 : n019.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.83s 1.63s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 17 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 13 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > #nlpp > not > 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(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_46,axiom,
! [A] : axiom(implies(or(A,A),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(p)),not(p))),
file(unknown,unknown) ).
tff(c_22,plain,
! [X_21,Y_22] : ( or(not(X_21),Y_22) = implies(X_21,Y_22) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_2,plain,
! [A_1] : axiom(implies(or(A_1,A_1),A_1)),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_29,plain,
! [X_21] : axiom(implies(implies(X_21,not(X_21)),not(X_21))),
inference(superposition,[status(thm),theory(equality)],[c_22,c_2]) ).
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(p)),not(p))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_42,plain,
~ axiom(implies(implies(p,not(p)),not(p))),
inference(resolution,[status(thm)],[c_14,c_18]) ).
tff(c_146,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_29,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL169-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/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.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 14:06:16 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.83/1.63 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.83/1.64
% 2.83/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.83/1.67
% 2.83/1.67 Inference rules
% 2.83/1.67 ----------------------
% 2.83/1.67 #Ref : 0
% 2.83/1.67 #Sup : 28
% 2.83/1.67 #Fact : 0
% 2.83/1.67 #Define : 0
% 2.83/1.67 #Split : 0
% 2.83/1.67 #Chain : 0
% 2.83/1.67 #Close : 0
% 2.83/1.67
% 2.83/1.67 Ordering : KBO
% 2.83/1.67
% 2.83/1.67 Simplification rules
% 2.83/1.67 ----------------------
% 2.83/1.67 #Subsume : 1
% 2.83/1.67 #Demod : 7
% 2.83/1.67 #Tautology : 4
% 2.83/1.67 #SimpNegUnit : 0
% 2.83/1.67 #BackRed : 1
% 2.83/1.67
% 2.83/1.67 #Partial instantiations: 0
% 2.83/1.67 #Strategies tried : 1
% 2.83/1.67
% 2.83/1.67 Timing (in seconds)
% 2.83/1.67 ----------------------
% 2.83/1.67 Preprocessing : 0.42
% 2.83/1.67 Parsing : 0.23
% 2.83/1.67 CNF conversion : 0.02
% 2.83/1.67 Main loop : 0.25
% 2.83/1.67 Inferencing : 0.11
% 2.83/1.67 Reduction : 0.07
% 2.83/1.67 Demodulation : 0.05
% 2.83/1.67 BG Simplification : 0.01
% 2.83/1.67 Subsumption : 0.05
% 2.83/1.67 Abstraction : 0.01
% 2.83/1.67 MUC search : 0.00
% 2.83/1.67 Cooper : 0.00
% 2.83/1.67 Total : 0.72
% 2.83/1.67 Index Insertion : 0.00
% 2.83/1.67 Index Deletion : 0.00
% 2.83/1.67 Index Matching : 0.00
% 2.83/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------