%------------------------------------------------------------------------------
% File : E-SAT---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 : n007.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:28:10 PM UTC 2026
% Result : Theorem 0.09s 0.48s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 55 ( 11 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 56 ( 20 ~; 24 |; 8 &)
% ( 3 <=>; 1 =>; 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 : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 48 ( 4 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/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(t17_xboole_1,conjecture,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
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_4,plain,
! [X30,X31,X32,X33,X34,X35,X36,X37] :
( ( X37 = set_intersection2(X35,X36)
| in(esk4_3(X35,X36,X37),X37)
| in(esk4_3(X35,X36,X37),X36) )
& ( X37 = set_intersection2(X35,X36)
| in(esk4_3(X35,X36,X37),X37)
| in(esk4_3(X35,X36,X37),X35) )
& ( X37 = set_intersection2(X35,X36)
| ~ in(esk4_3(X35,X36,X37),X36)
| ~ in(esk4_3(X35,X36,X37),X35)
| ~ in(esk4_3(X35,X36,X37),X37) )
& ( X32 != set_intersection2(X30,X31)
| in(X34,X32)
| ~ in(X34,X31)
| ~ in(X34,X30) )
& ( X32 != set_intersection2(X30,X31)
| ~ in(X33,X32)
| in(X33,X31) )
& ( X32 != set_intersection2(X30,X31)
| ~ in(X33,X32)
| in(X33,X30) ) ),
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_5,plain,
( X3 != set_intersection2(X4,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12,X13] :
( ( subset(X12,X13)
| ~ in(esk3_2(X12,X13),X13) )
& ( subset(X12,X13)
| in(esk3_2(X12,X13),X12) )
& ( in(X11,X10)
| ~ in(X11,X9)
| ~ subset(X9,X10) ) ),
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,
( ~ in(X1,set_intersection2(X3,X2))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] : subset(set_intersection2(X1,X2),X1),
inference(assume_negation,[status(cth)],[t17_xboole_1]) ).
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(esk3_2(set_intersection2(X1,X2),X3),X2)
| subset(set_intersection2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_12,plain,
! [X28,X29] : set_intersection2(X28,X29) = set_intersection2(X29,X28),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_13,negated_conjecture,
~ subset(set_intersection2(esk1_0,esk2_0),esk1_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_14,plain,
subset(set_intersection2(X1,X2),X2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ subset(set_intersection2(esk1_0,esk2_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
subset(set_intersection2(X1,X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU127+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 05:49:51 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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.09/0.48 % Version: 3.5.1
% 0.09/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.48 % Starting sh5l with 300s (1) cores
% 0.09/0.48 % new_bool_1 with pid 314249 completed with status 0
% 0.09/0.48 % Result found by new_bool_1
% 0.09/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.48 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.09/0.48 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.48 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.48 % SubtermCWHack with pid 314252 completed with status 0
% 0.09/0.48 % Result found by SubtermCWHack
% 0.09/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.48 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.09/0.48 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.48 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.48 % Preprocessing time : 0.002 s
% 0.09/0.48
% 0.09/0.48 % Proof found!
% 0.09/0.48 % SZS status Theorem
% 0.09/0.48 % SZS output start CNFRefutation
% See solution above
% 0.09/0.48 % Parsed axioms : 35
% 0.09/0.48 % Removed by relevancy pruning/SinE : 7
% 0.09/0.48 % Initial clauses : 43
% 0.09/0.48 % Removed in clause preprocessing : 0
% 0.09/0.48 % Initial clauses in saturation : 43
% 0.09/0.48 % Processed clauses : 324
% 0.09/0.48 % ...of these trivial : 3
% 0.09/0.48 % ...subsumed : 205
% 0.09/0.48 % ...remaining for further processing : 116
% 0.09/0.48 % Other redundant clauses eliminated : 9
% 0.09/0.48 % Clauses deleted for lack of memory : 0
% 0.09/0.48 % Backward-subsumed : 1
% 0.09/0.48 % Backward-rewritten : 2
% 0.09/0.48 % Generated clauses : 639
% 0.09/0.48 % ...of the previous two non-redundant : 524
% 0.09/0.48 % ...aggressively subsumed : 0
% 0.09/0.48 % Contextual simplify-reflections : 0
% 0.09/0.48 % Paramodulations : 620
% 0.09/0.48 % Factorizations : 10
% 0.09/0.48 % NegExts : 0
% 0.09/0.48 % Equation resolutions : 9
% 0.09/0.48 % Disequality decompositions : 0
% 0.09/0.48 % Total rewrite steps : 82
% 0.09/0.48 % ...of those cached : 59
% 0.09/0.48 % Propositional unsat checks : 0
% 0.09/0.48 % Propositional check models : 0
% 0.09/0.48 % Propositional check unsatisfiable : 0
% 0.09/0.48 % Propositional clauses : 0
% 0.09/0.48 % Propositional clauses after purity: 0
% 0.09/0.48 % Propositional unsat core size : 0
% 0.09/0.48 % Propositional preprocessing time : 0.000
% 0.09/0.48 % Propositional encoding time : 0.000
% 0.09/0.48 % Propositional solver time : 0.000
% 0.09/0.48 % Success case prop preproc time : 0.000
% 0.09/0.48 % Success case prop encoding time : 0.000
% 0.09/0.48 % Success case prop solver time : 0.000
% 0.09/0.48 % Current number of processed clauses : 104
% 0.09/0.48 % Positive orientable unit clauses : 14
% 0.09/0.48 % Positive unorientable unit clauses: 2
% 0.09/0.48 % Negative unit clauses : 7
% 0.09/0.48 % Non-unit-clauses : 81
% 0.09/0.48 % Current number of unprocessed clauses: 243
% 0.09/0.48 % ...number of literals in the above : 690
% 0.09/0.48 % Current number of archived formulas : 0
% 0.09/0.48 % Current number of archived clauses : 3
% 0.09/0.48 % Clause-clause subsumption calls (NU) : 984
% 0.09/0.48 % Rec. Clause-clause subsumption calls : 917
% 0.09/0.48 % Non-unit clause-clause subsumptions : 183
% 0.09/0.48 % Unit Clause-clause subsumption calls : 84
% 0.09/0.48 % Rewrite failures with RHS unbound : 0
% 0.09/0.48 % BW rewrite match attempts : 24
% 0.09/0.48 % BW rewrite match successes : 16
% 0.09/0.48 % Condensation attempts : 0
% 0.09/0.48 % Condensation successes : 0
% 0.09/0.48 % Termbank termtop insertions : 7305
% 0.09/0.48 % Search garbage collected termcells : 654
% 0.09/0.48
% 0.09/0.48 % -------------------------------------------------
% 0.09/0.48 % User time : 0.027 s
% 0.09/0.48 % System time : 0.005 s
% 0.09/0.48 % Total time : 0.032 s
% 0.09/0.48 % Maximum resident set size: 3656 pages
% 0.09/0.48
% 0.09/0.48 % -------------------------------------------------
% 0.09/0.48 % User time : 0.032 s
% 0.09/0.48 % System time : 0.010 s
% 0.09/0.48 % Total time : 0.042 s
% 0.09/0.48 % Maximum resident set size: 4608 pages
% 0.09/0.48 % E exiting
%------------------------------------------------------------------------------