TSTP Solution File: KLE054+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE054+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 : n014.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:46 EDT 2023
% Result : Theorem 7.91s 2.96s
% Output : CNFRefutation 8.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 42 ( 34 unt; 8 typ; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 49 (; 49 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > domain > zero > one > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(domain,type,
domain: $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_63,axiom,
! [A] : ( multiplication(A,one) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
tff(f_52,axiom,
! [A,B] : ( addition(A,B) = addition(B,A) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
tff(f_117,axiom,
! [X0] : ( addition(domain(X0),one) = one ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).
tff(f_113,axiom,
! [X0] : ( addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).
tff(f_120,axiom,
! [X0,X1] : ( domain(addition(X0,X1)) = addition(domain(X0),domain(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain5) ).
tff(f_115,axiom,
! [X0,X1] : ( domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).
tff(f_68,axiom,
! [A,B,C] : ( multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
tff(f_125,negated_conjecture,
~ ! [X0,X1] : ( addition(domain(multiplication(X0,X1)),domain(X0)) = domain(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(c_12,plain,
! [A_11] : ( multiplication(A_11,one) = A_11 ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_156,plain,
! [B_36,A_37] : ( addition(B_36,A_37) = addition(A_37,B_36) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_32,plain,
! [X0_26] : ( addition(domain(X0_26),one) = one ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_180,plain,
! [X0_26] : ( addition(one,domain(X0_26)) = one ),
inference(superposition,[status(thm),theory(equality)],[c_156,c_32]) ).
tff(c_493,plain,
! [X0_51] : ( addition(X0_51,multiplication(domain(X0_51),X0_51)) = multiplication(domain(X0_51),X0_51) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_517,plain,
multiplication(domain(one),one) = addition(one,domain(one)),
inference(superposition,[status(thm),theory(equality)],[c_12,c_493]) ).
tff(c_531,plain,
domain(one) = one,
inference(demodulation,[status(thm),theory(equality)],[c_180,c_12,c_517]) ).
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_301,plain,
! [X0_44,X1_45] : ( addition(domain(X0_44),domain(X1_45)) = domain(addition(X0_44,X1_45)) ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_320,plain,
! [X1_45,X0_44] : ( addition(domain(X1_45),domain(X0_44)) = domain(addition(X0_44,X1_45)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_301]) ).
tff(c_540,plain,
! [X0_44] : ( addition(one,domain(X0_44)) = domain(addition(X0_44,one)) ),
inference(superposition,[status(thm),theory(equality)],[c_531,c_320]) ).
tff(c_572,plain,
! [X0_52] : ( domain(addition(X0_52,one)) = one ),
inference(demodulation,[status(thm),theory(equality)],[c_180,c_540]) ).
tff(c_30,plain,
! [X0_24,X1_25] : ( domain(multiplication(X0_24,domain(X1_25))) = domain(multiplication(X0_24,X1_25)) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_589,plain,
! [X0_24,X0_52] : ( domain(multiplication(X0_24,addition(X0_52,one))) = domain(multiplication(X0_24,one)) ),
inference(superposition,[status(thm),theory(equality)],[c_572,c_30]) ).
tff(c_625,plain,
! [X0_24,X0_52] : ( domain(multiplication(X0_24,addition(X0_52,one))) = domain(X0_24) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_589]) ).
tff(c_966,plain,
! [A_62,B_63,C_64] : ( addition(multiplication(A_62,B_63),multiplication(A_62,C_64)) = multiplication(A_62,addition(B_63,C_64)) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_7474,plain,
! [A_127,B_128] : ( multiplication(A_127,addition(B_128,one)) = addition(multiplication(A_127,B_128),A_127) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_966]) ).
tff(c_428,plain,
! [X1_49,X0_50] : ( addition(domain(X1_49),domain(X0_50)) = domain(addition(X0_50,X1_49)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_301]) ).
tff(c_36,plain,
! [X0_27,X1_28] : ( addition(domain(X0_27),domain(X1_28)) = domain(addition(X0_27,X1_28)) ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_434,plain,
! [X1_49,X0_50] : ( domain(addition(X1_49,X0_50)) = domain(addition(X0_50,X1_49)) ),
inference(superposition,[status(thm),theory(equality)],[c_428,c_36]) ).
tff(c_7550,plain,
! [A_127,B_128] : ( domain(multiplication(A_127,addition(B_128,one))) = domain(addition(A_127,multiplication(A_127,B_128))) ),
inference(superposition,[status(thm),theory(equality)],[c_7474,c_434]) ).
tff(c_7696,plain,
! [A_127,B_128] : ( domain(addition(A_127,multiplication(A_127,B_128))) = domain(A_127) ),
inference(demodulation,[status(thm),theory(equality)],[c_625,c_7550]) ).
tff(c_38,plain,
addition(domain(multiplication('#skF_1','#skF_2')),domain('#skF_1')) != domain('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_39,plain,
domain(addition(multiplication('#skF_1','#skF_2'),'#skF_1')) != domain('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_38]) ).
tff(c_40,plain,
domain(addition('#skF_1',multiplication('#skF_1','#skF_2'))) != domain('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_39]) ).
tff(c_8628,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_7696,c_40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE054+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % 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.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 23:21:03 EDT 2023
% 0.14/0.35 % CPUTime :
% 7.91/2.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.91/2.97
% 7.91/2.97 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.04/3.00
% 8.04/3.00 Inference rules
% 8.04/3.00 ----------------------
% 8.04/3.00 #Ref : 0
% 8.04/3.00 #Sup : 2113
% 8.04/3.00 #Fact : 0
% 8.04/3.00 #Define : 0
% 8.04/3.00 #Split : 0
% 8.04/3.00 #Chain : 0
% 8.04/3.00 #Close : 0
% 8.04/3.00
% 8.04/3.00 Ordering : KBO
% 8.04/3.00
% 8.04/3.00 Simplification rules
% 8.04/3.00 ----------------------
% 8.04/3.00 #Subsume : 136
% 8.04/3.00 #Demod : 2620
% 8.04/3.00 #Tautology : 1260
% 8.04/3.00 #SimpNegUnit : 0
% 8.04/3.00 #BackRed : 1
% 8.04/3.00
% 8.04/3.00 #Partial instantiations: 0
% 8.04/3.00 #Strategies tried : 1
% 8.04/3.00
% 8.04/3.00 Timing (in seconds)
% 8.04/3.00 ----------------------
% 8.04/3.00 Preprocessing : 0.49
% 8.04/3.00 Parsing : 0.27
% 8.04/3.00 CNF conversion : 0.03
% 8.04/3.00 Main loop : 1.44
% 8.04/3.00 Inferencing : 0.40
% 8.04/3.00 Reduction : 0.75
% 8.04/3.00 Demodulation : 0.65
% 8.04/3.00 BG Simplification : 0.05
% 8.04/3.00 Subsumption : 0.18
% 8.04/3.00 Abstraction : 0.08
% 8.04/3.00 MUC search : 0.00
% 8.04/3.00 Cooper : 0.00
% 8.04/3.00 Total : 1.98
% 8.04/3.00 Index Insertion : 0.00
% 8.04/3.01 Index Deletion : 0.00
% 8.04/3.01 Index Matching : 0.00
% 8.04/3.01 BG Taut test : 0.00
%------------------------------------------------------------------------------