%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU187+1 : 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 : n018.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:10 PM UTC 2026
% Result : Theorem 0.15s 5.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 48 ( 13 unt; 0 def)
% Number of atoms : 134 ( 40 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 155 ( 69 ~; 68 |; 9 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 1 con; 0-3 aty)
% Number of variables : 89 ( 3 sgn 42 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_relat_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(cc1_relat_1,axiom,
! [X1] :
( empty(X1)
=> relation(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_relat_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(t60_relat_1,conjecture,
( relation_rng(empty_set) = empty_set
& relation_dom(empty_set) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_relat_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(c_0_11,plain,
! [X20,X21,X22,X24,X25,X26,X28] :
( ( ~ relation(X20)
| X26 = relation_rng(X20)
| in(ordered_pair(esk6_2(X20,X26),esk5_2(X20,X26)),X20)
| in(esk5_2(X20,X26),X26) )
& ( ~ relation(X20)
| X26 = relation_rng(X20)
| ~ in(ordered_pair(X28,esk5_2(X20,X26)),X20)
| ~ in(esk5_2(X20,X26),X26) )
& ( ~ relation(X20)
| X21 != relation_rng(X20)
| in(X24,X21)
| ~ in(ordered_pair(X25,X24),X20) )
& ( ~ relation(X20)
| X21 != relation_rng(X20)
| in(ordered_pair(esk4_3(X20,X21,X22),X22),X20)
| ~ in(X22,X21) ) ),
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)],[d5_relat_1])])])])])])]) ).
fof(c_0_12,plain,
! [X30,X31] : ordered_pair(X30,X31) = unordered_pair(unordered_pair(X30,X31),singleton(X30)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
cnf(c_0_13,plain,
( ~ relation(X3)
| X2 != relation_rng(X3)
| ~ in(X1,X2)
| in(ordered_pair(esk4_3(X3,X2,X1),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X8,X9] : unordered_pair(X8,X9) = unordered_pair(X9,X8),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_16,plain,
! [X10,X11,X12,X14,X15,X16,X18] :
( ( ~ relation(X10)
| X16 = relation_dom(X10)
| in(ordered_pair(esk2_2(X10,X16),esk3_2(X10,X16)),X10)
| in(esk2_2(X10,X16),X16) )
& ( ~ relation(X10)
| X16 = relation_dom(X10)
| ~ in(ordered_pair(esk2_2(X10,X16),X18),X10)
| ~ in(esk2_2(X10,X16),X16) )
& ( ~ relation(X10)
| X11 != relation_dom(X10)
| in(X14,X11)
| ~ in(ordered_pair(X14,X15),X10) )
& ( ~ relation(X10)
| X11 != relation_dom(X10)
| in(ordered_pair(X12,esk1_3(X10,X11,X12)),X10)
| ~ in(X12,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)],[d4_relat_1])])])])])])]) ).
fof(c_0_17,plain,
! [X53,X54] :
( ~ empty(X54)
| ~ in(X53,X54) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
cnf(c_0_18,plain,
( ~ in(X1,X2)
| ~ relation(X3)
| X2 != relation_rng(X3)
| in(unordered_pair(unordered_pair(esk4_3(X3,X2,X1),X1),singleton(esk4_3(X3,X2,X1))),X3) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X7] :
( relation(X7)
| ~ empty(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relat_1])])]) ).
fof(c_0_21,plain,
! [X47,X48] :
( in(X47,X48)
| empty(X48)
| ~ element(X47,X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
fof(c_0_22,plain,
! [X32] : element(esk7_1(X32),X32),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_23,plain,
( ~ relation(X3)
| X2 != relation_dom(X3)
| ~ in(X1,X2)
| in(ordered_pair(X1,esk1_3(X3,X2,X1)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ in(X1,X3)
| ~ relation(X2)
| X3 != relation_rng(X2)
| in(unordered_pair(unordered_pair(X1,esk4_3(X2,X3,X1)),singleton(esk4_3(X2,X3,X1))),X2) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ empty(X1)
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
element(esk7_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( ~ in(X1,X2)
| ~ relation(X3)
| X2 != relation_dom(X3)
| in(unordered_pair(unordered_pair(X1,esk1_3(X3,X2,X1)),singleton(X1)),X3) ),
inference(rw,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_30,plain,
( ~ in(X3,X1)
| ~ empty(X2)
| X1 != relation_rng(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
( in(esk7_1(X1),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( ~ in(X1,X3)
| ~ relation(X2)
| X3 != relation_dom(X2)
| in(unordered_pair(singleton(X1),unordered_pair(X1,esk1_3(X2,X3,X1))),X2) ),
inference(rw,[status(thm)],[c_0_29,c_0_19]) ).
fof(c_0_33,negated_conjecture,
~ ( relation_rng(empty_set) = empty_set
& relation_dom(empty_set) = empty_set ),
inference(assume_negation,[status(cth)],[t60_relat_1]) ).
fof(c_0_34,plain,
! [X52] :
( X52 = empty_set
| ~ empty(X52) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
cnf(c_0_35,plain,
( ~ empty(X2)
| X1 != relation_rng(X2)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( ~ in(X3,X1)
| ~ empty(X2)
| X1 != relation_dom(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_32]),c_0_26]) ).
fof(c_0_37,negated_conjecture,
( relation_rng(empty_set) != empty_set
| relation_dom(empty_set) != empty_set ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])]) ).
cnf(c_0_38,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,plain,
( ~ empty(X1)
| empty(relation_rng(X1)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
( ~ empty(X2)
| X1 != relation_dom(X2)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_41,negated_conjecture,
( relation_rng(empty_set) != empty_set
| relation_dom(empty_set) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
( ~ empty(X1)
| relation_rng(X1) = empty_set ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_44,plain,
( ~ empty(X1)
| empty(relation_dom(X1)) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_45,negated_conjecture,
relation_dom(empty_set) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_46,plain,
( ~ empty(X1)
| relation_dom(X1) = empty_set ),
inference(spm,[status(thm)],[c_0_38,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU187+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n018.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 05:58:20 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.45 % Version: 3.5.1
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.45 % Starting sh5l with 300s (1) cores
% 0.15/5.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1120770 completed with status 0
% 0.15/5.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.45 % No SInE strategy applied
% 0.15/5.45 % Search class: FGHSS-FFMM31-MFFFFFNN
% 0.15/5.45 % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.15/5.45 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.45 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.15/5.45 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.15/5.45 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 0.15/5.45 % G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 1120778 completed with status 0
% 0.15/5.45 % Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.45 % No SInE strategy applied
% 0.15/5.45 % Search class: FGHSS-FFMM31-MFFFFFNN
% 0.15/5.45 % partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.15/5.45 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.45 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.15/5.45 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.15/5.45 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 0.15/5.45 % Preprocessing time : 0.001 s
% 0.15/5.45
% 0.15/5.45 % Proof found!
% 0.15/5.45 % SZS status Theorem
% 0.15/5.45 % SZS output start CNFRefutation
% See solution above
% 0.15/5.45 % Parsed axioms : 32
% 0.15/5.45 % Removed by relevancy pruning/SinE : 0
% 0.15/5.45 % Initial clauses : 42
% 0.15/5.45 % Removed in clause preprocessing : 8
% 0.15/5.45 % Initial clauses in saturation : 34
% 0.15/5.45 % Processed clauses : 70
% 0.15/5.45 % ...of these trivial : 2
% 0.15/5.45 % ...subsumed : 11
% 0.15/5.45 % ...remaining for further processing : 57
% 0.15/5.45 % Other redundant clauses eliminated : 0
% 0.15/5.45 % Clauses deleted for lack of memory : 0
% 0.15/5.45 % Backward-subsumed : 2
% 0.15/5.45 % Backward-rewritten : 3
% 0.15/5.45 % Generated clauses : 106
% 0.15/5.45 % ...of the previous two non-redundant : 90
% 0.15/5.45 % ...aggressively subsumed : 0
% 0.15/5.45 % Contextual simplify-reflections : 2
% 0.15/5.45 % Paramodulations : 101
% 0.15/5.45 % Factorizations : 2
% 0.15/5.45 % NegExts : 0
% 0.15/5.45 % Equation resolutions : 3
% 0.15/5.45 % Disequality decompositions : 0
% 0.15/5.45 % Total rewrite steps : 19
% 0.15/5.45 % ...of those cached : 9
% 0.15/5.45 % Propositional unsat checks : 0
% 0.15/5.45 % Propositional check models : 0
% 0.15/5.45 % Propositional check unsatisfiable : 0
% 0.15/5.45 % Propositional clauses : 0
% 0.15/5.45 % Propositional clauses after purity: 0
% 0.15/5.45 % Propositional unsat core size : 0
% 0.15/5.45 % Propositional preprocessing time : 0.000
% 0.15/5.45 % Propositional encoding time : 0.000
% 0.15/5.45 % Propositional solver time : 0.000
% 0.15/5.45 % Success case prop preproc time : 0.000
% 0.15/5.45 % Success case prop encoding time : 0.000
% 0.15/5.45 % Success case prop solver time : 0.000
% 0.15/5.45 % Current number of processed clauses : 52
% 0.15/5.45 % Positive orientable unit clauses : 6
% 0.15/5.45 % Positive unorientable unit clauses: 1
% 0.15/5.45 % Negative unit clauses : 9
% 0.15/5.45 % Non-unit-clauses : 36
% 0.15/5.45 % Current number of unprocessed clauses: 51
% 0.15/5.45 % ...number of literals in the above : 204
% 0.15/5.45 % Current number of archived formulas : 0
% 0.15/5.45 % Current number of archived clauses : 6
% 0.15/5.45 % Clause-clause subsumption calls (NU) : 164
% 0.15/5.45 % Rec. Clause-clause subsumption calls : 134
% 0.15/5.45 % Non-unit clause-clause subsumptions : 9
% 0.15/5.45 % Unit Clause-clause subsumption calls : 30
% 0.15/5.45 % Rewrite failures with RHS unbound : 0
% 0.15/5.45 % BW rewrite match attempts : 4
% 0.15/5.45 % BW rewrite match successes : 4
% 0.15/5.45 % Condensation attempts : 0
% 0.15/5.45 % Condensation successes : 0
% 0.15/5.45 % Termbank termtop insertions : 3378
% 0.15/5.45 % Search garbage collected termcells : 517
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.002 s
% 0.15/5.45 % System time : 0.006 s
% 0.15/5.45 % Total time : 0.008 s
% 0.15/5.45 % Maximum resident set size: 3648 pages
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.018 s
% 0.15/5.45 % System time : 0.019 s
% 0.15/5.45 % Total time : 0.037 s
% 0.15/5.45 % Maximum resident set size: 4608 pages
% 0.15/5.45 % E exiting
%------------------------------------------------------------------------------