%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT381+3 : 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 : n013.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.24s 0.58s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 16 unt; 0 def)
% Number of atoms : 114 ( 8 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 115 ( 28 ~; 30 |; 41 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__744,hypothesis,
( aSupremumOfIn0(xv,xS,xT)
& ! [X1] :
( ( aUpperBoundOfIn0(X1,xS,xT)
| ( ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xT) ) )
=> sdtlseqdt0(xv,X1) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xv) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& ! [X1] :
( ( aUpperBoundOfIn0(X1,xS,xT)
| ( ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xT) ) )
=> sdtlseqdt0(xu,X1) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xu) )
& aElementOf0(xu,xT)
& aElementOf0(xu,xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__744) ).
fof(m__,conjecture,
xu = xv,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).
fof(mASymm,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aElement0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& sdtlseqdt0(X1,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mASymm) ).
fof(m__725,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__725) ).
fof(c_0_5,hypothesis,
( aSupremumOfIn0(xv,xS,xT)
& ! [X1] :
( ( aUpperBoundOfIn0(X1,xS,xT)
| ( ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xT) ) )
=> sdtlseqdt0(xv,X1) )
& aUpperBoundOfIn0(xv,xS,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xv) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& ! [X1] :
( ( aUpperBoundOfIn0(X1,xS,xT)
| ( ! [X2] :
( aElementOf0(X2,xS)
=> sdtlseqdt0(X2,X1) )
& aElementOf0(X1,xT) ) )
=> sdtlseqdt0(xu,X1) )
& aUpperBoundOfIn0(xu,xS,xT)
& ! [X1] :
( aElementOf0(X1,xS)
=> sdtlseqdt0(X1,xu) )
& aElementOf0(xu,xT) ),
inference(fof_simplification,[status(thm)],[m__744]) ).
fof(c_0_6,negated_conjecture,
xu != xv,
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,hypothesis,
! [X6,X7,X9,X10] :
( aSupremumOfIn0(xv,xS,xT)
& ( sdtlseqdt0(xv,X10)
| ~ aUpperBoundOfIn0(X10,xS,xT) )
& ( sdtlseqdt0(xv,X10)
| ~ aElementOf0(X10,xT)
| ~ sdtlseqdt0(esk2_1(X10),X10) )
& ( sdtlseqdt0(xv,X10)
| ~ aElementOf0(X10,xT)
| aElementOf0(esk2_1(X10),xS) )
& aUpperBoundOfIn0(xv,xS,xT)
& ( sdtlseqdt0(X9,xv)
| ~ aElementOf0(X9,xS) )
& aElementOf0(xv,xT)
& aElementOf0(xv,xT)
& aSupremumOfIn0(xu,xS,xT)
& ( sdtlseqdt0(xu,X7)
| ~ aUpperBoundOfIn0(X7,xS,xT) )
& ( sdtlseqdt0(xu,X7)
| ~ aElementOf0(X7,xT)
| ~ sdtlseqdt0(esk1_1(X7),X7) )
& ( sdtlseqdt0(xu,X7)
| ~ aElementOf0(X7,xT)
| aElementOf0(esk1_1(X7),xS) )
& aUpperBoundOfIn0(xu,xS,xT)
& ( sdtlseqdt0(X6,xu)
| ~ aElementOf0(X6,xS) )
& aElementOf0(xu,xT) ),
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)],[c_0_5])])])])])]) ).
fof(c_0_8,plain,
! [X18,X19] :
( aElement0(X19)
| ~ aElementOf0(X19,X18)
| ~ aSet0(X18) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).
fof(c_0_9,negated_conjecture,
xu != xv,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X29,X30] :
( X29 = X30
| ~ sdtlseqdt0(X30,X29)
| ~ sdtlseqdt0(X29,X30)
| ~ aElement0(X30)
| ~ aElement0(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mASymm])])]) ).
cnf(c_0_11,hypothesis,
( ~ aUpperBoundOfIn0(X1,xS,xT)
| sdtlseqdt0(xv,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
aUpperBoundOfIn0(xu,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
( ~ aUpperBoundOfIn0(X1,xS,xT)
| sdtlseqdt0(xu,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,hypothesis,
aUpperBoundOfIn0(xv,xS,xT),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
( ~ aElementOf0(X2,X1)
| ~ aSet0(X1)
| aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xv,xT),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__725]) ).
cnf(c_0_18,hypothesis,
aElementOf0(xu,xT),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_19,negated_conjecture,
xu != xv,
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElement0(X2)
| ~ aElement0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,hypothesis,
sdtlseqdt0(xv,xu),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_22,hypothesis,
sdtlseqdt0(xu,xv),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_23,hypothesis,
aElement0(xv),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_24,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
xu != xv,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT381+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n013.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Sun Sep 20 23:56:36 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.55 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.24/0.58 % Version: 3.5.1
% 0.24/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.58 % Starting sh5l with 300s (1) cores
% 0.24/0.58 % new_bool_3 with pid 3727103 completed with status 0
% 0.24/0.58 % Result found by new_bool_3
% 0.24/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.58 % Search class: FGUSF-FFMM32-SFFFFFNN
% 0.24/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.58 % SubtermCWHack with pid 3727107 completed with status 0
% 0.24/0.58 % Result found by SubtermCWHack
% 0.24/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.58 % Search class: FGUSF-FFMM32-SFFFFFNN
% 0.24/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.58 % Preprocessing time : 0.002 s
% 0.24/0.58
% 0.24/0.58 % Proof found!
% 0.24/0.58 % SZS status Theorem
% 0.24/0.58 % SZS output start CNFRefutation
% See solution above
% 0.24/0.58 % Parsed axioms : 17
% 0.24/0.58 % Removed by relevancy pruning/SinE : 3
% 0.24/0.58 % Initial clauses : 40
% 0.24/0.58 % Removed in clause preprocessing : 3
% 0.24/0.58 % Initial clauses in saturation : 37
% 0.24/0.58 % Processed clauses : 33
% 0.24/0.58 % ...of these trivial : 1
% 0.24/0.58 % ...subsumed : 0
% 0.24/0.58 % ...remaining for further processing : 32
% 0.24/0.58 % Other redundant clauses eliminated : 0
% 0.24/0.58 % Clauses deleted for lack of memory : 0
% 0.24/0.58 % Backward-subsumed : 0
% 0.24/0.58 % Backward-rewritten : 0
% 0.24/0.58 % Generated clauses : 24
% 0.24/0.58 % ...of the previous two non-redundant : 13
% 0.24/0.58 % ...aggressively subsumed : 0
% 0.24/0.58 % Contextual simplify-reflections : 0
% 0.24/0.58 % Paramodulations : 24
% 0.24/0.58 % Factorizations : 0
% 0.24/0.58 % NegExts : 0
% 0.24/0.58 % Equation resolutions : 0
% 0.24/0.58 % Disequality decompositions : 0
% 0.24/0.58 % Total rewrite steps : 21
% 0.24/0.58 % ...of those cached : 11
% 0.24/0.58 % Propositional unsat checks : 0
% 0.24/0.58 % Propositional check models : 0
% 0.24/0.58 % Propositional check unsatisfiable : 0
% 0.24/0.58 % Propositional clauses : 0
% 0.24/0.58 % Propositional clauses after purity: 0
% 0.24/0.58 % Propositional unsat core size : 0
% 0.24/0.58 % Propositional preprocessing time : 0.000
% 0.24/0.58 % Propositional encoding time : 0.000
% 0.24/0.58 % Propositional solver time : 0.000
% 0.24/0.58 % Success case prop preproc time : 0.000
% 0.24/0.58 % Success case prop encoding time : 0.000
% 0.24/0.58 % Success case prop solver time : 0.000
% 0.24/0.58 % Current number of processed clauses : 32
% 0.24/0.58 % Positive orientable unit clauses : 15
% 0.24/0.58 % Positive unorientable unit clauses: 0
% 0.24/0.58 % Negative unit clauses : 1
% 0.24/0.58 % Non-unit-clauses : 16
% 0.24/0.58 % Current number of unprocessed clauses: 17
% 0.24/0.58 % ...number of literals in the above : 74
% 0.24/0.58 % Current number of archived formulas : 0
% 0.24/0.58 % Current number of archived clauses : 0
% 0.24/0.58 % Clause-clause subsumption calls (NU) : 28
% 0.24/0.58 % Rec. Clause-clause subsumption calls : 26
% 0.24/0.58 % Non-unit clause-clause subsumptions : 0
% 0.24/0.58 % Unit Clause-clause subsumption calls : 2
% 0.24/0.58 % Rewrite failures with RHS unbound : 0
% 0.24/0.58 % BW rewrite match attempts : 0
% 0.24/0.58 % BW rewrite match successes : 0
% 0.24/0.58 % Condensation attempts : 0
% 0.24/0.58 % Condensation successes : 0
% 0.24/0.58 % Termbank termtop insertions : 3117
% 0.24/0.58 % Search garbage collected termcells : 711
% 0.24/0.58
% 0.24/0.58 % -------------------------------------------------
% 0.24/0.58 % User time : 0.013 s
% 0.24/0.58 % System time : 0.002 s
% 0.24/0.58 % Total time : 0.015 s
% 0.24/0.58 % Maximum resident set size: 3652 pages
% 0.24/0.58
% 0.24/0.58 % -------------------------------------------------
% 0.24/0.58 % User time : 0.017 s
% 0.24/0.58 % System time : 0.007 s
% 0.24/0.58 % Total time : 0.024 s
% 0.24/0.58 % Maximum resident set size: 4864 pages
% 0.24/0.58 % E exiting
%------------------------------------------------------------------------------