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