0.08/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.13	% Command    : run_E %s %d THM
0.14/0.34	% Computer   : n002.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   : Wed Jul 14 16:56:17 EDT 2021
0.14/0.34	% CPUTime    : 
0.20/0.48	Running first-order theorem proving
0.20/0.48	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.48	# Version: 2.6
0.20/0.49	# No SInE strategy applied
0.20/0.49	# Trying AutoSched0 for 59 seconds
0.40/0.64	# AutoSched0-Mode selected heuristic G_E___107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S070I
0.40/0.64	# and selection function SelectVGNonCR.
0.40/0.64	#
0.40/0.64	# Preprocessing time       : 0.048 s
0.40/0.64	# Presaturation interreduction done
0.40/0.64	
0.40/0.64	# Proof found!
0.40/0.64	# SZS status Theorem
0.40/0.64	# SZS output start CNFRefutation
0.40/0.64	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/sandbox/benchmark/theBenchmark.p', conj_6)).
0.40/0.64	fof(fact_84_insert__subset, axiom, ![X4, X28, X7, X10]:((hBOOL(hAPP(fun(X4,bool),bool,hAPP(fun(X4,bool),fun(fun(X4,bool),bool),ord_less_eq(fun(X4,bool)),X7),X10))&hBOOL(hAPP(fun(X4,bool),bool,hAPP(X4,fun(fun(X4,bool),bool),member(X4),X28),X10)))<=>hBOOL(hAPP(fun(X4,bool),bool,hAPP(fun(X4,bool),fun(fun(X4,bool),bool),ord_less_eq(fun(X4,bool)),hAPP(fun(X4,bool),fun(X4,bool),hAPP(X4,fun(fun(X4,bool),fun(X4,bool)),insert(X4),X28),X7)),X10))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_84_insert__subset)).
0.40/0.64	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/sandbox/benchmark/theBenchmark.p', conj_1)).
0.40/0.64	fof(fact_78_imageI, axiom, ![X3, X4, X6, X28, X7]:(hBOOL(hAPP(fun(X4,bool),bool,hAPP(X4,fun(fun(X4,bool),bool),member(X4),X28),X7))=>hBOOL(hAPP(fun(X3,bool),bool,hAPP(X3,fun(fun(X3,bool),bool),member(X3),hAPP(X4,X3,X6,X28)),hAPP(fun(X4,bool),fun(X3,bool),hAPP(fun(X4,X3),fun(fun(X4,bool),fun(X3,bool)),image(X4,X3),X6),X7)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_78_imageI)).
0.40/0.64	fof(conj_4, hypothesis, hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_4)).
0.40/0.64	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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_6])])).
0.40/0.64	fof(c_0_6, plain, ![X688, X689, X690, X691]:((~hBOOL(hAPP(fun(X688,bool),bool,hAPP(fun(X688,bool),fun(fun(X688,bool),bool),ord_less_eq(fun(X688,bool)),X690),X691))|~hBOOL(hAPP(fun(X688,bool),bool,hAPP(X688,fun(fun(X688,bool),bool),member(X688),X689),X691))|hBOOL(hAPP(fun(X688,bool),bool,hAPP(fun(X688,bool),fun(fun(X688,bool),bool),ord_less_eq(fun(X688,bool)),hAPP(fun(X688,bool),fun(X688,bool),hAPP(X688,fun(fun(X688,bool),fun(X688,bool)),insert(X688),X689),X690)),X691)))&((hBOOL(hAPP(fun(X688,bool),bool,hAPP(fun(X688,bool),fun(fun(X688,bool),bool),ord_less_eq(fun(X688,bool)),X690),X691))|~hBOOL(hAPP(fun(X688,bool),bool,hAPP(fun(X688,bool),fun(fun(X688,bool),bool),ord_less_eq(fun(X688,bool)),hAPP(fun(X688,bool),fun(X688,bool),hAPP(X688,fun(fun(X688,bool),fun(X688,bool)),insert(X688),X689),X690)),X691)))&(hBOOL(hAPP(fun(X688,bool),bool,hAPP(X688,fun(fun(X688,bool),bool),member(X688),X689),X691))|~hBOOL(hAPP(fun(X688,bool),bool,hAPP(fun(X688,bool),fun(fun(X688,bool),bool),ord_less_eq(fun(X688,bool)),hAPP(fun(X688,bool),fun(X688,bool),hAPP(X688,fun(fun(X688,bool),fun(X688,bool)),insert(X688),X689),X690)),X691))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_84_insert__subset])])])).
0.40/0.64	cnf(c_0_7, 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_5])).
0.40/0.64	cnf(c_0_8, 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_6])).
0.40/0.64	cnf(c_0_9, 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.40/0.64	fof(c_0_10, plain, ![X852, X853, X854, X855, X856]:(~hBOOL(hAPP(fun(X853,bool),bool,hAPP(X853,fun(fun(X853,bool),bool),member(X853),X855),X856))|hBOOL(hAPP(fun(X852,bool),bool,hAPP(X852,fun(fun(X852,bool),bool),member(X852),hAPP(X853,X852,X854,X855)),hAPP(fun(X853,bool),fun(X852,bool),hAPP(fun(X853,X852),fun(fun(X853,bool),fun(X852,bool)),image(X853,X852),X854),X856)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_78_imageI])])).
0.40/0.64	cnf(c_0_11, 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_7, c_0_8]), c_0_9])])).
0.40/0.64	cnf(c_0_12, 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_10])).
0.40/0.64	cnf(c_0_13, 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.40/0.64	cnf(c_0_14, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])]), ['proof']).
0.40/0.64	# SZS output end CNFRefutation
0.40/0.64	# Proof object total steps             : 15
0.40/0.64	# Proof object clause steps            : 7
0.40/0.64	# Proof object formula steps           : 8
0.40/0.64	# Proof object conjectures             : 5
0.40/0.64	# Proof object clause conjectures      : 3
0.40/0.64	# Proof object formula conjectures     : 2
0.40/0.64	# Proof object initial clauses used    : 5
0.40/0.64	# Proof object initial formulas used   : 5
0.40/0.64	# Proof object generating inferences   : 2
0.40/0.64	# Proof object simplifying inferences  : 4
0.40/0.64	# Training examples: 0 positive, 0 negative
0.40/0.64	# Parsed axioms                        : 161
0.40/0.64	# Removed by relevancy pruning/SinE    : 0
0.40/0.64	# Initial clauses                      : 200
0.40/0.64	# Removed in clause preprocessing      : 3
0.40/0.64	# Initial clauses in saturation        : 197
0.40/0.64	# Processed clauses                    : 526
0.40/0.64	# ...of these trivial                  : 8
0.40/0.64	# ...subsumed                          : 117
0.40/0.64	# ...remaining for further processing  : 401
0.40/0.64	# Other redundant clauses eliminated   : 2
0.40/0.64	# Clauses deleted for lack of memory   : 0
0.40/0.64	# Backward-subsumed                    : 0
0.40/0.64	# Backward-rewritten                   : 6
0.40/0.64	# Generated clauses                    : 1811
0.40/0.64	# ...of the previous two non-trivial   : 1605
0.40/0.64	# Contextual simplify-reflections      : 0
0.40/0.64	# Paramodulations                      : 1800
0.40/0.64	# Factorizations                       : 2
0.40/0.64	# NegExts                              : 0
0.40/0.64	# Equation resolutions                 : 9
0.40/0.64	# Propositional unsat checks           : 0
0.40/0.64	#    Propositional check models        : 0
0.40/0.64	#    Propositional check unsatisfiable : 0
0.40/0.64	#    Propositional clauses             : 0
0.40/0.64	#    Propositional clauses after purity: 0
0.40/0.64	#    Propositional unsat core size     : 0
0.40/0.64	#    Propositional preprocessing time  : 0.000
0.40/0.64	#    Propositional encoding time       : 0.000
0.40/0.64	#    Propositional solver time         : 0.000
0.40/0.64	#    Success case prop preproc time    : 0.000
0.40/0.64	#    Success case prop encoding time   : 0.000
0.40/0.64	#    Success case prop solver time     : 0.000
0.40/0.64	# Current number of processed clauses  : 225
0.40/0.64	#    Positive orientable unit clauses  : 68
0.40/0.64	#    Positive unorientable unit clauses: 5
0.40/0.64	#    Negative unit clauses             : 12
0.40/0.64	#    Non-unit-clauses                  : 140
0.40/0.64	# Current number of unprocessed clauses: 1442
0.40/0.64	# ...number of literals in the above   : 3161
0.40/0.64	# Current number of archived formulas  : 0
0.40/0.64	# Current number of archived clauses   : 176
0.40/0.64	# Clause-clause subsumption calls (NU) : 4824
0.40/0.64	# Rec. Clause-clause subsumption calls : 4651
0.40/0.64	# Non-unit clause-clause subsumptions  : 91
0.40/0.64	# Unit Clause-clause subsumption calls : 304
0.40/0.64	# Rewrite failures with RHS unbound    : 0
0.40/0.64	# BW rewrite match attempts            : 3023
0.40/0.64	# BW rewrite match successes           : 14
0.40/0.64	# Condensation attempts                : 0
0.40/0.64	# Condensation successes               : 0
0.40/0.64	# Termbank termtop insertions          : 162882
0.40/0.64	
0.40/0.64	# -------------------------------------------------
0.40/0.64	# User time                : 0.156 s
0.40/0.64	# System time              : 0.008 s
0.40/0.64	# Total time               : 0.164 s
0.40/0.64	# Maximum resident set size: 1844 pages
0.40/0.64	EOF