TSTP Solution File: KLE002+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE002+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 : n025.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 4.38s 2.23s
% Output : CNFRefutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 20 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 16 ( 8 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 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 : 15 (; 15 !; 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_86,negated_conjecture,
~ ! [X0,X1,X2] :
( leq(X0,X1)
=> leq(multiplication(X0,X2),multiplication(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
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_69,axiom,
! [A,B,C] : ( multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
tff(c_30,plain,
leq('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_226,plain,
! [A_32,B_33] :
( ( addition(A_32,B_33) = B_33 )
| ~ leq(A_32,B_33) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_230,plain,
addition('#skF_1','#skF_2') = '#skF_2',
inference(resolution,[status(thm)],[c_30,c_226]) ).
tff(c_18,plain,
! [A_16,C_18,B_17] : ( addition(multiplication(A_16,C_18),multiplication(B_17,C_18)) = multiplication(addition(A_16,B_17),C_18) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
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(multiplication('#skF_1','#skF_3'),multiplication('#skF_2','#skF_3')),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_243,plain,
addition(multiplication('#skF_1','#skF_3'),multiplication('#skF_2','#skF_3')) != multiplication('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_235,c_28]) ).
tff(c_1842,plain,
multiplication(addition('#skF_1','#skF_2'),'#skF_3') != multiplication('#skF_2','#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_243]) ).
tff(c_1845,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_230,c_1842]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : KLE002+1 : TPTP v8.1.2. Released v4.0.0.
% 0.14/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.14/0.36 % Computer : n025.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 23:38:20 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.38/2.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.38/2.23
% 4.38/2.23 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.38/2.26
% 4.38/2.26 Inference rules
% 4.38/2.26 ----------------------
% 4.38/2.26 #Ref : 0
% 4.38/2.26 #Sup : 436
% 4.38/2.26 #Fact : 0
% 4.38/2.26 #Define : 0
% 4.38/2.26 #Split : 0
% 4.38/2.26 #Chain : 0
% 4.38/2.26 #Close : 0
% 4.38/2.26
% 4.38/2.26 Ordering : KBO
% 4.38/2.26
% 4.38/2.26 Simplification rules
% 4.38/2.26 ----------------------
% 4.38/2.26 #Subsume : 32
% 4.38/2.26 #Demod : 426
% 4.38/2.26 #Tautology : 222
% 4.38/2.26 #SimpNegUnit : 0
% 4.38/2.26 #BackRed : 1
% 4.38/2.26
% 4.38/2.26 #Partial instantiations: 0
% 4.38/2.26 #Strategies tried : 1
% 4.38/2.26
% 4.38/2.26 Timing (in seconds)
% 4.38/2.26 ----------------------
% 4.38/2.26 Preprocessing : 0.47
% 4.38/2.26 Parsing : 0.25
% 4.38/2.27 CNF conversion : 0.03
% 4.38/2.27 Main loop : 0.63
% 4.38/2.27 Inferencing : 0.21
% 4.38/2.27 Reduction : 0.26
% 4.38/2.27 Demodulation : 0.22
% 4.38/2.27 BG Simplification : 0.03
% 4.38/2.27 Subsumption : 0.10
% 4.38/2.27 Abstraction : 0.03
% 4.38/2.27 MUC search : 0.00
% 4.38/2.27 Cooper : 0.00
% 4.38/2.27 Total : 1.14
% 4.38/2.27 Index Insertion : 0.00
% 4.38/2.27 Index Deletion : 0.00
% 4.38/2.27 Index Matching : 0.00
% 4.38/2.27 BG Taut test : 0.00
%------------------------------------------------------------------------------