TSTP Solution File: KLE058+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE058+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:47 EDT 2023
% Result : Theorem 3.50s 1.90s
% Output : CNFRefutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 20 ( 14 unt; 6 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 11 (; 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > domain > zero > one
%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(one,type,
one: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_124,negated_conjecture,
domain(one) != one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(f_117,axiom,
! [X0] : ( addition(domain(X0),one) = one ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).
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_63,axiom,
! [A] : ( multiplication(A,one) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
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(c_38,plain,
domain(one) != one,
inference(cnfTransformation,[status(thm)],[f_124]) ).
tff(c_32,plain,
! [X0_26] : ( addition(domain(X0_26),one) = one ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_150,plain,
! [B_36,A_37] : ( addition(B_36,A_37) = addition(A_37,B_36) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_194,plain,
! [X0_26] : ( addition(one,domain(X0_26)) = one ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_150]) ).
tff(c_12,plain,
! [A_11] : ( multiplication(A_11,one) = A_11 ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_491,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_515,plain,
multiplication(domain(one),one) = addition(one,domain(one)),
inference(superposition,[status(thm),theory(equality)],[c_12,c_491]) ).
tff(c_529,plain,
domain(one) = one,
inference(demodulation,[status(thm),theory(equality)],[c_194,c_12,c_515]) ).
tff(c_531,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_38,c_529]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE058+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/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:57:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.50/1.90 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.50/1.90
% 3.50/1.90 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.50/1.93
% 3.50/1.93 Inference rules
% 3.50/1.93 ----------------------
% 3.50/1.93 #Ref : 0
% 3.50/1.93 #Sup : 120
% 3.50/1.93 #Fact : 0
% 3.50/1.93 #Define : 0
% 3.50/1.93 #Split : 0
% 3.50/1.93 #Chain : 0
% 3.50/1.93 #Close : 0
% 3.50/1.93
% 3.50/1.93 Ordering : KBO
% 3.50/1.93
% 3.50/1.93 Simplification rules
% 3.50/1.93 ----------------------
% 3.50/1.93 #Subsume : 0
% 3.50/1.93 #Demod : 72
% 3.50/1.93 #Tautology : 96
% 3.50/1.93 #SimpNegUnit : 1
% 3.50/1.93 #BackRed : 0
% 3.50/1.93
% 3.50/1.93 #Partial instantiations: 0
% 3.50/1.93 #Strategies tried : 1
% 3.50/1.93
% 3.50/1.93 Timing (in seconds)
% 3.50/1.93 ----------------------
% 3.50/1.93 Preprocessing : 0.51
% 3.50/1.93 Parsing : 0.28
% 3.50/1.93 CNF conversion : 0.03
% 3.50/1.93 Main loop : 0.35
% 3.50/1.93 Inferencing : 0.12
% 3.50/1.93 Reduction : 0.13
% 3.50/1.93 Demodulation : 0.10
% 3.50/1.93 BG Simplification : 0.02
% 3.50/1.93 Subsumption : 0.06
% 3.50/1.93 Abstraction : 0.02
% 3.50/1.93 MUC search : 0.00
% 3.60/1.93 Cooper : 0.00
% 3.60/1.93 Total : 0.90
% 3.60/1.93 Index Insertion : 0.00
% 3.60/1.93 Index Deletion : 0.00
% 3.60/1.93 Index Matching : 0.00
% 3.60/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------