0.00/0.04	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.05	% 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.26	% Computer   : n127.star.cs.uiowa.edu
0.03/0.26	% Model      : x86_64 x86_64
0.03/0.26	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.26	% Memory     : 32218.625MB
0.03/0.26	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.26	% CPULimit   : 300
0.03/0.26	% DateTime   : Sat Jul 14 04:27:10 CDT 2018
0.03/0.26	% CPUTime    : 
0.03/0.26	# Version: 2.2pre001
0.06/0.27	# No SInE strategy applied
0.06/0.27	# Trying AutoSched0 for 151 seconds
0.06/0.33	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_TT_S0Y
0.06/0.33	# and selection function SelectMaxLComplexAvoidPosPred.
0.06/0.33	#
0.06/0.33	# Preprocessing time       : 0.017 s
0.06/0.33	# Presaturation interreduction done
0.06/0.33	
0.06/0.33	# Proof found!
0.06/0.33	# SZS status Theorem
0.06/0.33	# SZS output start CNFRefutation
0.06/0.33	fof(conj_6, conjecture, hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_6)).
0.06/0.33	fof(fact_84_insert__subset, axiom, ![X1, X2, X3, X4]:(hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),hAPP(fun(X1,bool),fun(X1,bool),hAPP(X1,fun(fun(X1,bool),fun(X1,bool)),insert(X1),X2),X3)),X4))<=>(hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),X3),X4))&hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X2),X4)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_84_insert__subset)).
0.06/0.33	fof(conj_1, hypothesis, hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),g),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_1)).
0.06/0.33	fof(fact_78_imageI, axiom, ![X10, X1, X11, X2, X3]:(hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X2),X3))=>hBOOL(hAPP(fun(X10,bool),bool,hAPP(X10,fun(fun(X10,bool),bool),member(X10),hAPP(X1,X10,X11,X2)),hAPP(fun(X1,bool),fun(X10,bool),hAPP(fun(X1,X10),fun(fun(X1,bool),fun(X10,bool)),image(X1,X10),X11),X3)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_78_imageI)).
0.06/0.33	fof(conj_4, hypothesis, hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_4)).
0.06/0.33	fof(c_0_5, negated_conjecture, ~(hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))), inference(assume_negation,[status(cth)],[conj_6])).
0.06/0.33	fof(c_0_6, negated_conjecture, ~hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))), inference(fof_simplification,[status(thm)],[c_0_5])).
0.06/0.33	fof(c_0_7, plain, ![X56, X57, X58, X59, X56, X57, X58, X59]:(((hBOOL(hAPP(fun(X56,bool),bool,hAPP(fun(X56,bool),fun(fun(X56,bool),bool),ord_less_eq(fun(X56,bool)),X58),X59))|~hBOOL(hAPP(fun(X56,bool),bool,hAPP(fun(X56,bool),fun(fun(X56,bool),bool),ord_less_eq(fun(X56,bool)),hAPP(fun(X56,bool),fun(X56,bool),hAPP(X56,fun(fun(X56,bool),fun(X56,bool)),insert(X56),X57),X58)),X59)))&(hBOOL(hAPP(fun(X56,bool),bool,hAPP(X56,fun(fun(X56,bool),bool),member(X56),X57),X59))|~hBOOL(hAPP(fun(X56,bool),bool,hAPP(fun(X56,bool),fun(fun(X56,bool),bool),ord_less_eq(fun(X56,bool)),hAPP(fun(X56,bool),fun(X56,bool),hAPP(X56,fun(fun(X56,bool),fun(X56,bool)),insert(X56),X57),X58)),X59))))&(~hBOOL(hAPP(fun(X56,bool),bool,hAPP(fun(X56,bool),fun(fun(X56,bool),bool),ord_less_eq(fun(X56,bool)),X58),X59))|~hBOOL(hAPP(fun(X56,bool),bool,hAPP(X56,fun(fun(X56,bool),bool),member(X56),X57),X59))|hBOOL(hAPP(fun(X56,bool),bool,hAPP(fun(X56,bool),fun(fun(X56,bool),bool),ord_less_eq(fun(X56,bool)),hAPP(fun(X56,bool),fun(X56,bool),hAPP(X56,fun(fun(X56,bool),fun(X56,bool)),insert(X56),X57),X58)),X59)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_84_insert__subset])])])])])).
0.06/0.33	cnf(c_0_8, negated_conjecture, (~hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.06/0.33	cnf(c_0_9, plain, (hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),hAPP(fun(X1,bool),fun(X1,bool),hAPP(X1,fun(fun(X1,bool),fun(X1,bool)),insert(X1),X4),X2)),X3))|~hBOOL(hAPP(fun(X1,bool),bool,hAPP(fun(X1,bool),fun(fun(X1,bool),bool),ord_less_eq(fun(X1,bool)),X2),X3))|~hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X4),X3))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.06/0.33	cnf(c_0_10, hypothesis, (hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),g),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))), inference(split_conjunct,[status(thm)],[conj_1])).
0.06/0.33	fof(c_0_11, plain, ![X364, X365, X366, X367, X368]:(~hBOOL(hAPP(fun(X365,bool),bool,hAPP(X365,fun(fun(X365,bool),bool),member(X365),X367),X368))|hBOOL(hAPP(fun(X364,bool),bool,hAPP(X364,fun(fun(X364,bool),bool),member(X364),hAPP(X365,X364,X366,X367)),hAPP(fun(X365,bool),fun(X364,bool),hAPP(fun(X365,X364),fun(fun(X365,bool),fun(X364,bool)),image(X365,X364),X366),X368)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_78_imageI])])).
0.06/0.33	cnf(c_0_12, negated_conjecture, (~hBOOL(hAPP(fun(x_a,bool),bool,hAPP(x_a,fun(fun(x_a,bool),bool),member(x_a),hAPP(pname,x_a,mgt_call,pn)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])])).
0.06/0.33	cnf(c_0_13, plain, (hBOOL(hAPP(fun(X4,bool),bool,hAPP(X4,fun(fun(X4,bool),bool),member(X4),hAPP(X1,X4,X5,X2)),hAPP(fun(X1,bool),fun(X4,bool),hAPP(fun(X1,X4),fun(fun(X1,bool),fun(X4,bool)),image(X1,X4),X5),X3)))|~hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X2),X3))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.06/0.33	cnf(c_0_14, hypothesis, (hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u))), inference(split_conjunct,[status(thm)],[conj_4])).
0.06/0.33	cnf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])]), ['proof']).
0.06/0.33	# SZS output end CNFRefutation
0.06/0.33	# Proof object total steps             : 16
0.06/0.33	# Proof object clause steps            : 7
0.06/0.33	# Proof object formula steps           : 9
0.06/0.33	# Proof object conjectures             : 6
0.06/0.33	# Proof object clause conjectures      : 3
0.06/0.33	# Proof object formula conjectures     : 3
0.06/0.33	# Proof object initial clauses used    : 5
0.06/0.33	# Proof object initial formulas used   : 5
0.06/0.33	# Proof object generating inferences   : 2
0.06/0.33	# Proof object simplifying inferences  : 4
0.06/0.33	# Training examples: 0 positive, 0 negative
0.06/0.33	# Parsed axioms                        : 161
0.06/0.33	# Removed by relevancy pruning/SinE    : 0
0.06/0.33	# Initial clauses                      : 200
0.06/0.33	# Removed in clause preprocessing      : 3
0.06/0.33	# Initial clauses in saturation        : 197
0.06/0.33	# Processed clauses                    : 443
0.06/0.33	# ...of these trivial                  : 3
0.06/0.33	# ...subsumed                          : 86
0.06/0.33	# ...remaining for further processing  : 354
0.06/0.33	# Other redundant clauses eliminated   : 4
0.06/0.33	# Clauses deleted for lack of memory   : 0
0.06/0.33	# Backward-subsumed                    : 0
0.06/0.33	# Backward-rewritten                   : 1
0.06/0.33	# Generated clauses                    : 1125
0.06/0.33	# ...of the previous two non-trivial   : 884
0.06/0.33	# Contextual simplify-reflections      : 20
0.06/0.33	# Paramodulations                      : 1116
0.06/0.33	# Factorizations                       : 2
0.06/0.33	# Equation resolutions                 : 7
0.06/0.33	# Propositional unsat checks           : 0
0.06/0.33	#    Propositional check models        : 0
0.06/0.33	#    Propositional check unsatisfiable : 0
0.06/0.33	#    Propositional clauses             : 0
0.06/0.33	#    Propositional clauses after purity: 0
0.06/0.33	#    Propositional unsat core size     : 0
0.06/0.33	# Current number of processed clauses  : 183
0.06/0.33	#    Positive orientable unit clauses  : 61
0.06/0.33	#    Positive unorientable unit clauses: 2
0.06/0.33	#    Negative unit clauses             : 8
0.06/0.33	#    Non-unit-clauses                  : 112
0.06/0.33	# Current number of unprocessed clauses: 805
0.06/0.33	# ...number of literals in the above   : 1968
0.06/0.33	# Current number of archived formulas  : 0
0.06/0.33	# Current number of archived clauses   : 170
0.06/0.33	# Clause-clause subsumption calls (NU) : 5583
0.06/0.33	# Rec. Clause-clause subsumption calls : 5290
0.06/0.33	# Non-unit clause-clause subsumptions  : 100
0.06/0.33	# Unit Clause-clause subsumption calls : 46
0.06/0.33	# Rewrite failures with RHS unbound    : 0
0.06/0.33	# BW rewrite match attempts            : 3252
0.06/0.33	# BW rewrite match successes           : 14
0.06/0.33	# Condensation attempts                : 0
0.06/0.33	# Condensation successes               : 0
0.06/0.33	# Termbank termtop insertions          : 101265
0.06/0.33	
0.06/0.33	# -------------------------------------------------
0.06/0.33	# User time                : 0.067 s
0.06/0.33	# System time              : 0.002 s
0.06/0.33	# Total time               : 0.069 s
0.06/0.33	# Maximum resident set size: 1776 pages
0.13/0.39	EOF