%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWX206+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 09:09:05 AM UTC 2026
% Result : Theorem 0.13s 0.40s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 13 unt; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_003,axiom,
! [Y] : x2(z,Y) = Y,
file('theBenchmark.p',axiom_003) ).
fof(goal_005,conjecture,
? [X] : x2(X,X) = X,
file('theBenchmark.p',goal_005) ).
fof(f_3_1,plain,
! [Y] : x2(z,Y) = Y,
inference(fof_nnf,[status(thm)],[axiom_003]) ).
fof(f_3_2,plain,
! [U_2] : x2(z,U_2) = U_2,
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
x2(z,U_2) = U_2,
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_5_1,negated_conjecture,
~ ? [X] : x2(X,X) = X,
inference(negate,[status(cth)],[goal_005]) ).
fof(f_5_2,negated_conjecture,
! [X] : x2(X,X) != X,
inference(fof_nnf,[status(thm)],[f_5_1]) ).
fof(f_5_3,negated_conjecture,
! [U_5] : x2(U_5,U_5) != U_5,
inference(variable_rename,[status(thm)],[f_5_2]) ).
fof(f_5_4,negated_conjecture,
! [U_5] : x2(U_5,U_5) != U_5,
inference(definitional_conversion,[status(esa)],[f_5_3]) ).
cnf(f_5_5,negated_conjecture,
x2(U_5,U_5) != U_5,
inference(clausify,[status(thm)],[f_5_4]) ).
cnf(t1,plain,
x2(z,z) != z,
inference(start,[status(thm),parent(0:0)],[f_5_5]) ).
cnf(t2,plain,
x2(z,z) = z,
inference(extension,[status(thm),parent(t1:1)],[f_3_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX206+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_PEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n005.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 06:16:33 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.13/0.40 % SZS status Theorem for theBenchmark
% 0.13/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------