0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.03/0.23	% Computer   : n171.star.cs.uiowa.edu
0.03/0.23	% Model      : x86_64 x86_64
0.03/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.23	% Memory     : 32218.625MB
0.03/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.23	% CPULimit   : 300
0.03/0.23	% DateTime   : Sat Jul 14 04:33:11 CDT 2018
0.03/0.24	% CPUTime    : 
0.03/0.24	# Version: 2.2pre001
0.03/0.24	# No SInE strategy applied
0.03/0.24	# Trying AutoSched0 for 151 seconds
29.89/30.12	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y
29.89/30.12	# and selection function SelectMaxLComplexAvoidPosPred.
29.89/30.12	#
29.89/30.12	# Preprocessing time       : 1.166 s
29.89/30.12	# Presaturation interreduction done
29.89/30.12	
29.89/30.12	# Proof found!
29.89/30.12	# SZS status Theorem
29.89/30.12	# SZS output start CNFRefutation
29.89/30.12	fof('T-Weak-FreeVar-abs', conjecture, ![X6, X30, X7, X2, X35, X11]:(vtcheck(vbind(X6,X30,X7),vabs(X2,X35,veabs),X11)<=(vtcheck(X7,vabs(X2,X35,veabs),X11)&~(visFreeVar(X6,vabs(X2,X35,veabs))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'T-Weak-FreeVar-abs')).
29.89/30.12	fof('T-Weak-FreeVar-abs-1', axiom, ![X6, X30, X7, X2, X35, X11]:(((~(visFreeVar(X6,vabs(X2,X35,veabs)))&vtcheck(X7,vabs(X2,X35,veabs),X11))&X2!=X6)=>vtcheck(vbind(X6,X30,X7),vabs(X2,X35,veabs),X11)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'T-Weak-FreeVar-abs-1')).
29.89/30.12	fof(isFreeVar1, axiom, ![X11, X3, X8, X6, X25, X10]:((X25=X3&X8=vabs(X6,X11,X10))=>(((X25!=X6&visFreeVar(X25,X10))<=visFreeVar(X3,X8))&(visFreeVar(X3,X8)<=(visFreeVar(X25,X10)&X6!=X25)))), file('/export/starexec/sandbox/benchmark/Axioms/COM001+0.ax', isFreeVar1)).
29.89/30.12	fof('T-Weak-FreeVar-abs-2', axiom, ![X6, X30, X7, X2, X35, X11]:(((X6=X2&~(visFreeVar(X6,vabs(X2,X35,veabs))))&vtcheck(X7,vabs(X2,X35,veabs),X11))=>vtcheck(vbind(X6,X30,X7),vabs(X2,X35,veabs),X11)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', 'T-Weak-FreeVar-abs-2')).
29.89/30.12	fof(c_0_4, negated_conjecture, ~(![X6, X30, X7, X2, X35, X11]:(vtcheck(vbind(X6,X30,X7),vabs(X2,X35,veabs),X11)<=(vtcheck(X7,vabs(X2,X35,veabs),X11)&~(visFreeVar(X6,vabs(X2,X35,veabs)))))), inference(assume_negation,[status(cth)],['T-Weak-FreeVar-abs'])).
29.89/30.12	fof(c_0_5, negated_conjecture, ((vtcheck(esk77_0,vabs(esk78_0,esk79_0,veabs),esk80_0)&~visFreeVar(esk75_0,vabs(esk78_0,esk79_0,veabs)))&~vtcheck(vbind(esk75_0,esk76_0,esk77_0),vabs(esk78_0,esk79_0,veabs),esk80_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])).
29.89/30.12	fof(c_0_6, plain, ![X353, X354, X355, X356, X357, X358]:(visFreeVar(X353,vabs(X356,X357,veabs))|~vtcheck(X355,vabs(X356,X357,veabs),X358)|X356=X353|vtcheck(vbind(X353,X354,X355),vabs(X356,X357,veabs),X358)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['T-Weak-FreeVar-abs-1'])])])).
29.89/30.12	fof(c_0_7, plain, ![X171, X172, X173, X174, X175, X176]:(((X175!=X174|~visFreeVar(X172,X173)|(X175!=X172|X173!=vabs(X174,X171,X176)))&(visFreeVar(X175,X176)|~visFreeVar(X172,X173)|(X175!=X172|X173!=vabs(X174,X171,X176))))&(~visFreeVar(X175,X176)|X174=X175|visFreeVar(X172,X173)|(X175!=X172|X173!=vabs(X174,X171,X176)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[isFreeVar1])])])])).
29.89/30.12	cnf(c_0_8, negated_conjecture, (~vtcheck(vbind(esk75_0,esk76_0,esk77_0),vabs(esk78_0,esk79_0,veabs),esk80_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
29.89/30.12	cnf(c_0_9, plain, (visFreeVar(X1,vabs(X2,X3,veabs))|X2=X1|vtcheck(vbind(X1,X6,X4),vabs(X2,X3,veabs),X5)|~vtcheck(X4,vabs(X2,X3,veabs),X5)), inference(split_conjunct,[status(thm)],[c_0_6])).
29.89/30.12	cnf(c_0_10, negated_conjecture, (vtcheck(esk77_0,vabs(esk78_0,esk79_0,veabs),esk80_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
29.89/30.12	cnf(c_0_11, negated_conjecture, (~visFreeVar(esk75_0,vabs(esk78_0,esk79_0,veabs))), inference(split_conjunct,[status(thm)],[c_0_5])).
29.89/30.12	fof(c_0_12, plain, ![X369, X370, X371, X372, X373, X374]:(X369!=X372|visFreeVar(X369,vabs(X372,X373,veabs))|~vtcheck(X371,vabs(X372,X373,veabs),X374)|vtcheck(vbind(X369,X370,X371),vabs(X372,X373,veabs),X374)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],['T-Weak-FreeVar-abs-2'])])])).
29.89/30.12	cnf(c_0_13, plain, (X1!=X2|~visFreeVar(X3,X4)|X1!=X3|X4!=vabs(X2,X5,X6)), inference(split_conjunct,[status(thm)],[c_0_7])).
29.89/30.12	cnf(c_0_14, negated_conjecture, (esk75_0=esk78_0), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])]), c_0_11])).
29.89/30.13	cnf(c_0_15, plain, (visFreeVar(X1,vabs(X2,X3,veabs))|vtcheck(vbind(X1,X6,X4),vabs(X2,X3,veabs),X5)|X1!=X2|~vtcheck(X4,vabs(X2,X3,veabs),X5)), inference(split_conjunct,[status(thm)],[c_0_12])).
29.89/30.13	cnf(c_0_16, plain, (~visFreeVar(X1,vabs(X1,X2,X3))), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_13])])])).
29.89/30.13	cnf(c_0_17, negated_conjecture, (~vtcheck(vbind(esk78_0,esk76_0,esk77_0),vabs(esk78_0,esk79_0,veabs),esk80_0)), inference(rw,[status(thm)],[c_0_8, c_0_14])).
29.89/30.13	cnf(c_0_18, plain, (vtcheck(vbind(X1,X2,X3),vabs(X1,X4,veabs),X5)|~vtcheck(X3,vabs(X1,X4,veabs),X5)), inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_15]), c_0_16])).
29.89/30.13	cnf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_10])]), ['proof']).
29.89/30.13	# SZS output end CNFRefutation
29.89/30.13	# Proof object total steps             : 20
29.89/30.13	# Proof object clause steps            : 11
29.89/30.13	# Proof object formula steps           : 9
29.89/30.13	# Proof object conjectures             : 9
29.89/30.13	# Proof object clause conjectures      : 6
29.89/30.13	# Proof object formula conjectures     : 3
29.89/30.13	# Proof object initial clauses used    : 6
29.89/30.13	# Proof object initial formulas used   : 4
29.89/30.13	# Proof object generating inferences   : 2
29.89/30.13	# Proof object simplifying inferences  : 11
29.89/30.13	# Training examples: 0 positive, 0 negative
29.89/30.13	# Parsed axioms                        : 60
29.89/30.13	# Removed by relevancy pruning/SinE    : 0
29.89/30.13	# Initial clauses                      : 31142
29.89/30.13	# Removed in clause preprocessing      : 10
29.89/30.13	# Initial clauses in saturation        : 31132
29.89/30.13	# Processed clauses                    : 62380
29.89/30.13	# ...of these trivial                  : 0
29.89/30.13	# ...subsumed                          : 8314
29.89/30.13	# ...remaining for further processing  : 54066
29.89/30.13	# Other redundant clauses eliminated   : 31136
29.89/30.13	# Clauses deleted for lack of memory   : 0
29.89/30.13	# Backward-subsumed                    : 0
29.89/30.13	# Backward-rewritten                   : 4
29.89/30.13	# Generated clauses                    : 31550
29.89/30.13	# ...of the previous two non-trivial   : 31532
29.89/30.13	# Contextual simplify-reflections      : 19601
29.89/30.13	# Paramodulations                      : 453
29.89/30.13	# Factorizations                       : 0
29.89/30.13	# Equation resolutions                 : 31149
29.89/30.13	# Propositional unsat checks           : 0
29.89/30.13	#    Propositional check models        : 0
29.89/30.13	#    Propositional check unsatisfiable : 0
29.89/30.13	#    Propositional clauses             : 0
29.89/30.13	#    Propositional clauses after purity: 0
29.89/30.13	#    Propositional unsat core size     : 0
29.89/30.13	# Current number of processed clauses  : 146
29.89/30.13	#    Positive orientable unit clauses  : 16
29.89/30.13	#    Positive unorientable unit clauses: 0
29.89/30.13	#    Negative unit clauses             : 83
29.89/30.13	#    Non-unit-clauses                  : 47
29.89/30.13	# Current number of unprocessed clauses: 23115
29.89/30.13	# ...number of literals in the above   : 138300
29.89/30.13	# Current number of archived formulas  : 0
29.89/30.13	# Current number of archived clauses   : 22836
29.89/30.13	# Clause-clause subsumption calls (NU) : 45800625
29.89/30.13	# Rec. Clause-clause subsumption calls : 64263
29.89/30.13	# Non-unit clause-clause subsumptions  : 27905
29.89/30.13	# Unit Clause-clause subsumption calls : 1292
29.89/30.13	# Rewrite failures with RHS unbound    : 0
29.89/30.13	# BW rewrite match attempts            : 5
29.89/30.13	# BW rewrite match successes           : 1
29.89/30.13	# Condensation attempts                : 0
29.89/30.13	# Condensation successes               : 0
29.89/30.13	# Termbank termtop insertions          : 3704380
29.89/30.14	
29.89/30.14	# -------------------------------------------------
29.89/30.14	# User time                : 29.778 s
29.89/30.14	# System time              : 0.123 s
29.89/30.14	# Total time               : 29.901 s
29.89/30.14	# Maximum resident set size: 1676 pages
29.89/30.14	EOF