%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU224+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:20 PM UTC 2026
% Result : Theorem 0.07s 0.35s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 142 ( 28 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 176 ( 69 ~; 72 |; 23 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 70 ( 6 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l82_funct_1,conjecture,
! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X2,relation_dom(relation_dom_restriction(X3,X1)))
<=> ( in(X2,X1)
& in(X2,relation_dom(X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l82_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/sandbox2/benchmark/theBenchmark.p',t68_funct_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/sandbox2/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(dt_k7_relat_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X2,relation_dom(relation_dom_restriction(X3,X1)))
<=> ( in(X2,X1)
& in(X2,relation_dom(X3)) ) ) ),
inference(assume_negation,[status(cth)],[l82_funct_1]) ).
fof(c_0_7,plain,
! [X50,X51,X52,X53] :
( ( ~ function(X51)
| ~ relation(X51)
| ~ function(X52)
| ~ relation(X52)
| X51 = relation_dom_restriction(X52,X50)
| relation_dom(X51) != set_intersection2(relation_dom(X52),X50)
| apply(X51,esk14_3(X50,X51,X52)) != apply(X52,esk14_3(X50,X51,X52)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ function(X52)
| ~ relation(X52)
| X51 = relation_dom_restriction(X52,X50)
| relation_dom(X51) != set_intersection2(relation_dom(X52),X50)
| in(esk14_3(X50,X51,X52),relation_dom(X51)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ function(X52)
| ~ relation(X52)
| X51 != relation_dom_restriction(X52,X50)
| apply(X51,X53) = apply(X52,X53)
| ~ in(X53,relation_dom(X51)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ function(X52)
| ~ relation(X52)
| X51 != relation_dom_restriction(X52,X50)
| relation_dom(X51) = set_intersection2(relation_dom(X52),X50) ) ),
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_8,plain,
! [X29,X30] :
( ( ~ function(X29)
| ~ relation(X29)
| function(relation_dom_restriction(X29,X30)) )
& ( ~ function(X29)
| ~ relation(X29)
| relation(relation_dom_restriction(X29,X30)) ) ),
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_9,plain,
! [X21,X22] :
( relation(relation_dom_restriction(X21,X22))
| ~ relation(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_relat_1])])]) ).
fof(c_0_10,plain,
! [X12,X13,X14,X15,X16,X17,X18,X19] :
( ( X19 = set_intersection2(X17,X18)
| in(esk1_3(X17,X18,X19),X19)
| in(esk1_3(X17,X18,X19),X18) )
& ( X19 = set_intersection2(X17,X18)
| in(esk1_3(X17,X18,X19),X19)
| in(esk1_3(X17,X18,X19),X17) )
& ( X19 = set_intersection2(X17,X18)
| ~ in(esk1_3(X17,X18,X19),X18)
| ~ in(esk1_3(X17,X18,X19),X17)
| ~ in(esk1_3(X17,X18,X19),X19) )
& ( X14 != set_intersection2(X12,X13)
| in(X16,X14)
| ~ in(X16,X13)
| ~ in(X16,X12) )
& ( X14 != set_intersection2(X12,X13)
| ~ in(X15,X14)
| in(X15,X13) )
& ( X14 != set_intersection2(X12,X13)
| ~ in(X15,X14)
| in(X15,X12) ) ),
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)],[d3_xboole_0])])])])])])]) ).
fof(c_0_11,negated_conjecture,
( ( in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0)))
| in(esk4_0,esk3_0) )
& ( in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0)))
| in(esk4_0,relation_dom(esk5_0)) )
& ( ~ in(esk4_0,esk3_0)
| ~ in(esk4_0,relation_dom(esk5_0))
| ~ in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))) )
& function(esk5_0)
& relation(esk5_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_6])])])])]) ).
cnf(c_0_12,plain,
( ~ function(X1)
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| X1 != relation_dom_restriction(X2,X3)
| relation_dom(X1) = set_intersection2(relation_dom(X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ function(X1)
| ~ relation(X1)
| function(relation_dom_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ relation(X1)
| relation(relation_dom_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X10,X11] : set_intersection2(X10,X11) = set_intersection2(X11,X10),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_16,plain,
( X3 != set_intersection2(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( X3 != set_intersection2(X4,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
( ~ in(esk4_0,esk3_0)
| ~ in(esk4_0,relation_dom(esk5_0))
| ~ in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ function(X1)
| ~ relation(X1)
| relation_dom(relation_dom_restriction(X1,X2)) = set_intersection2(relation_dom(X1),X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_12]),c_0_13]),c_0_14]) ).
cnf(c_0_20,negated_conjecture,
relation(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
function(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( ~ in(X1,set_intersection2(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( ~ in(X1,set_intersection2(X3,X2))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( X4 != set_intersection2(X2,X3)
| ~ in(X1,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,negated_conjecture,
~ in(esk4_0,set_intersection2(esk3_0,relation_dom(esk5_0))),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),c_0_22]),c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0)))
| in(esk4_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
( ~ in(esk4_0,esk3_0)
| ~ in(esk4_0,relation_dom(esk5_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
in(esk4_0,esk3_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_19]),c_0_20]),c_0_21])]),c_0_22]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0)))
| in(esk4_0,relation_dom(esk5_0)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,negated_conjecture,
~ in(esk4_0,relation_dom(esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
in(esk4_0,relation_dom(relation_dom_restriction(esk5_0,esk3_0))),
inference(sr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_19]),c_0_22]),c_0_20]),c_0_21])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU224+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Mon Sep 21 06:00:01 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.35 % Version: 3.5.1
% 0.07/0.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.35 % Starting sh5l with 300s (1) cores
% 0.07/0.35 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1701534 completed with status 0
% 0.07/0.35 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.07/0.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.35 % No SInE strategy applied
% 0.07/0.35 % Search class: FGHSM-FFMM32-SFFFFFNN
% 0.07/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.07/0.35 % Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 316s (1) cores
% 0.07/0.35 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.07/0.35 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.07/0.35 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1701541 completed with status 0
% 0.07/0.35 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.07/0.35 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.35 % No SInE strategy applied
% 0.07/0.35 % Search class: FGHSM-FFMM32-SFFFFFNN
% 0.07/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.35 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.07/0.35 % Preprocessing time : 0.001 s
% 0.07/0.35 % Presaturation interreduction done
% 0.07/0.35
% 0.07/0.35 % Proof found!
% 0.07/0.35 % SZS status Theorem
% 0.07/0.35 % SZS output start CNFRefutation
% See solution above
% 0.07/0.35 % Parsed axioms : 38
% 0.07/0.35 % Removed by relevancy pruning/SinE : 0
% 0.07/0.35 % Initial clauses : 66
% 0.07/0.35 % Removed in clause preprocessing : 7
% 0.07/0.35 % Initial clauses in saturation : 59
% 0.07/0.35 % Processed clauses : 158
% 0.07/0.35 % ...of these trivial : 4
% 0.07/0.35 % ...subsumed : 15
% 0.07/0.35 % ...remaining for further processing : 139
% 0.07/0.35 % Other redundant clauses eliminated : 5
% 0.07/0.35 % Clauses deleted for lack of memory : 0
% 0.07/0.35 % Backward-subsumed : 3
% 0.07/0.35 % Backward-rewritten : 13
% 0.07/0.35 % Generated clauses : 139
% 0.07/0.35 % ...of the previous two non-redundant : 112
% 0.07/0.35 % ...aggressively subsumed : 0
% 0.07/0.35 % Contextual simplify-reflections : 11
% 0.07/0.35 % Paramodulations : 128
% 0.07/0.35 % Factorizations : 4
% 0.07/0.35 % NegExts : 0
% 0.07/0.35 % Equation resolutions : 6
% 0.07/0.35 % Disequality decompositions : 0
% 0.07/0.35 % Total rewrite steps : 70
% 0.07/0.35 % ...of those cached : 54
% 0.07/0.35 % Propositional unsat checks : 0
% 0.07/0.35 % Propositional check models : 0
% 0.07/0.35 % Propositional check unsatisfiable : 0
% 0.07/0.35 % Propositional clauses : 0
% 0.07/0.35 % Propositional clauses after purity: 0
% 0.07/0.35 % Propositional unsat core size : 0
% 0.07/0.35 % Propositional preprocessing time : 0.000
% 0.07/0.35 % Propositional encoding time : 0.000
% 0.07/0.35 % Propositional solver time : 0.000
% 0.07/0.35 % Success case prop preproc time : 0.000
% 0.07/0.35 % Success case prop encoding time : 0.000
% 0.07/0.35 % Success case prop solver time : 0.000
% 0.07/0.35 % Current number of processed clauses : 63
% 0.07/0.35 % Positive orientable unit clauses : 23
% 0.07/0.35 % Positive unorientable unit clauses: 1
% 0.07/0.35 % Negative unit clauses : 6
% 0.07/0.35 % Non-unit-clauses : 33
% 0.07/0.35 % Current number of unprocessed clauses: 63
% 0.07/0.35 % ...number of literals in the above : 230
% 0.07/0.35 % Current number of archived formulas : 0
% 0.07/0.35 % Current number of archived clauses : 71
% 0.07/0.35 % Clause-clause subsumption calls (NU) : 464
% 0.07/0.35 % Rec. Clause-clause subsumption calls : 342
% 0.07/0.35 % Non-unit clause-clause subsumptions : 24
% 0.07/0.35 % Unit Clause-clause subsumption calls : 94
% 0.07/0.35 % Rewrite failures with RHS unbound : 0
% 0.07/0.35 % BW rewrite match attempts : 20
% 0.07/0.35 % BW rewrite match successes : 18
% 0.07/0.35 % Condensation attempts : 0
% 0.07/0.35 % Condensation successes : 0
% 0.07/0.35 % Termbank termtop insertions : 4863
% 0.07/0.35 % Search garbage collected termcells : 653
% 0.07/0.35
% 0.07/0.35 % -------------------------------------------------
% 0.07/0.35 % User time : 0.007 s
% 0.07/0.35 % System time : 0.003 s
% 0.07/0.35 % Total time : 0.010 s
% 0.07/0.35 % Maximum resident set size: 3404 pages
% 0.07/0.35
% 0.07/0.35 % -------------------------------------------------
% 0.07/0.35 % User time : 0.031 s
% 0.07/0.35 % System time : 0.008 s
% 0.07/0.35 % Total time : 0.039 s
% 0.07/0.35 % Maximum resident set size: 4608 pages
% 0.07/0.35 % E exiting
%------------------------------------------------------------------------------