%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT388+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 : Thu Sep 24 01:05:14 PM UTC 2026
% Result : Theorem 0.27s 0.56s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 100 ( 2 equ)
% Maximal formula atoms : 48 ( 12 avg)
% Number of connectives : 134 ( 42 ~; 46 |; 37 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 1 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( aSupremumOfIn0(X1,xT,xS)
| ( ! [X2] :
( ( aUpperBoundOfIn0(X2,xT,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aElementOf0(X2,xS) )
=> sdtlseqdt0(X1,X2) )
& ( aUpperBoundOfIn0(X1,xT,xS)
| ( ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xS) ) )
& aElementOf0(X1,xS) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__1330,hypothesis,
( 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)
& ! [X1] :
( aElementOf0(X1,xT)
=> sdtlseqdt0(X1,xp) )
& aFixedPointOf0(xp,xf)
& sdtlpdtrp0(xf,xp) = xp
& aElementOf0(xp,szDzozmdt0(xf)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1330) ).
fof(c_0_2,negated_conjecture,
~ ? [X1] :
( aSupremumOfIn0(X1,xT,xS)
| ( ! [X2] :
( ( aUpperBoundOfIn0(X2,xT,xS)
& ! [X3] :
( aElementOf0(X3,xT)
=> sdtlseqdt0(X3,X2) )
& aElementOf0(X2,xS) )
=> sdtlseqdt0(X1,X2) )
& ( aUpperBoundOfIn0(X1,xT,xS)
| ( ! [X2] :
( aElementOf0(X2,xT)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xS) ) )
& aElementOf0(X1,xS) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,hypothesis,
! [X33,X34] :
( aSupremumOfIn0(xp,xT,xS)
& ( sdtlseqdt0(xp,X34)
| ~ aUpperBoundOfIn0(X34,xT,xS) )
& ( sdtlseqdt0(xp,X34)
| ~ aElementOf0(X34,xS)
| ~ sdtlseqdt0(esk8_1(X34),X34) )
& ( sdtlseqdt0(xp,X34)
| ~ aElementOf0(X34,xS)
| aElementOf0(esk8_1(X34),xT) )
& aUpperBoundOfIn0(xp,xT,xS)
& ( sdtlseqdt0(X33,xp)
| ~ aElementOf0(X33,xT) )
& aFixedPointOf0(xp,xf)
& sdtlpdtrp0(xf,xp) = xp
& aElementOf0(xp,szDzozmdt0(xf)) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1330])])])])])]) ).
fof(c_0_4,negated_conjecture,
! [X6,X9,X10] :
( ~ aSupremumOfIn0(X10,xT,xS)
& ( ~ aElementOf0(X6,xS)
| ~ aUpperBoundOfIn0(X6,xT,xS)
| ~ sdtlseqdt0(X6,esk2_1(X6)) )
& ( ~ aElementOf0(X6,xS)
| ~ aUpperBoundOfIn0(X6,xT,xS)
| aUpperBoundOfIn0(esk2_1(X6),xT,xS) )
& ( ~ aElementOf0(X6,xS)
| ~ aUpperBoundOfIn0(X6,xT,xS)
| sdtlseqdt0(X9,esk2_1(X6))
| ~ aElementOf0(X9,xT) )
& ( ~ aElementOf0(X6,xS)
| ~ aUpperBoundOfIn0(X6,xT,xS)
| aElementOf0(esk2_1(X6),xS) )
& ( ~ aElementOf0(X6,xS)
| ~ aElementOf0(X6,xS)
| ~ sdtlseqdt0(esk1_1(X6),X6)
| ~ sdtlseqdt0(X6,esk2_1(X6)) )
& ( ~ aElementOf0(X6,xS)
| ~ aElementOf0(X6,xS)
| ~ sdtlseqdt0(esk1_1(X6),X6)
| aUpperBoundOfIn0(esk2_1(X6),xT,xS) )
& ( ~ aElementOf0(X6,xS)
| ~ aElementOf0(X6,xS)
| ~ sdtlseqdt0(esk1_1(X6),X6)
| sdtlseqdt0(X9,esk2_1(X6))
| ~ aElementOf0(X9,xT) )
& ( ~ aElementOf0(X6,xS)
| ~ aElementOf0(X6,xS)
| ~ sdtlseqdt0(esk1_1(X6),X6)
| aElementOf0(esk2_1(X6),xS) )
& ( ~ aElementOf0(X6,xS)
| ~ aElementOf0(X6,xS)
| aElementOf0(esk1_1(X6),xT)
| ~ sdtlseqdt0(X6,esk2_1(X6)) )
& ( ~ aElementOf0(X6,xS)
| ~ aElementOf0(X6,xS)
| aElementOf0(esk1_1(X6),xT)
| aUpperBoundOfIn0(esk2_1(X6),xT,xS) )
& ( ~ aElementOf0(X6,xS)
| ~ aElementOf0(X6,xS)
| aElementOf0(esk1_1(X6),xT)
| sdtlseqdt0(X9,esk2_1(X6))
| ~ aElementOf0(X9,xT) )
& ( ~ aElementOf0(X6,xS)
| ~ aElementOf0(X6,xS)
| aElementOf0(esk1_1(X6),xT)
| aElementOf0(esk2_1(X6),xS) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])]) ).
cnf(c_0_5,hypothesis,
aSupremumOfIn0(xp,xT,xS),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
~ aSupremumOfIn0(X1,xT,xS),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LAT388+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n008.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Sun Sep 20 23:58:38 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.52 Running first-order theorem proving
% 0.27/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.27/0.56 % Version: 3.5.1
% 0.27/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.56 % Starting sh5l with 300s (1) cores
% 0.27/0.56 % sh5l with pid 3917048 completed with status 0
% 0.27/0.56 % Result found by sh5l
% 0.27/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.56 % Starting sh5l with 300s (1) cores
% 0.27/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.56 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.27/0.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.56 % SubtermCWHack with pid 3917054 completed with status 0
% 0.27/0.56 % Result found by SubtermCWHack
% 0.27/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.56 % Starting sh5l with 300s (1) cores
% 0.27/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.27/0.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.27/0.56 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.27/0.56 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.56 % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.56 % Preprocessing time : 0.002 s
% 0.27/0.56
% 0.27/0.56 % Proof found!
% 0.27/0.56 % SZS status Theorem
% 0.27/0.56 % SZS output start CNFRefutation
% See solution above
% 0.27/0.56 % Parsed axioms : 31
% 0.27/0.56 % Removed by relevancy pruning/SinE : 1
% 0.27/0.56 % Initial clauses : 128
% 0.27/0.56 % Removed in clause preprocessing : 4
% 0.27/0.56 % Initial clauses in saturation : 124
% 0.27/0.56 % Processed clauses : 20
% 0.27/0.56 % ...of these trivial : 0
% 0.27/0.56 % ...subsumed : 0
% 0.27/0.56 % ...remaining for further processing : 20
% 0.27/0.56 % Other redundant clauses eliminated : 0
% 0.27/0.56 % Clauses deleted for lack of memory : 0
% 0.27/0.56 % Backward-subsumed : 0
% 0.27/0.56 % Backward-rewritten : 0
% 0.27/0.56 % Generated clauses : 2
% 0.27/0.56 % ...of the previous two non-redundant : 0
% 0.27/0.56 % ...aggressively subsumed : 0
% 0.27/0.56 % Contextual simplify-reflections : 0
% 0.27/0.56 % Paramodulations : 1
% 0.27/0.56 % Factorizations : 0
% 0.27/0.56 % NegExts : 0
% 0.27/0.56 % Equation resolutions : 0
% 0.27/0.56 % Disequality decompositions : 0
% 0.27/0.56 % Total rewrite steps : 1
% 0.27/0.56 % ...of those cached : 0
% 0.27/0.56 % Propositional unsat checks : 0
% 0.27/0.56 % Propositional check models : 0
% 0.27/0.56 % Propositional check unsatisfiable : 0
% 0.27/0.56 % Propositional clauses : 0
% 0.27/0.56 % Propositional clauses after purity: 0
% 0.27/0.56 % Propositional unsat core size : 0
% 0.27/0.56 % Propositional preprocessing time : 0.000
% 0.27/0.56 % Propositional encoding time : 0.000
% 0.27/0.56 % Propositional solver time : 0.000
% 0.27/0.56 % Success case prop preproc time : 0.000
% 0.27/0.56 % Success case prop encoding time : 0.000
% 0.27/0.56 % Success case prop solver time : 0.000
% 0.27/0.56 % Current number of processed clauses : 19
% 0.27/0.56 % Positive orientable unit clauses : 17
% 0.27/0.56 % Positive unorientable unit clauses: 0
% 0.27/0.56 % Negative unit clauses : 1
% 0.27/0.56 % Non-unit-clauses : 1
% 0.27/0.56 % Current number of unprocessed clauses: 104
% 0.27/0.56 % ...number of literals in the above : 344
% 0.27/0.56 % Current number of archived formulas : 0
% 0.27/0.56 % Current number of archived clauses : 1
% 0.27/0.56 % Clause-clause subsumption calls (NU) : 0
% 0.27/0.56 % Rec. Clause-clause subsumption calls : 0
% 0.27/0.56 % Non-unit clause-clause subsumptions : 0
% 0.27/0.56 % Unit Clause-clause subsumption calls : 0
% 0.27/0.56 % Rewrite failures with RHS unbound : 0
% 0.27/0.56 % BW rewrite match attempts : 0
% 0.27/0.56 % BW rewrite match successes : 0
% 0.27/0.56 % Condensation attempts : 0
% 0.27/0.56 % Condensation successes : 0
% 0.27/0.56 % Termbank termtop insertions : 8330
% 0.27/0.56 % Search garbage collected termcells : 2207
% 0.27/0.56
% 0.27/0.56 % -------------------------------------------------
% 0.27/0.56 % User time : 0.016 s
% 0.27/0.56 % System time : 0.003 s
% 0.27/0.56 % Total time : 0.019 s
% 0.27/0.56 % Maximum resident set size: 3952 pages
% 0.27/0.56
% 0.27/0.56 % -------------------------------------------------
% 0.27/0.56 % User time : 0.018 s
% 0.27/0.56 % System time : 0.008 s
% 0.27/0.56 % Total time : 0.026 s
% 0.27/0.56 % Maximum resident set size: 4608 pages
% 0.27/0.56 % E exiting
%------------------------------------------------------------------------------