%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN986+1.000 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n004.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:36:28 PM UTC 2026
% Result : Theorem 3.44s 11.10s
% Output : Proof 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 21 unt; 0 def)
% Number of atoms : 21 ( 11 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 : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 3 sgn 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,conjecture,
? [Z0] : r(zero,zero,Z0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ck) ).
fof(f2_neg,negated_conjecture,
~ ? [Z0] : r(zero,zero,Z0),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f2_nnf,plain,
! [Z0] : ~ r(zero,zero,Z0),
inference(nnf_transformation,[status(thm)],[f2_neg]) ).
fof(f2_sk,plain,
! [Z0] : ~ r(zero,zero,Z0),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
~ r(zero,zero,X0),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(t3,plain,
eq(r(zero,zero,X1),true) = efalse,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t46,plain,
eq(r(zero,zero,X1),true) = efalse,
inference(orient,[status(thm)],[t3]) ).
fof(f0,axiom,
! [Y] : r(Y,zero,succ(Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp1) ).
fof(f0_nnf,plain,
! [Y] : r(Y,zero,succ(Y)),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [Y] : r(Y,zero,succ(Y)),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
r(X0,zero,succ(X0)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t2,plain,
r(X1,zero,succ(X1)) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t20,plain,
r(X1,zero,succ(X1)) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(t47,plain,
efalse = eq(true,true),
inference(cp,[status(thm)],[t46,t20]) ).
cnf(t0,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t45,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t0]) ).
cnf(t51,plain,
efalse = etrue,
inference(step,[status(thm)],[t47,t45]) ).
cnf(t48,plain,
efalse = etrue,
inference(orient,[status(thm)],[t51]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t48]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN986+1.000 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.14/10.63 % Computer : n004.cluster.edu
% 0.14/10.63 % Model : x86_64 x86_64
% 0.14/10.63 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.63 % Memory : 8046.5625MB
% 0.14/10.63 % OS : Linux 6.8.0-71-generic
% 0.14/10.63 % CPULimit : 300
% 0.14/10.63 % WCLimit : 300
% 0.14/10.63 % DateTime : Fri Sep 25 02:43:35 UTC 2026
% 0.14/10.63 % CPUTime :
% 0.14/10.63 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.44/11.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.44/11.10 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------