%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU212+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 : n015.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:16 PM UTC 2026
% Result : Theorem 0.33s 0.66s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 115 ( 29 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 146 ( 55 ~; 56 |; 18 &)
% ( 8 <=>; 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 : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 44 ( 2 sgn 25 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_relat_1) ).
fof(t8_funct_1,conjecture,
! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( in(ordered_pair(X1,X2),X3)
<=> ( X2 = apply(X3,X1)
& in(X1,relation_dom(X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_funct_1) ).
fof(d4_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2,X3] :
( ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) )
& ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_funct_1) ).
fof(c_0_3,plain,
! [X13,X14,X15,X17,X18,X19,X21] :
( ( ~ relation(X13)
| X19 = relation_dom(X13)
| in(ordered_pair(esk5_2(X13,X19),esk6_2(X13,X19)),X13)
| in(esk5_2(X13,X19),X19) )
& ( ~ relation(X13)
| X19 = relation_dom(X13)
| ~ in(ordered_pair(esk5_2(X13,X19),X21),X13)
| ~ in(esk5_2(X13,X19),X19) )
& ( ~ relation(X13)
| X14 != relation_dom(X13)
| in(X17,X14)
| ~ in(ordered_pair(X17,X18),X13) )
& ( ~ relation(X13)
| X14 != relation_dom(X13)
| in(ordered_pair(X15,esk4_3(X13,X14,X15)),X13)
| ~ in(X15,X14) ) ),
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)],[d4_relat_1])])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( in(ordered_pair(X1,X2),X3)
<=> ( X2 = apply(X3,X1)
& in(X1,relation_dom(X3)) ) ) ),
inference(assume_negation,[status(cth)],[t8_funct_1]) ).
fof(c_0_5,plain,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2,X3] :
( ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) )
& ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) ) ) ),
inference(fof_simplification,[status(thm)],[d4_funct_1]) ).
cnf(c_0_6,plain,
( ~ relation(X3)
| X4 != relation_dom(X3)
| ~ in(ordered_pair(X1,X2),X3)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_7,negated_conjecture,
( ( in(ordered_pair(esk1_0,esk2_0),esk3_0)
| esk2_0 = apply(esk3_0,esk1_0) )
& ( in(ordered_pair(esk1_0,esk2_0),esk3_0)
| in(esk1_0,relation_dom(esk3_0)) )
& ( esk2_0 != apply(esk3_0,esk1_0)
| ~ in(esk1_0,relation_dom(esk3_0))
| ~ in(ordered_pair(esk1_0,esk2_0),esk3_0) )
& function(esk3_0)
& relation(esk3_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
fof(c_0_8,plain,
! [X8,X9,X10] :
( ( ~ function(X8)
| ~ relation(X8)
| in(X9,relation_dom(X8))
| X10 = apply(X8,X9)
| X10 != empty_set )
& ( ~ function(X8)
| ~ relation(X8)
| in(X9,relation_dom(X8))
| X10 = empty_set
| X10 != apply(X8,X9) )
& ( ~ function(X8)
| ~ relation(X8)
| ~ in(X9,relation_dom(X8))
| X10 = apply(X8,X9)
| ~ in(ordered_pair(X9,X10),X8) )
& ( ~ function(X8)
| ~ relation(X8)
| ~ in(X9,relation_dom(X8))
| in(ordered_pair(X9,X10),X8)
| X10 != apply(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_9,plain,
( ~ in(ordered_pair(X1,X3),X2)
| ~ relation(X2)
| in(X1,relation_dom(X2)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( in(ordered_pair(esk1_0,esk2_0),esk3_0)
| in(esk1_0,relation_dom(esk3_0)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ function(X2)
| ~ relation(X2)
| ~ in(X3,relation_dom(X2))
| X1 != apply(X2,X3)
| in(ordered_pair(X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( esk2_0 != apply(esk3_0,esk1_0)
| ~ in(esk1_0,relation_dom(esk3_0))
| ~ in(ordered_pair(esk1_0,esk2_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
in(esk1_0,relation_dom(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,plain,
( ~ in(X1,relation_dom(X2))
| ~ function(X2)
| ~ relation(X2)
| in(ordered_pair(X1,apply(X2,X1)),X2) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( in(ordered_pair(esk1_0,esk2_0),esk3_0)
| esk2_0 = apply(esk3_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
( ~ function(X3)
| ~ relation(X3)
| ~ in(X1,relation_dom(X3))
| ~ in(ordered_pair(X1,X2),X3)
| X2 = apply(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( ~ in(ordered_pair(esk1_0,esk2_0),esk3_0)
| apply(esk3_0,esk1_0) != esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_20,negated_conjecture,
in(ordered_pair(esk1_0,esk2_0),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_11]),c_0_17]),c_0_14])]) ).
cnf(c_0_21,plain,
( ~ in(ordered_pair(X3,X1),X2)
| ~ function(X2)
| ~ relation(X2)
| X1 = apply(X2,X3) ),
inference(csr,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_22,negated_conjecture,
apply(esk3_0,esk1_0) != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_11]),c_0_17])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU212+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.48 % Computer : n015.cluster.edu
% 0.19/0.48 % Model : x86_64 x86_64
% 0.19/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.48 % Memory : 8046.5625MB
% 0.19/0.48 % OS : Linux 6.8.0-71-generic
% 0.19/0.48 % CPULimit : 300
% 0.19/0.48 % WCLimit : 300
% 0.19/0.48 % DateTime : Mon Sep 21 06:01:36 UTC 2026
% 0.19/0.49 % CPUTime :
% 0.19/0.49 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.57 Running first-order theorem proving
% 0.24/0.57 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.33/0.66 % Version: 3.5.1
% 0.33/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.33/0.66 % Starting sh5l with 300s (1) cores
% 0.33/0.66 % new_bool_1 with pid 716741 completed with status 0
% 0.33/0.66 % Result found by new_bool_1
% 0.33/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.33/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.33/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/0.66 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.33/0.66 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.66 % Starting SubtermCWHack with 28s (1) cores
% 0.33/0.66 % SubtermCWHack with pid 716743 completed with status 0
% 0.33/0.66 % Result found by SubtermCWHack
% 0.33/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.33/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.33/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/0.66 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.33/0.66 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.66 % Starting SubtermCWHack with 28s (1) cores
% 0.33/0.66 % Preprocessing time : 0.002 s
% 0.33/0.66
% 0.33/0.66 % Proof found!
% 0.33/0.66 % SZS status Theorem
% 0.33/0.66 % SZS output start CNFRefutation
% See solution above
% 0.33/0.66 % Parsed axioms : 35
% 0.33/0.66 % Removed by relevancy pruning/SinE : 16
% 0.33/0.66 % Initial clauses : 34
% 0.33/0.66 % Removed in clause preprocessing : 0
% 0.33/0.66 % Initial clauses in saturation : 34
% 0.33/0.66 % Processed clauses : 171
% 0.33/0.66 % ...of these trivial : 1
% 0.33/0.66 % ...subsumed : 95
% 0.33/0.66 % ...remaining for further processing : 74
% 0.33/0.66 % Other redundant clauses eliminated : 5
% 0.33/0.66 % Clauses deleted for lack of memory : 0
% 0.33/0.66 % Backward-subsumed : 6
% 0.33/0.66 % Backward-rewritten : 11
% 0.33/0.66 % Generated clauses : 303
% 0.33/0.66 % ...of the previous two non-redundant : 252
% 0.33/0.66 % ...aggressively subsumed : 0
% 0.33/0.66 % Contextual simplify-reflections : 5
% 0.33/0.66 % Paramodulations : 298
% 0.33/0.66 % Factorizations : 0
% 0.33/0.66 % NegExts : 0
% 0.33/0.66 % Equation resolutions : 5
% 0.33/0.66 % Disequality decompositions : 0
% 0.33/0.66 % Total rewrite steps : 174
% 0.33/0.66 % ...of those cached : 165
% 0.33/0.66 % Propositional unsat checks : 0
% 0.33/0.66 % Propositional check models : 0
% 0.33/0.66 % Propositional check unsatisfiable : 0
% 0.33/0.66 % Propositional clauses : 0
% 0.33/0.66 % Propositional clauses after purity: 0
% 0.33/0.66 % Propositional unsat core size : 0
% 0.33/0.66 % Propositional preprocessing time : 0.000
% 0.33/0.66 % Propositional encoding time : 0.000
% 0.33/0.66 % Propositional solver time : 0.000
% 0.33/0.66 % Success case prop preproc time : 0.000
% 0.33/0.66 % Success case prop encoding time : 0.000
% 0.33/0.66 % Success case prop solver time : 0.000
% 0.33/0.66 % Current number of processed clauses : 52
% 0.33/0.66 % Positive orientable unit clauses : 12
% 0.33/0.66 % Positive unorientable unit clauses: 0
% 0.33/0.66 % Negative unit clauses : 9
% 0.33/0.66 % Non-unit-clauses : 31
% 0.33/0.66 % Current number of unprocessed clauses: 103
% 0.33/0.66 % ...number of literals in the above : 440
% 0.33/0.66 % Current number of archived formulas : 0
% 0.33/0.66 % Current number of archived clauses : 17
% 0.33/0.66 % Clause-clause subsumption calls (NU) : 594
% 0.33/0.66 % Rec. Clause-clause subsumption calls : 500
% 0.33/0.66 % Non-unit clause-clause subsumptions : 74
% 0.33/0.66 % Unit Clause-clause subsumption calls : 33
% 0.33/0.66 % Rewrite failures with RHS unbound : 0
% 0.33/0.66 % BW rewrite match attempts : 5
% 0.33/0.66 % BW rewrite match successes : 5
% 0.33/0.66 % Condensation attempts : 0
% 0.33/0.66 % Condensation successes : 0
% 0.33/0.66 % Termbank termtop insertions : 5243
% 0.33/0.66 % Search garbage collected termcells : 501
% 0.33/0.66
% 0.33/0.66 % -------------------------------------------------
% 0.33/0.66 % User time : 0.018 s
% 0.33/0.66 % System time : 0.006 s
% 0.33/0.66 % Total time : 0.025 s
% 0.33/0.66 % Maximum resident set size: 3652 pages
% 0.33/0.66
% 0.33/0.66 % -------------------------------------------------
% 0.33/0.66 % User time : 0.023 s
% 0.33/0.66 % System time : 0.011 s
% 0.33/0.66 % Total time : 0.034 s
% 0.33/0.66 % Maximum resident set size: 4864 pages
% 0.33/0.66 % E exiting
%------------------------------------------------------------------------------