%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SWX206+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n011.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 May 5 06:56:36 PM UTC 2026
% Result : Theorem 2.39s 1.51s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 5 ( 4 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 : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 4 ( 3 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ x2 > #nlpp > s > proj1S > z
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(proj1S,type,
proj1S: $i > $i ).
tff(s,type,
s: $i > $i ).
tff(x2,type,
x2: ( $i * $i ) > $i ).
tff(z,type,
z: $i ).
tff(f_31,axiom,
! [Y] : ( x2(z,Y) = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_003) ).
tff(f_36,negated_conjecture,
~ ? [X] : ( x2(X,X) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_005) ).
tff(c_22,plain,
! [Y_10] : ( x2(z,Y_10) = Y_10 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_10,plain,
! [X_6] : ( x2(X_6,X_6) != X_6 ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_35,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_22,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX206+1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.16/0.34 % Computer : n011.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue May 5 11:33:17 EDT 2026
% 0.16/0.34 % CPUTime :
% 2.39/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.39/1.51
% 2.39/1.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------