%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU199+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 : n011.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:13 PM UTC 2026
% Result : Theorem 113.23s 16.96s
% Output : CNFRefutation 113.23s
% 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(d12_relat_1,axiom,
! [X1,X2] :
( relation(X2)
=> ! [X3] :
( relation(X3)
=> ( X3 = relation_rng_restriction(X1,X2)
<=> ! [X4,X5] :
( in(ordered_pair(X4,X5),X3)
<=> ( in(ordered_pair(X4,X5),X2)
& in(X5,X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d12_relat_1) ).
fof(dt_k8_relat_1,axiom,
! [X1,X2] :
( relation(X2)
=> relation(relation_rng_restriction(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k8_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(t117_relat_1,conjecture,
! [X1,X2] :
( relation(X2)
=> subset(relation_rng_restriction(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t117_relat_1) ).
fof(c_0_4,plain,
! [X21,X22,X23,X24,X25,X26,X27] :
( ( ~ relation(X22)
| ~ relation(X23)
| X23 = relation_rng_restriction(X21,X22)
| in(ordered_pair(esk4_3(X21,X22,X23),esk5_3(X21,X22,X23)),X23)
| in(ordered_pair(esk4_3(X21,X22,X23),esk5_3(X21,X22,X23)),X22) )
& ( ~ relation(X22)
| ~ relation(X23)
| X23 = relation_rng_restriction(X21,X22)
| in(ordered_pair(esk4_3(X21,X22,X23),esk5_3(X21,X22,X23)),X23)
| in(esk5_3(X21,X22,X23),X21) )
& ( ~ relation(X22)
| ~ relation(X23)
| X23 = relation_rng_restriction(X21,X22)
| ~ in(ordered_pair(esk4_3(X21,X22,X23),esk5_3(X21,X22,X23)),X22)
| ~ in(esk5_3(X21,X22,X23),X21)
| ~ in(ordered_pair(esk4_3(X21,X22,X23),esk5_3(X21,X22,X23)),X23) )
& ( ~ relation(X22)
| ~ relation(X23)
| X23 != relation_rng_restriction(X21,X22)
| in(ordered_pair(X26,X27),X23)
| ~ in(ordered_pair(X26,X27),X22)
| ~ in(X27,X21) )
& ( ~ relation(X22)
| ~ relation(X23)
| X23 != relation_rng_restriction(X21,X22)
| ~ in(ordered_pair(X24,X25),X23)
| in(ordered_pair(X24,X25),X22) )
& ( ~ relation(X22)
| ~ relation(X23)
| X23 != relation_rng_restriction(X21,X22)
| ~ in(ordered_pair(X24,X25),X23)
| in(X25,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)],[d12_relat_1])])])])])])]) ).
fof(c_0_5,plain,
! [X30,X31] :
( relation(relation_rng_restriction(X30,X31))
| ~ relation(X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relat_1])])]) ).
cnf(c_0_6,plain,
( ~ relation(X3)
| ~ relation(X4)
| X4 != relation_rng_restriction(X5,X3)
| ~ 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_rng_restriction(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X58,X59,X60,X61] :
( ( ~ relation(X58)
| ~ relation(X59)
| subset(X58,X59)
| ~ in(ordered_pair(esk12_2(X58,X59),esk13_2(X58,X59)),X59) )
& ( ~ relation(X58)
| ~ relation(X59)
| subset(X58,X59)
| in(ordered_pair(esk12_2(X58,X59),esk13_2(X58,X59)),X58) )
& ( ~ relation(X58)
| ~ relation(X59)
| in(ordered_pair(X60,X61),X59)
| ~ in(ordered_pair(X60,X61),X58)
| ~ subset(X58,X59) ) ),
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_rng_restriction(X1,X2),X2) ),
inference(assume_negation,[status(cth)],[t117_relat_1]) ).
cnf(c_0_10,plain,
( ~ in(ordered_pair(X1,X2),relation_rng_restriction(X4,X3))
| ~ 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(esk12_2(X1,X2),esk13_2(X1,X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
( ~ subset(relation_rng_restriction(esk1_0,esk2_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(esk12_2(X1,X2),esk13_2(X1,X2)),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ relation(X3)
| ~ relation(X2)
| in(ordered_pair(esk12_2(relation_rng_restriction(X1,X2),X3),esk13_2(relation_rng_restriction(X1,X2),X3)),X2)
| subset(relation_rng_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_rng_restriction(esk1_0,esk2_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ relation(X2)
| subset(relation_rng_restriction(X1,X2),X2) ),
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.03 % Problem : SEU199+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.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 05:57:10 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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
% 113.23/16.96 % Version: 3.5.1
% 113.23/16.96 % Preprocessing class: FSLSSMSSSSSNFFN.
% 113.23/16.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 113.23/16.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 113.23/16.96 % Starting new_bool_3 with 300s (1) cores
% 113.23/16.96 % Starting new_bool_1 with 300s (1) cores
% 113.23/16.96 % Starting sh5l with 300s (1) cores
% 113.23/16.96 % new_bool_1 with pid 1122333 completed with status 0
% 113.23/16.96 % Result found by new_bool_1
% 113.23/16.96 % Preprocessing class: FSLSSMSSSSSNFFN.
% 113.23/16.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 113.23/16.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 113.23/16.96 % Starting new_bool_3 with 300s (1) cores
% 113.23/16.96 % Starting new_bool_1 with 300s (1) cores
% 113.23/16.96 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 113.23/16.96 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 113.23/16.96 % Search class: FGHSM-FFMM31-SFFFFFNN
% 113.23/16.96 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 113.23/16.96 % Starting SubtermCWHack with 28s (1) cores
% 113.23/16.96 % SubtermCWHack with pid 1122336 completed with status 0
% 113.23/16.96 % Result found by SubtermCWHack
% 113.23/16.96 % Preprocessing class: FSLSSMSSSSSNFFN.
% 113.23/16.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 113.23/16.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 113.23/16.96 % Starting new_bool_3 with 300s (1) cores
% 113.23/16.96 % Starting new_bool_1 with 300s (1) cores
% 113.23/16.96 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 113.23/16.96 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 113.23/16.96 % Search class: FGHSM-FFMM31-SFFFFFNN
% 113.23/16.96 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 113.23/16.96 % Starting SubtermCWHack with 28s (1) cores
% 113.23/16.96 % Preprocessing time : 0.003 s
% 113.23/16.96
% 113.23/16.96 % Proof found!
% 113.23/16.96 % SZS status Theorem
% 113.23/16.96 % SZS output start CNFRefutation
% See solution above
% 113.23/16.96 % Parsed axioms : 192
% 113.23/16.96 % Removed by relevancy pruning/SinE : 140
% 113.23/16.96 % Initial clauses : 99
% 113.23/16.96 % Removed in clause preprocessing : 2
% 113.23/16.96 % Initial clauses in saturation : 97
% 113.23/16.96 % Processed clauses : 58446
% 113.23/16.96 % ...of these trivial : 4
% 113.23/16.96 % ...subsumed : 55324
% 113.23/16.96 % ...remaining for further processing : 3118
% 113.23/16.96 % Other redundant clauses eliminated : 36
% 113.23/16.96 % Clauses deleted for lack of memory : 0
% 113.23/16.96 % Backward-subsumed : 562
% 113.23/16.96 % Backward-rewritten : 21
% 113.23/16.96 % Generated clauses : 1214301
% 113.23/16.96 % ...of the previous two non-redundant : 1137408
% 113.23/16.96 % ...aggressively subsumed : 0
% 113.23/16.96 % Contextual simplify-reflections : 354
% 113.23/16.96 % Paramodulations : 1214233
% 113.23/16.96 % Factorizations : 27
% 113.23/16.96 % NegExts : 0
% 113.23/16.96 % Equation resolutions : 38
% 113.23/16.96 % Disequality decompositions : 0
% 113.23/16.96 % Total rewrite steps : 395587
% 113.23/16.96 % ...of those cached : 395134
% 113.23/16.96 % Propositional unsat checks : 0
% 113.23/16.96 % Propositional check models : 0
% 113.23/16.96 % Propositional check unsatisfiable : 0
% 113.23/16.96 % Propositional clauses : 0
% 113.23/16.96 % Propositional clauses after purity: 0
% 113.23/16.96 % Propositional unsat core size : 0
% 113.23/16.96 % Propositional preprocessing time : 0.000
% 113.23/16.96 % Propositional encoding time : 0.000
% 113.23/16.96 % Propositional solver time : 0.000
% 113.23/16.96 % Success case prop preproc time : 0.000
% 113.23/16.96 % Success case prop encoding time : 0.000
% 113.23/16.96 % Success case prop solver time : 0.000
% 113.23/16.96 % Current number of processed clauses : 2518
% 113.23/16.96 % Positive orientable unit clauses : 24
% 113.23/16.96 % Positive unorientable unit clauses: 0
% 113.23/16.96 % Negative unit clauses : 18
% 113.23/16.96 % Non-unit-clauses : 2476
% 113.23/16.96 % Current number of unprocessed clauses: 1057200
% 113.23/16.96 % ...number of literals in the above : 5381516
% 113.23/16.96 % Current number of archived formulas : 0
% 113.23/16.96 % Current number of archived clauses : 586
% 113.23/16.96 % Clause-clause subsumption calls (NU) : 2973752
% 113.23/16.96 % Rec. Clause-clause subsumption calls : 1851749
% 113.23/16.96 % Non-unit clause-clause subsumptions : 39449
% 113.23/16.96 % Unit Clause-clause subsumption calls : 415
% 113.23/16.96 % Rewrite failures with RHS unbound : 0
% 113.23/16.96 % BW rewrite match attempts : 11
% 113.23/16.96 % BW rewrite match successes : 10
% 113.23/16.96 % Condensation attempts : 0
% 113.23/16.96 % Condensation successes : 0
% 113.23/16.96 % Termbank termtop insertions : 19117586
% 113.23/16.96 % Search garbage collected termcells : 2431
% 113.23/16.96
% 113.23/16.96 % -------------------------------------------------
% 113.23/16.96 % User time : 15.450 s
% 113.23/16.96 % System time : 0.688 s
% 113.23/16.96 % Total time : 16.138 s
% 113.23/16.96 % Maximum resident set size: 4024 pages
% 113.23/16.96
% 113.23/16.96 % -------------------------------------------------
% 113.23/16.96 % User time : 15.455 s
% 113.23/16.96 % System time : 0.695 s
% 113.23/16.96 % Total time : 16.149 s
% 113.23/16.96 % Maximum resident set size: 5120 pages
% 113.23/16.96 % E exiting
%------------------------------------------------------------------------------