%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN401+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 : n014.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:37 PM UTC 2026
% Result : Theorem 4.59s 6.14s
% Output : Proof 4.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 7 unt; 0 def)
% Number of atoms : 15 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 ( 3 sgn 6 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
! [X] :
( ! [Y] : f(Y)
=> f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish229) ).
fof(f0_neg,negated_conjecture,
~ ! [X] :
( ! [Y] : f(Y)
=> f(X) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [X] :
( ~ f(X)
& ! [Y] : f(Y) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [Y] :
( ~ f(sk0)
& f(Y) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c0,plain,
f(X1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t0,plain,
f(X1) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t1,plain,
f(X1) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(c1,plain,
~ f(sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
f(sk0) != true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t1]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN401+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/5.38 % Computer : n014.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Fri Sep 25 01:04:52 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.59/6.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.59/6.14 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------