%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN345+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 : n005.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 4.80s 1.08s
% Output : Proof 4.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 97 ( 29 ~; 32 |; 16 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 9 sgn 10 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
! [X1,X2] :
? [Y1,Y2] :
! [Z] :
( ( ( big_f(X1,X2,Y1)
=> big_f(Y2,Y1,Z) )
=> ( big_f(X1,X1,X2)
=> big_f(X1,X2,X2) ) )
=> ( ( ( big_f(X2,Y1,Y2)
=> big_f(Y1,Z,Z) )
=> ( big_f(X1,X2,X2)
=> big_f(X1,X1,X2) ) )
=> ( big_f(Y1,Y2,Z)
=> ( ( big_f(X1,X1,X2)
<=> big_f(X1,X2,X2) )
& big_f(X2,X2,Y1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_16_4) ).
fof(f0_neg,negated_conjecture,
~ ! [X1,X2] :
? [Y1,Y2] :
! [Z] :
( ( ( big_f(X1,X2,Y1)
=> big_f(Y2,Y1,Z) )
=> ( big_f(X1,X1,X2)
=> big_f(X1,X2,X2) ) )
=> ( ( ( big_f(X2,Y1,Y2)
=> big_f(Y1,Z,Z) )
=> ( big_f(X1,X2,X2)
=> big_f(X1,X1,X2) ) )
=> ( big_f(Y1,Y2,Z)
=> ( ( big_f(X1,X1,X2)
<=> big_f(X1,X2,X2) )
& big_f(X2,X2,Y1) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [X1,X2] :
! [Y1,Y2] :
? [Z] :
( ( ( big_f(X1,X2,X2)
& ~ big_f(X1,X1,X2) )
| ( ~ big_f(X1,X2,X2)
& big_f(X1,X1,X2) )
| ~ big_f(X2,X2,Y1) )
& big_f(Y1,Y2,Z)
& ( big_f(X1,X1,X2)
| ~ big_f(X1,X2,X2)
| ( ~ big_f(Y1,Z,Z)
& big_f(X2,Y1,Y2) ) )
& ( big_f(X1,X2,X2)
| ~ big_f(X1,X1,X2)
| ( ~ big_f(Y2,Y1,Z)
& big_f(X1,X2,Y1) ) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [Y1,Y2] :
( ( ( big_f(sk0,sk1,sk1)
& ~ big_f(sk0,sk0,sk1) )
| ( ~ big_f(sk0,sk1,sk1)
& big_f(sk0,sk0,sk1) )
| ~ big_f(sk1,sk1,Y1) )
& big_f(Y1,Y2,sk2(Y1,Y2))
& ( big_f(sk0,sk0,sk1)
| ~ big_f(sk0,sk1,sk1)
| ( ~ big_f(Y1,sk2(Y1,Y2),sk2(Y1,Y2))
& big_f(sk1,Y1,Y2) ) )
& ( big_f(sk0,sk1,sk1)
| ~ big_f(sk0,sk0,sk1)
| ( ~ big_f(Y2,Y1,sk2(Y1,Y2))
& big_f(sk0,sk1,Y1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2])],[f0_nnf]) ).
cnf(c3,plain,
( big_f(sk0,sk0,sk1)
| ~ big_f(sk0,sk1,sk1)
| ~ big_f(X2,sk2(X2,X3),sk2(X2,X3)) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c6,plain,
( big_f(sk0,sk1,sk1)
| big_f(sk0,sk0,sk1)
| ~ big_f(sk1,sk1,X2) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c4,plain,
big_f(X2,X3,sk2(X2,X3)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p10,plain,
( big_f(sk0,sk1,sk1)
| big_f(sk0,sk0,sk1) ),
inference(resolution,[status(thm)],[c6,c4]) ).
cnf(c2,plain,
( big_f(sk0,sk0,sk1)
| ~ big_f(sk0,sk1,sk1)
| big_f(sk1,X2,X3) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p11,plain,
( big_f(sk0,sk0,sk1)
| big_f(sk1,X0,X1)
| big_f(sk0,sk0,sk1) ),
inference(resolution,[status(thm)],[p10,c2]) ).
cnf(p13,plain,
( big_f(sk1,X0,X1)
| big_f(sk0,sk0,sk1) ),
inference(factoring,[status(thm)],[p11]) ).
cnf(p14,plain,
( big_f(sk0,sk0,sk1)
| big_f(sk0,sk0,sk1)
| ~ big_f(sk0,sk1,sk1) ),
inference(resolution,[status(thm)],[c3,p13]) ).
cnf(p15,plain,
( big_f(sk0,sk0,sk1)
| ~ big_f(sk0,sk1,sk1) ),
inference(factoring,[status(thm)],[p14]) ).
cnf(p16,plain,
( big_f(sk0,sk0,sk1)
| big_f(sk0,sk0,sk1) ),
inference(resolution,[status(thm)],[p15,p10]) ).
cnf(p17,plain,
big_f(sk0,sk0,sk1),
inference(factoring,[status(thm)],[p16]) ).
cnf(c0,plain,
( big_f(sk0,sk1,sk1)
| ~ big_f(sk0,sk0,sk1)
| big_f(sk0,sk1,X2) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p9,plain,
( ~ big_f(sk0,sk0,sk1)
| big_f(sk0,sk1,sk1) ),
inference(factoring,[status(thm)],[c0]) ).
cnf(p18,plain,
big_f(sk0,sk1,sk1),
inference(resolution,[status(thm)],[p17,p9]) ).
cnf(c7,plain,
( ~ big_f(sk0,sk0,sk1)
| ~ big_f(sk0,sk1,sk1)
| ~ big_f(sk1,sk1,X2) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p12,plain,
( ~ big_f(sk0,sk0,sk1)
| ~ big_f(sk0,sk1,sk1) ),
inference(resolution,[status(thm)],[c7,c4]) ).
cnf(p19,plain,
~ big_f(sk0,sk0,sk1),
inference(resolution,[status(thm)],[p18,p12]) ).
cnf(p20,plain,
$false,
inference(resolution,[status(thm)],[p19,p17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN345+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.07/0.34 % Computer : n005.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Fri Sep 25 00:55:18 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.80/1.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.80/1.08 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------