TSTP Solution File: KLE001+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE001+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/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 : n018.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 3.04s 1.85s
% Output : CNFRefutation 3.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of formulae : 16 ( 5 unt; 8 typ; 0 def)
% Number of atoms : 11 ( 5 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 1 |; 0 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > zero > one > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(multiplication,type,
multiplication: ( $i * $i ) > $i ).
tff(addition,type,
addition: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $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/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
tff(f_79,axiom,
! [A,B] :
( leq(A,B)
<=> ( addition(A,B) = B ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
tff(f_86,negated_conjecture,
~ ! [X0,X1,X2] :
( leq(X0,X1)
=> leq(addition(X0,X2),addition(X0,X2)) ),
file('/export/starexec/sandbox2/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_235,plain,
! [A_34,B_35] :
( leq(A_34,B_35)
| ( addition(A_34,B_35) != B_35 ) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_28,plain,
~ leq(addition('#skF_1','#skF_3'),addition('#skF_1','#skF_3')),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_241,plain,
addition(addition('#skF_1','#skF_3'),addition('#skF_1','#skF_3')) != addition('#skF_1','#skF_3'),
inference(resolution,[status(thm)],[c_235,c_28]) ).
tff(c_246,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_241]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : KLE001+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % 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.19/0.36 % Computer : n018.cluster.edu
% 0.19/0.36 % Model : x86_64 x86_64
% 0.19/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.36 % Memory : 8042.1875MB
% 0.19/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.36 % CPULimit : 300
% 0.19/0.36 % WCLimit : 300
% 0.19/0.36 % DateTime : Thu Aug 3 23:36:51 EDT 2023
% 0.19/0.36 % CPUTime :
% 3.04/1.85 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.04/1.86
% 3.04/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.04/1.88
% 3.04/1.88 Inference rules
% 3.04/1.88 ----------------------
% 3.04/1.88 #Ref : 0
% 3.04/1.88 #Sup : 49
% 3.04/1.88 #Fact : 0
% 3.04/1.88 #Define : 0
% 3.04/1.88 #Split : 0
% 3.04/1.88 #Chain : 0
% 3.04/1.88 #Close : 0
% 3.04/1.88
% 3.04/1.88 Ordering : KBO
% 3.04/1.88
% 3.04/1.88 Simplification rules
% 3.04/1.88 ----------------------
% 3.04/1.88 #Subsume : 0
% 3.04/1.88 #Demod : 8
% 3.04/1.88 #Tautology : 46
% 3.04/1.88 #SimpNegUnit : 0
% 3.04/1.88 #BackRed : 0
% 3.04/1.88
% 3.04/1.88 #Partial instantiations: 0
% 3.04/1.88 #Strategies tried : 1
% 3.04/1.88
% 3.04/1.88 Timing (in seconds)
% 3.04/1.88 ----------------------
% 3.04/1.88 Preprocessing : 0.47
% 3.04/1.88 Parsing : 0.26
% 3.04/1.88 CNF conversion : 0.03
% 3.04/1.88 Main loop : 0.23
% 3.04/1.88 Inferencing : 0.08
% 3.04/1.88 Reduction : 0.08
% 3.04/1.88 Demodulation : 0.06
% 3.04/1.88 BG Simplification : 0.01
% 3.04/1.88 Subsumption : 0.05
% 3.24/1.88 Abstraction : 0.01
% 3.24/1.89 MUC search : 0.00
% 3.24/1.89 Cooper : 0.00
% 3.24/1.89 Total : 0.74
% 3.24/1.89 Index Insertion : 0.00
% 3.24/1.89 Index Deletion : 0.00
% 3.24/1.89 Index Matching : 0.00
% 3.24/1.89 BG Taut test : 0.00
%------------------------------------------------------------------------------