%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN731+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n017.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:35:35 PM UTC 2026
% Result : Theorem 0.88s 0.81s
% Output : Proof 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 14 unt; 0 def)
% Number of atoms : 22 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 3 sgn 8 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
? [W] :
( ! [X] :
? [Y] : p(W,X,Y)
=> ? [Z] : p(Z,Z,W) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2150) ).
fof(f0_neg,negated_conjecture,
~ ? [W] :
( ! [X] :
? [Y] : p(W,X,Y)
=> ? [Z] : p(Z,Z,W) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
! [W] :
( ! [Z] : ~ p(Z,Z,W)
& ! [X] :
? [Y] : p(W,X,Y) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [W,X,Z] :
( ~ p(Z,Z,W)
& p(W,X,sk0(W,X)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c1,plain,
~ p(X3,X3,X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t1,plain,
eq(p(X1,X1,X2),true) = efalse,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t5,plain,
eq(p(X1,X1,X2),true) = efalse,
inference(orient,[status(thm)],[t1]) ).
cnf(c0,plain,
p(X0,X1,sk0(X0,X1)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t2,plain,
p(X1,X2,sk0(X1,X2)) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t3,plain,
p(X1,X2,sk0(X1,X2)) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(t6,plain,
efalse = eq(true,true),
inference(cp,[status(thm)],[t5,t3]) ).
cnf(t0,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t4,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t0]) ).
cnf(t10,plain,
efalse = etrue,
inference(step,[status(thm)],[t6,t4]) ).
cnf(t7,plain,
efalse = etrue,
inference(orient,[status(thm)],[t10]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t7]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN731+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 02:08:31 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.88/0.81 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.88/0.81 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------