%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : KLE066+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 : n019.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:43 PM UTC 2025
% Result : Theorem 3.73s 1.96s
% Output : CNFRefutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 3 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 1 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 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 : 12 ( 12 !; 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] :
( ( multiplication(X0,X1) = zero )
<= ( multiplication(X0,domain(X1)) = 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_118,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain4) ).
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_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,
multiplication('#skF_1','#skF_2') != zero,
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_34,plain,
domain(zero) = zero,
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_40,plain,
multiplication('#skF_1',domain('#skF_2')) = zero,
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_344,plain,
! [X0_46,X1_47] : ( domain(multiplication(X0_46,domain(X1_47))) = domain(multiplication(X0_46,X1_47)) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_369,plain,
domain(multiplication('#skF_1','#skF_2')) = domain(zero),
inference(superposition,[status(thm),theory(equality)],[c_40,c_344]) ).
tff(c_389,plain,
domain(multiplication('#skF_1','#skF_2')) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_369]) ).
tff(c_6,plain,
! [A_6] : ( addition(A_6,zero) = A_6 ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_871,plain,
! [X0_59] : ( addition(X0_59,multiplication(domain(X0_59),X0_59)) = multiplication(domain(X0_59),X0_59) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_917,plain,
multiplication(domain(multiplication('#skF_1','#skF_2')),multiplication('#skF_1','#skF_2')) = addition(multiplication('#skF_1','#skF_2'),multiplication(zero,multiplication('#skF_1','#skF_2'))),
inference(superposition,[status(thm),theory(equality)],[c_389,c_871]) ).
tff(c_946,plain,
multiplication('#skF_1','#skF_2') = zero,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_389,c_6,c_22,c_917]) ).
tff(c_948,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_38,c_946]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KLE066+1 : TPTP v9.0.0. Released v4.0.0.
% 0.03/0.12 % 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.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Apr 8 02:35:32 EDT 2025
% 0.12/0.33 % CPUTime :
% 3.73/1.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.73/1.97
% 3.73/1.97 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------