0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/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 16:28:34 EDT 2021
0.14/0.35	% CPUTime    : 
0.21/0.54	Running first-order theorem proving
0.21/0.54	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.21/0.54	# Version: 2.6
0.40/0.57	# No SInE strategy applied
0.40/0.57	# Trying AutoSched0 for 59 seconds
0.40/0.83	# AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0e
0.40/0.83	# and selection function SelectLargestNegLit.
0.40/0.83	#
0.40/0.83	# Preprocessing time       : 0.107 s
0.40/0.83	
0.40/0.83	# Proof found!
0.40/0.83	# SZS status Theorem
0.40/0.83	# SZS output start CNFRefutation
0.40/0.83	fof(fact_421_not__less__iff__gr__or__eq, axiom, ![X4]:(![X15, X14]:(~(hBOOL(hAPP(X4,bool,hAPP(X4,fun(X4,bool),ord_less(X4),X15),X14)))<=>(ti(X4,X15)=ti(X4,X14)|hBOOL(hAPP(X4,bool,hAPP(X4,fun(X4,bool),ord_less(X4),X14),X15))))<=linorder(X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_421_not__less__iff__gr__or__eq)).
0.40/0.83	fof(fact_119_number__of__is__id, axiom, ![X21]:X21=number_number_of(int,X21), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_119_number__of__is__id)).
0.40/0.83	fof(conj_0, conjecture, hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))!=zero_zero(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
0.40/0.83	fof(fact_0_n1pos, axiom, hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_n1pos)).
0.40/0.83	fof(fact_73_Pls__def, axiom, pls=zero_zero(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_73_Pls__def)).
0.40/0.83	fof(fact_37_one__is__num__one, axiom, number_number_of(int,hAPP(int,int,bit1,pls))=one_one(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_37_one__is__num__one)).
0.40/0.83	fof(tsy_c_hAPP_4_res, axiom, ![X4, X18, X19]:ti(X4,hAPP(X4,X4,X18,X19))=hAPP(X4,X4,X18,X19), file('/export/starexec/sandbox/benchmark/theBenchmark.p', tsy_c_hAPP_4_res)).
0.40/0.83	fof(fact_184_power__eq__0__iff, axiom, ![X4]:((((mult_zero(X4)&no_zero_divisors(X4))&zero_neq_one(X4))&power(X4))=>![X27, X3]:(hAPP(nat,X4,power_power(X4,X27),X3)=zero_zero(X4)<=>(zero_zero(nat)!=X3&ti(X4,X27)=zero_zero(X4)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_184_power__eq__0__iff)).
0.40/0.83	fof(tsy_c_Int_OPls_res, hypothesis, pls=ti(int,pls), file('/export/starexec/sandbox/benchmark/theBenchmark.p', tsy_c_Int_OPls_res)).
0.40/0.83	fof(arity_Int_Oint___Orderings_Olinorder, axiom, linorder(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', arity_Int_Oint___Orderings_Olinorder)).
0.40/0.83	fof(arity_Int_Oint___Rings_Ozero__neq__one, axiom, zero_neq_one(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', arity_Int_Oint___Rings_Ozero__neq__one)).
0.40/0.83	fof(arity_Int_Oint___Rings_Ono__zero__divisors, axiom, no_zero_divisors(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', arity_Int_Oint___Rings_Ono__zero__divisors)).
0.40/0.83	fof(arity_Int_Oint___Rings_Omult__zero, axiom, mult_zero(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', arity_Int_Oint___Rings_Omult__zero)).
0.40/0.83	fof(arity_Int_Oint___Power_Opower, axiom, power(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', arity_Int_Oint___Power_Opower)).
0.40/0.83	fof(c_0_14, plain, ![X4]:(linorder(X4)=>![X15, X14]:(~hBOOL(hAPP(X4,bool,hAPP(X4,fun(X4,bool),ord_less(X4),X15),X14))<=>(ti(X4,X15)=ti(X4,X14)|hBOOL(hAPP(X4,bool,hAPP(X4,fun(X4,bool),ord_less(X4),X14),X15))))), inference(fof_simplification,[status(thm)],[fact_421_not__less__iff__gr__or__eq])).
0.40/0.83	fof(c_0_15, plain, ![X2512]:X2512=number_number_of(int,X2512), inference(variable_rename,[status(thm)],[fact_119_number__of__is__id])).
0.40/0.83	fof(c_0_16, negated_conjecture, hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))=zero_zero(int), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
0.40/0.83	fof(c_0_17, plain, ![X1633, X1634, X1635]:((hBOOL(hAPP(X1633,bool,hAPP(X1633,fun(X1633,bool),ord_less(X1633),X1634),X1635))|(ti(X1633,X1634)=ti(X1633,X1635)|hBOOL(hAPP(X1633,bool,hAPP(X1633,fun(X1633,bool),ord_less(X1633),X1635),X1634)))|~linorder(X1633))&((ti(X1633,X1634)!=ti(X1633,X1635)|~hBOOL(hAPP(X1633,bool,hAPP(X1633,fun(X1633,bool),ord_less(X1633),X1634),X1635))|~linorder(X1633))&(~hBOOL(hAPP(X1633,bool,hAPP(X1633,fun(X1633,bool),ord_less(X1633),X1635),X1634))|~hBOOL(hAPP(X1633,bool,hAPP(X1633,fun(X1633,bool),ord_less(X1633),X1634),X1635))|~linorder(X1633)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])).
0.40/0.83	cnf(c_0_18, plain, (hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))))), inference(split_conjunct,[status(thm)],[fact_0_n1pos])).
0.40/0.83	cnf(c_0_19, plain, (pls=zero_zero(int)), inference(split_conjunct,[status(thm)],[fact_73_Pls__def])).
0.40/0.83	cnf(c_0_20, plain, (number_number_of(int,hAPP(int,int,bit1,pls))=one_one(int)), inference(split_conjunct,[status(thm)],[fact_37_one__is__num__one])).
0.40/0.83	cnf(c_0_21, plain, (X1=number_number_of(int,X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
0.40/0.83	fof(c_0_22, plain, ![X2336, X2337, X2338]:ti(X2336,hAPP(X2336,X2336,X2337,X2338))=hAPP(X2336,X2336,X2337,X2338), inference(variable_rename,[status(thm)],[tsy_c_hAPP_4_res])).
0.40/0.83	fof(c_0_23, plain, ![X1696, X1697, X1698]:(((zero_zero(nat)!=X1698|hAPP(nat,X1696,power_power(X1696,X1697),X1698)!=zero_zero(X1696)|(~mult_zero(X1696)|~no_zero_divisors(X1696)|~zero_neq_one(X1696)|~power(X1696)))&(ti(X1696,X1697)=zero_zero(X1696)|hAPP(nat,X1696,power_power(X1696,X1697),X1698)!=zero_zero(X1696)|(~mult_zero(X1696)|~no_zero_divisors(X1696)|~zero_neq_one(X1696)|~power(X1696))))&(zero_zero(nat)=X1698|ti(X1696,X1697)!=zero_zero(X1696)|hAPP(nat,X1696,power_power(X1696,X1697),X1698)=zero_zero(X1696)|(~mult_zero(X1696)|~no_zero_divisors(X1696)|~zero_neq_one(X1696)|~power(X1696)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_184_power__eq__0__iff])])])])).
0.40/0.83	cnf(c_0_24, negated_conjecture, (hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))=zero_zero(int)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.40/0.83	cnf(c_0_25, plain, (ti(X1,X2)!=ti(X1,X3)|~hBOOL(hAPP(X1,bool,hAPP(X1,fun(X1,bool),ord_less(X1),X2),X3))|~linorder(X1)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.40/0.83	cnf(c_0_26, plain, (hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,pls)),hAPP(nat,int,semiring_1_of_nat(int),n))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19]), c_0_20]), c_0_21])).
0.40/0.83	cnf(c_0_27, hypothesis, (pls=ti(int,pls)), inference(split_conjunct,[status(thm)],[tsy_c_Int_OPls_res])).
0.40/0.83	cnf(c_0_28, plain, (ti(X1,hAPP(X1,X1,X2,X3))=hAPP(X1,X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_22])).
0.40/0.83	cnf(c_0_29, plain, (linorder(int)), inference(split_conjunct,[status(thm)],[arity_Int_Oint___Orderings_Olinorder])).
0.40/0.83	cnf(c_0_30, plain, (ti(X1,X2)=zero_zero(X1)|hAPP(nat,X1,power_power(X1,X2),X3)!=zero_zero(X1)|~mult_zero(X1)|~no_zero_divisors(X1)|~zero_neq_one(X1)|~power(X1)), inference(split_conjunct,[status(thm)],[c_0_23])).
0.40/0.84	cnf(c_0_31, negated_conjecture, (hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,pls)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))=pls), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_20]), c_0_21]), c_0_19])).
0.40/0.84	cnf(c_0_32, plain, (zero_neq_one(int)), inference(split_conjunct,[status(thm)],[arity_Int_Oint___Rings_Ozero__neq__one])).
0.40/0.84	cnf(c_0_33, plain, (no_zero_divisors(int)), inference(split_conjunct,[status(thm)],[arity_Int_Oint___Rings_Ono__zero__divisors])).
0.40/0.84	cnf(c_0_34, plain, (mult_zero(int)), inference(split_conjunct,[status(thm)],[arity_Int_Oint___Rings_Omult__zero])).
0.40/0.84	cnf(c_0_35, plain, (power(int)), inference(split_conjunct,[status(thm)],[arity_Int_Oint___Power_Opower])).
0.40/0.84	cnf(c_0_36, plain, (hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,pls)),hAPP(nat,int,semiring_1_of_nat(int),n))!=pls), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27]), c_0_28]), c_0_29])])).
0.40/0.84	cnf(c_0_37, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_28]), c_0_19]), c_0_19]), c_0_32]), c_0_33]), c_0_34]), c_0_35])]), c_0_36]), ['proof']).
0.40/0.84	# SZS output end CNFRefutation
0.40/0.84	# Proof object total steps             : 38
0.40/0.84	# Proof object clause steps            : 18
0.40/0.84	# Proof object formula steps           : 20
0.40/0.84	# Proof object conjectures             : 5
0.40/0.84	# Proof object clause conjectures      : 3
0.40/0.84	# Proof object formula conjectures     : 2
0.40/0.84	# Proof object initial clauses used    : 14
0.40/0.84	# Proof object initial formulas used   : 14
0.40/0.84	# Proof object generating inferences   : 2
0.40/0.84	# Proof object simplifying inferences  : 19
0.40/0.84	# Training examples: 0 positive, 0 negative
0.40/0.84	# Parsed axioms                        : 660
0.40/0.84	# Removed by relevancy pruning/SinE    : 0
0.40/0.84	# Initial clauses                      : 903
0.40/0.84	# Removed in clause preprocessing      : 50
0.40/0.84	# Initial clauses in saturation        : 853
0.40/0.84	# Processed clauses                    : 951
0.40/0.84	# ...of these trivial                  : 23
0.40/0.84	# ...subsumed                          : 183
0.40/0.84	# ...remaining for further processing  : 744
0.40/0.84	# Other redundant clauses eliminated   : 47
0.40/0.84	# Clauses deleted for lack of memory   : 0
0.40/0.84	# Backward-subsumed                    : 1
0.40/0.84	# Backward-rewritten                   : 28
0.40/0.84	# Generated clauses                    : 5730
0.40/0.84	# ...of the previous two non-trivial   : 5058
0.40/0.84	# Contextual simplify-reflections      : 2
0.40/0.84	# Paramodulations                      : 5642
0.40/0.84	# Factorizations                       : 11
0.40/0.84	# NegExts                              : 0
0.40/0.84	# Equation resolutions                 : 77
0.40/0.84	# Propositional unsat checks           : 0
0.40/0.84	#    Propositional check models        : 0
0.40/0.84	#    Propositional check unsatisfiable : 0
0.40/0.84	#    Propositional clauses             : 0
0.40/0.84	#    Propositional clauses after purity: 0
0.40/0.84	#    Propositional unsat core size     : 0
0.40/0.84	#    Propositional preprocessing time  : 0.000
0.40/0.84	#    Propositional encoding time       : 0.000
0.40/0.84	#    Propositional solver time         : 0.000
0.40/0.84	#    Success case prop preproc time    : 0.000
0.40/0.84	#    Success case prop encoding time   : 0.000
0.40/0.84	#    Success case prop solver time     : 0.000
0.40/0.84	# Current number of processed clauses  : 702
0.40/0.84	#    Positive orientable unit clauses  : 196
0.40/0.84	#    Positive unorientable unit clauses: 4
0.40/0.84	#    Negative unit clauses             : 24
0.40/0.84	#    Non-unit-clauses                  : 478
0.40/0.84	# Current number of unprocessed clauses: 4947
0.40/0.84	# ...number of literals in the above   : 12994
0.40/0.84	# Current number of archived formulas  : 0
0.40/0.84	# Current number of archived clauses   : 29
0.40/0.84	# Clause-clause subsumption calls (NU) : 60604
0.40/0.84	# Rec. Clause-clause subsumption calls : 35551
0.40/0.84	# Non-unit clause-clause subsumptions  : 134
0.40/0.84	# Unit Clause-clause subsumption calls : 2008
0.40/0.84	# Rewrite failures with RHS unbound    : 0
0.40/0.84	# BW rewrite match attempts            : 2021
0.40/0.84	# BW rewrite match successes           : 57
0.40/0.84	# Condensation attempts                : 0
0.40/0.84	# Condensation successes               : 0
0.40/0.84	# Termbank termtop insertions          : 387443
0.40/0.84	
0.40/0.84	# -------------------------------------------------
0.40/0.84	# User time                : 0.286 s
0.40/0.84	# System time              : 0.012 s
0.40/0.84	# Total time               : 0.298 s
0.40/0.84	# Maximum resident set size: 2424 pages
0.40/0.84	EOF