%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT382+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 : n004.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.19s 5.77s
% Output : CNFRefutation 0.19s
% 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(mDefInf,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
=> ! [X3] :
( aInfimumOfIn0(X3,X2,X1)
<=> ( ! [X4] :
( aLowerBoundOfIn0(X4,X2,X1)
=> sdtlseqdt0(X4,X3) )
& aLowerBoundOfIn0(X3,X2,X1)
& aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefInf) ).
fof(m__,conjecture,
xu = xv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__792,hypothesis,
( aInfimumOfIn0(xv,xS,xT)
& aInfimumOfIn0(xu,xS,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__792) ).
fof(m__773_01,hypothesis,
aSubsetOf0(xS,xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773_01) ).
fof(m__773,hypothesis,
aSet0(xT),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__773) ).
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,
! [X11,X12,X13,X14,X15] :
( ( ~ aSet0(X11)
| ~ aSubsetOf0(X12,X11)
| aInfimumOfIn0(X15,X12,X11)
| ~ aLowerBoundOfIn0(X15,X12,X11)
| ~ aElementOf0(X15,X11)
| ~ sdtlseqdt0(esk2_3(X11,X12,X15),X15) )
& ( ~ aSet0(X11)
| ~ aSubsetOf0(X12,X11)
| aInfimumOfIn0(X15,X12,X11)
| ~ aLowerBoundOfIn0(X15,X12,X11)
| ~ aElementOf0(X15,X11)
| aLowerBoundOfIn0(esk2_3(X11,X12,X15),X12,X11) )
& ( ~ aSet0(X11)
| ~ aSubsetOf0(X12,X11)
| ~ aInfimumOfIn0(X13,X12,X11)
| sdtlseqdt0(X14,X13)
| ~ aLowerBoundOfIn0(X14,X12,X11) )
& ( ~ aSet0(X11)
| ~ aSubsetOf0(X12,X11)
| ~ aInfimumOfIn0(X13,X12,X11)
| aLowerBoundOfIn0(X13,X12,X11) )
& ( ~ aSet0(X11)
| ~ aSubsetOf0(X12,X11)
| ~ aInfimumOfIn0(X13,X12,X11)
| aElementOf0(X13,X11) ) ),
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)],[mDefInf])])])])])])]) ).
fof(c_0_8,negated_conjecture,
xu != xv,
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_9,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aInfimumOfIn0(X4,X2,X3)
| ~ aLowerBoundOfIn0(X1,X2,X3)
| sdtlseqdt0(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aInfimumOfIn0(xv,xS,xT),
inference(split_conjunct,[status(thm)],[m__792]) ).
cnf(c_0_11,hypothesis,
aSubsetOf0(xS,xT),
inference(split_conjunct,[status(thm)],[m__773_01]) ).
cnf(c_0_12,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__773]) ).
cnf(c_0_13,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aInfimumOfIn0(X1,X2,X3)
| aLowerBoundOfIn0(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,hypothesis,
aInfimumOfIn0(xu,xS,xT),
inference(split_conjunct,[status(thm)],[m__792]) ).
fof(c_0_15,plain,
! [X17,X18] :
( aElement0(X18)
| ~ aElementOf0(X18,X17)
| ~ aSet0(X17) ),
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)
| ~ aInfimumOfIn0(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,
! [X22,X23] :
( X22 = X23
| ~ sdtlseqdt0(X23,X22)
| ~ sdtlseqdt0(X22,X23)
| ~ aElement0(X23)
| ~ aElement0(X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mASymm])])]) ).
cnf(c_0_19,hypothesis,
( ~ aLowerBoundOfIn0(X1,xS,xT)
| sdtlseqdt0(X1,xv) ),
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,
aLowerBoundOfIn0(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(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])]) ).
cnf(c_0_23,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])]) ).
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(xu,xv),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,hypothesis,
aElement0(xu),
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(xv),
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,
( ~ aLowerBoundOfIn0(X1,xS,xT)
| sdtlseqdt0(X1,xu) ),
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,
aLowerBoundOfIn0(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(xv,xu),
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.03 % Problem : LAT382+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.63 % Computer : n004.cluster.edu
% 0.13/5.63 % Model : x86_64 x86_64
% 0.13/5.63 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.63 % Memory : 8046.5625MB
% 0.13/5.63 % OS : Linux 6.8.0-71-generic
% 0.13/5.64 % CPULimit : 300
% 0.13/5.64 % WCLimit : 300
% 0.13/5.64 % DateTime : Sun Sep 20 23:57:27 UTC 2026
% 0.13/5.64 % CPUTime :
% 0.13/5.64 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.69 Running first-order theorem proving
% 0.13/5.69 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.19/5.77 % Version: 3.5.1
% 0.19/5.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/5.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/5.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/5.77 % Starting new_bool_3 with 300s (1) cores
% 0.19/5.77 % Starting new_bool_1 with 300s (1) cores
% 0.19/5.77 % Starting sh5l with 300s (1) cores
% 0.19/5.77 % new_bool_3 with pid 1819447 completed with status 0
% 0.19/5.77 % Result found by new_bool_3
% 0.19/5.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/5.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/5.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/5.77 % Starting new_bool_3 with 300s (1) cores
% 0.19/5.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/5.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/5.77 % Search class: FGUSF-FFMS32-SFFFFFNN
% 0.19/5.77 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/5.77 % Starting SubtermCWHack with 31s (1) cores
% 0.19/5.77 % SubtermCWHack with pid 1819455 completed with status 0
% 0.19/5.77 % Result found by SubtermCWHack
% 0.19/5.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/5.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/5.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/5.77 % Starting new_bool_3 with 300s (1) cores
% 0.19/5.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/5.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/5.77 % Search class: FGUSF-FFMS32-SFFFFFNN
% 0.19/5.77 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/5.77 % Starting SubtermCWHack with 31s (1) cores
% 0.19/5.77 % Preprocessing time : 0.001 s
% 0.19/5.77
% 0.19/5.77 % Proof found!
% 0.19/5.77 % SZS status Theorem
% 0.19/5.77 % SZS output start CNFRefutation
% See solution above
% 0.19/5.77 % Parsed axioms : 18
% 0.19/5.77 % Removed by relevancy pruning/SinE : 4
% 0.19/5.77 % Initial clauses : 25
% 0.19/5.77 % Removed in clause preprocessing : 3
% 0.19/5.77 % Initial clauses in saturation : 22
% 0.19/5.77 % Processed clauses : 51
% 0.19/5.77 % ...of these trivial : 0
% 0.19/5.77 % ...subsumed : 3
% 0.19/5.77 % ...remaining for further processing : 48
% 0.19/5.77 % Other redundant clauses eliminated : 0
% 0.19/5.77 % Clauses deleted for lack of memory : 0
% 0.19/5.77 % Backward-subsumed : 3
% 0.19/5.77 % Backward-rewritten : 1
% 0.19/5.77 % Generated clauses : 56
% 0.19/5.77 % ...of the previous two non-redundant : 43
% 0.19/5.77 % ...aggressively subsumed : 0
% 0.19/5.77 % Contextual simplify-reflections : 0
% 0.19/5.77 % Paramodulations : 56
% 0.19/5.77 % Factorizations : 0
% 0.19/5.77 % NegExts : 0
% 0.19/5.77 % Equation resolutions : 0
% 0.19/5.77 % Disequality decompositions : 0
% 0.19/5.77 % Total rewrite steps : 45
% 0.19/5.77 % ...of those cached : 35
% 0.19/5.77 % Propositional unsat checks : 0
% 0.19/5.77 % Propositional check models : 0
% 0.19/5.77 % Propositional check unsatisfiable : 0
% 0.19/5.77 % Propositional clauses : 0
% 0.19/5.77 % Propositional clauses after purity: 0
% 0.19/5.77 % Propositional unsat core size : 0
% 0.19/5.77 % Propositional preprocessing time : 0.000
% 0.19/5.77 % Propositional encoding time : 0.000
% 0.19/5.77 % Propositional solver time : 0.000
% 0.19/5.77 % Success case prop preproc time : 0.000
% 0.19/5.77 % Success case prop encoding time : 0.000
% 0.19/5.77 % Success case prop solver time : 0.000
% 0.19/5.77 % Current number of processed clauses : 44
% 0.19/5.77 % Positive orientable unit clauses : 14
% 0.19/5.77 % Positive unorientable unit clauses: 0
% 0.19/5.77 % Negative unit clauses : 3
% 0.19/5.77 % Non-unit-clauses : 27
% 0.19/5.77 % Current number of unprocessed clauses: 14
% 0.19/5.77 % ...number of literals in the above : 76
% 0.19/5.77 % Current number of archived formulas : 0
% 0.19/5.77 % Current number of archived clauses : 4
% 0.19/5.77 % Clause-clause subsumption calls (NU) : 131
% 0.19/5.77 % Rec. Clause-clause subsumption calls : 50
% 0.19/5.77 % Non-unit clause-clause subsumptions : 2
% 0.19/5.77 % Unit Clause-clause subsumption calls : 43
% 0.19/5.77 % Rewrite failures with RHS unbound : 0
% 0.19/5.77 % BW rewrite match attempts : 1
% 0.19/5.77 % BW rewrite match successes : 1
% 0.19/5.77 % Condensation attempts : 0
% 0.19/5.77 % Condensation successes : 0
% 0.19/5.77 % Termbank termtop insertions : 3004
% 0.19/5.77 % Search garbage collected termcells : 559
% 0.19/5.77
% 0.19/5.77 % -------------------------------------------------
% 0.19/5.77 % User time : 0.006 s
% 0.19/5.77 % System time : 0.004 s
% 0.19/5.77 % Total time : 0.009 s
% 0.19/5.77 % Maximum resident set size: 3648 pages
% 0.19/5.77
% 0.19/5.77 % -------------------------------------------------
% 0.19/5.77 % User time : 0.006 s
% 0.19/5.77 % System time : 0.009 s
% 0.19/5.77 % Total time : 0.015 s
% 0.19/5.77 % Maximum resident set size: 4864 pages
% 0.19/5.77 % E exiting
%------------------------------------------------------------------------------