%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWX206+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n016.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 : Fri Sep 25 03:32:07 PM UTC 2026
% Result : Theorem 0.13s 6.05s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 10 ( 10 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 15 ( 1 sgn 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,conjecture,
? [X] : x2(X,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_005) ).
fof(f4_neg,negated_conjecture,
~ ? [X] : x2(X,X) = X,
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f4_nnf,plain,
! [X] : x2(X,X) != X,
inference(nnf_transformation,[status(thm)],[f4_neg]) ).
fof(f4_sk,plain,
! [X] : x2(X,X) != X,
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
x2(X0,X0) != X0,
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi4,negated_conjecture,
ifeq(x2(X0,X0),X0,false,true) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
fof(f2,axiom,
! [Y] : x2(z,Y) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).
fof(f2_nnf,plain,
! [Y] : x2(z,Y) = Y,
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [Y] : x2(z,Y) = Y,
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
x2(z,X0) = X0,
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi1,axiom,
x2(z,X0) = X0,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi4,hi1]) ).
cnf(t10,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
fof(f1,axiom,
! [X] : z != s(X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).
fof(f1_nnf,plain,
! [X] : z != s(X),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X] : z != s(X),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
z != s(X0),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c1,c4]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t10]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.22 % Problem : SWX206+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.24 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/5.58 % Computer : n016.cluster.edu
% 0.10/5.58 % Model : x86_64 x86_64
% 0.10/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.58 % Memory : 8046.5625MB
% 0.10/5.58 % OS : Linux 6.8.0-71-generic
% 0.10/5.58 % CPULimit : 300
% 0.10/5.58 % WCLimit : 300
% 0.10/5.58 % DateTime : Thu Sep 24 23:42:03 UTC 2026
% 0.10/5.58 % CPUTime :
% 0.10/5.58 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.13/6.05 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/6.05 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------