%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU189+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 10.58s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 6 unt; 0 def)
% Number of atoms : 73 ( 18 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 75 ( 32 ~; 22 |; 10 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 21 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t65_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ( relation_dom(X1) = empty_set
<=> relation_rng(X1) = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t65_relat_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(fc8_relat_1,axiom,
! [X1] :
( empty(X1)
=> ( relation(relation_rng(X1))
& empty(relation_rng(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc8_relat_1) ).
fof(fc7_relat_1,axiom,
! [X1] :
( empty(X1)
=> ( relation(relation_dom(X1))
& empty(relation_dom(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc7_relat_1) ).
fof(fc6_relat_1,axiom,
! [X1] :
( ( relation(X1)
& ~ empty(X1) )
=> ~ empty(relation_rng(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc6_relat_1) ).
fof(fc5_relat_1,axiom,
! [X1] :
( ( relation(X1)
& ~ empty(X1) )
=> ~ empty(relation_dom(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc5_relat_1) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( relation_dom(X1) = empty_set
<=> relation_rng(X1) = empty_set ) ),
inference(assume_negation,[status(cth)],[t65_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,
! [X31] :
( ( ~ empty(X31)
| relation(relation_rng(X31)) )
& ( ~ empty(X31)
| empty(relation_rng(X31)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc8_relat_1])])])]) ).
fof(c_0_10,plain,
! [X49] :
( ( ~ empty(X49)
| relation(relation_dom(X49)) )
& ( ~ empty(X49)
| empty(relation_dom(X49)) ) ),
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_11,plain,
! [X1] :
( ( relation(X1)
& ~ empty(X1) )
=> ~ empty(relation_rng(X1)) ),
inference(fof_simplification,[status(thm)],[fc6_relat_1]) ).
fof(c_0_12,negated_conjecture,
( ( relation_rng(esk1_0) = empty_set
| relation_dom(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_rng(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ empty(X1)
| empty(relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X1] :
( ( relation(X1)
& ~ empty(X1) )
=> ~ empty(relation_dom(X1)) ),
inference(fof_simplification,[status(thm)],[fc5_relat_1]) ).
fof(c_0_17,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_11])])]) ).
cnf(c_0_18,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_19,plain,
( ~ empty(X1)
| relation_rng(X1) = empty_set ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ empty(X1)
| relation_dom(X1) = empty_set ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
fof(c_0_21,plain,
! [X48] :
( ~ empty(relation_dom(X48))
| ~ relation(X48)
| empty(X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_22,plain,
( ~ empty(relation_rng(X1))
| ~ relation(X1)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,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_24,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_26,negated_conjecture,
~ empty(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_27,plain,
( ~ empty(relation_dom(X1))
| ~ relation(X1)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
relation_dom(esk1_0) = empty_set,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24]),c_0_25])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU189+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/10.41 % Computer : n002.cluster.edu
% 0.13/10.41 % Model : x86_64 x86_64
% 0.13/10.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.41 % Memory : 8046.5625MB
% 0.13/10.41 % OS : Linux 6.8.0-71-generic
% 0.13/10.41 % CPULimit : 300
% 0.13/10.41 % WCLimit : 300
% 0.13/10.41 % DateTime : Mon Sep 21 05:59:16 UTC 2026
% 0.13/10.41 % CPUTime :
% 0.13/10.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/10.48 Running first-order theorem proving
% 0.13/10.48 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.17/10.58 % Version: 3.5.1
% 0.17/10.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/10.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/10.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/10.58 % Starting new_bool_3 with 300s (1) cores
% 0.17/10.58 % Starting new_bool_1 with 300s (1) cores
% 0.17/10.58 % Starting sh5l with 300s (1) cores
% 0.17/10.58 % new_bool_3 with pid 2581316 completed with status 0
% 0.17/10.58 % Result found by new_bool_3
% 0.17/10.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/10.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/10.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/10.58 % Starting new_bool_3 with 300s (1) cores
% 0.17/10.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/10.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/10.58 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.17/10.58 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.17/10.58 % Starting SubtermCWHack with 28s (1) cores
% 0.17/10.58 % SubtermCWHack with pid 2581319 completed with status 0
% 0.17/10.58 % Result found by SubtermCWHack
% 0.17/10.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/10.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/10.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/10.58 % Starting new_bool_3 with 300s (1) cores
% 0.17/10.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.17/10.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/10.58 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.17/10.58 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.17/10.58 % Starting SubtermCWHack with 28s (1) cores
% 0.17/10.58 % Preprocessing time : 0.004 s
% 0.17/10.58
% 0.17/10.58 % Proof found!
% 0.17/10.58 % SZS status Theorem
% 0.17/10.58 % SZS output start CNFRefutation
% See solution above
% 0.17/10.58 % Parsed axioms : 171
% 0.17/10.58 % Removed by relevancy pruning/SinE : 90
% 0.17/10.58 % Initial clauses : 139
% 0.17/10.58 % Removed in clause preprocessing : 0
% 0.17/10.58 % Initial clauses in saturation : 139
% 0.17/10.58 % Processed clauses : 82
% 0.17/10.58 % ...of these trivial : 3
% 0.17/10.58 % ...subsumed : 9
% 0.17/10.58 % ...remaining for further processing : 70
% 0.17/10.58 % Other redundant clauses eliminated : 7
% 0.17/10.58 % Clauses deleted for lack of memory : 0
% 0.17/10.58 % Backward-subsumed : 0
% 0.17/10.58 % Backward-rewritten : 6
% 0.17/10.58 % Generated clauses : 78
% 0.17/10.58 % ...of the previous two non-redundant : 33
% 0.17/10.58 % ...aggressively subsumed : 0
% 0.17/10.58 % Contextual simplify-reflections : 1
% 0.17/10.58 % Paramodulations : 72
% 0.17/10.58 % Factorizations : 0
% 0.17/10.58 % NegExts : 0
% 0.17/10.58 % Equation resolutions : 7
% 0.17/10.58 % Disequality decompositions : 0
% 0.17/10.58 % Total rewrite steps : 66
% 0.17/10.58 % ...of those cached : 49
% 0.17/10.58 % Propositional unsat checks : 0
% 0.17/10.58 % Propositional check models : 0
% 0.17/10.58 % Propositional check unsatisfiable : 0
% 0.17/10.58 % Propositional clauses : 0
% 0.17/10.58 % Propositional clauses after purity: 0
% 0.17/10.58 % Propositional unsat core size : 0
% 0.17/10.58 % Propositional preprocessing time : 0.000
% 0.17/10.58 % Propositional encoding time : 0.000
% 0.17/10.58 % Propositional solver time : 0.000
% 0.17/10.58 % Success case prop preproc time : 0.000
% 0.17/10.58 % Success case prop encoding time : 0.000
% 0.17/10.58 % Success case prop solver time : 0.000
% 0.17/10.58 % Current number of processed clauses : 58
% 0.17/10.58 % Positive orientable unit clauses : 25
% 0.17/10.58 % Positive unorientable unit clauses: 1
% 0.17/10.58 % Negative unit clauses : 9
% 0.17/10.58 % Non-unit-clauses : 23
% 0.17/10.58 % Current number of unprocessed clauses: 88
% 0.17/10.58 % ...number of literals in the above : 242
% 0.17/10.58 % Current number of archived formulas : 0
% 0.17/10.58 % Current number of archived clauses : 6
% 0.17/10.58 % Clause-clause subsumption calls (NU) : 129
% 0.17/10.58 % Rec. Clause-clause subsumption calls : 104
% 0.17/10.58 % Non-unit clause-clause subsumptions : 8
% 0.17/10.58 % Unit Clause-clause subsumption calls : 29
% 0.17/10.58 % Rewrite failures with RHS unbound : 0
% 0.17/10.58 % BW rewrite match attempts : 15
% 0.17/10.58 % BW rewrite match successes : 12
% 0.17/10.58 % Condensation attempts : 0
% 0.17/10.58 % Condensation successes : 0
% 0.17/10.58 % Termbank termtop insertions : 9597
% 0.17/10.58 % Search garbage collected termcells : 2494
% 0.17/10.58
% 0.17/10.58 % -------------------------------------------------
% 0.17/10.58 % User time : 0.016 s
% 0.17/10.58 % System time : 0.008 s
% 0.17/10.58 % Total time : 0.025 s
% 0.17/10.58 % Maximum resident set size: 4052 pages
% 0.17/10.58
% 0.17/10.58 % -------------------------------------------------
% 0.17/10.58 % User time : 0.023 s
% 0.17/10.58 % System time : 0.015 s
% 0.17/10.58 % Total time : 0.039 s
% 0.17/10.58 % Maximum resident set size: 5120 pages
% 0.17/10.58 % E exiting
%------------------------------------------------------------------------------