%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN411+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 : n009.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.56s 6.09s
% Output : Proof 4.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 22 ( 12 ~; 4 |; 4 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 39 ( 9 sgn 18 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [X,Y,Z] : f(X,Y,Z)
<=> ~ ? [U,V,W] : ~ f(U,V,W) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish250) ).
fof(f0_neg,negated_conjecture,
~ ( ! [X,Y,Z] : f(X,Y,Z)
<=> ~ ? [U,V,W] : ~ f(U,V,W) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ( ! [U,V,W] : f(U,V,W)
& ? [X,Y,Z] : ~ f(X,Y,Z) )
| ( ? [U,V,W] : ~ f(U,V,W)
& ! [X,Y,Z] : f(X,Y,Z) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,Y,Z,U,V,W] :
( ( f(U,V,W)
& ~ f(sk3,sk4,sk5) )
| ( ~ f(sk0,sk1,sk2)
& f(X,Y,Z) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2,sk3,sk4,sk5])],[f0_nnf]) ).
cnf(c2,plain,
( ~ f(sk3,sk4,sk5)
| ~ f(sk0,sk1,sk2) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(c1,plain,
( f(X3,X4,X5)
| f(X0,X1,X2) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p4,plain,
f(X0,X1,X2),
inference(factoring,[status(thm)],[c1]) ).
cnf(p5,plain,
~ f(sk3,sk4,sk5),
inference(resolution,[status(thm)],[c2,p4]) ).
cnf(p6,plain,
$false,
inference(resolution,[status(thm)],[p5,p4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN411+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/5.37 % Computer : n009.cluster.edu
% 0.11/5.37 % Model : x86_64 x86_64
% 0.11/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37 % Memory : 8046.5625MB
% 0.11/5.37 % OS : Linux 6.8.0-71-generic
% 0.11/5.37 % CPULimit : 300
% 0.11/5.37 % WCLimit : 300
% 0.11/5.37 % DateTime : Fri Sep 25 01:06:19 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.56/6.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.56/6.09 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------