%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN409+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n014.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:34:38 PM UTC 2026
% Result : Theorem 4.68s 6.09s
% Output : Proof 4.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 3 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 31 ( 13 ~; 8 |; 8 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 18 ( 3 sgn 12 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [X] : f(X)
<=> ! [Y,Z] :
( f(Z)
& f(Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish246) ).
fof(f0_neg,negated_conjecture,
~ ( ! [X] : f(X)
<=> ! [Y,Z] :
( f(Z)
& f(Y) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ( ! [Y,Z] :
( f(Z)
& f(Y) )
& ? [X] : ~ f(X) )
| ( ? [Y,Z] :
( ~ f(Z)
| ~ f(Y) )
& ! [X] : f(X) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,Y,Z] :
( ( f(Z)
& f(Y)
& ~ f(sk2) )
| ( ( ~ f(sk1)
| ~ f(sk0) )
& f(X) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2])],[f0_nnf]) ).
cnf(c1,plain,
( f(X1)
| f(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p6,plain,
f(X0),
inference(factoring,[status(thm)],[c1]) ).
cnf(c3,plain,
( ~ f(sk2)
| ~ f(sk1)
| ~ f(sk0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p7,plain,
( ~ f(sk2)
| ~ f(sk1) ),
inference(resolution,[status(thm)],[p6,c3]) ).
cnf(p8,plain,
~ f(sk2),
inference(resolution,[status(thm)],[p7,p6]) ).
cnf(p9,plain,
$false,
inference(resolution,[status(thm)],[p8,p6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN409+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/5.38 % Computer : n014.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Fri Sep 25 01:05:37 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.68/6.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.68/6.09 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------