%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU245+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 : n016.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:26 PM UTC 2026
% Result : Theorem 0.23s 0.57s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 91 ( 13 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 106 ( 42 ~; 46 |; 11 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 55 ( 5 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(d6_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] : relation_restriction(X1,X2) = set_intersection2(X1,cartesian_product2(X2,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d6_wellord1) ).
fof(t16_wellord1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,cartesian_product2(X2,X2))
& in(X1,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_wellord1) ).
fof(c_0_3,plain,
! [X36,X37,X38,X39,X40,X41,X42,X43] :
( ( X43 = set_intersection2(X41,X42)
| in(esk10_3(X41,X42,X43),X43)
| in(esk10_3(X41,X42,X43),X42) )
& ( X43 = set_intersection2(X41,X42)
| in(esk10_3(X41,X42,X43),X43)
| in(esk10_3(X41,X42,X43),X41) )
& ( X43 = set_intersection2(X41,X42)
| ~ in(esk10_3(X41,X42,X43),X42)
| ~ in(esk10_3(X41,X42,X43),X41)
| ~ in(esk10_3(X41,X42,X43),X43) )
& ( X38 != set_intersection2(X36,X37)
| in(X40,X38)
| ~ in(X40,X37)
| ~ in(X40,X36) )
& ( X38 != set_intersection2(X36,X37)
| ~ in(X39,X38)
| in(X39,X37) )
& ( X38 != set_intersection2(X36,X37)
| ~ in(X39,X38)
| in(X39,X36) ) ),
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])])])])])])]) ).
cnf(c_0_4,plain,
( X3 != set_intersection2(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
! [X31,X32] :
( relation_restriction(X31,X32) = set_intersection2(X31,cartesian_product2(X32,X32))
| ~ relation(X31) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d6_wellord1])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,cartesian_product2(X2,X2))
& in(X1,X3) ) ) ),
inference(assume_negation,[status(cth)],[t16_wellord1]) ).
cnf(c_0_7,plain,
( X4 != set_intersection2(X2,X3)
| ~ in(X1,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( ~ in(X1,set_intersection2(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( ~ relation(X1)
| relation_restriction(X1,X2) = set_intersection2(X1,cartesian_product2(X2,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
( ( in(esk7_0,relation_restriction(esk9_0,esk8_0))
| in(esk7_0,cartesian_product2(esk8_0,esk8_0)) )
& ( in(esk7_0,relation_restriction(esk9_0,esk8_0))
| in(esk7_0,esk9_0) )
& ( ~ in(esk7_0,cartesian_product2(esk8_0,esk8_0))
| ~ in(esk7_0,esk9_0)
| ~ in(esk7_0,relation_restriction(esk9_0,esk8_0)) )
& relation(esk9_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_11,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ relation(X2)
| ~ in(X1,relation_restriction(X2,X3))
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( in(esk7_0,relation_restriction(esk9_0,esk8_0))
| in(esk7_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
relation(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ relation(X2)
| ~ in(X1,X2)
| ~ in(X1,cartesian_product2(X3,X3))
| in(X1,relation_restriction(X2,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( in(esk7_0,relation_restriction(esk9_0,esk8_0))
| in(esk7_0,cartesian_product2(esk8_0,esk8_0)) ),
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_3]) ).
cnf(c_0_18,negated_conjecture,
( ~ in(esk7_0,cartesian_product2(esk8_0,esk8_0))
| ~ in(esk7_0,esk9_0)
| ~ in(esk7_0,relation_restriction(esk9_0,esk8_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
in(esk7_0,esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_20,negated_conjecture,
( ~ relation(X1)
| ~ in(esk7_0,X1)
| in(esk7_0,relation_restriction(X1,esk8_0))
| in(esk7_0,relation_restriction(esk9_0,esk8_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ in(X1,set_intersection2(X3,X2))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( ~ in(esk7_0,cartesian_product2(esk8_0,esk8_0))
| ~ in(esk7_0,relation_restriction(esk9_0,esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
in(esk7_0,relation_restriction(esk9_0,esk8_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_14])]) ).
cnf(c_0_24,plain,
( ~ relation(X3)
| ~ in(X1,relation_restriction(X3,X2))
| in(X1,cartesian_product2(X2,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_25,negated_conjecture,
~ in(esk7_0,cartesian_product2(esk8_0,esk8_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_14])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU245+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 % Computer : n016.cluster.edu
% 0.14/0.42 % Model : x86_64 x86_64
% 0.14/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.42 % Memory : 8046.5625MB
% 0.14/0.42 % OS : Linux 6.8.0-71-generic
% 0.14/0.42 % CPULimit : 300
% 0.14/0.42 % WCLimit : 300
% 0.14/0.42 % DateTime : Mon Sep 21 06:07:52 UTC 2026
% 0.14/0.43 % CPUTime :
% 0.14/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 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.23/0.57 % Version: 3.5.1
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 % Starting sh5l with 300s (1) cores
% 0.23/0.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1721711 completed with status 0
% 0.23/0.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.57 % No SInE strategy applied
% 0.23/0.57 % Search class: FGHSM-FFMM32-SFFFFFNN
% 0.23/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.57 % Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 316s (1) cores
% 0.23/0.57 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.57 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.23/0.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1721717 completed with status 0
% 0.23/0.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.57 % No SInE strategy applied
% 0.23/0.57 % Search class: FGHSM-FFMM32-SFFFFFNN
% 0.23/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.57 % Preprocessing time : 0.002 s
% 0.23/0.57 % Presaturation interreduction done
% 0.23/0.57
% 0.23/0.57 % Proof found!
% 0.23/0.57 % SZS status Theorem
% 0.23/0.57 % SZS output start CNFRefutation
% See solution above
% 0.23/0.58 % Parsed axioms : 26
% 0.23/0.58 % Removed by relevancy pruning/SinE : 0
% 0.23/0.58 % Initial clauses : 41
% 0.23/0.58 % Removed in clause preprocessing : 6
% 0.23/0.58 % Initial clauses in saturation : 35
% 0.23/0.58 % Processed clauses : 150
% 0.23/0.58 % ...of these trivial : 1
% 0.23/0.58 % ...subsumed : 34
% 0.23/0.58 % ...remaining for further processing : 114
% 0.23/0.58 % Other redundant clauses eliminated : 3
% 0.23/0.58 % Clauses deleted for lack of memory : 0
% 0.23/0.58 % Backward-subsumed : 1
% 0.23/0.58 % Backward-rewritten : 14
% 0.23/0.58 % Generated clauses : 191
% 0.23/0.58 % ...of the previous two non-redundant : 166
% 0.23/0.58 % ...aggressively subsumed : 0
% 0.23/0.58 % Contextual simplify-reflections : 2
% 0.23/0.58 % Paramodulations : 184
% 0.23/0.58 % Factorizations : 4
% 0.23/0.58 % NegExts : 0
% 0.23/0.58 % Equation resolutions : 3
% 0.23/0.58 % Disequality decompositions : 0
% 0.23/0.58 % Total rewrite steps : 49
% 0.23/0.58 % ...of those cached : 36
% 0.23/0.58 % Propositional unsat checks : 0
% 0.23/0.58 % Propositional check models : 0
% 0.23/0.58 % Propositional check unsatisfiable : 0
% 0.23/0.58 % Propositional clauses : 0
% 0.23/0.58 % Propositional clauses after purity: 0
% 0.23/0.58 % Propositional unsat core size : 0
% 0.23/0.58 % Propositional preprocessing time : 0.000
% 0.23/0.58 % Propositional encoding time : 0.000
% 0.23/0.58 % Propositional solver time : 0.000
% 0.23/0.58 % Success case prop preproc time : 0.000
% 0.23/0.58 % Success case prop encoding time : 0.000
% 0.23/0.58 % Success case prop solver time : 0.000
% 0.23/0.58 % Current number of processed clauses : 61
% 0.23/0.58 % Positive orientable unit clauses : 18
% 0.23/0.58 % Positive unorientable unit clauses: 1
% 0.23/0.58 % Negative unit clauses : 6
% 0.23/0.58 % Non-unit-clauses : 36
% 0.23/0.58 % Current number of unprocessed clauses: 86
% 0.23/0.58 % ...number of literals in the above : 287
% 0.23/0.58 % Current number of archived formulas : 0
% 0.23/0.58 % Current number of archived clauses : 50
% 0.23/0.58 % Clause-clause subsumption calls (NU) : 562
% 0.23/0.58 % Rec. Clause-clause subsumption calls : 421
% 0.23/0.58 % Non-unit clause-clause subsumptions : 27
% 0.23/0.58 % Unit Clause-clause subsumption calls : 49
% 0.23/0.58 % Rewrite failures with RHS unbound : 0
% 0.23/0.58 % BW rewrite match attempts : 14
% 0.23/0.58 % BW rewrite match successes : 12
% 0.23/0.58 % Condensation attempts : 0
% 0.23/0.58 % Condensation successes : 0
% 0.23/0.58 % Termbank termtop insertions : 4192
% 0.23/0.58 % Search garbage collected termcells : 408
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.015 s
% 0.23/0.58 % System time : 0.007 s
% 0.23/0.58 % Total time : 0.022 s
% 0.23/0.58 % Maximum resident set size: 3648 pages
% 0.23/0.58
% 0.23/0.58 % -------------------------------------------------
% 0.23/0.58 % User time : 0.094 s
% 0.23/0.58 % System time : 0.019 s
% 0.23/0.58 % Total time : 0.113 s
% 0.23/0.58 % Maximum resident set size: 4864 pages
% 0.23/0.58 % E exiting
%------------------------------------------------------------------------------