%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN315+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 : n007.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:19 PM UTC 2026
% Result : Theorem 0.14s 10.80s
% Output : Proof 0.14s
% 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 : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 13 ( 6 sgn 4 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
? [X] :
! [Y] :
( ( big_f(X)
<=> p )
=> ( big_f(Y)
<=> p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_2_1) ).
fof(f0_neg,negated_conjecture,
~ ? [X] :
! [Y] :
( ( big_f(X)
<=> p )
=> ( big_f(Y)
<=> p ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
! [X] :
? [Y] :
( ( ( p
& ~ big_f(Y) )
| ( ~ p
& big_f(Y) ) )
& ( ~ p
| big_f(X) )
& ( p
| ~ big_f(X) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X] :
( ( ( p
& ~ big_f(sk0(X)) )
| ( ~ p
& big_f(sk0(X)) ) )
& ( ~ p
| big_f(X) )
& ( p
| ~ big_f(X) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c3,plain,
( p
| big_f(sk0(X0)) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c0,plain,
( p
| ~ big_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,
( ~ big_f(sk0(X0))
| ~ p ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p9,plain,
~ big_f(sk0(X0)),
inference(resolution,[status(thm)],[p7,c4]) ).
cnf(c1,plain,
( ~ p
| big_f(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p8,plain,
big_f(X0),
inference(resolution,[status(thm)],[p7,c1]) ).
cnf(p10,plain,
$false,
inference(resolution,[status(thm)],[p9,p8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN315+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/10.38 % Computer : n007.cluster.edu
% 0.09/10.38 % Model : x86_64 x86_64
% 0.09/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.38 % Memory : 8046.5625MB
% 0.09/10.38 % OS : Linux 6.8.0-71-generic
% 0.09/10.38 % CPULimit : 300
% 0.09/10.38 % WCLimit : 300
% 0.09/10.38 % DateTime : Fri Sep 25 00:46:33 UTC 2026
% 0.09/10.38 % CPUTime :
% 0.09/10.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.14/10.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/10.80 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------