%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU709_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 : n020.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:26:48 PM UTC 2026
% Result : Theorem 0.23s 0.55s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU709_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.45 % Computer : n020.cluster.edu
% 0.17/0.45 % Model : x86_64 x86_64
% 0.17/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45 % Memory : 8046.5625MB
% 0.17/0.45 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 06:53:32 UTC 2026
% 0.17/0.46 % CPUTime :
% 0.17/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.23/0.55 % Version: 3.5.1
% 0.23/0.55 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 % Starting sh5l with 300s (1) cores
% 0.23/0.55 % new_bool_1 with pid 2313876 completed with status 0
% 0.23/0.55 % Result found by new_bool_1
% 0.23/0.55 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.55 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.23/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.55 % SubtermCWHack with pid 2313878 completed with status 0
% 0.23/0.55 % Result found by SubtermCWHack
% 0.23/0.55 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.55 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.23/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.55 % Preprocessing time : 0.002 s
% 0.23/0.55
% 0.23/0.55 % Proof found!
% 0.23/0.55 % SZS status Theorem
% 0.23/0.55 % SZS output start CNFRefutation
% 0.23/0.55 tff(decl_23, type, in: ($i * $i) > $o).
% 0.23/0.55 tff(decl_24, type, emptyset: $i).
% 0.23/0.55 tff(decl_25, type, setadjoin: ($i * $i) > $i).
% 0.23/0.55 tff(decl_26, type, setadjoinIL: $o).
% 0.23/0.55 tff(decl_27, type, in__Cong: $o).
% 0.23/0.55 tff(decl_28, type, secondinupair: $o).
% 0.23/0.55 tff(decl_29, type, if: ($i * $o * $i * $i) > $i).
% 0.23/0.55 tff(decl_30, type, iftrue: $o).
% 0.23/0.55 tff(decl_31, type, iffalse: $o).
% 0.23/0.55 tff(decl_32, type, esk1_0: $i).
% 0.23/0.55 tff(decl_33, type, epred1_0: $o).
% 0.23/0.55 tff(decl_34, type, esk2_0: $i).
% 0.23/0.55 tff(decl_35, type, esk3_0: $i).
% 0.23/0.55 tff(decl_36, type, esk4_0: $i).
% 0.23/0.55 tff(decl_37, type, esk5_0: $i).
% 0.23/0.55 tff(decl_38, type, esk6_0: $i).
% 0.23/0.55 tff(decl_39, type, esk7_0: $i).
% 0.23/0.55 tff(decl_40, type, esk8_0: $i).
% 0.23/0.55 tff(decl_41, type, epred2_0: $o).
% 0.23/0.55 tff(decl_42, type, esk9_0: $i).
% 0.23/0.55 tff(decl_43, type, esk10_0: $i).
% 0.23/0.55 tff(decl_44, type, esk11_0: $i).
% 0.23/0.55 tff(decl_45, type, epred3_0: $o).
% 0.23/0.55 tff(decl_46, type, esk12_0: $i).
% 0.23/0.55 tff(decl_47, type, esk13_0: $i).
% 0.23/0.55 fof(iftrueorfalse, conjecture, (setadjoinIL=>(in__Cong=>(secondinupair=>(iftrue=>(iffalse=>![X3, X5:$o, X1]:((in(X1,X3)=>![X2]:((in(X2,X3)=>in(if(X3,X5,X1,X2),setadjoin(X1,setadjoin(X2,emptyset)))))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', iftrueorfalse)).
% 0.23/0.55 fof(iffalse, axiom, (iffalse<=>![X3, X5:$o, X1]:((in(X1,X3)=>![X2]:((in(X2,X3)=>(~(X5)=>if(X3,X5,X1,X2)=X2)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', iffalse)).
% 0.23/0.55 fof(iftrue, axiom, (iftrue<=>![X3, X5:$o, X1]:((in(X1,X3)=>![X2]:((in(X2,X3)=>(X5=>if(X3,X5,X1,X2)=X1)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', iftrue)).
% 0.23/0.55 fof(setadjoinIL, axiom, (setadjoinIL<=>![X1, X2]:(in(X1,setadjoin(X1,X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', setadjoinIL)).
% 0.23/0.55 fof(secondinupair, axiom, (secondinupair<=>![X1, X2]:(in(X2,setadjoin(X1,setadjoin(X2,emptyset))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', secondinupair)).
% 0.23/0.55 fof(c_0_5, negated_conjecture, ~((setadjoinIL=>(in__Cong=>(secondinupair=>(iftrue=>(iffalse=>![X3, X5:$o, X1]:((in(X1,X3)=>![X2]:((in(X2,X3)=>in(if(X3,X5,X1,X2),setadjoin(X1,setadjoin(X2,emptyset))))))))))))), inference(assume_negation,[status(cth)],[iftrueorfalse])).
% 0.23/0.55 fof(c_0_6, plain, (iffalse<=>![X3, X5:$o, X1]:((in(X1,X3)=>![X2]:((in(X2,X3)=>(~X5=>if(X3,X5,X1,X2)=X2)))))), inference(fof_simplification,[status(thm)],[iffalse])).
% 0.23/0.55 fof(c_0_7, plain, ![X18, X19:$o, X20, X21]:(((~iftrue|(~in(X20,X18)|(~in(X21,X18)|(~X19|if(X18,X19,X20,X21)=X20))))&((in(esk9_0,esk8_0)|iftrue)&((in(esk10_0,esk8_0)|iftrue)&((epred2_0|iftrue)&(((~epred2_0|epred2_0|iftrue)&(if(esk8_0,$false,esk9_0,esk10_0)!=esk9_0|epred2_0|iftrue))&((~epred2_0|if(esk8_0,$true,esk9_0,esk10_0)!=esk9_0|iftrue)&(if(esk8_0,$false,esk9_0,esk10_0)!=esk9_0|if(esk8_0,$true,esk9_0,esk10_0)!=esk9_0|iftrue)))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[iftrue])])])])])])])).
% 0.23/0.55 fof(c_0_8, negated_conjecture, (setadjoinIL&(in__Cong&(secondinupair&(iftrue&(iffalse&(in(esk2_0,esk1_0)&(in(esk3_0,esk1_0)&(((~epred1_0|epred1_0)&(~in(if(esk1_0,$false,esk2_0,esk3_0),setadjoin(esk2_0,setadjoin(esk3_0,emptyset)))|epred1_0))&((~epred1_0|~in(if(esk1_0,$true,esk2_0,esk3_0),setadjoin(esk2_0,setadjoin(esk3_0,emptyset))))&(~in(if(esk1_0,$false,esk2_0,esk3_0),setadjoin(esk2_0,setadjoin(esk3_0,emptyset)))|~in(if(esk1_0,$true,esk2_0,esk3_0),setadjoin(esk2_0,setadjoin(esk3_0,emptyset))))))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])])).
% 0.23/0.55 fof(c_0_9, plain, ![X10, X11]:(((~setadjoinIL|in(X10,setadjoin(X10,X11)))&(~in(esk4_0,setadjoin(esk4_0,esk5_0))|setadjoinIL))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[setadjoinIL])])])])])).
% 0.23/0.55 fof(c_0_10, plain, ![X26, X27:$o, X28, X29]:(((~iffalse|(~in(X28,X26)|(~in(X29,X26)|(X27|if(X26,X27,X28,X29)=X29))))&((in(esk12_0,esk11_0)|iffalse)&((in(esk13_0,esk11_0)|iffalse)&((~epred3_0|iffalse)&(((~epred3_0|epred3_0|iffalse)&(if(esk11_0,$false,esk12_0,esk13_0)!=esk13_0|epred3_0|iffalse))&((~epred3_0|if(esk11_0,$true,esk12_0,esk13_0)!=esk13_0|iffalse)&(if(esk11_0,$false,esk12_0,esk13_0)!=esk13_0|if(esk11_0,$true,esk12_0,esk13_0)!=esk13_0|iffalse)))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])])])).
% 0.23/0.55 fof(c_0_11, plain, ![X14, X15]:(((~secondinupair|in(X15,setadjoin(X14,setadjoin(X15,emptyset))))&(~in(esk7_0,setadjoin(esk6_0,setadjoin(esk7_0,emptyset)))|secondinupair))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[secondinupair])])])])])).
% 0.23/0.55 cnf(c_0_12, plain, (if(X2,$true,X1,X3)=X1|~iftrue|~in(X1,X2)|~in(X3,X2)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7])])])).
% 0.23/0.55 cnf(c_0_13, negated_conjecture, (iftrue), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.55 cnf(c_0_14, plain, (in(X1,setadjoin(X1,X2))|~setadjoinIL), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.23/0.55 cnf(c_0_15, negated_conjecture, (setadjoinIL), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.55 cnf(c_0_16, plain, (if(X2,$false,X1,X3)=X3|~iffalse|~in(X1,X2)|~in(X3,X2)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_10])])])).
% 0.23/0.55 cnf(c_0_17, negated_conjecture, (iffalse), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.55 cnf(c_0_18, plain, (in(X1,setadjoin(X2,setadjoin(X1,emptyset)))|~secondinupair), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.23/0.55 cnf(c_0_19, negated_conjecture, (secondinupair), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.55 cnf(c_0_20, negated_conjecture, (~epred1_0|~in(if(esk1_0,$true,esk2_0,esk3_0),setadjoin(esk2_0,setadjoin(esk3_0,emptyset)))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.55 cnf(c_0_21, plain, (if(X1,$true,X2,X3)=X2|~in(X3,X1)|~in(X2,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_13])])).
% 0.23/0.55 cnf(c_0_22, plain, (in(X1,setadjoin(X1,X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15])])).
% 0.23/0.55 cnf(c_0_23, negated_conjecture, (in(esk3_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.55 cnf(c_0_24, negated_conjecture, (in(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.55 cnf(c_0_25, negated_conjecture, (epred1_0|~in(if(esk1_0,$false,esk2_0,esk3_0),setadjoin(esk2_0,setadjoin(esk3_0,emptyset)))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.55 cnf(c_0_26, plain, (if(X1,$false,X2,X3)=X3|~in(X3,X1)|~in(X2,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17])])).
% 0.23/0.55 cnf(c_0_27, plain, (in(X1,setadjoin(X2,setadjoin(X1,emptyset)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19])])).
% 0.23/0.55 cnf(c_0_28, negated_conjecture, (~epred1_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22]), c_0_23]), c_0_24])])).
% 0.23/0.55 cnf(c_0_29, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27]), c_0_23]), c_0_24])]), c_0_28]), ['proof']).
% 0.23/0.55 % SZS output end CNFRefutation
% 0.23/0.55 % Parsed axioms : 15
% 0.23/0.55 % Removed by relevancy pruning/SinE : 9
% 0.23/0.55 % Initial clauses : 37
% 0.23/0.55 % Removed in clause preprocessing : 5
% 0.23/0.55 % Initial clauses in saturation : 32
% 0.23/0.55 % Processed clauses : 30
% 0.23/0.55 % ...of these trivial : 16
% 0.23/0.55 % ...subsumed : 0
% 0.23/0.55 % ...remaining for further processing : 14
% 0.23/0.55 % Other redundant clauses eliminated : 0
% 0.23/0.55 % Clauses deleted for lack of memory : 0
% 0.23/0.55 % Backward-subsumed : 1
% 0.23/0.55 % Backward-rewritten : 0
% 0.23/0.55 % Generated clauses : 2
% 0.23/0.55 % ...of the previous two non-redundant : 1
% 0.23/0.55 % ...aggressively subsumed : 0
% 0.23/0.55 % Contextual simplify-reflections : 0
% 0.23/0.55 % Paramodulations : 2
% 0.23/0.55 % Factorizations : 0
% 0.23/0.55 % NegExts : 0
% 0.23/0.55 % Equation resolutions : 0
% 0.23/0.55 % Disequality decompositions : 0
% 0.23/0.55 % Total rewrite steps : 28
% 0.23/0.55 % ...of those cached : 17
% 0.23/0.55 % Propositional unsat checks : 0
% 0.23/0.55 % Propositional check models : 0
% 0.23/0.55 % Propositional check unsatisfiable : 0
% 0.23/0.55 % Propositional clauses : 0
% 0.23/0.55 % Propositional clauses after purity: 0
% 0.23/0.55 % Propositional unsat core size : 0
% 0.23/0.55 % Propositional preprocessing time : 0.000
% 0.23/0.55 % Propositional encoding time : 0.000
% 0.23/0.55 % Propositional solver time : 0.000
% 0.23/0.55 % Success case prop preproc time : 0.000
% 0.23/0.55 % Success case prop encoding time : 0.000
% 0.23/0.55 % Success case prop solver time : 0.000
% 0.23/0.55 % Current number of processed clauses : 13
% 0.23/0.55 % Positive orientable unit clauses : 9
% 0.23/0.55 % Positive unorientable unit clauses: 0
% 0.23/0.55 % Negative unit clauses : 1
% 0.23/0.55 % Non-unit-clauses : 3
% 0.23/0.55 % Current number of unprocessed clauses: 3
% 0.23/0.55 % ...number of literals in the above : 8
% 0.23/0.55 % Current number of archived formulas : 0
% 0.23/0.55 % Current number of archived clauses : 1
% 0.23/0.55 % Clause-clause subsumption calls (NU) : 1
% 0.23/0.55 % Rec. Clause-clause subsumption calls : 1
% 0.23/0.55 % Non-unit clause-clause subsumptions : 0
% 0.23/0.55 % Unit Clause-clause subsumption calls : 3
% 0.23/0.55 % Rewrite failures with RHS unbound : 0
% 0.23/0.55 % BW rewrite match attempts : 0
% 0.23/0.55 % BW rewrite match successes : 0
% 0.23/0.55 % Condensation attempts : 0
% 0.23/0.55 % Condensation successes : 0
% 0.23/0.55 % Termbank termtop insertions : 2087
% 0.23/0.55 % Search garbage collected termcells : 684
% 0.23/0.55
% 0.23/0.55 % -------------------------------------------------
% 0.23/0.55 % User time : 0.006 s
% 0.23/0.55 % System time : 0.003 s
% 0.23/0.55 % Total time : 0.009 s
% 0.23/0.55 % Maximum resident set size: 3644 pages
% 0.23/0.55
% 0.23/0.55 % -------------------------------------------------
% 0.23/0.55 % User time : 0.010 s
% 0.23/0.55 % System time : 0.008 s
% 0.23/0.55 % Total time : 0.018 s
% 0.23/0.55 % Maximum resident set size: 4864 pages
% 0.23/0.55 % E exiting
%------------------------------------------------------------------------------