%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : NUM878_1 : TPTP v9.0.0. Released v5.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 : n026.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:57:26 PM UTC 2025
% Result : Theorem 2.78s 1.60s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 7 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 4 ( 2 ~; 1 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 12 ( 0 atm; 4 fun; 3 num; 5 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 0 usr; 2 con; 0-2 aty)
% Number of variables : 5 ( 4 !; 1 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_87,axiom,
! [C: $int,B: $int] :
( ( $product(C,B) = C )
<=> ( ( C = 0 )
| ( B = 1 ) ) ),
file('/export/starexec/sandbox2/solver/bin/lemmas/mult_lemmas.p',mult_cancel_right1) ).
tff(f_30,negated_conjecture,
~ ? [Xa: $int] : ( $product(Xa,Xa) = Xa ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_idempotent_element) ).
tff(c_29,plain,
! [C_24: $int] : ( $product(C_24,1) = C_24 ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_42,plain,
! [X_33a: $int] : ( $product(X_33a,X_33a) != X_33a ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_73,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_29,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM878_1 : TPTP v9.0.0. Released v5.0.0.
% 0.06/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.33 % Computer : n026.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 15:37:53 EDT 2025
% 0.12/0.33 % CPUTime :
% 2.78/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.78/1.61
% 2.78/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------