%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU223+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:20 PM UTC 2026
% Result : Theorem 0.15s 0.67s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 82 ( 19 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 106 ( 42 ~; 40 |; 14 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 33 ( 3 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t70_funct_1,conjecture,
! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X2,relation_dom(relation_dom_restriction(X3,X1)))
=> apply(relation_dom_restriction(X3,X1),X2) = apply(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t70_funct_1) ).
fof(t68_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( X2 = relation_dom_restriction(X3,X1)
<=> ( ! [X4] :
( in(X4,relation_dom(X2))
=> apply(X2,X4) = apply(X3,X4) )
& relation_dom(X2) = set_intersection2(relation_dom(X3),X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t68_funct_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(fc4_funct_1,axiom,
! [X1,X2] :
( ( function(X1)
& relation(X1) )
=> ( function(relation_dom_restriction(X1,X2))
& relation(relation_dom_restriction(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X2,relation_dom(relation_dom_restriction(X3,X1)))
=> apply(relation_dom_restriction(X3,X1),X2) = apply(X3,X2) ) ),
inference(assume_negation,[status(cth)],[t70_funct_1]) ).
fof(c_0_5,plain,
! [X8,X9,X10,X11] :
( ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 = relation_dom_restriction(X10,X8)
| relation_dom(X9) != set_intersection2(relation_dom(X10),X8)
| apply(X9,esk4_3(X8,X9,X10)) != apply(X10,esk4_3(X8,X9,X10)) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 = relation_dom_restriction(X10,X8)
| relation_dom(X9) != set_intersection2(relation_dom(X10),X8)
| in(esk4_3(X8,X9,X10),relation_dom(X9)) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 != relation_dom_restriction(X10,X8)
| apply(X9,X11) = apply(X10,X11)
| ~ in(X11,relation_dom(X9)) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 != relation_dom_restriction(X10,X8)
| relation_dom(X9) = set_intersection2(relation_dom(X10),X8) ) ),
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)],[t68_funct_1])])])])])]) ).
fof(c_0_6,plain,
! [X13,X14] :
( relation(relation_dom_restriction(X13,X14))
| ~ relation(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_relat_1])])]) ).
fof(c_0_7,plain,
! [X15,X16] :
( ( ~ function(X15)
| ~ relation(X15)
| function(relation_dom_restriction(X15,X16)) )
& ( ~ function(X15)
| ~ relation(X15)
| relation(relation_dom_restriction(X15,X16)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc4_funct_1])])])]) ).
fof(c_0_8,negated_conjecture,
( apply(relation_dom_restriction(esk3_0,esk1_0),esk2_0) != apply(esk3_0,esk2_0)
& in(esk2_0,relation_dom(relation_dom_restriction(esk3_0,esk1_0)))
& function(esk3_0)
& relation(esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_9,plain,
( ~ function(X2)
| ~ relation(X2)
| ~ function(X3)
| ~ relation(X3)
| X2 != relation_dom_restriction(X3,X4)
| ~ in(X1,relation_dom(X2))
| apply(X2,X1) = apply(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ relation(X1)
| relation(relation_dom_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ function(X1)
| ~ relation(X1)
| function(relation_dom_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
apply(relation_dom_restriction(esk3_0,esk1_0),esk2_0) != apply(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ relation(X1)
| ~ function(X1)
| ~ in(X3,relation_dom(relation_dom_restriction(X1,X2)))
| apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_9]),c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
in(esk2_0,relation_dom(relation_dom_restriction(esk3_0,esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU223+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.58 % Computer : n009.cluster.edu
% 0.11/0.58 % Model : x86_64 x86_64
% 0.11/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58 % Memory : 8046.5625MB
% 0.11/0.58 % OS : Linux 6.8.0-71-generic
% 0.11/0.58 % CPULimit : 300
% 0.11/0.58 % WCLimit : 300
% 0.11/0.58 % DateTime : Mon Sep 21 05:59:59 UTC 2026
% 0.11/0.59 % CPUTime :
% 0.11/0.59 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.63 Running first-order theorem proving
% 0.15/0.63 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.15/0.67 % Version: 3.5.1
% 0.15/0.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.67 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.67 % Starting sh5l with 300s (1) cores
% 0.15/0.67 % new_bool_3 with pid 1001114 completed with status 0
% 0.15/0.67 % Result found by new_bool_3
% 0.15/0.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.67 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.15/0.67 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.67 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.67 % SubtermCWHack with pid 1001126 completed with status 0
% 0.15/0.67 % Result found by SubtermCWHack
% 0.15/0.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.67 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.15/0.67 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.67 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.67 % Preprocessing time : 0.002 s
% 0.15/0.67
% 0.15/0.67 % Proof found!
% 0.15/0.67 % SZS status Theorem
% 0.15/0.67 % SZS output start CNFRefutation
% See solution above
% 0.15/0.67 % Parsed axioms : 39
% 0.15/0.67 % Removed by relevancy pruning/SinE : 7
% 0.15/0.67 % Initial clauses : 48
% 0.15/0.67 % Removed in clause preprocessing : 0
% 0.15/0.67 % Initial clauses in saturation : 48
% 0.15/0.67 % Processed clauses : 176
% 0.15/0.67 % ...of these trivial : 2
% 0.15/0.67 % ...subsumed : 77
% 0.15/0.67 % ...remaining for further processing : 97
% 0.15/0.67 % Other redundant clauses eliminated : 2
% 0.15/0.67 % Clauses deleted for lack of memory : 0
% 0.15/0.67 % Backward-subsumed : 1
% 0.15/0.67 % Backward-rewritten : 7
% 0.15/0.67 % Generated clauses : 236
% 0.15/0.67 % ...of the previous two non-redundant : 199
% 0.15/0.67 % ...aggressively subsumed : 0
% 0.15/0.67 % Contextual simplify-reflections : 6
% 0.15/0.67 % Paramodulations : 233
% 0.15/0.67 % Factorizations : 0
% 0.15/0.67 % NegExts : 0
% 0.15/0.67 % Equation resolutions : 3
% 0.15/0.67 % Disequality decompositions : 0
% 0.15/0.67 % Total rewrite steps : 50
% 0.15/0.67 % ...of those cached : 33
% 0.15/0.67 % Propositional unsat checks : 0
% 0.15/0.67 % Propositional check models : 0
% 0.15/0.67 % Propositional check unsatisfiable : 0
% 0.15/0.67 % Propositional clauses : 0
% 0.15/0.67 % Propositional clauses after purity: 0
% 0.15/0.67 % Propositional unsat core size : 0
% 0.15/0.67 % Propositional preprocessing time : 0.000
% 0.15/0.67 % Propositional encoding time : 0.000
% 0.15/0.67 % Propositional solver time : 0.000
% 0.15/0.67 % Success case prop preproc time : 0.000
% 0.15/0.67 % Success case prop encoding time : 0.000
% 0.15/0.67 % Success case prop solver time : 0.000
% 0.15/0.67 % Current number of processed clauses : 87
% 0.15/0.67 % Positive orientable unit clauses : 19
% 0.15/0.67 % Positive unorientable unit clauses: 1
% 0.15/0.67 % Negative unit clauses : 8
% 0.15/0.67 % Non-unit-clauses : 59
% 0.15/0.67 % Current number of unprocessed clauses: 67
% 0.15/0.67 % ...number of literals in the above : 277
% 0.15/0.67 % Current number of archived formulas : 0
% 0.15/0.67 % Current number of archived clauses : 8
% 0.15/0.67 % Clause-clause subsumption calls (NU) : 949
% 0.15/0.67 % Rec. Clause-clause subsumption calls : 676
% 0.15/0.67 % Non-unit clause-clause subsumptions : 68
% 0.15/0.67 % Unit Clause-clause subsumption calls : 24
% 0.15/0.67 % Rewrite failures with RHS unbound : 0
% 0.15/0.67 % BW rewrite match attempts : 9
% 0.15/0.67 % BW rewrite match successes : 8
% 0.15/0.67 % Condensation attempts : 0
% 0.15/0.67 % Condensation successes : 0
% 0.15/0.67 % Termbank termtop insertions : 5152
% 0.15/0.67 % Search garbage collected termcells : 491
% 0.15/0.67
% 0.15/0.67 % -------------------------------------------------
% 0.15/0.67 % User time : 0.012 s
% 0.15/0.67 % System time : 0.004 s
% 0.15/0.67 % Total time : 0.016 s
% 0.15/0.67 % Maximum resident set size: 3664 pages
% 0.15/0.67
% 0.15/0.67 % -------------------------------------------------
% 0.15/0.67 % User time : 0.016 s
% 0.15/0.67 % System time : 0.007 s
% 0.15/0.67 % Total time : 0.023 s
% 0.15/0.67 % Maximum resident set size: 4608 pages
% 0.15/0.67 % E exiting
%------------------------------------------------------------------------------