%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU193+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 : n020.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:12 PM UTC 2026
% Result : Theorem 204.84s 30.23s
% Output : CNFRefutation 204.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 3 unt; 0 def)
% Number of atoms : 93 ( 8 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 124 ( 50 ~; 54 |; 9 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 48 ( 4 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d11_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2,X3] :
( relation(X3)
=> ( X3 = relation_dom_restriction(X1,X2)
<=> ! [X4,X5] :
( in(ordered_pair(X4,X5),X3)
<=> ( in(ordered_pair(X4,X5),X1)
& in(X4,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d11_relat_1) ).
fof(dt_k7_relat_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(d3_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(X1,X2)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X1)
=> in(ordered_pair(X3,X4),X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_relat_1) ).
fof(t88_relat_1,conjecture,
! [X1,X2] :
( relation(X2)
=> subset(relation_dom_restriction(X2,X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t88_relat_1) ).
fof(c_0_4,plain,
! [X30,X31,X32,X33,X34,X35,X36] :
( ( ~ relation(X30)
| ~ relation(X32)
| X32 = relation_dom_restriction(X30,X31)
| in(ordered_pair(esk5_3(X30,X31,X32),esk6_3(X30,X31,X32)),X32)
| in(ordered_pair(esk5_3(X30,X31,X32),esk6_3(X30,X31,X32)),X30) )
& ( ~ relation(X30)
| ~ relation(X32)
| X32 = relation_dom_restriction(X30,X31)
| in(ordered_pair(esk5_3(X30,X31,X32),esk6_3(X30,X31,X32)),X32)
| in(esk5_3(X30,X31,X32),X31) )
& ( ~ relation(X30)
| ~ relation(X32)
| X32 = relation_dom_restriction(X30,X31)
| ~ in(ordered_pair(esk5_3(X30,X31,X32),esk6_3(X30,X31,X32)),X30)
| ~ in(esk5_3(X30,X31,X32),X31)
| ~ in(ordered_pair(esk5_3(X30,X31,X32),esk6_3(X30,X31,X32)),X32) )
& ( ~ relation(X30)
| ~ relation(X32)
| X32 != relation_dom_restriction(X30,X31)
| in(ordered_pair(X35,X36),X32)
| ~ in(ordered_pair(X35,X36),X30)
| ~ in(X35,X31) )
& ( ~ relation(X30)
| ~ relation(X32)
| X32 != relation_dom_restriction(X30,X31)
| ~ in(ordered_pair(X33,X34),X32)
| in(ordered_pair(X33,X34),X30) )
& ( ~ relation(X30)
| ~ relation(X32)
| X32 != relation_dom_restriction(X30,X31)
| ~ in(ordered_pair(X33,X34),X32)
| in(X33,X31) ) ),
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)],[d11_relat_1])])])])])])]) ).
fof(c_0_5,plain,
! [X39,X40] :
( relation(relation_dom_restriction(X39,X40))
| ~ relation(X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_relat_1])])]) ).
cnf(c_0_6,plain,
( ~ relation(X3)
| ~ relation(X4)
| X4 != relation_dom_restriction(X3,X5)
| ~ in(ordered_pair(X1,X2),X4)
| in(ordered_pair(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ relation(X1)
| relation(relation_dom_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X85,X86,X87,X88] :
( ( ~ relation(X85)
| ~ relation(X86)
| subset(X85,X86)
| ~ in(ordered_pair(esk17_2(X85,X86),esk18_2(X85,X86)),X86) )
& ( ~ relation(X85)
| ~ relation(X86)
| subset(X85,X86)
| in(ordered_pair(esk17_2(X85,X86),esk18_2(X85,X86)),X85) )
& ( ~ relation(X85)
| ~ relation(X86)
| in(ordered_pair(X87,X88),X86)
| ~ in(ordered_pair(X87,X88),X85)
| ~ subset(X85,X86) ) ),
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)],[d3_relat_1])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> subset(relation_dom_restriction(X2,X1),X2) ),
inference(assume_negation,[status(cth)],[t88_relat_1]) ).
cnf(c_0_10,plain,
( ~ in(ordered_pair(X1,X2),relation_dom_restriction(X3,X4))
| ~ relation(X3)
| in(ordered_pair(X1,X2),X3) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_6]),c_0_7]) ).
cnf(c_0_11,plain,
( ~ relation(X1)
| ~ relation(X2)
| subset(X1,X2)
| in(ordered_pair(esk17_2(X1,X2),esk18_2(X1,X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
( ~ subset(relation_dom_restriction(esk2_0,esk1_0),esk2_0)
& relation(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_13,plain,
( ~ relation(X1)
| ~ relation(X2)
| ~ in(ordered_pair(esk17_2(X1,X2),esk18_2(X1,X2)),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ relation(X3)
| ~ relation(X1)
| in(ordered_pair(esk17_2(relation_dom_restriction(X1,X2),X3),esk18_2(relation_dom_restriction(X1,X2),X3)),X1)
| subset(relation_dom_restriction(X1,X2),X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_7]) ).
cnf(c_0_15,negated_conjecture,
~ subset(relation_dom_restriction(esk2_0,esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ relation(X1)
| subset(relation_dom_restriction(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_7]) ).
cnf(c_0_17,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU193+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:57:34 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 204.84/30.23 % Version: 3.5.1
% 204.84/30.23 % Preprocessing class: FSLSSMSSSSSNFFN.
% 204.84/30.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 204.84/30.23 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 204.84/30.23 % Starting new_bool_3 with 300s (1) cores
% 204.84/30.23 % Starting new_bool_1 with 300s (1) cores
% 204.84/30.23 % Starting sh5l with 300s (1) cores
% 204.84/30.23 % new_bool_1 with pid 2155356 completed with status 0
% 204.84/30.23 % Result found by new_bool_1
% 204.84/30.23 % Preprocessing class: FSLSSMSSSSSNFFN.
% 204.84/30.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 204.84/30.23 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 204.84/30.23 % Starting new_bool_3 with 300s (1) cores
% 204.84/30.23 % Starting new_bool_1 with 300s (1) cores
% 204.84/30.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 204.84/30.23 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 204.84/30.23 % Search class: FGHSM-FFMM31-SFFFFFNN
% 204.84/30.23 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 204.84/30.23 % Starting SubtermCWHack with 28s (1) cores
% 204.84/30.23 % SubtermCWHack with pid 2155359 completed with status 8
% 204.84/30.23 % Starting new_bool_1 with 31s (1) cores
% 204.84/30.23 % new_bool_1 with pid 2155732 completed with status 0
% 204.84/30.23 % Result found by new_bool_1
% 204.84/30.23 % Preprocessing class: FSLSSMSSSSSNFFN.
% 204.84/30.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 204.84/30.23 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 204.84/30.23 % Starting new_bool_3 with 300s (1) cores
% 204.84/30.23 % Starting new_bool_1 with 300s (1) cores
% 204.84/30.23 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 204.84/30.23 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 204.84/30.23 % Search class: FGHSM-FFMM31-SFFFFFNN
% 204.84/30.23 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 204.84/30.23 % Starting SubtermCWHack with 28s (1) cores
% 204.84/30.23 % SubtermCWHack with pid 2155359 completed with status 8
% 204.84/30.23 % Starting new_bool_1 with 31s (1) cores
% 204.84/30.23 % Preprocessing time : 0.003 s
% 204.84/30.23 % Presaturation interreduction done
% 204.84/30.23
% 204.84/30.23 % Proof found!
% 204.84/30.23 % SZS status Theorem
% 204.84/30.23 % SZS output start CNFRefutation
% See solution above
% 204.84/30.23 % Parsed axioms : 182
% 204.84/30.23 % Removed by relevancy pruning/SinE : 117
% 204.84/30.23 % Initial clauses : 120
% 204.84/30.23 % Removed in clause preprocessing : 0
% 204.84/30.23 % Initial clauses in saturation : 120
% 204.84/30.23 % Processed clauses : 9242
% 204.84/30.23 % ...of these trivial : 25
% 204.84/30.23 % ...subsumed : 7967
% 204.84/30.23 % ...remaining for further processing : 1250
% 204.84/30.23 % Other redundant clauses eliminated : 330
% 204.84/30.23 % Clauses deleted for lack of memory : 0
% 204.84/30.23 % Backward-subsumed : 121
% 204.84/30.23 % Backward-rewritten : 17
% 204.84/30.23 % Generated clauses : 55263
% 204.84/30.23 % ...of the previous two non-redundant : 49673
% 204.84/30.23 % ...aggressively subsumed : 0
% 204.84/30.23 % Contextual simplify-reflections : 69
% 204.84/30.23 % Paramodulations : 54905
% 204.84/30.23 % Factorizations : 20
% 204.84/30.23 % NegExts : 0
% 204.84/30.23 % Equation resolutions : 333
% 204.84/30.23 % Disequality decompositions : 0
% 204.84/30.23 % Total rewrite steps : 10697
% 204.84/30.23 % ...of those cached : 10318
% 204.84/30.23 % Propositional unsat checks : 0
% 204.84/30.23 % Propositional check models : 0
% 204.84/30.23 % Propositional check unsatisfiable : 0
% 204.84/30.23 % Propositional clauses : 0
% 204.84/30.23 % Propositional clauses after purity: 0
% 204.84/30.23 % Propositional unsat core size : 0
% 204.84/30.23 % Propositional preprocessing time : 0.000
% 204.84/30.23 % Propositional encoding time : 0.000
% 204.84/30.23 % Propositional solver time : 0.000
% 204.84/30.23 % Success case prop preproc time : 0.000
% 204.84/30.23 % Success case prop encoding time : 0.000
% 204.84/30.23 % Success case prop solver time : 0.000
% 204.84/30.23 % Current number of processed clauses : 984
% 204.84/30.23 % Positive orientable unit clauses : 78
% 204.84/30.23 % Positive unorientable unit clauses: 0
% 204.84/30.23 % Negative unit clauses : 26
% 204.84/30.23 % Non-unit-clauses : 880
% 204.84/30.23 % Current number of unprocessed clauses: 39713
% 204.84/30.23 % ...number of literals in the above : 163477
% 204.84/30.23 % Current number of archived formulas : 0
% 204.84/30.23 % Current number of archived clauses : 248
% 204.84/30.23 % Clause-clause subsumption calls (NU) : 171235
% 204.84/30.23 % Rec. Clause-clause subsumption calls : 91801
% 204.84/30.23 % Non-unit clause-clause subsumptions : 5612
% 204.84/30.23 % Unit Clause-clause subsumption calls : 4729
% 204.84/30.23 % Rewrite failures with RHS unbound : 0
% 204.84/30.23 % BW rewrite match attempts : 71
% 204.84/30.23 % BW rewrite match successes : 15
% 204.84/30.23 % Condensation attempts : 0
% 204.84/30.23 % Condensation successes : 0
% 204.84/30.23 % Termbank termtop insertions : 672497
% 204.84/30.23 % Search garbage collected termcells : 2587
% 204.84/30.23
% 204.84/30.23 % -------------------------------------------------
% 204.84/30.23 % User time : 28.165 s
% 204.84/30.23 % System time : 1.116 s
% 204.84/30.23 % Total time : 29.281 s
% 204.84/30.23 % Maximum resident set size: 4068 pages
% 204.84/30.23
% 204.84/30.23 % -------------------------------------------------
% 204.84/30.23 % User time : 28.171 s
% 204.84/30.23 % System time : 1.122 s
% 204.84/30.23 % Total time : 29.294 s
% 204.84/30.23 % Maximum resident set size: 5120 pages
% 204.84/30.23 % E exiting
%------------------------------------------------------------------------------