TSTP Solution File: KLE148+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE148+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 : n008.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:56 EDT 2023
% Result : Theorem 30.36s 16.60s
% Output : CNFRefutation 30.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of formulae : 34 ( 24 unt; 9 typ; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 3 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 33 (; 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > strong_iteration > star > zero > one > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(strong_iteration,type,
strong_iteration: $i > $i ).
tff(star,type,
star: $i > $i ).
tff(multiplication,type,
multiplication: ( $i * $i ) > $i ).
tff(addition,type,
addition: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $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_109,negated_conjecture,
~ ! [X0,X1] :
( ( multiplication(X0,X1) = zero )
=> ( multiplication(X0,strong_iteration(X1)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(f_65,axiom,
! [A] : ( multiplication(A,one) = A ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
tff(f_91,axiom,
! [A] : ( strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
tff(f_54,axiom,
! [A,B] : ( addition(A,B) = addition(B,A) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_commutativity) ).
tff(f_58,axiom,
! [A] : ( addition(A,zero) = A ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
tff(f_75,axiom,
! [A] : ( multiplication(zero,A) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
tff(f_63,axiom,
! [A,B,C] : ( multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
tff(f_70,axiom,
! [A,B,C] : ( multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity1) ).
tff(c_40,plain,
multiplication('#skF_1',strong_iteration('#skF_2')) != '#skF_1',
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_12,plain,
! [A_11] : ( multiplication(A_11,one) = A_11 ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_30,plain,
! [A_28] : ( addition(multiplication(A_28,strong_iteration(A_28)),one) = strong_iteration(A_28) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_120,plain,
! [B_40,A_41] : ( addition(B_40,A_41) = addition(A_41,B_40) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_6,plain,
! [A_6] : ( addition(A_6,zero) = A_6 ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_136,plain,
! [A_41] : ( addition(zero,A_41) = A_41 ),
inference(superposition,[status(thm),theory(equality)],[c_120,c_6]) ).
tff(c_20,plain,
! [A_19] : ( multiplication(zero,A_19) = zero ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_42,plain,
multiplication('#skF_1','#skF_2') = zero,
inference(cnfTransformation,[status(thm)],[f_109]) ).
tff(c_602,plain,
! [A_59,B_60,C_61] : ( multiplication(multiplication(A_59,B_60),C_61) = multiplication(A_59,multiplication(B_60,C_61)) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_646,plain,
! [C_61] : ( multiplication('#skF_1',multiplication('#skF_2',C_61)) = multiplication(zero,C_61) ),
inference(superposition,[status(thm),theory(equality)],[c_42,c_602]) ).
tff(c_656,plain,
! [C_61] : ( multiplication('#skF_1',multiplication('#skF_2',C_61)) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_20,c_646]) ).
tff(c_1008,plain,
! [A_71,B_72,C_73] : ( addition(multiplication(A_71,B_72),multiplication(A_71,C_73)) = multiplication(A_71,addition(B_72,C_73)) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_1056,plain,
! [C_61,C_73] : ( multiplication('#skF_1',addition(multiplication('#skF_2',C_61),C_73)) = addition(zero,multiplication('#skF_1',C_73)) ),
inference(superposition,[status(thm),theory(equality)],[c_656,c_1008]) ).
tff(c_84923,plain,
! [C_733,C_734] : ( multiplication('#skF_1',addition(multiplication('#skF_2',C_733),C_734)) = multiplication('#skF_1',C_734) ),
inference(demodulation,[status(thm),theory(equality)],[c_136,c_1056]) ).
tff(c_85331,plain,
multiplication('#skF_1',strong_iteration('#skF_2')) = multiplication('#skF_1',one),
inference(superposition,[status(thm),theory(equality)],[c_30,c_84923]) ).
tff(c_85423,plain,
multiplication('#skF_1',strong_iteration('#skF_2')) = '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_12,c_85331]) ).
tff(c_85425,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_40,c_85423]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE148+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.14/0.36 % Computer : n008.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:33:33 EDT 2023
% 0.14/0.36 % CPUTime :
% 30.36/16.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.36/16.60
% 30.36/16.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 30.36/16.63
% 30.36/16.63 Inference rules
% 30.36/16.63 ----------------------
% 30.36/16.63 #Ref : 0
% 30.36/16.63 #Sup : 21724
% 30.36/16.63 #Fact : 0
% 30.36/16.63 #Define : 0
% 30.36/16.63 #Split : 17
% 30.36/16.63 #Chain : 0
% 30.36/16.63 #Close : 0
% 30.36/16.63
% 30.36/16.63 Ordering : KBO
% 30.36/16.63
% 30.36/16.63 Simplification rules
% 30.36/16.63 ----------------------
% 30.36/16.63 #Subsume : 5028
% 30.36/16.63 #Demod : 22958
% 30.36/16.63 #Tautology : 5885
% 30.36/16.63 #SimpNegUnit : 286
% 30.36/16.63 #BackRed : 45
% 30.36/16.63
% 30.36/16.63 #Partial instantiations: 0
% 30.36/16.63 #Strategies tried : 1
% 30.36/16.63
% 30.36/16.63 Timing (in seconds)
% 30.36/16.63 ----------------------
% 30.36/16.63 Preprocessing : 0.49
% 30.36/16.63 Parsing : 0.27
% 30.36/16.63 CNF conversion : 0.03
% 30.36/16.63 Main loop : 15.07
% 30.36/16.63 Inferencing : 1.80
% 30.36/16.63 Reduction : 9.57
% 30.36/16.63 Demodulation : 8.44
% 30.36/16.63 BG Simplification : 0.18
% 30.36/16.63 Subsumption : 2.82
% 30.36/16.64 Abstraction : 0.28
% 30.36/16.64 MUC search : 0.00
% 30.36/16.64 Cooper : 0.00
% 30.36/16.64 Total : 15.60
% 30.36/16.64 Index Insertion : 0.00
% 30.36/16.64 Index Deletion : 0.00
% 30.36/16.64 Index Matching : 0.00
% 30.36/16.64 BG Taut test : 0.00
%------------------------------------------------------------------------------