%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU130+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 : n018.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:54 PM UTC 2026
% Result : Theorem 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 64 ( 19 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 68 ( 24 ~; 29 |; 9 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 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 : 45 ( 0 sgn 28 !; 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(t28_xboole_1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(c_0_4,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( X24 = set_intersection2(X22,X23)
| in(esk2_3(X22,X23,X24),X24)
| in(esk2_3(X22,X23,X24),X23) )
& ( X24 = set_intersection2(X22,X23)
| in(esk2_3(X22,X23,X24),X24)
| in(esk2_3(X22,X23,X24),X22) )
& ( X24 = set_intersection2(X22,X23)
| ~ in(esk2_3(X22,X23,X24),X23)
| ~ in(esk2_3(X22,X23,X24),X22)
| ~ in(esk2_3(X22,X23,X24),X24) )
& ( X19 != set_intersection2(X17,X18)
| in(X21,X19)
| ~ in(X21,X18)
| ~ in(X21,X17) )
& ( X19 != set_intersection2(X17,X18)
| ~ in(X20,X19)
| in(X20,X18) )
& ( X19 != set_intersection2(X17,X18)
| ~ in(X20,X19)
| in(X20,X17) ) ),
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,
~ ! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[t28_xboole_1]) ).
cnf(c_0_6,plain,
( X3 = set_intersection2(X1,X2)
| in(esk2_3(X1,X2,X3),X3)
| in(esk2_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X11,X12,X13,X14,X15] :
( ( subset(X14,X15)
| ~ in(esk1_2(X14,X15),X15) )
& ( subset(X14,X15)
| in(esk1_2(X14,X15),X14) )
& ( in(X13,X12)
| ~ in(X13,X11)
| ~ subset(X11,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_tarski])])])])])])]) ).
fof(c_0_8,negated_conjecture,
( set_intersection2(esk5_0,esk6_0) != esk5_0
& subset(esk5_0,esk6_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_9,plain,
( ~ in(esk2_3(X1,X2,X3),X2)
| ~ in(esk2_3(X1,X2,X3),X1)
| ~ in(esk2_3(X1,X2,X3),X3)
| X3 = set_intersection2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( in(esk2_3(X1,X2,X2),X2)
| set_intersection2(X1,X2) = X2 ),
inference(ef,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
subset(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ in(esk2_3(X1,X2,X2),X1)
| set_intersection2(X1,X2) = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( ~ in(X1,esk5_0)
| in(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_15,plain,
! [X7,X8] : set_intersection2(X7,X8) = set_intersection2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_16,negated_conjecture,
( ~ in(esk2_3(esk6_0,X1,X1),esk5_0)
| set_intersection2(esk6_0,X1) = X1 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
set_intersection2(esk5_0,esk6_0) != esk5_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU130+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n018.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 05:53:43 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.46 % Version: 3.5.1
% 0.15/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1111746 completed with status 0
% 0.15/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.46 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.15/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.46 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 1111756 completed with status 0
% 0.15/0.46 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.15/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.46 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.46 % Preprocessing time : 0.001 s
% 0.15/0.46
% 0.15/0.46 % Proof found!
% 0.15/0.46 % SZS status Theorem
% 0.15/0.46 % SZS output start CNFRefutation
% See solution above
% 0.15/0.46 % Parsed axioms : 18
% 0.15/0.46 % Removed by relevancy pruning/SinE : 0
% 0.15/0.46 % Initial clauses : 28
% 0.15/0.46 % Removed in clause preprocessing : 2
% 0.15/0.46 % Initial clauses in saturation : 26
% 0.15/0.46 % Processed clauses : 247
% 0.15/0.46 % ...of these trivial : 8
% 0.15/0.46 % ...subsumed : 115
% 0.15/0.46 % ...remaining for further processing : 123
% 0.15/0.46 % Other redundant clauses eliminated : 5
% 0.15/0.46 % Clauses deleted for lack of memory : 0
% 0.15/0.46 % Backward-subsumed : 1
% 0.15/0.46 % Backward-rewritten : 1
% 0.15/0.46 % Generated clauses : 781
% 0.15/0.46 % ...of the previous two non-redundant : 644
% 0.15/0.46 % ...aggressively subsumed : 0
% 0.15/0.46 % Contextual simplify-reflections : 2
% 0.15/0.46 % Paramodulations : 746
% 0.15/0.46 % Factorizations : 20
% 0.15/0.46 % NegExts : 0
% 0.15/0.46 % Equation resolutions : 15
% 0.15/0.46 % Disequality decompositions : 0
% 0.15/0.46 % Total rewrite steps : 207
% 0.15/0.46 % ...of those cached : 177
% 0.15/0.46 % Propositional unsat checks : 0
% 0.15/0.46 % Propositional check models : 0
% 0.15/0.46 % Propositional check unsatisfiable : 0
% 0.15/0.46 % Propositional clauses : 0
% 0.15/0.46 % Propositional clauses after purity: 0
% 0.15/0.46 % Propositional unsat core size : 0
% 0.15/0.46 % Propositional preprocessing time : 0.000
% 0.15/0.46 % Propositional encoding time : 0.000
% 0.15/0.46 % Propositional solver time : 0.000
% 0.15/0.46 % Success case prop preproc time : 0.000
% 0.15/0.46 % Success case prop encoding time : 0.000
% 0.15/0.46 % Success case prop solver time : 0.000
% 0.15/0.46 % Current number of processed clauses : 119
% 0.15/0.46 % Positive orientable unit clauses : 14
% 0.15/0.46 % Positive unorientable unit clauses: 1
% 0.15/0.46 % Negative unit clauses : 4
% 0.15/0.46 % Non-unit-clauses : 100
% 0.15/0.46 % Current number of unprocessed clauses: 418
% 0.15/0.46 % ...number of literals in the above : 1123
% 0.15/0.46 % Current number of archived formulas : 0
% 0.15/0.46 % Current number of archived clauses : 2
% 0.15/0.46 % Clause-clause subsumption calls (NU) : 1618
% 0.15/0.46 % Rec. Clause-clause subsumption calls : 1096
% 0.15/0.46 % Non-unit clause-clause subsumptions : 98
% 0.15/0.46 % Unit Clause-clause subsumption calls : 31
% 0.15/0.46 % Rewrite failures with RHS unbound : 0
% 0.15/0.46 % BW rewrite match attempts : 14
% 0.15/0.46 % BW rewrite match successes : 7
% 0.15/0.46 % Condensation attempts : 0
% 0.15/0.46 % Condensation successes : 0
% 0.15/0.46 % Termbank termtop insertions : 9713
% 0.15/0.46 % Search garbage collected termcells : 358
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.016 s
% 0.15/0.46 % System time : 0.004 s
% 0.15/0.46 % Total time : 0.020 s
% 0.15/0.46 % Maximum resident set size: 3640 pages
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.066 s
% 0.15/0.46 % System time : 0.017 s
% 0.15/0.46 % Total time : 0.083 s
% 0.15/0.46 % Maximum resident set size: 4608 pages
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------