%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT388+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n010.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:59:46 PM UTC 2026
% Result : Theorem 1.73s 6.52s
% Output : CNFRefutation 1.73s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f85ERROR: Could not build tree for root c_628ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f30,axiom,
( aSupremumOfIn0(xp,xT,xS)
& ! [X0] :
( ( aUpperBoundOfIn0(X0,xT,xS)
| ( ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,X0) )
& aElementOf0(X0,xS) ) )
=> sdtlseqdt0(xp,X0) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X0] :
( aElementOf0(X0,xT)
=> sdtlseqdt0(X0,xp) )
& aFixedPointOf0(xp,xf)
& sdtlpdtrp0(xf,xp) = xp
& aElementOf0(xp,szDzozmdt0(xf)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1330) ).
fof(f41,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [X1] :
( ( aUpperBoundOfIn0(X1,xT,xS)
| ( ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xS) ) )
=> sdtlseqdt0(xp,X1) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X0] :
( aElementOf0(X0,xT)
=> sdtlseqdt0(X0,xp) )
& aFixedPointOf0(xp,xf)
& sdtlpdtrp0(xf,xp) = xp
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(rectify,[],[f30]) ).
fof(f77,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [X1] :
( ( ~ aUpperBoundOfIn0(X1,xT,xS)
& ( ? [X2] :
( aElementOf0(X2,xT)
& ~ sdtlseqdt0(X2,X1) )
| ~ aElementOf0(X1,xS) ) )
| sdtlseqdt0(xp,X1) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X0] :
( ~ aElementOf0(X0,xT)
| sdtlseqdt0(X0,xp) )
& aFixedPointOf0(xp,xf)
& sdtlpdtrp0(xf,xp) = xp
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(ennf_transformation,[],[f41]) ).
fof(f130,plain,
( aSupremumOfIn0(xp,xT,xS)
& ! [X1] :
( ( ~ aUpperBoundOfIn0(X1,xT,xS)
& ( ( aElementOf0(sK21(X1),xT)
& ~ sdtlseqdt0(sK21(X1),X1) )
| ~ aElementOf0(X1,xS) ) )
| sdtlseqdt0(xp,X1) )
& aUpperBoundOfIn0(xp,xT,xS)
& ! [X0] :
( ~ aElementOf0(X0,xT)
| sdtlseqdt0(X0,xp) )
& aFixedPointOf0(xp,xf)
& sdtlpdtrp0(xf,xp) = xp
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21]),skolemize(X2,sK21(X1))],[f77]) ).
fof(f134,plain,
! [X0] :
( ~ aSupremumOfIn0(X0,xT,xS)
& ( sP3(X0)
| ( ~ aUpperBoundOfIn0(X0,xT,xS)
& ( ( aElementOf0(sK23(X0),xT)
& ~ sdtlseqdt0(sK23(X0),X0) )
| ~ aElementOf0(X0,xS) ) )
| ~ aElementOf0(X0,xS) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23]),skolemize(X1,sK23(X0))],[f85]) ).
fof(f242,plain,
aSupremumOfIn0(xp,xT,xS),
inference(cnf_transformation,[],[f130]) ).
fof(f255,plain,
! [X0] : ~ aSupremumOfIn0(X0,xT,xS),
inference(cnf_transformation,[],[f134]) ).
tcf(c_164,plain,
aSupremumOfIn0(xp,xT,xS),
inference(cnf_transformation,[],[f242]) ).
tcf(c_172,negated_conjecture,
! [X0: $i] : ~ aSupremumOfIn0(X0,xT,xS),
inference(cnf_transformation,[],[f255]) ).
tcf(c_628,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_164,c_172]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT388+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.59 % Computer : n010.cluster.edu
% 0.11/5.59 % Model : x86_64 x86_64
% 0.11/5.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.59 % Memory : 8046.5625MB
% 0.11/5.59 % OS : Linux 6.8.0-71-generic
% 0.11/5.59 % CPULimit : 300
% 0.11/5.59 % WCLimit : 300
% 0.11/5.59 % DateTime : Wed Sep 23 21:31:52 UTC 2026
% 0.15/5.60 % CPUTime :
% 0.15/5.60 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.64 Running first-order theorem proving
% 0.15/5.64 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.65
% 0.15/5.65 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.65
% 0.15/5.65 % Detected problem language: tptp
% 0.15/5.66 % Proving...
% 1.73/6.52 % SZS status Started for theBenchmark.p
% 1.73/6.52 % SZS status Theorem for theBenchmark.p
% 1.73/6.52
% 1.73/6.52 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.73/6.52
% 1.73/6.52 % ------ iProver source info
% 1.73/6.52
% 1.73/6.52 % git: date: 2026-07-19 20:42:38 +0200
% 1.73/6.52 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.73/6.52 % git: non_committed_changes: false
% 1.73/6.52
% 1.73/6.52 % ------ Parsing...
% 1.73/6.52 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.73/6.52
% 1.73/6.52 % ------ Preprocessing...%
% 1.73/6.52
% 1.73/6.52 % SZS status Theorem for theBenchmark.p
% 1.73/6.52
% 1.73/6.52 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.73/6.52
% 1.73/6.52
%------------------------------------------------------------------------------