%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : KLE059+1 : TPTP v9.0.0. 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 : n010.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 : Wed Apr 9 07:04:42 PM UTC 2025
% Result : Theorem 2.74s 1.68s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 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 : 6 ( 6 !; 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_127,negated_conjecture,
~ ! [X0,X1] :
( ( addition(X0,X1) = X1 )
=> ( addition(domain(X0),domain(X1)) = domain(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
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(c_40,plain,
addition('#skF_1','#skF_2') = '#skF_2',
inference(cnfTransformation,[status(thm)],[f_127]) ).
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_38,plain,
addition(domain('#skF_1'),domain('#skF_2')) != domain('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_41,plain,
domain(addition('#skF_1','#skF_2')) != domain('#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_38]) ).
tff(c_43,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_40,c_41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : KLE059+1 : TPTP v9.0.0. Released v4.0.0.
% 0.12/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.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 8 02:35:32 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.74/1.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.69
% 2.74/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------