%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU523_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:25:48 PM UTC 2026
% Result : Theorem 0.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU523_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n011.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 06:39:11 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.41 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.12/0.42 % Version: 3.5.1
% 0.12/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 % Starting sh5l with 300s (1) cores
% 0.12/0.42 % new_bool_1 with pid 1232943 completed with status 0
% 0.12/0.42 % Result found by new_bool_1
% 0.12/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.42 % Search class: FGUNF-FFSS21-SFFFFFNN
% 0.12/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.42 % SubtermCWHack with pid 1232949 completed with status 0
% 0.12/0.42 % Result found by SubtermCWHack
% 0.12/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.42 % Search class: FGUNF-FFSS21-SFFFFFNN
% 0.12/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.42 % Preprocessing time : 0.001 s
% 0.12/0.42
% 0.12/0.42 % Proof found!
% 0.12/0.42 % SZS status Theorem
% 0.12/0.42 % SZS output start CNFRefutation
% 0.12/0.42 tff(decl_23, type, in: ($i * $i) > $o).
% 0.12/0.42 tff(decl_24, type, setunion: $i > $i).
% 0.12/0.42 tff(decl_25, type, setunionAx: $o).
% 0.12/0.42 tff(decl_26, type, esk1_0: $i).
% 0.12/0.42 tff(decl_27, type, esk2_0: $i).
% 0.12/0.42 tff(decl_28, type, epred1_0: $o).
% 0.12/0.42 tff(decl_29, type, esk3_2: ($i * $i) > $i).
% 0.12/0.42 tff(decl_30, type, esk4_0: $i).
% 0.12/0.42 tff(decl_31, type, esk5_0: $i).
% 0.12/0.42 tff(decl_32, type, esk6_0: $i).
% 0.12/0.42 fof(setunionE, conjecture, (setunionAx=>![X1, X2]:((in(X2,setunion(X1))=>![X4:$o]:((![X3]:((in(X2,X3)=>(in(X3,X1)=>X4)))=>X4))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setunionE)).
% 0.12/0.42 fof(setunionAx, axiom, (setunionAx<=>![X1, X2]:((in(X2,setunion(X1))<=>?[X3]:((in(X2,X3)&in(X3,X1)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', setunionAx)).
% 0.12/0.42 fof(c_0_2, negated_conjecture, ~((setunionAx=>![X1, X2]:((in(X2,setunion(X1))=>![X4:$o]:((![X3]:((in(X2,X3)=>(in(X3,X1)=>X4)))=>X4)))))), inference(assume_negation,[status(cth)],[setunionE])).
% 0.12/0.42 fof(c_0_3, negated_conjecture, ![X8]:((setunionAx&(in(esk2_0,setunion(esk1_0))&((~in(esk2_0,X8)|(~in(X8,esk1_0)|epred1_0))&~epred1_0)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])).
% 0.12/0.42 fof(c_0_4, plain, ![X9, X10, X12, X13, X14, X17]:(((((in(X10,esk3_2(X9,X10))|~in(X10,setunion(X9))|~setunionAx)&(in(esk3_2(X9,X10),X9)|~in(X10,setunion(X9))|~setunionAx))&(~in(X13,X14)|~in(X14,X12)|in(X13,setunion(X12))|~setunionAx))&((~in(esk5_0,setunion(esk4_0))|(~in(esk5_0,X17)|~in(X17,esk4_0))|setunionAx)&((in(esk5_0,esk6_0)|in(esk5_0,setunion(esk4_0))|setunionAx)&(in(esk6_0,esk4_0)|in(esk5_0,setunion(esk4_0))|setunionAx))))), 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)],[setunionAx])])])])])])])).
% 0.12/0.42 cnf(c_0_5, negated_conjecture, (epred1_0|~in(esk2_0,X1)|~in(X1,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.12/0.42 cnf(c_0_6, negated_conjecture, (~epred1_0), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.12/0.42 cnf(c_0_7, plain, (in(esk3_2(X1,X2),X1)|~in(X2,setunion(X1))|~setunionAx), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.42 cnf(c_0_8, negated_conjecture, (setunionAx), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.12/0.42 cnf(c_0_9, negated_conjecture, (~in(X1,esk1_0)|~in(esk2_0,X1)), inference(sr,[status(thm)],[c_0_5, c_0_6])).
% 0.12/0.42 cnf(c_0_10, plain, (in(esk3_2(X1,X2),X1)|~in(X2,setunion(X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])])).
% 0.12/0.42 cnf(c_0_11, plain, (in(X1,esk3_2(X2,X1))|~in(X1,setunion(X2))|~setunionAx), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.42 cnf(c_0_12, negated_conjecture, (~in(esk2_0,esk3_2(esk1_0,X1))|~in(X1,setunion(esk1_0))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.12/0.42 cnf(c_0_13, plain, (in(X1,esk3_2(X2,X1))|~in(X1,setunion(X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_8])])).
% 0.12/0.42 cnf(c_0_14, negated_conjecture, (in(esk2_0,setunion(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.12/0.42 cnf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])]), ['proof']).
% 0.12/0.42 % SZS output end CNFRefutation
% 0.12/0.42 % Parsed axioms : 5
% 0.12/0.42 % Removed by relevancy pruning/SinE : 3
% 0.12/0.42 % Initial clauses : 10
% 0.12/0.42 % Removed in clause preprocessing : 0
% 0.12/0.42 % Initial clauses in saturation : 10
% 0.12/0.42 % Processed clauses : 9
% 0.12/0.42 % ...of these trivial : 2
% 0.12/0.42 % ...subsumed : 0
% 0.12/0.42 % ...remaining for further processing : 7
% 0.12/0.42 % Other redundant clauses eliminated : 0
% 0.12/0.42 % Clauses deleted for lack of memory : 0
% 0.12/0.42 % Backward-subsumed : 0
% 0.12/0.42 % Backward-rewritten : 0
% 0.12/0.42 % Generated clauses : 2
% 0.12/0.42 % ...of the previous two non-redundant : 1
% 0.12/0.42 % ...aggressively subsumed : 0
% 0.12/0.42 % Contextual simplify-reflections : 0
% 0.12/0.42 % Paramodulations : 2
% 0.12/0.42 % Factorizations : 0
% 0.12/0.42 % NegExts : 0
% 0.12/0.42 % Equation resolutions : 0
% 0.12/0.42 % Disequality decompositions : 0
% 0.12/0.42 % Total rewrite steps : 5
% 0.12/0.42 % ...of those cached : 3
% 0.12/0.42 % Propositional unsat checks : 0
% 0.12/0.42 % Propositional check models : 0
% 0.12/0.42 % Propositional check unsatisfiable : 0
% 0.12/0.42 % Propositional clauses : 0
% 0.12/0.42 % Propositional clauses after purity: 0
% 0.12/0.42 % Propositional unsat core size : 0
% 0.12/0.42 % Propositional preprocessing time : 0.000
% 0.12/0.42 % Propositional encoding time : 0.000
% 0.12/0.42 % Propositional solver time : 0.000
% 0.12/0.42 % Success case prop preproc time : 0.000
% 0.12/0.42 % Success case prop encoding time : 0.000
% 0.12/0.42 % Success case prop solver time : 0.000
% 0.12/0.42 % Current number of processed clauses : 7
% 0.12/0.42 % Positive orientable unit clauses : 2
% 0.12/0.42 % Positive unorientable unit clauses: 0
% 0.12/0.42 % Negative unit clauses : 1
% 0.12/0.42 % Non-unit-clauses : 4
% 0.12/0.42 % Current number of unprocessed clauses: 2
% 0.12/0.42 % ...number of literals in the above : 8
% 0.12/0.42 % Current number of archived formulas : 0
% 0.12/0.42 % Current number of archived clauses : 0
% 0.12/0.42 % Clause-clause subsumption calls (NU) : 7
% 0.12/0.42 % Rec. Clause-clause subsumption calls : 7
% 0.12/0.42 % Non-unit clause-clause subsumptions : 0
% 0.12/0.42 % Unit Clause-clause subsumption calls : 0
% 0.12/0.42 % Rewrite failures with RHS unbound : 0
% 0.12/0.42 % BW rewrite match attempts : 0
% 0.12/0.42 % BW rewrite match successes : 0
% 0.12/0.42 % Condensation attempts : 0
% 0.12/0.42 % Condensation successes : 0
% 0.12/0.42 % Termbank termtop insertions : 788
% 0.12/0.42 % Search garbage collected termcells : 264
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.002 s
% 0.12/0.42 % System time : 0.002 s
% 0.12/0.42 % Total time : 0.004 s
% 0.12/0.42 % Maximum resident set size: 3580 pages
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.005 s
% 0.12/0.42 % System time : 0.005 s
% 0.12/0.42 % Total time : 0.010 s
% 0.12/0.42 % Maximum resident set size: 4608 pages
% 0.12/0.42 % E exiting
%------------------------------------------------------------------------------