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   : n182.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:29:10 CDT 2018
0.03/0.23	% CPUTime    : 
0.03/0.23	# Version: 2.2pre001
0.03/0.23	# No SInE strategy applied
0.03/0.23	# Trying AutoSched0 for 151 seconds
0.06/0.25	# AutoSched0-Mode selected heuristic G_E___060_C18_F1_PI_SE_CS_SP_CO_S0Y
0.06/0.25	# and selection function SelectMaxLComplexAvoidPosPred.
0.06/0.25	#
0.06/0.25	# Preprocessing time       : 0.013 s
0.06/0.25	
0.06/0.25	# Proof found!
0.06/0.25	# SZS status Theorem
0.06/0.25	# SZS output start CNFRefutation
0.06/0.25	fof(dt_k1_yellow_1, axiom, ![X1]:((((reflexive(inclusion_order(X1))&antisymmetric(inclusion_order(X1)))&relation_of2_as_subset(inclusion_order(X1),X1,X1))&v1_partfun1(inclusion_order(X1),X1,X1))&transitive(inclusion_order(X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dt_k1_yellow_1)).
0.06/0.25	fof(redefinition_k1_yellow_1, axiom, ![X1]:inclusion_relation(X1)=inclusion_order(X1), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', redefinition_k1_yellow_1)).
0.06/0.25	fof(redefinition_m2_relset_1, axiom, ![X1, X2, X3]:(relation_of2_as_subset(X3,X1,X2)<=>relation_of2(X3,X1,X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', redefinition_m2_relset_1)).
0.06/0.25	fof(d1_yellow_1, axiom, ![X1]:incl_POSet(X1)=rel_str_of(X1,inclusion_order(X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', d1_yellow_1)).
0.06/0.25	fof(t4_waybel_7, conjecture, ![X1]:powerset(X1)=the_carrier(boole_POSet(X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', t4_waybel_7)).
0.06/0.25	fof(free_g1_orders_2, axiom, ![X1, X2]:(![X3, X4]:((X1=X3&X4=X2)<=rel_str_of(X1,X2)=rel_str_of(X3,X4))<=relation_of2(X2,X1,X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', free_g1_orders_2)).
0.06/0.25	fof(dt_k2_yellow_1, axiom, ![X1]:(rel_str(incl_POSet(X1))&strict_rel_str(incl_POSet(X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', dt_k2_yellow_1)).
0.06/0.25	fof(fc5_yellow_1, axiom, ![X1]:(((strict_rel_str(incl_POSet(X1))&reflexive_relstr(incl_POSet(X1)))&antisymmetric_relstr(incl_POSet(X1)))&transitive_relstr(incl_POSet(X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fc5_yellow_1)).
0.06/0.25	fof(t4_yellow_1, axiom, ![X1]:incl_POSet(powerset(X1))=boole_POSet(X1), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', t4_yellow_1)).
0.06/0.25	fof(abstractness_v1_orders_2, axiom, ![X1]:((rel_str_of(the_carrier(X1),the_InternalRel(X1))=X1<=strict_rel_str(X1))<=rel_str(X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', abstractness_v1_orders_2)).
0.06/0.25	fof(c_0_10, plain, ![X83, X83, X83, X83, X83]:((((reflexive(inclusion_order(X83))&antisymmetric(inclusion_order(X83)))&relation_of2_as_subset(inclusion_order(X83),X83,X83))&v1_partfun1(inclusion_order(X83),X83,X83))&transitive(inclusion_order(X83))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[dt_k1_yellow_1])])])).
0.06/0.25	fof(c_0_11, plain, ![X53]:inclusion_relation(X53)=inclusion_order(X53), inference(variable_rename,[status(thm)],[redefinition_k1_yellow_1])).
0.06/0.25	fof(c_0_12, plain, ![X56, X57, X58, X56, X57, X58]:((~relation_of2_as_subset(X58,X56,X57)|relation_of2(X58,X56,X57))&(~relation_of2(X58,X56,X57)|relation_of2_as_subset(X58,X56,X57))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])])])).
0.06/0.25	cnf(c_0_13, plain, (relation_of2_as_subset(inclusion_order(X1),X1,X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.06/0.25	cnf(c_0_14, plain, (inclusion_relation(X1)=inclusion_order(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.06/0.25	fof(c_0_15, plain, ![X59]:incl_POSet(X59)=rel_str_of(X59,inclusion_order(X59)), inference(variable_rename,[status(thm)],[d1_yellow_1])).
0.06/0.25	fof(c_0_16, negated_conjecture, ~(![X1]:powerset(X1)=the_carrier(boole_POSet(X1))), inference(assume_negation,[status(cth)],[t4_waybel_7])).
0.06/0.25	fof(c_0_17, plain, ![X61, X62, X63, X64]:((X61=X63|rel_str_of(X61,X62)!=rel_str_of(X63,X64)|~relation_of2(X62,X61,X61))&(X64=X62|rel_str_of(X61,X62)!=rel_str_of(X63,X64)|~relation_of2(X62,X61,X61))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[free_g1_orders_2])])])])])])])).
0.06/0.25	cnf(c_0_18, plain, (relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.06/0.25	cnf(c_0_19, plain, (relation_of2_as_subset(inclusion_relation(X1),X1,X1)), inference(rw,[status(thm)],[c_0_13, c_0_14])).
0.06/0.25	fof(c_0_20, plain, ![X79, X79]:(rel_str(incl_POSet(X79))&strict_rel_str(incl_POSet(X79))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[dt_k2_yellow_1])])])).
0.06/0.25	cnf(c_0_21, plain, (incl_POSet(X1)=rel_str_of(X1,inclusion_order(X1))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.06/0.25	fof(c_0_22, plain, ![X15, X15, X15, X15]:(((strict_rel_str(incl_POSet(X15))&reflexive_relstr(incl_POSet(X15)))&antisymmetric_relstr(incl_POSet(X15)))&transitive_relstr(incl_POSet(X15))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[fc5_yellow_1])])])).
0.06/0.25	fof(c_0_23, negated_conjecture, powerset(esk6_0)!=the_carrier(boole_POSet(esk6_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])).
0.06/0.25	fof(c_0_24, plain, ![X36]:incl_POSet(powerset(X36))=boole_POSet(X36), inference(variable_rename,[status(thm)],[t4_yellow_1])).
0.06/0.25	cnf(c_0_25, plain, (X1=X2|rel_str_of(X1,X3)!=rel_str_of(X2,X4)|~relation_of2(X3,X1,X1)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.06/0.25	cnf(c_0_26, plain, (relation_of2(inclusion_relation(X1),X1,X1)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.06/0.25	fof(c_0_27, plain, ![X117]:(~rel_str(X117)|(~strict_rel_str(X117)|rel_str_of(the_carrier(X117),the_InternalRel(X117))=X117)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[abstractness_v1_orders_2])])])).
0.06/0.25	cnf(c_0_28, plain, (rel_str(incl_POSet(X1))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.06/0.25	cnf(c_0_29, plain, (incl_POSet(X1)=rel_str_of(X1,inclusion_relation(X1))), inference(rw,[status(thm)],[c_0_21, c_0_14])).
0.06/0.25	cnf(c_0_30, plain, (strict_rel_str(incl_POSet(X1))), inference(split_conjunct,[status(thm)],[c_0_22])).
0.06/0.25	cnf(c_0_31, negated_conjecture, (powerset(esk6_0)!=the_carrier(boole_POSet(esk6_0))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.06/0.25	cnf(c_0_32, plain, (incl_POSet(powerset(X1))=boole_POSet(X1)), inference(split_conjunct,[status(thm)],[c_0_24])).
0.06/0.25	cnf(c_0_33, plain, (X1=X2|rel_str_of(X1,inclusion_relation(X1))!=rel_str_of(X2,X3)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.06/0.25	cnf(c_0_34, plain, (rel_str_of(the_carrier(X1),the_InternalRel(X1))=X1|~rel_str(X1)|~strict_rel_str(X1)), inference(split_conjunct,[status(thm)],[c_0_27])).
0.06/0.25	cnf(c_0_35, plain, (rel_str(rel_str_of(X1,inclusion_relation(X1)))), inference(rw,[status(thm)],[c_0_28, c_0_29])).
0.06/0.25	cnf(c_0_36, plain, (strict_rel_str(rel_str_of(X1,inclusion_relation(X1)))), inference(rw,[status(thm)],[c_0_30, c_0_29])).
0.06/0.25	cnf(c_0_37, negated_conjecture, (powerset(esk6_0)!=the_carrier(rel_str_of(powerset(esk6_0),inclusion_relation(powerset(esk6_0))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_32]), c_0_29])).
0.06/0.25	cnf(c_0_38, plain, (the_carrier(rel_str_of(X1,inclusion_relation(X1)))=X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34])]), c_0_35]), c_0_36])])).
0.06/0.25	cnf(c_0_39, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37, c_0_38])]), ['proof']).
0.06/0.25	# SZS output end CNFRefutation
0.06/0.25	# Proof object total steps             : 40
0.06/0.25	# Proof object clause steps            : 19
0.06/0.25	# Proof object formula steps           : 21
0.06/0.25	# Proof object conjectures             : 6
0.06/0.25	# Proof object clause conjectures      : 3
0.06/0.25	# Proof object formula conjectures     : 3
0.06/0.25	# Proof object initial clauses used    : 10
0.06/0.25	# Proof object initial formulas used   : 10
0.06/0.25	# Proof object generating inferences   : 3
0.06/0.25	# Proof object simplifying inferences  : 12
0.06/0.25	# Training examples: 0 positive, 0 negative
0.06/0.25	# Parsed axioms                        : 89
0.06/0.25	# Removed by relevancy pruning/SinE    : 0
0.06/0.25	# Initial clauses                      : 300
0.06/0.25	# Removed in clause preprocessing      : 53
0.06/0.25	# Initial clauses in saturation        : 247
0.06/0.25	# Processed clauses                    : 254
0.06/0.25	# ...of these trivial                  : 38
0.06/0.25	# ...subsumed                          : 18
0.06/0.25	# ...remaining for further processing  : 198
0.06/0.25	# Other redundant clauses eliminated   : 2
0.06/0.25	# Clauses deleted for lack of memory   : 0
0.06/0.25	# Backward-subsumed                    : 0
0.06/0.25	# Backward-rewritten                   : 4
0.06/0.25	# Generated clauses                    : 154
0.06/0.25	# ...of the previous two non-trivial   : 74
0.06/0.25	# Contextual simplify-reflections      : 35
0.06/0.25	# Paramodulations                      : 150
0.06/0.25	# Factorizations                       : 0
0.06/0.25	# Equation resolutions                 : 4
0.06/0.25	# Propositional unsat checks           : 0
0.06/0.25	#    Propositional check models        : 0
0.06/0.25	#    Propositional check unsatisfiable : 0
0.06/0.25	#    Propositional clauses             : 0
0.06/0.25	#    Propositional clauses after purity: 0
0.06/0.25	#    Propositional unsat core size     : 0
0.06/0.25	# Current number of processed clauses  : 194
0.06/0.25	#    Positive orientable unit clauses  : 101
0.06/0.25	#    Positive unorientable unit clauses: 0
0.06/0.25	#    Negative unit clauses             : 13
0.06/0.25	#    Non-unit-clauses                  : 80
0.06/0.25	# Current number of unprocessed clauses: 62
0.06/0.25	# ...number of literals in the above   : 165
0.06/0.25	# Current number of archived formulas  : 0
0.06/0.25	# Current number of archived clauses   : 7
0.06/0.25	# Clause-clause subsumption calls (NU) : 5773
0.06/0.25	# Rec. Clause-clause subsumption calls : 1004
0.06/0.25	# Non-unit clause-clause subsumptions  : 50
0.06/0.25	# Unit Clause-clause subsumption calls : 181
0.06/0.25	# Rewrite failures with RHS unbound    : 0
0.06/0.25	# BW rewrite match attempts            : 11
0.06/0.25	# BW rewrite match successes           : 3
0.06/0.25	# Condensation attempts                : 254
0.06/0.25	# Condensation successes               : 0
0.06/0.25	# Termbank termtop insertions          : 14497
0.06/0.25	
0.06/0.25	# -------------------------------------------------
0.06/0.25	# User time                : 0.018 s
0.06/0.25	# System time              : 0.003 s
0.06/0.25	# Total time               : 0.021 s
0.06/0.25	# Maximum resident set size: 1588 pages
0.06/0.25	EOF