%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN343+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 : n003.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:26 PM UTC 2026
% Result : Theorem 3.01s 0.87s
% Output : Proof 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 28 ( 10 ~; 6 |; 6 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 3-3 aty)
% Number of variables : 22 ( 3 sgn 8 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
? [X,Y1,Y2] :
! [Z] :
( ( ( big_f(X,Y1)
=> big_f(Z,X) )
=> big_f(X,X) )
=> ( big_f(Y1,Y2)
& big_f(X,X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_16_2) ).
fof(f0_neg,negated_conjecture,
~ ? [X,Y1,Y2] :
! [Z] :
( ( ( big_f(X,Y1)
=> big_f(Z,X) )
=> big_f(X,X) )
=> ( big_f(Y1,Y2)
& big_f(X,X) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
! [X,Y1,Y2] :
? [Z] :
( ( ~ big_f(Y1,Y2)
| ~ big_f(X,X) )
& ( big_f(X,X)
| ( ~ big_f(Z,X)
& big_f(X,Y1) ) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,Y1,Y2] :
( ( ~ big_f(Y1,Y2)
| ~ big_f(X,X) )
& ( big_f(X,X)
| ( ~ big_f(sk0(X,Y1,Y2),X)
& big_f(X,Y1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c2,plain,
( ~ big_f(X1,X2)
| ~ big_f(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p4,plain,
~ big_f(X0,X0),
inference(factoring,[status(thm)],[c2]) ).
cnf(c0,plain,
( big_f(X0,X0)
| big_f(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p3,plain,
big_f(X0,X0),
inference(factoring,[status(thm)],[c0]) ).
cnf(p5,plain,
$false,
inference(resolution,[status(thm)],[p4,p3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN343+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.35 % Computer : n003.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Fri Sep 25 00:56:36 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.01/0.87 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.01/0.87 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------