%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : LAT388+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n019.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 01:57:06 PM UTC 2026
% Result : Theorem 4.22s 16.15s
% Output : Proof 4.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 7 unt; 0 def)
% Number of atoms : 13 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 5 ( 1 sgn 2 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f29,hypothesis,
( aSupremumOfIn0(xp,xT,xS)
& aFixedPointOf0(xp,xf) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1330) ).
fof(f29_nnf,plain,
( aSupremumOfIn0(xp,xT,xS)
& aFixedPointOf0(xp,xf) ),
inference(nnf_transformation,[status(thm)],[f29]) ).
fof(f29_sk,plain,
( aSupremumOfIn0(xp,xT,xS)
& aFixedPointOf0(xp,xf) ),
inference(skolemisation,[status(esa)],[f29_nnf]) ).
cnf(c64,plain,
aSupremumOfIn0(xp,xT,xS),
inference(cnf_transformation,[status(esa)],[f29_sk]) ).
fof(f30,conjecture,
? [W0] : aSupremumOfIn0(W0,xT,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f30_neg,negated_conjecture,
~ ? [W0] : aSupremumOfIn0(W0,xT,xS),
inference(negated_conjecture,[status(cth)],[f30]) ).
fof(f30_nnf,plain,
! [W0] : ~ aSupremumOfIn0(W0,xT,xS),
inference(nnf_transformation,[status(thm)],[f30_neg]) ).
fof(f30_sk,plain,
! [W0] : ~ aSupremumOfIn0(W0,xT,xS),
inference(skolemisation,[status(esa)],[f30_nnf]) ).
cnf(c65,plain,
~ aSupremumOfIn0(X0,xT,xS),
inference(cnf_transformation,[status(esa)],[f30_sk]) ).
cnf(p67,plain,
$false,
inference(resolution,[status(thm)],[c64,c65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT388+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/15.39 % Computer : n019.cluster.edu
% 0.12/15.39 % Model : x86_64 x86_64
% 0.12/15.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/15.39 % Memory : 8046.5625MB
% 0.12/15.39 % OS : Linux 6.8.0-71-generic
% 0.12/15.39 % CPULimit : 300
% 0.12/15.39 % WCLimit : 300
% 0.12/15.39 % DateTime : Wed Sep 23 21:31:35 UTC 2026
% 0.12/15.39 % CPUTime :
% 0.12/15.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.22/16.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.22/16.15 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------