TSTP Solution File: KLE056+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE056+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 : n007.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 3.68s 1.93s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 19 ( 11 unt; 7 typ; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 3 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > domain > zero > one > #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_1',type,
'#skF_1': $i ).
tff(one,type,
one: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_127,negated_conjecture,
~ ! [X0] :
( ( domain(X0) = zero )
=> ( X0 = zero ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(f_75,axiom,
! [A] : ( multiplication(zero,A) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
tff(f_56,axiom,
! [A] : ( addition(A,zero) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_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,
zero != '#skF_1',
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_22,plain,
! [A_20] : ( multiplication(zero,A_20) = zero ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_6,plain,
! [A_6] : ( addition(A_6,zero) = A_6 ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_40,plain,
domain('#skF_1') = zero,
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_800,plain,
! [X0_58] : ( addition(X0_58,multiplication(domain(X0_58),X0_58)) = multiplication(domain(X0_58),X0_58) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_864,plain,
multiplication(domain('#skF_1'),'#skF_1') = addition('#skF_1',multiplication(zero,'#skF_1')),
inference(superposition,[status(thm),theory(equality)],[c_40,c_800]) ).
tff(c_883,plain,
zero = '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_22,c_6,c_22,c_40,c_864]) ).
tff(c_885,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_38,c_883]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE056+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.36 % Computer : n007.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:15:54 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.68/1.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.68/1.93
% 3.68/1.93 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.68/1.96
% 3.68/1.96 Inference rules
% 3.68/1.96 ----------------------
% 3.68/1.96 #Ref : 0
% 3.68/1.96 #Sup : 204
% 3.68/1.96 #Fact : 0
% 3.68/1.96 #Define : 0
% 3.68/1.96 #Split : 0
% 3.68/1.96 #Chain : 0
% 3.68/1.96 #Close : 0
% 3.68/1.96
% 3.68/1.96 Ordering : KBO
% 3.68/1.96
% 3.68/1.96 Simplification rules
% 3.68/1.96 ----------------------
% 3.68/1.96 #Subsume : 0
% 3.68/1.96 #Demod : 195
% 3.68/1.96 #Tautology : 159
% 3.68/1.96 #SimpNegUnit : 1
% 3.68/1.96 #BackRed : 0
% 3.68/1.96
% 3.68/1.96 #Partial instantiations: 0
% 3.68/1.96 #Strategies tried : 1
% 3.68/1.96
% 3.68/1.96 Timing (in seconds)
% 3.68/1.96 ----------------------
% 3.68/1.96 Preprocessing : 0.50
% 3.68/1.96 Parsing : 0.27
% 3.68/1.96 CNF conversion : 0.03
% 3.68/1.96 Main loop : 0.40
% 3.68/1.96 Inferencing : 0.14
% 3.68/1.96 Reduction : 0.15
% 3.68/1.96 Demodulation : 0.12
% 3.68/1.96 BG Simplification : 0.02
% 3.68/1.96 Subsumption : 0.07
% 3.68/1.96 Abstraction : 0.02
% 3.68/1.96 MUC search : 0.00
% 3.68/1.96 Cooper : 0.00
% 3.68/1.96 Total : 0.94
% 3.68/1.96 Index Insertion : 0.00
% 3.68/1.96 Index Deletion : 0.00
% 3.68/1.96 Index Matching : 0.00
% 3.68/1.96 BG Taut test : 0.00
%------------------------------------------------------------------------------