0.00/0.05	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.08	% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.12/0.47	% Computer : n014.cluster.edu
0.12/0.47	% Model    : x86_64 x86_64
0.12/0.47	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.47	% Memory   : 8046.5625MB
0.12/0.47	% OS       : Linux 6.8.0-71-generic
0.12/0.47	% CPULimit : 1440
0.12/0.47	% WCLimit  : 180
0.12/0.47	% DateTime : Mon Jul 27 10:19:09 UTC 2026
0.12/0.47	% CPUTime  : 
0.12/0.47	Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.16/0.53	Running first-order theorem proving
0.16/0.53	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=180 /export/starexec/sandbox/benchmark/theBenchmark.p
0.29/0.61	% Version: 3.5.1
0.29/0.61	% Preprocessing class: FSLSSMSSSSSNFFN.
0.29/0.61	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.29/0.61	% Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 900s (5) cores
0.29/0.61	% Starting new_bool_3 with 180s (1) cores
0.29/0.61	% Starting new_bool_1 with 180s (1) cores
0.29/0.61	% Starting sh5l with 180s (1) cores
0.29/0.61	% new_bool_3 with pid 3520783 completed with status 0
0.29/0.61	% Result found by new_bool_3
0.29/0.61	% Preprocessing class: FSLSSMSSSSSNFFN.
0.29/0.61	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.29/0.61	% Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 900s (5) cores
0.29/0.61	% Starting new_bool_3 with 180s (1) cores
0.29/0.61	% (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
0.29/0.61	% SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.29/0.61	% Search class: FGHSF-FFMM21-MFFFFFNN
0.29/0.61	% Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.29/0.61	% Starting SubtermCWHack with 19s (1) cores
0.29/0.61	% SubtermCWHack with pid 3520787 completed with status 0
0.29/0.61	% Result found by SubtermCWHack
0.29/0.61	% Preprocessing class: FSLSSMSSSSSNFFN.
0.29/0.61	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.29/0.61	% Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 900s (5) cores
0.29/0.61	% Starting new_bool_3 with 180s (1) cores
0.29/0.61	% (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
0.29/0.61	% SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.29/0.61	% Search class: FGHSF-FFMM21-MFFFFFNN
0.29/0.61	% Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.29/0.61	% Starting SubtermCWHack with 19s (1) cores
0.29/0.61	% Preprocessing time       : 0.002 s
0.29/0.61	
0.29/0.61	% Proof found!
0.29/0.61	% SZS status Theorem
0.29/0.61	% SZS output start CNFRefutation
0.29/0.61	fof(co1, conjecture, ![X1]:((![X2]:((ssList(X2)=>![X3]:((![X4]:((ssList(X4)=>(X2!=X4|((neq(X4,nil)|~(neq(X2,nil)))&(~(neq(X2,nil))|?[X5]:((?[X6]:((ssList(X6)&?[X7]:(((ssList(X7)&app(X6,X7)=X1)&app(app(X6,cons(X5,nil)),X7)=X2))))&ssItem(X5)))|![X8]:((ssItem(X8)=>app(X3,cons(X8,nil))!=X4))))|X3!=X1)))<=ssList(X3)))))<=ssList(X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', co1)).
0.29/0.61	fof(ax84, axiom, ![X1]:((app(X1,nil)=X1<=ssList(X1))), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax', ax84)).
0.29/0.61	fof(ax17, axiom, ssList(nil), file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax', ax17)).
0.29/0.61	fof(c_0_3, negated_conjecture, ~(![X1]:((![X2]:((ssList(X2)=>![X3]:((![X4]:((ssList(X4)=>(X2!=X4|((neq(X4,nil)|~(neq(X2,nil)))&(~(neq(X2,nil))|?[X5]:((?[X6]:((ssList(X6)&?[X7]:(((ssList(X7)&app(X6,X7)=X1)&app(app(X6,cons(X5,nil)),X7)=X2))))&ssItem(X5)))|![X8]:((ssItem(X8)=>app(X3,cons(X8,nil))!=X4))))|X3!=X1)))<=ssList(X3)))))<=ssList(X1)))), inference(assume_negation,[status(cth)],[co1])).
0.29/0.61	fof(c_0_4, negated_conjecture, ~(![X1]:((ssList(X1)=>![X2]:((ssList(X2)=>![X3]:((ssList(X3)=>![X4]:((ssList(X4)=>(X2!=X4|((neq(X4,nil)|~neq(X2,nil))&(~neq(X2,nil)|?[X5]:((?[X6]:((ssList(X6)&?[X7]:(((ssList(X7)&app(X6,X7)=X1)&app(app(X6,cons(X5,nil)),X7)=X2))))&ssItem(X5)))|![X8]:((ssItem(X8)=>app(X3,cons(X8,nil))!=X4))))|X3!=X1)))))))))), inference(fof_simplification,[status(thm)],[c_0_3])).
0.29/0.61	fof(c_0_5, negated_conjecture, ![X13, X14, X15]:((ssList(esk1_0)&(ssList(esk2_0)&(ssList(esk3_0)&(ssList(esk4_0)&((esk2_0=esk4_0&((((neq(esk2_0,nil)|~neq(esk4_0,nil))&(~ssList(X14)|(~ssList(X15)|app(X14,X15)!=esk1_0|app(app(X14,cons(X13,nil)),X15)!=esk2_0)|~ssItem(X13)|~neq(esk4_0,nil)))&((ssItem(esk5_0)|~neq(esk4_0,nil))&(app(esk3_0,cons(esk5_0,nil))=esk4_0|~neq(esk4_0,nil))))&(((neq(esk2_0,nil)|neq(esk2_0,nil))&(~ssList(X14)|(~ssList(X15)|app(X14,X15)!=esk1_0|app(app(X14,cons(X13,nil)),X15)!=esk2_0)|~ssItem(X13)|neq(esk2_0,nil)))&((ssItem(esk5_0)|neq(esk2_0,nil))&(app(esk3_0,cons(esk5_0,nil))=esk4_0|neq(esk2_0,nil))))))&esk3_0=esk1_0)))))), 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)],[c_0_4])])])])])])).
0.29/0.61	cnf(c_0_6, negated_conjecture, (neq(esk2_0,nil)|neq(esk2_0,nil)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.29/0.61	cnf(c_0_7, negated_conjecture, (~ssList(X1)|~ssList(X2)|app(X1,X2)!=esk1_0|app(app(X1,cons(X3,nil)),X2)!=esk2_0|~ssItem(X3)|~neq(esk4_0,nil)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.29/0.61	cnf(c_0_8, negated_conjecture, (esk2_0=esk4_0), inference(split_conjunct,[status(thm)],[c_0_5])).
0.29/0.61	cnf(c_0_9, negated_conjecture, (neq(esk2_0,nil)), inference(cn,[status(thm)],[c_0_6])).
0.29/0.61	cnf(c_0_10, negated_conjecture, (app(esk3_0,cons(esk5_0,nil))=esk4_0|~neq(esk4_0,nil)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.29/0.61	cnf(c_0_11, negated_conjecture, (esk3_0=esk1_0), inference(split_conjunct,[status(thm)],[c_0_5])).
0.29/0.61	cnf(c_0_12, negated_conjecture, (ssItem(esk5_0)|~neq(esk4_0,nil)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.29/0.61	fof(c_0_13, plain, ![X1]:((ssList(X1)=>app(X1,nil)=X1)), inference(fof_simplification,[status(thm)],[ax84])).
0.29/0.61	cnf(c_0_14, negated_conjecture, (app(app(X1,cons(X2,nil)),X3)!=esk2_0|app(X1,X3)!=esk1_0|~ssItem(X2)|~ssList(X3)|~ssList(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8]), c_0_9])])).
0.29/0.61	cnf(c_0_15, negated_conjecture, (app(esk1_0,cons(esk5_0,nil))=esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11]), c_0_8]), c_0_8]), c_0_9])])).
0.29/0.61	cnf(c_0_16, negated_conjecture, (ssItem(esk5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_8]), c_0_9])])).
0.29/0.61	cnf(c_0_17, negated_conjecture, (ssList(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.29/0.61	fof(c_0_18, plain, ![X28]:((~ssList(X28)|app(X28,nil)=X28)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
0.29/0.61	cnf(c_0_19, negated_conjecture, (app(esk2_0,X1)!=esk2_0|app(esk1_0,X1)!=esk1_0|~ssList(X1)), inference(cn,[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])])).
0.29/0.61	cnf(c_0_20, plain, (app(X1,nil)=X1|~ssList(X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.29/0.61	cnf(c_0_21, plain, (ssList(nil)), inference(split_conjunct,[status(thm)],[ax17])).
0.29/0.61	cnf(c_0_22, negated_conjecture, (app(esk2_0,nil)!=esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21]), c_0_17])])).
0.29/0.61	cnf(c_0_23, negated_conjecture, (ssList(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
0.29/0.61	cnf(c_0_24, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_20]), c_0_23])]), ['proof']).
0.29/0.61	% SZS output end CNFRefutation
0.29/0.61	% Parsed axioms                        : 96
0.29/0.61	% Removed by relevancy pruning/SinE    : 77
0.29/0.61	% Initial clauses                      : 41
0.29/0.61	% Removed in clause preprocessing      : 0
0.29/0.61	% Initial clauses in saturation        : 41
0.29/0.61	% Processed clauses                    : 103
0.29/0.61	% ...of these trivial                  : 4
0.29/0.61	% ...subsumed                          : 24
0.29/0.61	% ...remaining for further processing  : 75
0.29/0.61	% Other redundant clauses eliminated   : 12
0.29/0.61	% Clauses deleted for lack of memory   : 0
0.29/0.61	% Backward-subsumed                    : 9
0.29/0.61	% Backward-rewritten                   : 3
0.29/0.61	% Generated clauses                    : 237
0.29/0.61	% ...of the previous two non-redundant : 169
0.29/0.61	% ...aggressively subsumed             : 0
0.29/0.61	% Contextual simplify-reflections      : 4
0.29/0.61	% Paramodulations                      : 222
0.29/0.61	% Factorizations                       : 0
0.29/0.61	% NegExts                              : 0
0.29/0.61	% Equation resolutions                 : 16
0.29/0.61	% Disequality decompositions           : 0
0.29/0.61	% Total rewrite steps                  : 215
0.29/0.61	% ...of those cached                   : 206
0.29/0.61	% Propositional unsat checks           : 0
0.29/0.61	%    Propositional check models        : 0
0.29/0.61	%    Propositional check unsatisfiable : 0
0.29/0.61	%    Propositional clauses             : 0
0.29/0.61	%    Propositional clauses after purity: 0
0.29/0.61	%    Propositional unsat core size     : 0
0.29/0.61	%    Propositional preprocessing time  : 0.000
0.29/0.61	%    Propositional encoding time       : 0.000
0.29/0.61	%    Propositional solver time         : 0.000
0.29/0.61	%    Success case prop preproc time    : 0.000
0.29/0.61	%    Success case prop encoding time   : 0.000
0.29/0.61	%    Success case prop solver time     : 0.000
0.29/0.61	% Current number of processed clauses  : 60
0.29/0.61	%    Positive orientable unit clauses  : 12
0.29/0.61	%    Positive unorientable unit clauses: 0
0.29/0.61	%    Negative unit clauses             : 4
0.29/0.61	%    Non-unit-clauses                  : 44
0.29/0.61	% Current number of unprocessed clauses: 99
0.29/0.61	% ...number of literals in the above   : 511
0.29/0.61	% Current number of archived formulas  : 0
0.29/0.61	% Current number of archived clauses   : 12
0.29/0.61	% Clause-clause subsumption calls (NU) : 219
0.29/0.61	% Rec. Clause-clause subsumption calls : 125
0.29/0.61	% Non-unit clause-clause subsumptions  : 32
0.29/0.61	% Unit Clause-clause subsumption calls : 35
0.29/0.61	% Rewrite failures with RHS unbound    : 0
0.29/0.61	% BW rewrite match attempts            : 3
0.29/0.61	% BW rewrite match successes           : 3
0.29/0.61	% Condensation attempts                : 0
0.29/0.61	% Condensation successes               : 0
0.29/0.61	% Termbank termtop insertions          : 7845
0.29/0.61	% Search garbage collected termcells   : 1390
0.29/0.61	
0.29/0.61	% -------------------------------------------------
0.29/0.61	% User time                : 0.012 s
0.29/0.61	% System time              : 0.002 s
0.29/0.61	% Total time               : 0.014 s
0.29/0.61	% Maximum resident set size: 3760 pages
0.29/0.61	
0.29/0.61	% -------------------------------------------------
0.29/0.61	% User time                : 0.014 s
0.29/0.61	% System time              : 0.009 s
0.29/0.61	% Total time               : 0.022 s
0.29/0.61	% Maximum resident set size: 4864 pages
0.29/0.62	% E exiting
0.29/0.62	EOF