%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU045+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:23:43 PM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 136 ( 23 equ)
% Maximal formula atoms : 79 ( 7 avg)
% Number of connectives : 196 ( 78 ~; 86 |; 21 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 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 : 36 ( 3 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t87_funct_1,conjecture,
! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X2,relation_dom(relation_rng_restriction(X1,X3)))
=> apply(relation_rng_restriction(X1,X3),X2) = apply(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t87_funct_1) ).
fof(t85_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( X2 = relation_rng_restriction(X1,X3)
<=> ( ! [X4] :
( in(X4,relation_dom(X2))
=> apply(X2,X4) = apply(X3,X4) )
& ! [X4] :
( in(X4,relation_dom(X2))
<=> ( in(apply(X3,X4),X1)
& in(X4,relation_dom(X3)) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t85_funct_1) ).
fof(dt_k8_relat_1,axiom,
! [X1,X2] :
( relation(X2)
=> relation(relation_rng_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k8_relat_1) ).
fof(fc5_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( function(relation_rng_restriction(X1,X2))
& relation(relation_rng_restriction(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc5_funct_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X2,relation_dom(relation_rng_restriction(X1,X3)))
=> apply(relation_rng_restriction(X1,X3),X2) = apply(X3,X2) ) ),
inference(assume_negation,[status(cth)],[t87_funct_1]) ).
fof(c_0_5,plain,
! [X8,X9,X10,X11,X12,X13] :
( ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 = relation_rng_restriction(X8,X10)
| in(esk4_3(X8,X9,X10),relation_dom(X9))
| in(apply(X10,esk4_3(X8,X9,X10)),X8)
| apply(X9,esk5_3(X8,X9,X10)) != apply(X10,esk5_3(X8,X9,X10)) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 = relation_rng_restriction(X8,X10)
| in(esk4_3(X8,X9,X10),relation_dom(X9))
| in(apply(X10,esk4_3(X8,X9,X10)),X8)
| in(esk5_3(X8,X9,X10),relation_dom(X9)) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 = relation_rng_restriction(X8,X10)
| in(esk4_3(X8,X9,X10),relation_dom(X9))
| in(esk4_3(X8,X9,X10),relation_dom(X10))
| apply(X9,esk5_3(X8,X9,X10)) != apply(X10,esk5_3(X8,X9,X10)) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 = relation_rng_restriction(X8,X10)
| in(esk4_3(X8,X9,X10),relation_dom(X9))
| in(esk4_3(X8,X9,X10),relation_dom(X10))
| in(esk5_3(X8,X9,X10),relation_dom(X9)) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 = relation_rng_restriction(X8,X10)
| ~ in(apply(X10,esk4_3(X8,X9,X10)),X8)
| ~ in(esk4_3(X8,X9,X10),relation_dom(X10))
| ~ in(esk4_3(X8,X9,X10),relation_dom(X9))
| apply(X9,esk5_3(X8,X9,X10)) != apply(X10,esk5_3(X8,X9,X10)) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 = relation_rng_restriction(X8,X10)
| ~ in(apply(X10,esk4_3(X8,X9,X10)),X8)
| ~ in(esk4_3(X8,X9,X10),relation_dom(X10))
| ~ in(esk4_3(X8,X9,X10),relation_dom(X9))
| in(esk5_3(X8,X9,X10),relation_dom(X9)) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 != relation_rng_restriction(X8,X10)
| apply(X9,X13) = apply(X10,X13)
| ~ in(X13,relation_dom(X9)) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 != relation_rng_restriction(X8,X10)
| in(X12,relation_dom(X9))
| ~ in(apply(X10,X12),X8)
| ~ in(X12,relation_dom(X10)) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 != relation_rng_restriction(X8,X10)
| ~ in(X11,relation_dom(X9))
| in(apply(X10,X11),X8) )
& ( ~ function(X9)
| ~ relation(X9)
| ~ function(X10)
| ~ relation(X10)
| X9 != relation_rng_restriction(X8,X10)
| ~ in(X11,relation_dom(X9))
| in(X11,relation_dom(X10)) ) ),
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)],[t85_funct_1])])])])])])]) ).
fof(c_0_6,plain,
! [X16,X17] :
( relation(relation_rng_restriction(X16,X17))
| ~ relation(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k8_relat_1])])]) ).
fof(c_0_7,plain,
! [X18,X19] :
( ( ~ function(X19)
| ~ relation(X19)
| function(relation_rng_restriction(X18,X19)) )
& ( ~ function(X19)
| ~ relation(X19)
| relation(relation_rng_restriction(X18,X19)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc5_funct_1])])])]) ).
fof(c_0_8,negated_conjecture,
( apply(relation_rng_restriction(esk1_0,esk3_0),esk2_0) != apply(esk3_0,esk2_0)
& in(esk2_0,relation_dom(relation_rng_restriction(esk1_0,esk3_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_rng_restriction(X4,X3)
| ~ 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_rng_restriction(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ function(X2)
| ~ relation(X2)
| function(relation_rng_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
apply(relation_rng_restriction(esk1_0,esk3_0),esk2_0) != apply(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ relation(X2)
| ~ function(X2)
| ~ in(X3,relation_dom(relation_rng_restriction(X1,X2)))
| apply(relation_rng_restriction(X1,X2),X3) = apply(X2,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_rng_restriction(esk1_0,esk3_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 : SEU045+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n011.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 05:47:56 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % new_bool_1 with pid 1102623 completed with status 0
% 0.12/0.45 % Result found by new_bool_1
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGHSS-FFMM31-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.45 % SubtermCWHack with pid 1102627 completed with status 0
% 0.12/0.45 % Result found by SubtermCWHack
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGHSS-FFMM31-SFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Theorem
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 34
% 0.12/0.45 % Removed by relevancy pruning/SinE : 9
% 0.12/0.45 % Initial clauses : 46
% 0.12/0.45 % Removed in clause preprocessing : 0
% 0.12/0.45 % Initial clauses in saturation : 46
% 0.12/0.45 % Processed clauses : 242
% 0.12/0.45 % ...of these trivial : 0
% 0.12/0.45 % ...subsumed : 105
% 0.12/0.45 % ...remaining for further processing : 137
% 0.12/0.45 % Other redundant clauses eliminated : 4
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 2
% 0.12/0.45 % Backward-rewritten : 14
% 0.12/0.45 % Generated clauses : 617
% 0.12/0.45 % ...of the previous two non-redundant : 508
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 6
% 0.12/0.45 % Paramodulations : 611
% 0.12/0.45 % Factorizations : 0
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 6
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 240
% 0.12/0.45 % ...of those cached : 220
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 117
% 0.12/0.45 % Positive orientable unit clauses : 20
% 0.12/0.45 % Positive unorientable unit clauses: 0
% 0.12/0.45 % Negative unit clauses : 11
% 0.12/0.45 % Non-unit-clauses : 86
% 0.12/0.45 % Current number of unprocessed clauses: 297
% 0.12/0.45 % ...number of literals in the above : 1219
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 16
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 1938
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 1461
% 0.12/0.45 % Non-unit clause-clause subsumptions : 107
% 0.12/0.45 % Unit Clause-clause subsumption calls : 115
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 4
% 0.12/0.45 % BW rewrite match successes : 4
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 10309
% 0.12/0.45 % Search garbage collected termcells : 616
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.012 s
% 0.12/0.45 % System time : 0.002 s
% 0.12/0.45 % Total time : 0.014 s
% 0.12/0.45 % Maximum resident set size: 3632 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.015 s
% 0.12/0.45 % System time : 0.005 s
% 0.12/0.45 % Total time : 0.020 s
% 0.12/0.45 % Maximum resident set size: 4608 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------