0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.13	% Command    : run_E %s %d THM
0.14/0.34	% Computer   : n014.cluster.edu
0.14/0.34	% Model      : x86_64 x86_64
0.14/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory     : 8042.1875MB
0.14/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.34	% CPULimit   : 1200
0.14/0.34	% WCLimit    : 120
0.14/0.34	% DateTime   : Tue Jul 13 13:35:34 EDT 2021
0.14/0.34	% CPUTime    : 
0.20/0.51	Running first-order theorem proving
0.20/0.51	Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
0.20/0.51	# Version: 2.6
0.20/0.53	# No SInE strategy applied
0.20/0.53	# Trying AutoSched0 for 59 seconds
12.75/12.96	# AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S4S
12.75/12.96	# and selection function SelectNewComplexAHPNS.
12.75/12.96	#
12.75/12.96	# Preprocessing time       : 0.083 s
12.75/12.96	
12.75/12.96	# Proof found!
12.75/12.96	# SZS status Theorem
12.75/12.96	# SZS output start CNFRefutation
12.75/12.96	fof(ax1_64, axiom, ![X12, X18, X16, X19]:(isa(f_relationexistsallfn(X12,X16,X19,X18),X19)<=(relationexistsall(X16,X19,X18)&isa(X12,X18))), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_64)).
12.75/12.96	fof(ax1_244, axiom, ![X12]:(tptp_8_968(f_relationexistsallfn(X12,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X12)<=isa(X12,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_244)).
12.75/12.96	fof(query88, conjecture, ?[X3]:(mtvisible(c_knowledgefragmentd3mt)=>(tptpcol_16_7738(X3)&tptp_8_968(X3,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', query88)).
12.75/12.96	fof(ax1_245, axiom, relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_245)).
12.75/12.96	fof(ax1_134, axiom, isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_134)).
12.75/12.96	fof(ax1_673, axiom, ![X3]:(isa(X3,c_tptpcol_16_7738)=>tptpcol_16_7738(X3)), file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax', ax1_673)).
12.75/12.96	fof(c_0_6, plain, ![X12, X18, X16, X19]:((relationexistsall(X16,X19,X18)&isa(X12,X18))=>isa(f_relationexistsallfn(X12,X16,X19,X18),X19)), inference(fof_simplification,[status(thm)],[ax1_64])).
12.75/12.96	fof(c_0_7, plain, ![X12]:(isa(X12,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))=>tptp_8_968(f_relationexistsallfn(X12,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X12)), inference(fof_simplification,[status(thm)],[ax1_244])).
12.75/12.96	fof(c_0_8, plain, ![X2003, X2004, X2005, X2006]:(~relationexistsall(X2005,X2006,X2004)|~isa(X2003,X2004)|isa(f_relationexistsallfn(X2003,X2005,X2006,X2004),X2006)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
12.75/12.96	fof(c_0_9, negated_conjecture, ~(?[X3]:(mtvisible(c_knowledgefragmentd3mt)=>(tptpcol_16_7738(X3)&tptp_8_968(X3,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)))), inference(assume_negation,[status(cth)],[query88])).
12.75/12.96	fof(c_0_10, plain, ![X1813]:(~isa(X1813,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))|tptp_8_968(f_relationexistsallfn(X1813,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1813)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])).
12.75/12.96	cnf(c_0_11, plain, (isa(f_relationexistsallfn(X4,X1,X2,X3),X2)|~relationexistsall(X1,X2,X3)|~isa(X4,X3)), inference(split_conjunct,[status(thm)],[c_0_8])).
12.75/12.96	cnf(c_0_12, plain, (relationexistsall(c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))), inference(split_conjunct,[status(thm)],[ax1_245])).
12.75/12.96	fof(c_0_13, negated_conjecture, ![X2265]:(mtvisible(c_knowledgefragmentd3mt)&(~tptpcol_16_7738(X2265)|~tptp_8_968(X2265,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])).
12.75/12.96	cnf(c_0_14, plain, (tptp_8_968(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),X1)|~isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))), inference(split_conjunct,[status(thm)],[c_0_10])).
12.75/12.96	cnf(c_0_15, plain, (isa(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))), inference(split_conjunct,[status(thm)],[ax1_134])).
12.75/12.96	fof(c_0_16, plain, ![X1161]:(~isa(X1161,c_tptpcol_16_7738)|tptpcol_16_7738(X1161)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_673])])).
12.75/12.96	cnf(c_0_17, plain, (isa(f_relationexistsallfn(X1,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpcol_16_7738)|~isa(X1,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
12.75/12.96	cnf(c_0_18, negated_conjecture, (~tptpcol_16_7738(X1)|~tptp_8_968(X1,c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)), inference(split_conjunct,[status(thm)],[c_0_13])).
12.75/12.96	cnf(c_0_19, plain, (tptp_8_968(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
12.75/12.96	cnf(c_0_20, plain, (tptpcol_16_7738(X1)|~isa(X1,c_tptpcol_16_7738)), inference(split_conjunct,[status(thm)],[c_0_16])).
12.75/12.96	cnf(c_0_21, plain, (isa(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)),c_tptpcol_16_7738)), inference(spm,[status(thm)],[c_0_17, c_0_15])).
12.75/12.96	cnf(c_0_22, negated_conjecture, (~tptpcol_16_7738(f_relationexistsallfn(c_tptpnsubcollectionofwithrelationtotypefnissuingaprescriptionproductscorrectivelensprescription_2804,c_tptp_8_968,c_tptpcol_16_7738,f_subcollectionofwithrelationtotypefn(c_issuingaprescription,c_products,c_correctivelensprescription)))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
12.75/12.96	cnf(c_0_23, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22]), ['proof']).
12.75/12.96	# SZS output end CNFRefutation
12.75/12.96	# Proof object total steps             : 24
12.75/12.96	# Proof object clause steps            : 11
12.75/12.96	# Proof object formula steps           : 13
12.75/12.96	# Proof object conjectures             : 5
12.75/12.96	# Proof object clause conjectures      : 2
12.75/12.96	# Proof object formula conjectures     : 3
12.75/12.96	# Proof object initial clauses used    : 6
12.75/12.96	# Proof object initial formulas used   : 6
12.75/12.96	# Proof object generating inferences   : 5
12.75/12.96	# Proof object simplifying inferences  : 1
12.75/12.96	# Training examples: 0 positive, 0 negative
12.75/12.96	# Parsed axioms                        : 1132
12.75/12.96	# Removed by relevancy pruning/SinE    : 0
12.75/12.96	# Initial clauses                      : 1133
12.75/12.96	# Removed in clause preprocessing      : 0
12.75/12.96	# Initial clauses in saturation        : 1133
12.75/12.96	# Processed clauses                    : 74240
12.75/12.96	# ...of these trivial                  : 24324
12.75/12.96	# ...subsumed                          : 13292
12.75/12.96	# ...remaining for further processing  : 36624
12.75/12.96	# Other redundant clauses eliminated   : 0
12.75/12.96	# Clauses deleted for lack of memory   : 0
12.75/12.96	# Backward-subsumed                    : 1
12.75/12.96	# Backward-rewritten                   : 0
12.75/12.96	# Generated clauses                    : 186108
12.75/12.96	# ...of the previous two non-trivial   : 113996
12.75/12.96	# Contextual simplify-reflections      : 0
12.75/12.96	# Paramodulations                      : 186108
12.75/12.96	# Factorizations                       : 0
12.75/12.96	# NegExts                              : 0
12.75/12.96	# Equation resolutions                 : 0
12.75/12.96	# Propositional unsat checks           : 0
12.75/12.96	#    Propositional check models        : 0
12.75/12.96	#    Propositional check unsatisfiable : 0
12.75/12.96	#    Propositional clauses             : 0
12.75/12.96	#    Propositional clauses after purity: 0
12.75/12.96	#    Propositional unsat core size     : 0
12.75/12.96	#    Propositional preprocessing time  : 0.000
12.75/12.96	#    Propositional encoding time       : 0.000
12.75/12.96	#    Propositional solver time         : 0.000
12.75/12.96	#    Success case prop preproc time    : 0.000
12.75/12.96	#    Success case prop encoding time   : 0.000
12.75/12.96	#    Success case prop solver time     : 0.000
12.75/12.96	# Current number of processed clauses  : 36623
12.75/12.96	#    Positive orientable unit clauses  : 16533
12.75/12.96	#    Positive unorientable unit clauses: 0
12.75/12.96	#    Negative unit clauses             : 10465
12.75/12.96	#    Non-unit-clauses                  : 9625
12.75/12.96	# Current number of unprocessed clauses: 40889
12.75/12.96	# ...number of literals in the above   : 49208
12.75/12.96	# Current number of archived formulas  : 0
12.75/12.96	# Current number of archived clauses   : 1
12.75/12.96	# Clause-clause subsumption calls (NU) : 8394582
12.75/12.96	# Rec. Clause-clause subsumption calls : 8073236
12.75/12.96	# Non-unit clause-clause subsumptions  : 2407
12.75/12.96	# Unit Clause-clause subsumption calls : 47509827
12.75/12.96	# Rewrite failures with RHS unbound    : 0
12.75/12.96	# BW rewrite match attempts            : 33
12.75/12.96	# BW rewrite match successes           : 0
12.75/12.96	# Condensation attempts                : 0
12.75/12.96	# Condensation successes               : 0
12.75/12.96	# Termbank termtop insertions          : 1265244
12.75/12.97	
12.75/12.97	# -------------------------------------------------
12.75/12.97	# User time                : 12.364 s
12.75/12.97	# System time              : 0.098 s
12.75/12.97	# Total time               : 12.462 s
12.75/12.97	# Maximum resident set size: 2544 pages
12.75/12.97	EOF
