%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU112+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:50 PM UTC 2026
% Result : Theorem 0.10s 0.64s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 13 unt; 0 def)
% Number of atoms : 30 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 7 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 2 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t25_finsub_1,conjecture,
! [X1,X2] : subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t25_finsub_1) ).
fof(t8_xboole_1,axiom,
! [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(t7_xboole_1,axiom,
! [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(t23_finsub_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> subset(finite_subsets(X1),finite_subsets(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_finsub_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] : subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2))),
inference(assume_negation,[status(cth)],[t25_finsub_1]) ).
fof(c_0_6,negated_conjecture,
~ subset(set_union2(finite_subsets(esk1_0),finite_subsets(esk2_0)),finite_subsets(set_union2(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_5])])])]) ).
fof(c_0_7,plain,
! [X13,X14,X15] :
( subset(set_union2(X13,X15),X14)
| ~ subset(X15,X14)
| ~ subset(X13,X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])])]) ).
fof(c_0_8,plain,
! [X11,X12] : subset(X11,set_union2(X11,X12)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
fof(c_0_9,plain,
! [X20,X21] : set_union2(X20,X21) = set_union2(X21,X20),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_10,negated_conjecture,
~ subset(set_union2(finite_subsets(esk1_0),finite_subsets(esk2_0)),finite_subsets(set_union2(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ subset(X3,X2)
| ~ subset(X1,X2)
| subset(set_union2(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X7,X8] :
( subset(finite_subsets(X7),finite_subsets(X8))
| ~ subset(X7,X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_finsub_1])])]) ).
cnf(c_0_13,plain,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( ~ subset(finite_subsets(esk1_0),finite_subsets(set_union2(esk1_0,esk2_0)))
| ~ subset(finite_subsets(esk2_0),finite_subsets(set_union2(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ subset(X1,X2)
| subset(finite_subsets(X1),finite_subsets(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
~ subset(finite_subsets(esk1_0),finite_subsets(set_union2(esk1_0,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU112+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.57 % Computer : n013.cluster.edu
% 0.10/0.57 % Model : x86_64 x86_64
% 0.10/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57 % Memory : 8046.5625MB
% 0.10/0.57 % OS : Linux 6.8.0-71-generic
% 0.10/0.57 % CPULimit : 300
% 0.10/0.57 % WCLimit : 300
% 0.10/0.57 % DateTime : Mon Sep 21 05:50:06 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.61 Running first-order theorem proving
% 0.10/0.61 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.64 % Version: 3.5.1
% 0.10/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.64 % Starting sh5l with 300s (1) cores
% 0.10/0.64 % new_bool_3 with pid 64024 completed with status 0
% 0.10/0.64 % Result found by new_bool_3
% 0.10/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.64 % Search class: FGUSM-FFMF21-SFFFFFNN
% 0.10/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.64 % SubtermCWHack with pid 64027 completed with status 0
% 0.10/0.64 % Result found by SubtermCWHack
% 0.10/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.64 % Search class: FGUSM-FFMF21-SFFFFFNN
% 0.10/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.64 % Preprocessing time : 0.002 s
% 0.10/0.64
% 0.10/0.64 % Proof found!
% 0.10/0.64 % SZS status Theorem
% 0.10/0.64 % SZS output start CNFRefutation
% See solution above
% 0.10/0.64 % Parsed axioms : 40
% 0.10/0.64 % Removed by relevancy pruning/SinE : 11
% 0.10/0.64 % Initial clauses : 44
% 0.10/0.64 % Removed in clause preprocessing : 0
% 0.10/0.64 % Initial clauses in saturation : 44
% 0.10/0.64 % Processed clauses : 101
% 0.10/0.64 % ...of these trivial : 2
% 0.10/0.64 % ...subsumed : 30
% 0.10/0.64 % ...remaining for further processing : 69
% 0.10/0.64 % Other redundant clauses eliminated : 0
% 0.10/0.64 % Clauses deleted for lack of memory : 0
% 0.10/0.64 % Backward-subsumed : 1
% 0.10/0.64 % Backward-rewritten : 3
% 0.10/0.64 % Generated clauses : 106
% 0.10/0.64 % ...of the previous two non-redundant : 78
% 0.10/0.64 % ...aggressively subsumed : 0
% 0.10/0.64 % Contextual simplify-reflections : 0
% 0.10/0.64 % Paramodulations : 106
% 0.10/0.64 % Factorizations : 0
% 0.10/0.64 % NegExts : 0
% 0.10/0.64 % Equation resolutions : 0
% 0.10/0.64 % Disequality decompositions : 0
% 0.10/0.64 % Total rewrite steps : 29
% 0.10/0.64 % ...of those cached : 14
% 0.10/0.64 % Propositional unsat checks : 0
% 0.10/0.64 % Propositional check models : 0
% 0.10/0.64 % Propositional check unsatisfiable : 0
% 0.10/0.64 % Propositional clauses : 0
% 0.10/0.64 % Propositional clauses after purity: 0
% 0.10/0.64 % Propositional unsat core size : 0
% 0.10/0.64 % Propositional preprocessing time : 0.000
% 0.10/0.64 % Propositional encoding time : 0.000
% 0.10/0.64 % Propositional solver time : 0.000
% 0.10/0.64 % Success case prop preproc time : 0.000
% 0.10/0.64 % Success case prop encoding time : 0.000
% 0.10/0.64 % Success case prop solver time : 0.000
% 0.10/0.64 % Current number of processed clauses : 65
% 0.10/0.64 % Positive orientable unit clauses : 19
% 0.10/0.64 % Positive unorientable unit clauses: 1
% 0.10/0.64 % Negative unit clauses : 6
% 0.10/0.64 % Non-unit-clauses : 39
% 0.10/0.64 % Current number of unprocessed clauses: 16
% 0.10/0.64 % ...number of literals in the above : 53
% 0.10/0.64 % Current number of archived formulas : 0
% 0.10/0.64 % Current number of archived clauses : 4
% 0.10/0.64 % Clause-clause subsumption calls (NU) : 167
% 0.10/0.64 % Rec. Clause-clause subsumption calls : 155
% 0.10/0.64 % Non-unit clause-clause subsumptions : 28
% 0.10/0.64 % Unit Clause-clause subsumption calls : 19
% 0.10/0.64 % Rewrite failures with RHS unbound : 0
% 0.10/0.64 % BW rewrite match attempts : 9
% 0.10/0.64 % BW rewrite match successes : 8
% 0.10/0.64 % Condensation attempts : 0
% 0.10/0.64 % Condensation successes : 0
% 0.10/0.64 % Termbank termtop insertions : 3231
% 0.10/0.64 % Search garbage collected termcells : 387
% 0.10/0.64
% 0.10/0.64 % -------------------------------------------------
% 0.10/0.64 % User time : 0.009 s
% 0.10/0.64 % System time : 0.002 s
% 0.10/0.64 % Total time : 0.011 s
% 0.10/0.64 % Maximum resident set size: 3668 pages
% 0.10/0.64
% 0.10/0.64 % -------------------------------------------------
% 0.10/0.64 % User time : 0.011 s
% 0.10/0.64 % System time : 0.006 s
% 0.10/0.64 % Total time : 0.018 s
% 0.10/0.64 % Maximum resident set size: 4864 pages
% 0.10/0.64 % E exiting
%------------------------------------------------------------------------------