%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU127+2 : 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 : n008.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:53 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 7 unt; 0 def)
% Number of atoms : 50 ( 8 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 56 ( 21 ~; 23 |; 8 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 35 ( 2 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t17_xboole_1,conjecture,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_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(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] : subset(set_intersection2(X1,X2),X1),
inference(assume_negation,[status(cth)],[t17_xboole_1]) ).
fof(c_0_4,plain,
! [X32,X33,X34,X35,X36,X37,X38,X39] :
( ( X39 = set_intersection2(X37,X38)
| in(esk4_3(X37,X38,X39),X39)
| in(esk4_3(X37,X38,X39),X38) )
& ( X39 = set_intersection2(X37,X38)
| in(esk4_3(X37,X38,X39),X39)
| in(esk4_3(X37,X38,X39),X37) )
& ( X39 = set_intersection2(X37,X38)
| ~ in(esk4_3(X37,X38,X39),X38)
| ~ in(esk4_3(X37,X38,X39),X37)
| ~ in(esk4_3(X37,X38,X39),X39) )
& ( X34 != set_intersection2(X32,X33)
| in(X36,X34)
| ~ in(X36,X33)
| ~ in(X36,X32) )
& ( X34 != set_intersection2(X32,X33)
| ~ in(X35,X34)
| in(X35,X33) )
& ( X34 != set_intersection2(X32,X33)
| ~ in(X35,X34)
| in(X35,X32) ) ),
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_5,negated_conjecture,
~ subset(set_intersection2(esk7_0,esk8_0),esk7_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_6,plain,
! [X26,X27,X28,X29,X30] :
( ( subset(X29,X30)
| ~ in(esk3_2(X29,X30),X30) )
& ( subset(X29,X30)
| in(esk3_2(X29,X30),X29) )
& ( in(X28,X27)
| ~ in(X28,X26)
| ~ subset(X26,X27) ) ),
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_tarski])])])])])])]) ).
cnf(c_0_7,plain,
( X3 != set_intersection2(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
~ subset(set_intersection2(esk7_0,esk8_0),esk7_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ in(esk3_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ in(X1,set_intersection2(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
in(esk3_2(set_intersection2(esk7_0,esk8_0),esk7_0),set_intersection2(esk7_0,esk8_0)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
~ in(esk3_2(set_intersection2(esk7_0,esk8_0),esk7_0),esk7_0),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU127+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 05:52:39 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 282137 completed with status 0
% 0.11/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 0.11/0.45 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 0.11/0.45 % G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 282146 completed with status 0
% 0.11/0.45 % Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 164s (1) cores
% 0.11/0.45 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.45 % Preprocessing time : 0.002 s
% 0.11/0.45 % Presaturation interreduction done
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Theorem
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 35
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 54
% 0.11/0.45 % Removed in clause preprocessing : 3
% 0.11/0.45 % Initial clauses in saturation : 51
% 0.11/0.45 % Processed clauses : 166
% 0.11/0.45 % ...of these trivial : 5
% 0.11/0.45 % ...subsumed : 48
% 0.11/0.45 % ...remaining for further processing : 113
% 0.11/0.45 % Other redundant clauses eliminated : 11
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 0
% 0.11/0.45 % Backward-rewritten : 1
% 0.11/0.45 % Generated clauses : 167
% 0.11/0.45 % ...of the previous two non-redundant : 117
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 156
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 11
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 39
% 0.11/0.45 % ...of those cached : 23
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 54
% 0.11/0.45 % Positive orientable unit clauses : 15
% 0.11/0.45 % Positive unorientable unit clauses: 2
% 0.11/0.45 % Negative unit clauses : 6
% 0.11/0.45 % Non-unit-clauses : 31
% 0.11/0.45 % Current number of unprocessed clauses: 47
% 0.11/0.45 % ...number of literals in the above : 111
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 50
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 644
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 497
% 0.11/0.45 % Non-unit clause-clause subsumptions : 29
% 0.11/0.45 % Unit Clause-clause subsumption calls : 6
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 43
% 0.11/0.45 % BW rewrite match successes : 33
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 4380
% 0.11/0.45 % Search garbage collected termcells : 759
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.011 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.015 s
% 0.11/0.45 % Maximum resident set size: 3604 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.043 s
% 0.11/0.45 % System time : 0.018 s
% 0.11/0.45 % Total time : 0.061 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------