%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT381+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:13 PM UTC 2026
% Result : Theorem 0.23s 0.58s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 20 unt; 0 def)
% Number of atoms : 95 ( 8 equ)
% Maximal formula atoms : 25 ( 2 avg)
% Number of connectives : 109 ( 48 ~; 44 |; 9 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 33 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSup,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> ! [X3] :
( aSupremumOfIn0(X3,X2,X1)
<=> ( ! [X4] :
( aUpperBoundOfIn0(X4,X2,X1)
=> sdtlseqdt0(X3,X4) )
& aUpperBoundOfIn0(X3,X2,X1)
& aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSup) ).
fof(m__,conjecture,
xu = xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__744,hypothesis,
( aSupremumOfIn0(xv,xS,xT)
& aSupremumOfIn0(xu,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__744) ).
fof(m__725_01,hypothesis,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__725_01) ).
fof(m__725,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__725) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(mASymm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mASymm) ).
fof(c_0_7,plain,
! [X13,X14,X15,X16,X17] :
( ( ~ aSet0(X13)
| ~ aSubsetOf0(X14,X13)
| aSupremumOfIn0(X17,X14,X13)
| ~ aUpperBoundOfIn0(X17,X14,X13)
| ~ aElementOf0(X17,X13)
| ~ sdtlseqdt0(X17,esk2_3(X13,X14,X17)) )
& ( ~ aSet0(X13)
| ~ aSubsetOf0(X14,X13)
| aSupremumOfIn0(X17,X14,X13)
| ~ aUpperBoundOfIn0(X17,X14,X13)
| ~ aElementOf0(X17,X13)
| aUpperBoundOfIn0(esk2_3(X13,X14,X17),X14,X13) )
& ( ~ aSet0(X13)
| ~ aSubsetOf0(X14,X13)
| ~ aSupremumOfIn0(X15,X14,X13)
| sdtlseqdt0(X15,X16)
| ~ aUpperBoundOfIn0(X16,X14,X13) )
& ( ~ aSet0(X13)
| ~ aSubsetOf0(X14,X13)
| ~ aSupremumOfIn0(X15,X14,X13)
| aUpperBoundOfIn0(X15,X14,X13) )
& ( ~ aSet0(X13)
| ~ aSubsetOf0(X14,X13)
| ~ aSupremumOfIn0(X15,X14,X13)
| aElementOf0(X15,X13) ) ),
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)],[mDefSup])])])])])])]) ).
fof(c_0_8,negated_conjecture,
xu != xv,
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_9,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aSupremumOfIn0(X4,X2,X3)
| ~ aUpperBoundOfIn0(X1,X2,X3)
| sdtlseqdt0(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aSupremumOfIn0(xv,xS,xT),
inference(split_conjunct,[status(thm)],[m__744]) ).
cnf(c_0_11,hypothesis,
aSubsetOf0(xS,xT),
inference(split_conjunct,[status(thm)],[m__725_01]) ).
cnf(c_0_12,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__725]) ).
cnf(c_0_13,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aSupremumOfIn0(X1,X2,X3)
| aUpperBoundOfIn0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,hypothesis,
aSupremumOfIn0(xu,xS,xT),
inference(split_conjunct,[status(thm)],[m__744]) ).
fof(c_0_15,plain,
! [X6,X7] :
( aElement0(X7)
| ~ aElementOf0(X7,X6)
| ~ aSet0(X6) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
cnf(c_0_16,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSupremumOfIn0(X1,X3,X2)
| aElementOf0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_17,negated_conjecture,
xu != xv,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_18,plain,
! [X23,X24] :
( X23 = X24
| ~ sdtlseqdt0(X24,X23)
| ~ sdtlseqdt0(X23,X24)
| ~ aElement0(X24)
| ~ aElement0(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mASymm])])]) ).
cnf(c_0_19,hypothesis,
( ~ aUpperBoundOfIn0(X1,xS,xT)
| sdtlseqdt0(xv,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_20,hypothesis,
aUpperBoundOfIn0(xu,xS,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_11]),c_0_12])]) ).
cnf(c_0_21,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,hypothesis,
aElementOf0(xv,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_23,hypothesis,
aElementOf0(xu,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_11]),c_0_12])]) ).
fof(c_0_24,negated_conjecture,
xu != xv,
inference(fof_nnf,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,hypothesis,
sdtlseqdt0(xv,xu),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,hypothesis,
aElement0(xv),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_12])]) ).
cnf(c_0_28,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_23]),c_0_12])]) ).
cnf(c_0_29,negated_conjecture,
xu != xv,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,hypothesis,
( ~ aUpperBoundOfIn0(X1,xS,xT)
| sdtlseqdt0(xu,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_14]),c_0_11]),c_0_12])]) ).
cnf(c_0_31,hypothesis,
aUpperBoundOfIn0(xv,xS,xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_32,hypothesis,
~ sdtlseqdt0(xu,xv),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_33,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT381+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.46 % Computer : n003.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Sun Sep 20 23:58:45 UTC 2026
% 0.18/0.47 % CPUTime :
% 0.18/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.23/0.58 % Version: 3.5.1
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58 % Starting sh5l with 300s (1) cores
% 0.23/0.58 % new_bool_1 with pid 2957939 completed with status 0
% 0.23/0.58 % Result found by new_bool_1
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58 % Search class: FGUSF-FFMS32-SFFFFFNN
% 0.23/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58 % SubtermCWHack with pid 2957941 completed with status 0
% 0.23/0.58 % Result found by SubtermCWHack
% 0.23/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58 % Search class: FGUSF-FFMS32-SFFFFFNN
% 0.23/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58 % Preprocessing time : 0.001 s
% 0.23/0.58
% 0.23/0.58 % Proof found!
% 0.23/0.58 % SZS status Theorem
% 0.23/0.58 % SZS output start CNFRefutation
% See solution above
% 0.23/0.58 % Parsed axioms : 17
% 0.23/0.58 % Removed by relevancy pruning/SinE : 3
% 0.23/0.58 % Initial clauses : 25
% 0.23/0.58 % Removed in clause preprocessing : 3
% 0.23/0.58 % Initial clauses in saturation : 22
% 0.23/0.58 % Processed clauses : 50
% 0.23/0.58 % ...of these trivial : 0
% 0.23/0.58 % ...subsumed : 3
% 0.23/0.58 % ...remaining for further processing : 47
% 0.23/0.58 % Other redundant clauses eliminated : 0
% 0.23/0.58 % Clauses deleted for lack of memory : 0
% 0.23/0.58 % Backward-subsumed : 2
% 0.23/0.58 % Backward-rewritten : 1
% 0.23/0.58 % Generated clauses : 55
% 0.23/0.58 % ...of the previous two non-redundant : 42
% 0.23/0.58 % ...aggressively subsumed : 0
% 0.23/0.58 % Contextual simplify-reflections : 0
% 0.23/0.58 % Paramodulations : 55
% 0.23/0.58 % Factorizations : 0
% 0.23/0.58 % NegExts : 0
% 0.23/0.58 % Equation resolutions : 0
% 0.23/0.58 % Disequality decompositions : 0
% 0.23/0.58 % Total rewrite steps : 51
% 0.23/0.58 % ...of those cached : 42
% 0.23/0.58 % Propositional unsat checks : 0
% 0.23/0.58 % Propositional check models : 0
% 0.23/0.58 % Propositional check unsatisfiable : 0
% 0.23/0.58 % Propositional clauses : 0
% 0.23/0.58 % Propositional clauses after purity: 0
% 0.23/0.58 % Propositional unsat core size : 0
% 0.23/0.58 % Propositional preprocessing time : 0.000
% 0.23/0.58 % Propositional encoding time : 0.000
% 0.23/0.58 % Propositional solver time : 0.000
% 0.23/0.58 % Success case prop preproc time : 0.000
% 0.23/0.58 % Success case prop encoding time : 0.000
% 0.23/0.58 % Success case prop solver time : 0.000
% 0.23/0.58 % Current number of processed clauses : 44
% 0.23/0.58 % Positive orientable unit clauses : 14
% 0.23/0.58 % Positive unorientable unit clauses: 0
% 0.23/0.58 % Negative unit clauses : 3
% 0.23/0.58 % Non-unit-clauses : 27
% 0.23/0.58 % Current number of unprocessed clauses: 14
% 0.23/0.58 % ...number of literals in the above : 71
% 0.23/0.58 % Current number of archived formulas : 0
% 0.23/0.58 % Current number of archived clauses : 3
% 0.23/0.58 % Clause-clause subsumption calls (NU) : 115
% 0.23/0.58 % Rec. Clause-clause subsumption calls : 47
% 0.23/0.58 % Non-unit clause-clause subsumptions : 2
% 0.23/0.58 % Unit Clause-clause subsumption calls : 41
% 0.23/0.58 % Rewrite failures with RHS unbound : 0
% 0.23/0.58 % BW rewrite match attempts : 1
% 0.23/0.58 % BW rewrite match successes : 1
% 0.23/0.58 % Condensation attempts : 0
% 0.23/0.58 % Condensation successes : 0
% 0.23/0.58 % Termbank termtop insertions : 2965
% 0.23/0.58 % Search garbage collected termcells : 535
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.008 s
% 0.23/0.58 % System time : 0.001 s
% 0.23/0.58 % Total time : 0.009 s
% 0.23/0.58 % Maximum resident set size: 3648 pages
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.010 s
% 0.23/0.58 % System time : 0.008 s
% 0.23/0.58 % Total time : 0.018 s
% 0.23/0.58 % Maximum resident set size: 4608 pages
% 0.23/0.58 % E exiting
%------------------------------------------------------------------------------