%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU188+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 02:24:11 PM UTC 2026
% Result : Theorem 0.17s 5.52s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 62 ( 17 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 61 ( 25 ~; 18 |; 8 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 17 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fc6_relat_1,axiom,
! [X1] :
( ( relation(X1)
& ~ empty(X1) )
=> ~ empty(relation_rng(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_relat_1) ).
fof(t64_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ( ( relation_rng(X1) = empty_set
| relation_dom(X1) = empty_set )
=> X1 = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t64_relat_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(fc7_relat_1,axiom,
! [X1] :
( empty(X1)
=> ( relation(relation_dom(X1))
& empty(relation_dom(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc7_relat_1) ).
fof(fc5_relat_1,axiom,
! [X1] :
( ( relation(X1)
& ~ empty(X1) )
=> ~ empty(relation_dom(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc5_relat_1) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(c_0_6,plain,
! [X1] :
( ( relation(X1)
& ~ empty(X1) )
=> ~ empty(relation_rng(X1)) ),
inference(fof_simplification,[status(thm)],[fc6_relat_1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( ( relation_rng(X1) = empty_set
| relation_dom(X1) = empty_set )
=> X1 = empty_set ) ),
inference(assume_negation,[status(cth)],[t64_relat_1]) ).
fof(c_0_8,plain,
! [X19] :
( X19 = empty_set
| ~ empty(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_9,plain,
! [X48] :
( ( ~ empty(X48)
| relation(relation_dom(X48)) )
& ( ~ empty(X48)
| empty(relation_dom(X48)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc7_relat_1])])])]) ).
fof(c_0_10,plain,
! [X1] :
( ( relation(X1)
& ~ empty(X1) )
=> ~ empty(relation_dom(X1)) ),
inference(fof_simplification,[status(thm)],[fc5_relat_1]) ).
fof(c_0_11,plain,
! [X30] :
( ~ empty(relation_rng(X30))
| ~ relation(X30)
| empty(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_12,negated_conjecture,
( esk1_0 != empty_set
& ( relation_rng(esk1_0) = empty_set
| relation_dom(esk1_0) = empty_set )
& relation(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_13,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ empty(X1)
| empty(relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X47] :
( ~ empty(relation_dom(X47))
| ~ relation(X47)
| empty(X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_16,plain,
( ~ empty(relation_rng(X1))
| ~ relation(X1)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( relation_rng(esk1_0) = empty_set
| relation_dom(esk1_0) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_20,plain,
( ~ empty(X1)
| relation_dom(X1) = empty_set ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( ~ empty(relation_dom(X1))
| ~ relation(X1)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
relation_dom(esk1_0) = empty_set,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
empty(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18]),c_0_19])]) ).
cnf(c_0_24,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU188+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.40 % Computer : n009.cluster.edu
% 0.14/5.40 % Model : x86_64 x86_64
% 0.14/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.40 % Memory : 8046.5625MB
% 0.14/5.40 % OS : Linux 6.8.0-71-generic
% 0.14/5.40 % CPULimit : 300
% 0.14/5.40 % WCLimit : 300
% 0.14/5.40 % DateTime : Mon Sep 21 05:56:34 UTC 2026
% 0.14/5.40 % CPUTime :
% 0.14/5.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.47 Running first-order theorem proving
% 0.14/5.47 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.17/5.52 % Version: 3.5.1
% 0.17/5.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/5.52 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.52 % Starting new_bool_1 with 300s (1) cores
% 0.17/5.52 % Starting sh5l with 300s (1) cores
% 0.17/5.52 % new_bool_3 with pid 996272 completed with status 0
% 0.17/5.52 % Result found by new_bool_3
% 0.17/5.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/5.52 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/5.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/5.52 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.17/5.52 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.17/5.52 % Starting SubtermCWHack with 28s (1) cores
% 0.17/5.52 % SubtermCWHack with pid 996275 completed with status 0
% 0.17/5.52 % Result found by SubtermCWHack
% 0.17/5.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/5.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/5.52 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/5.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/5.52 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.17/5.52 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.17/5.52 % Starting SubtermCWHack with 28s (1) cores
% 0.17/5.52 % Preprocessing time : 0.002 s
% 0.17/5.52
% 0.17/5.52 % Proof found!
% 0.17/5.52 % SZS status Theorem
% 0.17/5.52 % SZS output start CNFRefutation
% See solution above
% 0.17/5.52 % Parsed axioms : 170
% 0.17/5.52 % Removed by relevancy pruning/SinE : 90
% 0.17/5.52 % Initial clauses : 137
% 0.17/5.52 % Removed in clause preprocessing : 0
% 0.17/5.52 % Initial clauses in saturation : 137
% 0.17/5.52 % Processed clauses : 80
% 0.17/5.52 % ...of these trivial : 3
% 0.17/5.52 % ...subsumed : 9
% 0.17/5.52 % ...remaining for further processing : 68
% 0.17/5.52 % Other redundant clauses eliminated : 7
% 0.17/5.52 % Clauses deleted for lack of memory : 0
% 0.17/5.52 % Backward-subsumed : 0
% 0.17/5.52 % Backward-rewritten : 5
% 0.17/5.52 % Generated clauses : 74
% 0.17/5.52 % ...of the previous two non-redundant : 28
% 0.17/5.52 % ...aggressively subsumed : 0
% 0.17/5.52 % Contextual simplify-reflections : 1
% 0.17/5.52 % Paramodulations : 68
% 0.17/5.52 % Factorizations : 0
% 0.17/5.52 % NegExts : 0
% 0.17/5.52 % Equation resolutions : 7
% 0.17/5.52 % Disequality decompositions : 0
% 0.17/5.52 % Total rewrite steps : 63
% 0.17/5.52 % ...of those cached : 46
% 0.17/5.52 % Propositional unsat checks : 0
% 0.17/5.52 % Propositional check models : 0
% 0.17/5.52 % Propositional check unsatisfiable : 0
% 0.17/5.52 % Propositional clauses : 0
% 0.17/5.52 % Propositional clauses after purity: 0
% 0.17/5.52 % Propositional unsat core size : 0
% 0.17/5.52 % Propositional preprocessing time : 0.000
% 0.17/5.52 % Propositional encoding time : 0.000
% 0.17/5.52 % Propositional solver time : 0.000
% 0.17/5.52 % Success case prop preproc time : 0.000
% 0.17/5.52 % Success case prop encoding time : 0.000
% 0.17/5.52 % Success case prop solver time : 0.000
% 0.17/5.52 % Current number of processed clauses : 57
% 0.17/5.52 % Positive orientable unit clauses : 26
% 0.17/5.52 % Positive unorientable unit clauses: 1
% 0.17/5.52 % Negative unit clauses : 9
% 0.17/5.52 % Non-unit-clauses : 21
% 0.17/5.52 % Current number of unprocessed clauses: 85
% 0.17/5.52 % ...number of literals in the above : 234
% 0.17/5.52 % Current number of archived formulas : 0
% 0.17/5.52 % Current number of archived clauses : 5
% 0.17/5.52 % Clause-clause subsumption calls (NU) : 106
% 0.17/5.52 % Rec. Clause-clause subsumption calls : 94
% 0.17/5.52 % Non-unit clause-clause subsumptions : 8
% 0.17/5.52 % Unit Clause-clause subsumption calls : 14
% 0.17/5.52 % Rewrite failures with RHS unbound : 0
% 0.17/5.52 % BW rewrite match attempts : 15
% 0.17/5.52 % BW rewrite match successes : 12
% 0.17/5.52 % Condensation attempts : 0
% 0.17/5.52 % Condensation successes : 0
% 0.17/5.52 % Termbank termtop insertions : 9405
% 0.17/5.52 % Search garbage collected termcells : 2481
% 0.17/5.52
% 0.17/5.52 % -------------------------------------------------
% 0.17/5.52 % User time : 0.016 s
% 0.17/5.52 % System time : 0.004 s
% 0.17/5.52 % Total time : 0.020 s
% 0.17/5.52 % Maximum resident set size: 4000 pages
% 0.17/5.52
% 0.17/5.52 % -------------------------------------------------
% 0.17/5.52 % User time : 0.024 s
% 0.17/5.52 % System time : 0.009 s
% 0.17/5.52 % Total time : 0.033 s
% 0.17/5.52 % Maximum resident set size: 5120 pages
% 0.17/5.52 % E exiting
%------------------------------------------------------------------------------