%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU787_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:31:49 PM UTC 2026
% Result : Theorem 0.12s 0.43s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU787_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n018.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 07:00:28 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/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.12/0.43 % Version: 3.5.1
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % new_bool_3 with pid 1283657 completed with status 0
% 0.12/0.43 % Result found by new_bool_3
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.43 % Search class: FGUNF-FFSM22-SFFFFFNN
% 0.12/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43 % SubtermCWHack with pid 1283661 completed with status 0
% 0.12/0.43 % Result found by SubtermCWHack
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.43 % Search class: FGUNF-FFSM22-SFFFFFNN
% 0.12/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43 % Preprocessing time : 0.001 s
% 0.12/0.43
% 0.12/0.43 % Proof found!
% 0.12/0.43 % SZS status Theorem
% 0.12/0.43 % SZS output start CNFRefutation
% 0.12/0.43 tff(decl_23, type, in: ($i * $i) > $o).
% 0.12/0.43 tff(decl_24, type, binunion: ($i * $i) > $i).
% 0.12/0.43 tff(decl_25, type, kpair: ($i * $i) > $i).
% 0.12/0.43 tff(decl_26, type, breln1: ($i * $i) > $o).
% 0.12/0.43 tff(decl_27, type, breln1unionE: $o).
% 0.12/0.43 tff(decl_28, type, esk1_0: $i).
% 0.12/0.43 tff(decl_29, type, esk2_0: $i).
% 0.12/0.43 tff(decl_30, type, esk3_0: $i).
% 0.12/0.43 tff(decl_31, type, esk4_0: $i).
% 0.12/0.43 tff(decl_32, type, esk5_0: $i).
% 0.12/0.43 tff(decl_33, type, epred1_0: $o).
% 0.12/0.43 tff(decl_34, type, esk6_0: $i).
% 0.12/0.43 tff(decl_35, type, esk7_0: $i).
% 0.12/0.43 tff(decl_36, type, esk8_0: $i).
% 0.12/0.43 tff(decl_37, type, esk9_0: $i).
% 0.12/0.43 tff(decl_38, type, esk10_0: $i).
% 0.12/0.43 fof(breln1unionEcases, conjecture, (breln1unionE=>![X1, X2]:((breln1(X1,X2)=>![X3]:((breln1(X1,X3)=>![X4]:((in(X4,X1)=>![X5]:((in(X5,X1)=>(in(kpair(X4,X5),binunion(X2,X3))=>![X6:$o]:(((in(kpair(X4,X5),X2)=>X6)=>((in(kpair(X4,X5),X3)=>X6)=>X6))))))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', breln1unionEcases)).
% 0.12/0.43 fof(breln1unionE, axiom, (breln1unionE<=>![X1, X2]:((breln1(X1,X2)=>![X3]:((breln1(X1,X3)=>![X4]:((in(X4,X1)=>![X5]:((in(X5,X1)=>(in(kpair(X4,X5),binunion(X2,X3))=>(in(kpair(X4,X5),X2)|in(kpair(X4,X5),X3)))))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', breln1unionE)).
% 0.12/0.43 fof(c_0_2, negated_conjecture, ~((breln1unionE=>![X1, X2]:((breln1(X1,X2)=>![X3]:((breln1(X1,X3)=>![X4]:((in(X4,X1)=>![X5]:((in(X5,X1)=>(in(kpair(X4,X5),binunion(X2,X3))=>![X6:$o]:(((in(kpair(X4,X5),X2)=>X6)=>((in(kpair(X4,X5),X3)=>X6)=>X6)))))))))))))), inference(assume_negation,[status(cth)],[breln1unionEcases])).
% 0.12/0.43 fof(c_0_3, plain, ![X13, X14, X15, X16, X17]:(((~breln1unionE|(~breln1(X13,X14)|(~breln1(X13,X15)|(~in(X16,X13)|(~in(X17,X13)|(~in(kpair(X16,X17),binunion(X14,X15))|(in(kpair(X16,X17),X14)|in(kpair(X16,X17),X15))))))))&((breln1(esk6_0,esk7_0)|breln1unionE)&((breln1(esk6_0,esk8_0)|breln1unionE)&((in(esk9_0,esk6_0)|breln1unionE)&((in(esk10_0,esk6_0)|breln1unionE)&((in(kpair(esk9_0,esk10_0),binunion(esk7_0,esk8_0))|breln1unionE)&((~in(kpair(esk9_0,esk10_0),esk7_0)|breln1unionE)&(~in(kpair(esk9_0,esk10_0),esk8_0)|breln1unionE))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[breln1unionE])])])])])])).
% 0.12/0.43 fof(c_0_4, negated_conjecture, (breln1unionE&(breln1(esk1_0,esk2_0)&(breln1(esk1_0,esk3_0)&(in(esk4_0,esk1_0)&(in(esk5_0,esk1_0)&(in(kpair(esk4_0,esk5_0),binunion(esk2_0,esk3_0))&((~in(kpair(esk4_0,esk5_0),esk2_0)|epred1_0)&((~in(kpair(esk4_0,esk5_0),esk3_0)|epred1_0)&~epred1_0)))))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])).
% 0.12/0.43 cnf(c_0_5, plain, (in(kpair(X4,X5),X2)|in(kpair(X4,X5),X3)|~breln1unionE|~breln1(X1,X2)|~breln1(X1,X3)|~in(X4,X1)|~in(X5,X1)|~in(kpair(X4,X5),binunion(X2,X3))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.12/0.43 cnf(c_0_6, negated_conjecture, (breln1unionE), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.43 cnf(c_0_7, negated_conjecture, (epred1_0|~in(kpair(esk4_0,esk5_0),esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.43 cnf(c_0_8, negated_conjecture, (~epred1_0), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.43 cnf(c_0_9, negated_conjecture, (epred1_0|~in(kpair(esk4_0,esk5_0),esk3_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.43 cnf(c_0_10, plain, (in(kpair(X1,X2),X3)|in(kpair(X1,X2),X4)|~breln1(X5,X4)|~breln1(X5,X3)|~in(kpair(X1,X2),binunion(X3,X4))|~in(X2,X5)|~in(X1,X5)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_6])])).
% 0.12/0.43 cnf(c_0_11, negated_conjecture, (in(kpair(esk4_0,esk5_0),binunion(esk2_0,esk3_0))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.43 cnf(c_0_12, negated_conjecture, (~in(kpair(esk4_0,esk5_0),esk2_0)), inference(sr,[status(thm)],[c_0_7, c_0_8])).
% 0.12/0.43 cnf(c_0_13, negated_conjecture, (~in(kpair(esk4_0,esk5_0),esk3_0)), inference(sr,[status(thm)],[c_0_9, c_0_8])).
% 0.12/0.43 cnf(c_0_14, negated_conjecture, (~breln1(X1,esk3_0)|~breln1(X1,esk2_0)|~in(esk5_0,X1)|~in(esk4_0,X1)), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12]), c_0_13])).
% 0.12/0.43 cnf(c_0_15, negated_conjecture, (breln1(esk1_0,esk3_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.43 cnf(c_0_16, negated_conjecture, (breln1(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.43 cnf(c_0_17, negated_conjecture, (in(esk5_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.43 cnf(c_0_18, negated_conjecture, (in(esk4_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.12/0.43 cnf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16]), c_0_17]), c_0_18])]), ['proof']).
% 0.12/0.43 % SZS output end CNFRefutation
% 0.12/0.43 % Parsed axioms : 7
% 0.12/0.43 % Removed by relevancy pruning/SinE : 5
% 0.12/0.43 % Initial clauses : 17
% 0.12/0.43 % Removed in clause preprocessing : 0
% 0.12/0.43 % Initial clauses in saturation : 17
% 0.12/0.43 % Processed clauses : 18
% 0.12/0.43 % ...of these trivial : 7
% 0.12/0.43 % ...subsumed : 0
% 0.12/0.43 % ...remaining for further processing : 11
% 0.12/0.43 % Other redundant clauses eliminated : 0
% 0.12/0.43 % Clauses deleted for lack of memory : 0
% 0.12/0.43 % Backward-subsumed : 0
% 0.12/0.43 % Backward-rewritten : 0
% 0.12/0.43 % Generated clauses : 2
% 0.12/0.43 % ...of the previous two non-redundant : 1
% 0.12/0.43 % ...aggressively subsumed : 0
% 0.12/0.43 % Contextual simplify-reflections : 0
% 0.12/0.43 % Paramodulations : 2
% 0.12/0.43 % Factorizations : 0
% 0.12/0.43 % NegExts : 0
% 0.12/0.43 % Equation resolutions : 0
% 0.12/0.43 % Disequality decompositions : 0
% 0.12/0.43 % Total rewrite steps : 11
% 0.12/0.43 % ...of those cached : 7
% 0.12/0.43 % Propositional unsat checks : 0
% 0.12/0.43 % Propositional check models : 0
% 0.12/0.43 % Propositional check unsatisfiable : 0
% 0.12/0.43 % Propositional clauses : 0
% 0.12/0.43 % Propositional clauses after purity: 0
% 0.12/0.43 % Propositional unsat core size : 0
% 0.12/0.43 % Propositional preprocessing time : 0.000
% 0.12/0.43 % Propositional encoding time : 0.000
% 0.12/0.43 % Propositional solver time : 0.000
% 0.12/0.43 % Success case prop preproc time : 0.000
% 0.12/0.43 % Success case prop encoding time : 0.000
% 0.12/0.43 % Success case prop solver time : 0.000
% 0.12/0.43 % Current number of processed clauses : 11
% 0.12/0.43 % Positive orientable unit clauses : 6
% 0.12/0.43 % Positive unorientable unit clauses: 0
% 0.12/0.43 % Negative unit clauses : 3
% 0.12/0.43 % Non-unit-clauses : 2
% 0.12/0.43 % Current number of unprocessed clauses: 0
% 0.12/0.43 % ...number of literals in the above : 0
% 0.12/0.43 % Current number of archived formulas : 0
% 0.12/0.43 % Current number of archived clauses : 0
% 0.12/0.43 % Clause-clause subsumption calls (NU) : 1
% 0.12/0.43 % Rec. Clause-clause subsumption calls : 0
% 0.12/0.43 % Non-unit clause-clause subsumptions : 0
% 0.12/0.43 % Unit Clause-clause subsumption calls : 1
% 0.12/0.43 % Rewrite failures with RHS unbound : 0
% 0.12/0.43 % BW rewrite match attempts : 0
% 0.12/0.43 % BW rewrite match successes : 0
% 0.12/0.43 % Condensation attempts : 0
% 0.12/0.43 % Condensation successes : 0
% 0.12/0.43 % Termbank termtop insertions : 1118
% 0.12/0.43 % Search garbage collected termcells : 329
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.005 s
% 0.12/0.43 % System time : 0.001 s
% 0.12/0.43 % Total time : 0.006 s
% 0.12/0.43 % Maximum resident set size: 3636 pages
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.007 s
% 0.12/0.43 % System time : 0.005 s
% 0.12/0.43 % Total time : 0.012 s
% 0.12/0.43 % Maximum resident set size: 4608 pages
% 0.12/0.43 % E exiting
%------------------------------------------------------------------------------