%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU126+2 : 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 : 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:28:09 PM UTC 2026
% Result : Theorem 0.06s 0.34s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 45 ( 15 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 37 ( 16 ~; 12 |; 5 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 2 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t12_xboole_1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(t8_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X3,X2)
& subset(X1,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
inference(assume_negation,[status(cth)],[t12_xboole_1]) ).
fof(c_0_7,plain,
! [X29,X30] :
( ( X29 = X30
| ~ subset(X30,X29)
| ~ subset(X29,X30) )
& ( X29 != X30
| subset(X30,X29) )
& ( X29 != X30
| subset(X29,X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
fof(c_0_8,lemma,
! [X24,X25] : subset(X24,set_union2(X24,X25)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
fof(c_0_9,negated_conjecture,
( set_union2(esk1_0,esk2_0) != esk2_0
& subset(esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_10,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_11,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,lemma,
! [X26,X27,X28] :
( subset(set_union2(X26,X28),X27)
| ~ subset(X28,X27)
| ~ subset(X26,X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])])]) ).
fof(c_0_14,plain,
! [X37] : subset(X37,X37),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_15,negated_conjecture,
set_union2(esk1_0,esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,lemma,
( ~ subset(set_union2(X1,X2),X1)
| set_union2(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,lemma,
( ~ subset(X3,X2)
| ~ subset(X1,X2)
| subset(set_union2(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
set_union2(esk2_0,esk1_0) != esk2_0,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,lemma,
( ~ subset(X2,X1)
| set_union2(X1,X2) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU126+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.02/0.30 % Computer : n012.cluster.edu
% 0.02/0.30 % Model : x86_64 x86_64
% 0.02/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.30 % Memory : 8046.5625MB
% 0.02/0.30 % OS : Linux 6.8.0-71-generic
% 0.02/0.30 % CPULimit : 300
% 0.02/0.30 % WCLimit : 300
% 0.02/0.30 % DateTime : Mon Sep 21 05:51:38 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.02/0.32 Running first-order theorem proving
% 0.02/0.32 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.06/0.34 % Version: 3.5.1
% 0.06/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.06/0.34 % Starting sh5l with 300s (1) cores
% 0.06/0.34 % new_bool_3 with pid 1684330 completed with status 0
% 0.06/0.34 % Result found by new_bool_3
% 0.06/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.06/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.06/0.34 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.06/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.06/0.34 % SubtermCWHack with pid 1684333 completed with status 0
% 0.06/0.34 % Result found by SubtermCWHack
% 0.06/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.06/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.06/0.34 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.06/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.06/0.34 % Preprocessing time : 0.001 s
% 0.06/0.34
% 0.06/0.34 % Proof found!
% 0.06/0.34 % SZS status Theorem
% 0.06/0.34 % SZS output start CNFRefutation
% See solution above
% 0.06/0.34 % Parsed axioms : 33
% 0.06/0.34 % Removed by relevancy pruning/SinE : 10
% 0.06/0.34 % Initial clauses : 34
% 0.06/0.34 % Removed in clause preprocessing : 0
% 0.06/0.34 % Initial clauses in saturation : 34
% 0.06/0.34 % Processed clauses : 104
% 0.06/0.34 % ...of these trivial : 2
% 0.06/0.34 % ...subsumed : 43
% 0.06/0.34 % ...remaining for further processing : 59
% 0.06/0.34 % Other redundant clauses eliminated : 6
% 0.06/0.34 % Clauses deleted for lack of memory : 0
% 0.06/0.34 % Backward-subsumed : 0
% 0.06/0.34 % Backward-rewritten : 2
% 0.06/0.34 % Generated clauses : 156
% 0.06/0.34 % ...of the previous two non-redundant : 99
% 0.06/0.34 % ...aggressively subsumed : 0
% 0.06/0.34 % Contextual simplify-reflections : 0
% 0.06/0.34 % Paramodulations : 150
% 0.06/0.34 % Factorizations : 0
% 0.06/0.34 % NegExts : 0
% 0.06/0.34 % Equation resolutions : 6
% 0.06/0.34 % Disequality decompositions : 0
% 0.06/0.34 % Total rewrite steps : 33
% 0.06/0.34 % ...of those cached : 19
% 0.06/0.34 % Propositional unsat checks : 0
% 0.06/0.34 % Propositional check models : 0
% 0.06/0.34 % Propositional check unsatisfiable : 0
% 0.06/0.34 % Propositional clauses : 0
% 0.06/0.34 % Propositional clauses after purity: 0
% 0.06/0.34 % Propositional unsat core size : 0
% 0.06/0.34 % Propositional preprocessing time : 0.000
% 0.06/0.34 % Propositional encoding time : 0.000
% 0.06/0.34 % Propositional solver time : 0.000
% 0.06/0.34 % Success case prop preproc time : 0.000
% 0.06/0.34 % Success case prop encoding time : 0.000
% 0.06/0.34 % Success case prop solver time : 0.000
% 0.06/0.34 % Current number of processed clauses : 51
% 0.06/0.34 % Positive orientable unit clauses : 10
% 0.06/0.34 % Positive unorientable unit clauses: 1
% 0.06/0.34 % Negative unit clauses : 3
% 0.06/0.34 % Non-unit-clauses : 37
% 0.06/0.34 % Current number of unprocessed clauses: 29
% 0.06/0.34 % ...number of literals in the above : 80
% 0.06/0.34 % Current number of archived formulas : 0
% 0.06/0.34 % Current number of archived clauses : 2
% 0.06/0.34 % Clause-clause subsumption calls (NU) : 162
% 0.06/0.34 % Rec. Clause-clause subsumption calls : 147
% 0.06/0.34 % Non-unit clause-clause subsumptions : 36
% 0.06/0.34 % Unit Clause-clause subsumption calls : 0
% 0.06/0.34 % Rewrite failures with RHS unbound : 0
% 0.06/0.34 % BW rewrite match attempts : 15
% 0.06/0.34 % BW rewrite match successes : 11
% 0.06/0.34 % Condensation attempts : 0
% 0.06/0.34 % Condensation successes : 0
% 0.06/0.34 % Termbank termtop insertions : 2997
% 0.06/0.34 % Search garbage collected termcells : 513
% 0.06/0.34
% 0.06/0.34 % -------------------------------------------------
% 0.06/0.34 % User time : 0.003 s
% 0.06/0.34 % System time : 0.003 s
% 0.06/0.34 % Total time : 0.006 s
% 0.06/0.34 % Maximum resident set size: 3656 pages
% 0.06/0.34
% 0.06/0.34 % -------------------------------------------------
% 0.06/0.34 % User time : 0.004 s
% 0.06/0.34 % System time : 0.005 s
% 0.06/0.34 % Total time : 0.010 s
% 0.06/0.34 % Maximum resident set size: 4608 pages
% 0.06/0.34 % E exiting
%------------------------------------------------------------------------------