TSTP Solution File: KLE003+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE003+1 : TPTP v8.1.2. Released v4.0.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 : 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:44:38 EDT 2023
% Result : Theorem 2.18s 1.58s
% Output : CNFRefutation 2.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 8
% Syntax : Number of formulae : 11 ( 3 unt; 6 typ; 0 def)
% Number of atoms : 7 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 3 ~; 1 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 3 (; 3 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > zero > one > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(multiplication,type,
multiplication: ( $i * $i ) > $i ).
tff(addition,type,
addition: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(one,type,
one: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_57,axiom,
! [A] : ( addition(A,A) = A ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
tff(f_86,negated_conjecture,
~ ( ! [X0] : ( addition(X0,X0) = X0 )
<=> ( addition(one,one) = one ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(c_8,plain,
! [A_7] : ( addition(A_7,A_7) = A_7 ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_28,plain,
( ( addition(one,one) != one )
| ( addition('#skF_1','#skF_1') != '#skF_1' ) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_38,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_8,c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE003+1 : TPTP v8.1.2. Released v4.0.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.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 23:27:31 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.18/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.18/1.59
% 2.18/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.18/1.62
% 2.18/1.62 Inference rules
% 2.18/1.62 ----------------------
% 2.18/1.62 #Ref : 0
% 2.18/1.62 #Sup : 0
% 2.18/1.62 #Fact : 0
% 2.18/1.62 #Define : 0
% 2.18/1.62 #Split : 0
% 2.18/1.62 #Chain : 0
% 2.18/1.62 #Close : 0
% 2.18/1.62
% 2.18/1.62 Ordering : KBO
% 2.18/1.62
% 2.18/1.62 Simplification rules
% 2.18/1.62 ----------------------
% 2.18/1.62 #Subsume : 13
% 2.18/1.62 #Demod : 6
% 2.18/1.62 #Tautology : 3
% 2.18/1.62 #SimpNegUnit : 0
% 2.18/1.62 #BackRed : 0
% 2.18/1.62
% 2.18/1.62 #Partial instantiations: 0
% 2.18/1.62 #Strategies tried : 1
% 2.18/1.62
% 2.18/1.62 Timing (in seconds)
% 2.18/1.62 ----------------------
% 2.18/1.62 Preprocessing : 0.46
% 2.18/1.62 Parsing : 0.25
% 2.18/1.62 CNF conversion : 0.03
% 2.18/1.62 Main loop : 0.08
% 2.18/1.62 Inferencing : 0.00
% 2.18/1.62 Reduction : 0.04
% 2.18/1.62 Demodulation : 0.03
% 2.18/1.62 BG Simplification : 0.01
% 2.18/1.62 Subsumption : 0.04
% 2.18/1.62 Abstraction : 0.01
% 2.18/1.62 MUC search : 0.00
% 2.18/1.62 Cooper : 0.00
% 2.18/1.62 Total : 0.60
% 2.18/1.62 Index Insertion : 0.00
% 2.18/1.63 Index Deletion : 0.00
% 2.18/1.63 Index Matching : 0.00
% 2.18/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------