%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU219+1 : 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 : n012.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:18 PM UTC 2026
% Result : Theorem 0.13s 15.46s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 47 ( 20 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 48 ( 18 ~; 13 |; 10 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t55_funct_1,conjecture,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> ( relation_dom(X1) = relation_rng(function_inverse(X1))
& relation_rng(X1) = relation_dom(function_inverse(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_funct_1) ).
fof(d9_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> function_inverse(X1) = relation_inverse(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_funct_1) ).
fof(t37_relat_1,axiom,
! [X1] :
( relation(X1)
=> ( relation_dom(X1) = relation_rng(relation_inverse(X1))
& relation_rng(X1) = relation_dom(relation_inverse(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> ( relation_dom(X1) = relation_rng(function_inverse(X1))
& relation_rng(X1) = relation_dom(function_inverse(X1)) ) ) ),
inference(assume_negation,[status(cth)],[t55_funct_1]) ).
fof(c_0_4,negated_conjecture,
( ( relation_dom(esk1_0) != relation_rng(function_inverse(esk1_0))
| relation_rng(esk1_0) != relation_dom(function_inverse(esk1_0)) )
& one_to_one(esk1_0)
& function(esk1_0)
& relation(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_5,plain,
! [X4] :
( function_inverse(X4) = relation_inverse(X4)
| ~ one_to_one(X4)
| ~ function(X4)
| ~ relation(X4) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_funct_1])])]) ).
cnf(c_0_6,negated_conjecture,
( relation_dom(esk1_0) != relation_rng(function_inverse(esk1_0))
| relation_rng(esk1_0) != relation_dom(function_inverse(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ one_to_one(X1)
| ~ function(X1)
| ~ relation(X1)
| function_inverse(X1) = relation_inverse(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
one_to_one(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
function(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X3] :
( ( ~ relation(X3)
| relation_dom(X3) = relation_rng(relation_inverse(X3)) )
& ( ~ relation(X3)
| relation_rng(X3) = relation_dom(relation_inverse(X3)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_relat_1])])])]) ).
cnf(c_0_12,negated_conjecture,
( relation_rng(relation_inverse(esk1_0)) != relation_dom(esk1_0)
| relation_dom(relation_inverse(esk1_0)) != relation_rng(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_13,plain,
( ~ relation(X1)
| relation_rng(X1) = relation_dom(relation_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
relation_rng(relation_inverse(esk1_0)) != relation_dom(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10])]) ).
cnf(c_0_15,plain,
( ~ relation(X1)
| relation_dom(X1) = relation_rng(relation_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU219+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/15.39 % Computer : n012.cluster.edu
% 0.08/15.39 % Model : x86_64 x86_64
% 0.08/15.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/15.39 % Memory : 8046.5625MB
% 0.08/15.39 % OS : Linux 6.8.0-71-generic
% 0.08/15.39 % CPULimit : 300
% 0.08/15.39 % WCLimit : 300
% 0.08/15.39 % DateTime : Mon Sep 21 05:59:38 UTC 2026
% 0.08/15.39 % CPUTime :
% 0.08/15.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/15.43 Running first-order theorem proving
% 0.13/15.43 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.13/15.46 % Version: 3.5.1
% 0.13/15.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/15.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/15.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/15.46 % Starting new_bool_3 with 300s (1) cores
% 0.13/15.46 % Starting new_bool_1 with 300s (1) cores
% 0.13/15.46 % Starting sh5l with 300s (1) cores
% 0.13/15.46 % new_bool_1 with pid 1700771 completed with status 0
% 0.13/15.46 % Result found by new_bool_1
% 0.13/15.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/15.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/15.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/15.46 % Starting new_bool_3 with 300s (1) cores
% 0.13/15.46 % Starting new_bool_1 with 300s (1) cores
% 0.13/15.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/15.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/15.46 % Search class: FHHSF-FFSM11-SFFFFFNN
% 0.13/15.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/15.46 % Starting SubtermCWHack with 31s (1) cores
% 0.13/15.46 % SubtermCWHack with pid 1700779 completed with status 0
% 0.13/15.46 % Result found by SubtermCWHack
% 0.13/15.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/15.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/15.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/15.46 % Starting new_bool_3 with 300s (1) cores
% 0.13/15.46 % Starting new_bool_1 with 300s (1) cores
% 0.13/15.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/15.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/15.46 % Search class: FHHSF-FFSM11-SFFFFFNN
% 0.13/15.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/15.46 % Starting SubtermCWHack with 31s (1) cores
% 0.13/15.46 % Preprocessing time : 0.001 s
% 0.13/15.46
% 0.13/15.46 % Proof found!
% 0.13/15.46 % SZS status Theorem
% 0.13/15.46 % SZS output start CNFRefutation
% See solution above
% 0.13/15.46 % Parsed axioms : 11
% 0.13/15.46 % Removed by relevancy pruning/SinE : 2
% 0.13/15.46 % Initial clauses : 18
% 0.13/15.46 % Removed in clause preprocessing : 0
% 0.13/15.46 % Initial clauses in saturation : 18
% 0.13/15.46 % Processed clauses : 26
% 0.13/15.46 % ...of these trivial : 0
% 0.13/15.46 % ...subsumed : 5
% 0.13/15.46 % ...remaining for further processing : 21
% 0.13/15.46 % Other redundant clauses eliminated : 0
% 0.13/15.46 % Clauses deleted for lack of memory : 0
% 0.13/15.46 % Backward-subsumed : 1
% 0.13/15.46 % Backward-rewritten : 0
% 0.13/15.46 % Generated clauses : 10
% 0.13/15.46 % ...of the previous two non-redundant : 8
% 0.13/15.46 % ...aggressively subsumed : 0
% 0.13/15.46 % Contextual simplify-reflections : 0
% 0.13/15.46 % Paramodulations : 10
% 0.13/15.46 % Factorizations : 0
% 0.13/15.46 % NegExts : 0
% 0.13/15.46 % Equation resolutions : 0
% 0.13/15.46 % Disequality decompositions : 0
% 0.13/15.46 % Total rewrite steps : 9
% 0.13/15.46 % ...of those cached : 4
% 0.13/15.46 % Propositional unsat checks : 0
% 0.13/15.46 % Propositional check models : 0
% 0.13/15.46 % Propositional check unsatisfiable : 0
% 0.13/15.46 % Propositional clauses : 0
% 0.13/15.46 % Propositional clauses after purity: 0
% 0.13/15.46 % Propositional unsat core size : 0
% 0.13/15.46 % Propositional preprocessing time : 0.000
% 0.13/15.46 % Propositional encoding time : 0.000
% 0.13/15.46 % Propositional solver time : 0.000
% 0.13/15.46 % Success case prop preproc time : 0.000
% 0.13/15.46 % Success case prop encoding time : 0.000
% 0.13/15.46 % Success case prop solver time : 0.000
% 0.13/15.46 % Current number of processed clauses : 20
% 0.13/15.46 % Positive orientable unit clauses : 10
% 0.13/15.46 % Positive unorientable unit clauses: 0
% 0.13/15.46 % Negative unit clauses : 1
% 0.13/15.46 % Non-unit-clauses : 9
% 0.13/15.46 % Current number of unprocessed clauses: 0
% 0.13/15.46 % ...number of literals in the above : 0
% 0.13/15.46 % Current number of archived formulas : 0
% 0.13/15.46 % Current number of archived clauses : 1
% 0.13/15.46 % Clause-clause subsumption calls (NU) : 31
% 0.13/15.46 % Rec. Clause-clause subsumption calls : 17
% 0.13/15.46 % Non-unit clause-clause subsumptions : 5
% 0.13/15.46 % Unit Clause-clause subsumption calls : 2
% 0.13/15.46 % Rewrite failures with RHS unbound : 0
% 0.13/15.46 % BW rewrite match attempts : 0
% 0.13/15.46 % BW rewrite match successes : 0
% 0.13/15.46 % Condensation attempts : 0
% 0.13/15.46 % Condensation successes : 0
% 0.13/15.46 % Termbank termtop insertions : 1030
% 0.13/15.46 % Search garbage collected termcells : 166
% 0.13/15.46
% 0.13/15.46 % -------------------------------------------------
% 0.13/15.46 % User time : 0.004 s
% 0.13/15.46 % System time : 0.002 s
% 0.13/15.46 % Total time : 0.005 s
% 0.13/15.46 % Maximum resident set size: 3636 pages
% 0.13/15.46
% 0.13/15.46 % -------------------------------------------------
% 0.13/15.46 % User time : 0.004 s
% 0.13/15.46 % System time : 0.006 s
% 0.13/15.46 % Total time : 0.010 s
% 0.13/15.46 % Maximum resident set size: 4864 pages
% 0.13/15.46 % E exiting
%------------------------------------------------------------------------------