0.06/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : run_E %s %d THM
0.10/0.31	% Computer   : n006.cluster.edu
0.10/0.31	% Model      : x86_64 x86_64
0.10/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory     : 8042.1875MB
0.10/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit   : 1200
0.10/0.31	% WCLimit    : 120
0.10/0.31	% DateTime   : Tue Jul 13 12:46:40 EDT 2021
0.10/0.31	% CPUTime    : 
0.92/1.10	Running first-order theorem proving
0.92/1.10	Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers --proof-object --auto-schedule --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.92/1.10	# Version: 2.6
0.99/1.21	# No SInE strategy applied
0.99/1.21	# Trying AutoSched0 for 59 seconds
2.40/2.63	# AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S0Y
2.40/2.63	# and selection function SelectMaxLComplexAvoidPosPred.
2.40/2.63	#
2.40/2.63	# Preprocessing time       : 0.880 s
2.40/2.63	# SatCheck found unsatisfiable ground set
2.40/2.63	
2.40/2.63	# Proof found!
2.40/2.63	# SZS status Theorem
2.40/2.63	# SZS output start CNFRefutation
2.40/2.63	fof(query171, conjecture, (tptpofobject(c_tptpnavypersonnel_3,f_tptpquantityfn_6(n_414))<=mtvisible(c_tptp_spindlecollectormt)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', query171)).
2.40/2.63	fof(ax2_897, axiom, ![X3]:(tptpofobject(X3,f_tptpquantityfn_6(n_414))<=(mtvisible(c_tptp_member698_mt)&militaryperson(X3))), file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax', ax2_897)).
2.40/2.63	fof(ax2_7997, axiom, ![X19, X20]:((genlmt(X19,X20)&mtvisible(X19))=>mtvisible(X20)), file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax', ax2_7997)).
2.40/2.63	fof(ax2_2991, axiom, ![X5]:(navypersonnel(X5)=>militaryperson(X5)), file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax', ax2_2991)).
2.40/2.63	fof(ax2_1988, axiom, (mtvisible(c_tptp_member1672_mt)=>navypersonnel(c_tptpnavypersonnel_3)), file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax', ax2_1988)).
2.40/2.63	fof(ax2_1450, axiom, genlmt(c_tptp_spindlecollectormt,c_tptp_member698_mt), file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax', ax2_1450)).
2.40/2.63	fof(ax2_341, axiom, genlmt(c_tptp_spindlecollectormt,c_tptp_member1672_mt), file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax', ax2_341)).
2.40/2.63	fof(c_0_7, negated_conjecture, ~((mtvisible(c_tptp_spindlecollectormt)=>tptpofobject(c_tptpnavypersonnel_3,f_tptpquantityfn_6(n_414)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query171])])).
2.40/2.63	fof(c_0_8, plain, ![X3]:((mtvisible(c_tptp_member698_mt)&militaryperson(X3))=>tptpofobject(X3,f_tptpquantityfn_6(n_414))), inference(fof_simplification,[status(thm)],[ax2_897])).
2.40/2.63	fof(c_0_9, plain, ![X8140, X8141]:(~genlmt(X8140,X8141)|~mtvisible(X8140)|mtvisible(X8141)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])])).
2.40/2.63	fof(c_0_10, negated_conjecture, (mtvisible(c_tptp_spindlecollectormt)&~tptpofobject(c_tptpnavypersonnel_3,f_tptpquantityfn_6(n_414))), inference(fof_nnf,[status(thm)],[c_0_7])).
2.40/2.63	fof(c_0_11, plain, ![X10466]:(~navypersonnel(X10466)|militaryperson(X10466)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_2991])])).
2.40/2.63	fof(c_0_12, plain, (~mtvisible(c_tptp_member1672_mt)|navypersonnel(c_tptpnavypersonnel_3)), inference(fof_nnf,[status(thm)],[ax2_1988])).
2.40/2.63	fof(c_0_13, plain, ![X9933]:(~mtvisible(c_tptp_member698_mt)|~militaryperson(X9933)|tptpofobject(X9933,f_tptpquantityfn_6(n_414))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])).
2.40/2.63	cnf(c_0_14, plain, (mtvisible(X2)|~genlmt(X1,X2)|~mtvisible(X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
2.40/2.63	cnf(c_0_15, plain, (genlmt(c_tptp_spindlecollectormt,c_tptp_member698_mt)), inference(split_conjunct,[status(thm)],[ax2_1450])).
2.40/2.63	cnf(c_0_16, negated_conjecture, (mtvisible(c_tptp_spindlecollectormt)), inference(split_conjunct,[status(thm)],[c_0_10])).
2.40/2.63	cnf(c_0_17, plain, (genlmt(c_tptp_spindlecollectormt,c_tptp_member1672_mt)), inference(split_conjunct,[status(thm)],[ax2_341])).
2.40/2.63	cnf(c_0_18, plain, (militaryperson(X1)|~navypersonnel(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
2.40/2.63	cnf(c_0_19, plain, (navypersonnel(c_tptpnavypersonnel_3)|~mtvisible(c_tptp_member1672_mt)), inference(split_conjunct,[status(thm)],[c_0_12])).
2.40/2.63	cnf(c_0_20, negated_conjecture, (~tptpofobject(c_tptpnavypersonnel_3,f_tptpquantityfn_6(n_414))), inference(split_conjunct,[status(thm)],[c_0_10])).
2.40/2.63	cnf(c_0_21, plain, (tptpofobject(X1,f_tptpquantityfn_6(n_414))|~mtvisible(c_tptp_member698_mt)|~militaryperson(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
2.40/2.63	cnf(c_0_22, plain, (mtvisible(c_tptp_member698_mt)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])])).
2.40/2.63	cnf(c_0_23, plain, (mtvisible(c_tptp_member1672_mt)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_17]), c_0_16])])).
2.40/2.64	cnf(c_0_24, plain, (militaryperson(c_tptpnavypersonnel_3)|~mtvisible(c_tptp_member1672_mt)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
2.40/2.64	cnf(c_0_25, negated_conjecture, (~militaryperson(c_tptpnavypersonnel_3)|~mtvisible(c_tptp_member698_mt)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
2.40/2.64	cnf(c_0_26, plain, ($false), inference(cdclpropres,[status(thm)],[c_0_22, c_0_23, c_0_24, c_0_25]), ['proof']).
2.40/2.64	# SZS output end CNFRefutation
2.40/2.64	# Proof object total steps             : 27
2.40/2.64	# Proof object clause steps            : 13
2.40/2.64	# Proof object formula steps           : 14
2.40/2.64	# Proof object conjectures             : 6
2.40/2.64	# Proof object clause conjectures      : 3
2.40/2.64	# Proof object formula conjectures     : 3
2.40/2.64	# Proof object initial clauses used    : 8
2.40/2.64	# Proof object initial formulas used   : 7
2.40/2.64	# Proof object generating inferences   : 4
2.40/2.64	# Proof object simplifying inferences  : 4
2.40/2.64	# Training examples: 0 positive, 0 negative
2.40/2.64	# Parsed axioms                        : 8006
2.40/2.64	# Removed by relevancy pruning/SinE    : 0
2.40/2.64	# Initial clauses                      : 8007
2.40/2.64	# Removed in clause preprocessing      : 0
2.40/2.64	# Initial clauses in saturation        : 8007
2.40/2.64	# Processed clauses                    : 5623
2.40/2.64	# ...of these trivial                  : 320
2.40/2.64	# ...subsumed                          : 303
2.40/2.64	# ...remaining for further processing  : 5000
2.40/2.64	# Other redundant clauses eliminated   : 0
2.40/2.64	# Clauses deleted for lack of memory   : 0
2.40/2.64	# Backward-subsumed                    : 0
2.40/2.64	# Backward-rewritten                   : 23
2.40/2.64	# Generated clauses                    : 13823
2.40/2.64	# ...of the previous two non-trivial   : 13295
2.40/2.64	# Contextual simplify-reflections      : 0
2.40/2.64	# Paramodulations                      : 13823
2.40/2.64	# Factorizations                       : 0
2.40/2.64	# NegExts                              : 0
2.40/2.64	# Equation resolutions                 : 0
2.40/2.64	# Propositional unsat checks           : 1
2.40/2.64	#    Propositional check models        : 0
2.40/2.64	#    Propositional check unsatisfiable : 1
2.40/2.64	#    Propositional clauses             : 20656
2.40/2.64	#    Propositional clauses after purity: 5983
2.40/2.64	#    Propositional unsat core size     : 4
2.40/2.64	#    Propositional preprocessing time  : 0.000
2.40/2.64	#    Propositional encoding time       : 0.025
2.40/2.64	#    Propositional solver time         : 0.005
2.40/2.64	#    Success case prop preproc time    : 0.000
2.40/2.64	#    Success case prop encoding time   : 0.025
2.40/2.64	#    Success case prop solver time     : 0.005
2.40/2.64	# Current number of processed clauses  : 4977
2.40/2.64	#    Positive orientable unit clauses  : 2367
2.40/2.64	#    Positive unorientable unit clauses: 0
2.40/2.64	#    Negative unit clauses             : 33
2.40/2.64	#    Non-unit-clauses                  : 2577
2.40/2.64	# Current number of unprocessed clauses: 15679
2.40/2.64	# ...number of literals in the above   : 27216
2.40/2.64	# Current number of archived formulas  : 0
2.40/2.64	# Current number of archived clauses   : 23
2.40/2.64	# Clause-clause subsumption calls (NU) : 965784
2.40/2.64	# Rec. Clause-clause subsumption calls : 859845
2.40/2.64	# Non-unit clause-clause subsumptions  : 303
2.40/2.64	# Unit Clause-clause subsumption calls : 19518
2.40/2.64	# Rewrite failures with RHS unbound    : 0
2.40/2.64	# BW rewrite match attempts            : 108
2.40/2.64	# BW rewrite match successes           : 23
2.40/2.64	# Condensation attempts                : 0
2.40/2.64	# Condensation successes               : 0
2.40/2.64	# Termbank termtop insertions          : 545918
2.40/2.64	
2.40/2.64	# -------------------------------------------------
2.40/2.64	# User time                : 1.478 s
2.40/2.64	# System time              : 0.062 s
2.40/2.64	# Total time               : 1.540 s
2.40/2.64	# Maximum resident set size: 7852 pages
2.40/2.64	EOF