%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU125+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 : n009.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:52 PM UTC 2026
% Result : Theorem 0.10s 0.49s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 94 ( 16 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 89 ( 31 ~; 41 |; 11 &)
% ( 3 <=>; 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; 4 con; 0-3 aty)
% Number of variables : 73 ( 4 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_xboole_1,conjecture,
! [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(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
| in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_xboole_0) ).
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(t1_boole,axiom,
! [X1] : set_union2(X1,empty_set) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_boole) ).
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(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X3,X2)
& subset(X1,X2) )
=> subset(set_union2(X1,X3),X2) ),
inference(assume_negation,[status(cth)],[t8_xboole_1]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( X16 = set_union2(X14,X15)
| in(esk1_3(X14,X15,X16),X15)
| in(esk1_3(X14,X15,X16),X14)
| in(esk1_3(X14,X15,X16),X16) )
& ( X16 = set_union2(X14,X15)
| ~ in(esk1_3(X14,X15,X16),X16)
| ~ in(esk1_3(X14,X15,X16),X15) )
& ( X16 = set_union2(X14,X15)
| ~ in(esk1_3(X14,X15,X16),X16)
| ~ in(esk1_3(X14,X15,X16),X14) )
& ( X11 != set_union2(X9,X10)
| in(X13,X11)
| ~ in(X13,X10) )
& ( X11 != set_union2(X9,X10)
| in(X13,X11)
| ~ in(X13,X9) )
& ( X11 != set_union2(X9,X10)
| in(X12,X10)
| in(X12,X9)
| ~ in(X12,X11) ) ),
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)],[d2_xboole_0])])])])])])]) ).
fof(c_0_7,plain,
! [X18,X19,X20,X21,X22] :
( ( subset(X21,X22)
| ~ in(esk2_2(X21,X22),X22) )
& ( subset(X21,X22)
| in(esk2_2(X21,X22),X21) )
& ( in(X20,X19)
| ~ in(X20,X18)
| ~ subset(X18,X19) ) ),
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,
( ~ subset(set_union2(esk5_0,esk7_0),esk6_0)
& subset(esk7_0,esk6_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,
( X3 != set_union2(X4,X2)
| ~ in(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
subset(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ in(esk2_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ in(X1,X3)
| in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( ~ in(X1,esk7_0)
| in(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( ~ in(esk2_2(X1,set_union2(X2,X3)),X3)
| subset(X1,set_union2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( in(esk2_2(esk7_0,X1),esk6_0)
| subset(esk7_0,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
subset(esk7_0,set_union2(X1,esk6_0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_19,plain,
! [X32] : set_union2(X32,empty_set) = X32,
inference(variable_rename,[status(thm)],[t1_boole]) ).
fof(c_0_20,plain,
! [X7,X8] : set_union2(X7,X8) = set_union2(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_21,negated_conjecture,
( ~ in(X1,esk7_0)
| in(X1,set_union2(X2,esk6_0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_22,plain,
set_union2(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( X2 != set_union2(X3,X4)
| ~ in(X1,X2)
| in(X1,X4)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
( ~ in(esk2_2(X1,set_union2(X2,esk6_0)),esk7_0)
| subset(X1,set_union2(X2,esk6_0)) ),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_26,plain,
set_union2(empty_set,X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( ~ in(X1,set_union2(X3,X2))
| in(X1,X3)
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
subset(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
( ~ in(esk2_2(X1,esk6_0),esk7_0)
| subset(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( in(esk2_2(set_union2(X1,X2),X3),X1)
| in(esk2_2(set_union2(X1,X2),X3),X2)
| subset(set_union2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_31,negated_conjecture,
( ~ in(X1,esk5_0)
| in(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( in(esk2_2(set_union2(esk7_0,X1),esk6_0),X1)
| subset(set_union2(esk7_0,X1),esk6_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ subset(set_union2(esk5_0,esk7_0),esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,negated_conjecture,
in(esk2_2(set_union2(esk5_0,esk7_0),esk6_0),esk6_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_23]),c_0_23]),c_0_33]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_34]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU125+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.10/0.36 % Computer : n009.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:51:42 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.49 % Version: 3.5.1
% 0.10/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.49 % Starting sh5l with 300s (1) cores
% 0.10/0.49 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 985342 completed with status 0
% 0.10/0.49 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.49 % No SInE strategy applied
% 0.10/0.49 % Search class: FGHSM-FFSS32-SFFFFFNN
% 0.10/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.49 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.49 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 985350 completed with status 0
% 0.10/0.49 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.10/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.49 % No SInE strategy applied
% 0.10/0.49 % Search class: FGHSM-FFSS32-SFFFFFNN
% 0.10/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.49 % Preprocessing time : 0.002 s
% 0.10/0.49 % Presaturation interreduction done
% 0.10/0.49
% 0.10/0.49 % Proof found!
% 0.10/0.49 % SZS status Theorem
% 0.10/0.49 % SZS output start CNFRefutation
% See solution above
% 0.10/0.49 % Parsed axioms : 18
% 0.10/0.49 % Removed by relevancy pruning/SinE : 0
% 0.10/0.49 % Initial clauses : 27
% 0.10/0.49 % Removed in clause preprocessing : 2
% 0.10/0.49 % Initial clauses in saturation : 25
% 0.10/0.49 % Processed clauses : 673
% 0.10/0.49 % ...of these trivial : 4
% 0.10/0.49 % ...subsumed : 429
% 0.10/0.49 % ...remaining for further processing : 240
% 0.10/0.49 % Other redundant clauses eliminated : 3
% 0.10/0.49 % Clauses deleted for lack of memory : 0
% 0.10/0.49 % Backward-subsumed : 10
% 0.10/0.49 % Backward-rewritten : 2
% 0.10/0.49 % Generated clauses : 1749
% 0.10/0.49 % ...of the previous two non-redundant : 1621
% 0.10/0.49 % ...aggressively subsumed : 0
% 0.10/0.49 % Contextual simplify-reflections : 0
% 0.10/0.49 % Paramodulations : 1642
% 0.10/0.49 % Factorizations : 104
% 0.10/0.49 % NegExts : 0
% 0.10/0.49 % Equation resolutions : 3
% 0.10/0.49 % Disequality decompositions : 0
% 0.10/0.49 % Total rewrite steps : 454
% 0.10/0.49 % ...of those cached : 402
% 0.10/0.49 % Propositional unsat checks : 0
% 0.10/0.49 % Propositional check models : 0
% 0.10/0.49 % Propositional check unsatisfiable : 0
% 0.10/0.49 % Propositional clauses : 0
% 0.10/0.49 % Propositional clauses after purity: 0
% 0.10/0.49 % Propositional unsat core size : 0
% 0.10/0.49 % Propositional preprocessing time : 0.000
% 0.10/0.49 % Propositional encoding time : 0.000
% 0.10/0.49 % Propositional solver time : 0.000
% 0.10/0.49 % Success case prop preproc time : 0.000
% 0.10/0.49 % Success case prop encoding time : 0.000
% 0.10/0.49 % Success case prop solver time : 0.000
% 0.10/0.49 % Current number of processed clauses : 200
% 0.10/0.49 % Positive orientable unit clauses : 17
% 0.10/0.49 % Positive unorientable unit clauses: 1
% 0.10/0.49 % Negative unit clauses : 6
% 0.10/0.49 % Non-unit-clauses : 176
% 0.10/0.49 % Current number of unprocessed clauses: 990
% 0.10/0.49 % ...number of literals in the above : 4164
% 0.10/0.49 % Current number of archived formulas : 0
% 0.10/0.49 % Current number of archived clauses : 37
% 0.10/0.49 % Clause-clause subsumption calls (NU) : 14463
% 0.10/0.49 % Rec. Clause-clause subsumption calls : 12333
% 0.10/0.49 % Non-unit clause-clause subsumptions : 406
% 0.10/0.49 % Unit Clause-clause subsumption calls : 129
% 0.10/0.49 % Rewrite failures with RHS unbound : 0
% 0.10/0.49 % BW rewrite match attempts : 44
% 0.10/0.49 % BW rewrite match successes : 22
% 0.10/0.49 % Condensation attempts : 0
% 0.10/0.49 % Condensation successes : 0
% 0.10/0.49 % Termbank termtop insertions : 24478
% 0.10/0.49 % Search garbage collected termcells : 363
% 0.10/0.49
% 0.10/0.49 % -------------------------------------------------
% 0.10/0.49 % User time : 0.050 s
% 0.10/0.49 % System time : 0.006 s
% 0.10/0.49 % Total time : 0.056 s
% 0.10/0.49 % Maximum resident set size: 3640 pages
% 0.10/0.49
% 0.10/0.49 % -------------------------------------------------
% 0.10/0.49 % User time : 0.267 s
% 0.10/0.49 % System time : 0.031 s
% 0.10/0.49 % Total time : 0.298 s
% 0.10/0.49 % Maximum resident set size: 4608 pages
% 0.10/0.49 % E exiting
%------------------------------------------------------------------------------