TSTP Solution File: KLE150+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE150+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 : n016.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 22.57s 10.97s
% Output : CNFRefutation 22.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of formulae : 45 ( 37 unt; 8 typ; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 62 (; 62 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > strong_iteration > star > zero > one > #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_1',type,
'#skF_1': $i ).
tff(one,type,
one: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_73,axiom,
! [A] : ( multiplication(zero,A) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
tff(f_61,axiom,
! [A,B,C] : ( multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
tff(f_76,axiom,
! [A] : ( addition(one,multiplication(A,star(A))) = star(A) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_unfold1) ).
tff(f_52,axiom,
! [A,B] : ( addition(A,B) = addition(B,A) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_commutativity) ).
tff(f_56,axiom,
! [A] : ( addition(A,zero) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
tff(f_54,axiom,
! [C,B,A] : ( addition(A,addition(B,C)) = addition(addition(A,B),C) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
tff(f_65,axiom,
! [A] : ( multiplication(one,A) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_left_identity) ).
tff(f_70,axiom,
! [A,B,C] : ( multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
tff(f_89,axiom,
! [A] : ( strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
tff(f_105,negated_conjecture,
~ ! [X0] : ( strong_iteration(multiplication(X0,zero)) = addition(one,multiplication(X0,zero)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(c_20,plain,
! [A_19] : ( multiplication(zero,A_19) = zero ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_458,plain,
! [A_55,B_56,C_57] : ( multiplication(multiplication(A_55,B_56),C_57) = multiplication(A_55,multiplication(B_56,C_57)) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_22,plain,
! [A_20] : ( addition(one,multiplication(A_20,star(A_20))) = star(A_20) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_20797,plain,
! [A_321,B_322] : ( addition(one,multiplication(A_321,multiplication(B_322,star(multiplication(A_321,B_322))))) = star(multiplication(A_321,B_322)) ),
inference(superposition,[status(thm),theory(equality)],[c_458,c_22]) ).
tff(c_21017,plain,
! [A_321] : ( addition(one,multiplication(A_321,zero)) = star(multiplication(A_321,zero)) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_20797]) ).
tff(c_2,plain,
! [B_2,A_1] : ( addition(B_2,A_1) = addition(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_114,plain,
! [B_40,A_41] : ( addition(B_40,A_41) = addition(A_41,B_40) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_6,plain,
! [A_6] : ( addition(A_6,zero) = A_6 ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_130,plain,
! [A_41] : ( addition(zero,A_41) = A_41 ),
inference(superposition,[status(thm),theory(equality)],[c_114,c_6]) ).
tff(c_343,plain,
! [A_51,B_52,C_53] : ( addition(addition(A_51,B_52),C_53) = addition(A_51,addition(B_52,C_53)) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_2393,plain,
! [C_112,A_113,B_114] : ( addition(C_112,addition(A_113,B_114)) = addition(A_113,addition(B_114,C_112)) ),
inference(superposition,[status(thm),theory(equality)],[c_343,c_2]) ).
tff(c_2740,plain,
! [A_41,C_112] : ( addition(zero,addition(A_41,C_112)) = addition(C_112,A_41) ),
inference(superposition,[status(thm),theory(equality)],[c_130,c_2393]) ).
tff(c_355,plain,
! [C_53,A_51,B_52] : ( addition(C_53,addition(A_51,B_52)) = addition(A_51,addition(B_52,C_53)) ),
inference(superposition,[status(thm),theory(equality)],[c_343,c_2]) ).
tff(c_396,plain,
! [B_2,A_1,C_53] : ( addition(addition(B_2,A_1),C_53) = addition(A_1,addition(B_2,C_53)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_343]) ).
tff(c_14,plain,
! [A_12] : ( multiplication(one,A_12) = A_12 ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_863,plain,
! [A_68,C_69,B_70] : ( addition(multiplication(A_68,C_69),multiplication(B_70,C_69)) = multiplication(addition(A_68,B_70),C_69) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_917,plain,
! [B_70,A_12] : ( multiplication(addition(one,B_70),A_12) = addition(A_12,multiplication(B_70,A_12)) ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_863]) ).
tff(c_11957,plain,
! [B_207,C_208,A_209] : ( addition(multiplication(B_207,C_208),multiplication(A_209,C_208)) = multiplication(addition(A_209,B_207),C_208) ),
inference(superposition,[status(thm),theory(equality)],[c_863,c_2]) ).
tff(c_53735,plain,
! [B_566,A_567] : ( multiplication(addition(one,B_566),A_567) = addition(multiplication(B_566,A_567),A_567) ),
inference(superposition,[status(thm),theory(equality)],[c_14,c_11957]) ).
tff(c_30,plain,
! [A_28] : ( addition(multiplication(A_28,strong_iteration(A_28)),one) = strong_iteration(A_28) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_21780,plain,
! [A_331,B_332] : ( addition(multiplication(A_331,multiplication(B_332,strong_iteration(multiplication(A_331,B_332)))),one) = strong_iteration(multiplication(A_331,B_332)) ),
inference(superposition,[status(thm),theory(equality)],[c_458,c_30]) ).
tff(c_22001,plain,
! [A_331] : ( addition(multiplication(A_331,zero),one) = strong_iteration(multiplication(A_331,zero)) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_21780]) ).
tff(c_53862,plain,
! [B_566] : ( addition(addition(multiplication(B_566,zero),zero),one) = strong_iteration(multiplication(addition(one,B_566),zero)) ),
inference(superposition,[status(thm),theory(equality)],[c_53735,c_22001]) ).
tff(c_54576,plain,
! [B_566] : ( strong_iteration(multiplication(B_566,zero)) = star(multiplication(B_566,zero)) ),
inference(demodulation,[status(thm),theory(equality)],[c_21017,c_2,c_2740,c_355,c_396,c_2,c_130,c_917,c_53862]) ).
tff(c_40,plain,
addition(one,multiplication('#skF_1',zero)) != strong_iteration(multiplication('#skF_1',zero)),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_36832,plain,
strong_iteration(multiplication('#skF_1',zero)) != star(multiplication('#skF_1',zero)),
inference(demodulation,[status(thm),theory(equality)],[c_21017,c_40]) ).
tff(c_73893,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_54576,c_36832]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE150+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/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.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 23:48:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 22.57/10.97 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.57/10.98
% 22.57/10.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 22.57/11.01
% 22.57/11.01 Inference rules
% 22.57/11.01 ----------------------
% 22.57/11.01 #Ref : 0
% 22.57/11.01 #Sup : 19336
% 22.57/11.01 #Fact : 0
% 22.57/11.01 #Define : 0
% 22.57/11.01 #Split : 7
% 22.57/11.01 #Chain : 0
% 22.57/11.01 #Close : 0
% 22.57/11.01
% 22.57/11.01 Ordering : KBO
% 22.57/11.01
% 22.57/11.01 Simplification rules
% 22.57/11.01 ----------------------
% 22.57/11.01 #Subsume : 5831
% 22.57/11.01 #Demod : 17854
% 22.57/11.01 #Tautology : 5699
% 22.57/11.01 #SimpNegUnit : 430
% 22.57/11.01 #BackRed : 36
% 22.57/11.01
% 22.57/11.01 #Partial instantiations: 0
% 22.57/11.01 #Strategies tried : 1
% 22.57/11.01
% 22.57/11.01 Timing (in seconds)
% 22.57/11.01 ----------------------
% 22.57/11.01 Preprocessing : 0.51
% 22.57/11.01 Parsing : 0.27
% 22.57/11.01 CNF conversion : 0.03
% 22.57/11.01 Main loop : 9.30
% 22.57/11.01 Inferencing : 1.33
% 22.57/11.01 Reduction : 5.55
% 22.57/11.01 Demodulation : 4.72
% 22.57/11.01 BG Simplification : 0.13
% 22.57/11.01 Subsumption : 1.72
% 22.57/11.01 Abstraction : 0.20
% 22.57/11.01 MUC search : 0.00
% 22.57/11.01 Cooper : 0.00
% 22.57/11.01 Total : 9.85
% 22.57/11.01 Index Insertion : 0.00
% 22.57/11.01 Index Deletion : 0.00
% 22.57/11.01 Index Matching : 0.00
% 22.57/11.01 BG Taut test : 0.00
%------------------------------------------------------------------------------