0.10/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.13 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 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 : 960 0.14/0.34 % WCLimit : 120 0.14/0.34 % DateTime : Thu Jul 2 07:09:25 EDT 2020 0.14/0.34 % CPUTime : 0.14/0.34 # Version: 2.5pre002 0.14/0.35 # No SInE strategy applied 0.14/0.35 # Trying AutoSched0 for 59 seconds 0.20/0.47 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YA 0.20/0.47 # and selection function SelectMaxLComplexAvoidPosPred. 0.20/0.47 # 0.20/0.47 # Preprocessing time : 0.034 s 0.20/0.47 # Presaturation interreduction done 0.20/0.47 0.20/0.47 # Proof found! 0.20/0.47 # SZS status Theorem 0.20/0.47 # SZS output start CNFRefutation 0.20/0.47 fof(nevera_csa_thm, conjecture, nevera(csa,thm), file('/export/starexec/sandbox/benchmark/theBenchmark.p', nevera_csa_thm)). 0.20/0.47 fof(nevera, axiom, ![X9, X10]:(nevera(X9,X10)<=>![X1, X2]:(status(X1,X2,X9)=>~(status(X1,X2,X10)))), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax', nevera)). 0.20/0.47 fof(csa, axiom, ![X1, X2]:(?[X4]:(model(X4,not(X2))&model(X4,X1))<=>status(X1,X2,csa)), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax', csa)). 0.20/0.47 fof(completeness, axiom, ![X8, X7]:(model(X8,X7)<~>model(X8,not(X7))), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax', completeness)). 0.20/0.47 fof(thm, axiom, ![X1, X2]:(status(X1,X2,thm)<=>![X4]:(model(X4,X2)<=model(X4,X1))), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax', thm)). 0.20/0.47 fof(c_0_5, negated_conjecture, ~(nevera(csa,thm)), inference(assume_negation,[status(cth)],[nevera_csa_thm])). 0.20/0.47 fof(c_0_6, negated_conjecture, ~nevera(csa,thm), inference(fof_simplification,[status(thm)],[c_0_5])). 0.20/0.47 fof(c_0_7, plain, ![X187, X188, X189, X190, X191, X192]:((~nevera(X187,X188)|(~status(X189,X190,X187)|~status(X189,X190,X188)))&((status(esk50_2(X191,X192),esk51_2(X191,X192),X191)|nevera(X191,X192))&(status(esk50_2(X191,X192),esk51_2(X191,X192),X192)|nevera(X191,X192)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[nevera])])])])])])])). 0.20/0.47 fof(c_0_8, plain, ![X117, X118, X119, X120, X121]:((~model(X119,not(X118))|~model(X119,X117)|status(X117,X118,csa))&((model(esk29_2(X120,X121),not(X121))|~status(X120,X121,csa))&(model(esk29_2(X120,X121),X120)|~status(X120,X121,csa)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[csa])])])])])])). 0.20/0.47 cnf(c_0_9, negated_conjecture, (~nevera(csa,thm)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.20/0.47 cnf(c_0_10, plain, (status(esk50_2(X1,X2),esk51_2(X1,X2),X1)|nevera(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.47 fof(c_0_11, plain, ![X232, X233]:((~model(X232,X233)|~model(X232,not(X233)))&(model(X232,X233)|model(X232,not(X233)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[completeness])])])). 0.20/0.47 cnf(c_0_12, plain, (model(esk29_2(X1,X2),not(X2))|~status(X1,X2,csa)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.20/0.47 cnf(c_0_13, negated_conjecture, (status(esk50_2(csa,thm),esk51_2(csa,thm),csa)), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.20/0.47 fof(c_0_14, plain, ![X56, X57, X58, X59, X60]:((~status(X56,X57,thm)|(~model(X58,X56)|model(X58,X57)))&((model(esk13_2(X59,X60),X59)|status(X59,X60,thm))&(~model(esk13_2(X59,X60),X60)|status(X59,X60,thm)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[thm])])])])])])])). 0.20/0.47 cnf(c_0_15, plain, (status(esk50_2(X1,X2),esk51_2(X1,X2),X2)|nevera(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.47 cnf(c_0_16, plain, (~model(X1,X2)|~model(X1,not(X2))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.20/0.47 cnf(c_0_17, negated_conjecture, (model(esk29_2(esk50_2(csa,thm),esk51_2(csa,thm)),not(esk51_2(csa,thm)))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.20/0.47 cnf(c_0_18, plain, (model(X3,X2)|~status(X1,X2,thm)|~model(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.47 cnf(c_0_19, negated_conjecture, (status(esk50_2(csa,thm),esk51_2(csa,thm),thm)), inference(spm,[status(thm)],[c_0_9, c_0_15])). 0.20/0.47 cnf(c_0_20, plain, (model(esk29_2(X1,X2),X1)|~status(X1,X2,csa)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.20/0.47 cnf(c_0_21, negated_conjecture, (~model(esk29_2(esk50_2(csa,thm),esk51_2(csa,thm)),esk51_2(csa,thm))), inference(spm,[status(thm)],[c_0_16, c_0_17])). 0.20/0.47 cnf(c_0_22, negated_conjecture, (model(X1,esk51_2(csa,thm))|~model(X1,esk50_2(csa,thm))), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.20/0.47 cnf(c_0_23, negated_conjecture, (model(esk29_2(esk50_2(csa,thm),esk51_2(csa,thm)),esk50_2(csa,thm))), inference(spm,[status(thm)],[c_0_20, c_0_13])). 0.20/0.47 cnf(c_0_24, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])]), ['proof']). 0.20/0.47 # SZS output end CNFRefutation 0.20/0.47 # Proof object total steps : 25 0.20/0.47 # Proof object clause steps : 14 0.20/0.47 # Proof object formula steps : 11 0.20/0.47 # Proof object conjectures : 11 0.20/0.47 # Proof object clause conjectures : 8 0.20/0.47 # Proof object formula conjectures : 3 0.20/0.47 # Proof object initial clauses used : 7 0.20/0.47 # Proof object initial formulas used : 5 0.20/0.47 # Proof object generating inferences : 7 0.20/0.47 # Proof object simplifying inferences : 2 0.20/0.47 # Training examples: 0 positive, 0 negative 0.20/0.47 # Parsed axioms : 33 0.20/0.47 # Removed by relevancy pruning/SinE : 0 0.20/0.47 # Initial clauses : 109 0.20/0.47 # Removed in clause preprocessing : 0 0.20/0.47 # Initial clauses in saturation : 109 0.20/0.47 # Processed clauses : 922 0.20/0.47 # ...of these trivial : 240 0.20/0.47 # ...subsumed : 254 0.20/0.47 # ...remaining for further processing : 428 0.20/0.47 # Other redundant clauses eliminated : 0 0.20/0.47 # Clauses deleted for lack of memory : 0 0.20/0.47 # Backward-subsumed : 0 0.20/0.47 # Backward-rewritten : 1 0.20/0.47 # Generated clauses : 7705 0.20/0.47 # ...of the previous two non-trivial : 7213 0.20/0.47 # Contextual simplify-reflections : 0 0.20/0.47 # Paramodulations : 7705 0.20/0.47 # Factorizations : 0 0.20/0.47 # Equation resolutions : 0 0.20/0.47 # Propositional unsat checks : 0 0.20/0.47 # Propositional check models : 0 0.20/0.47 # Propositional check unsatisfiable : 0 0.20/0.47 # Propositional clauses : 0 0.20/0.47 # Propositional clauses after purity: 0 0.20/0.47 # Propositional unsat core size : 0 0.20/0.47 # Propositional preprocessing time : 0.000 0.20/0.47 # Propositional encoding time : 0.000 0.20/0.47 # Propositional solver time : 0.000 0.20/0.47 # Success case prop preproc time : 0.000 0.20/0.47 # Success case prop encoding time : 0.000 0.20/0.47 # Success case prop solver time : 0.000 0.20/0.47 # Current number of processed clauses : 320 0.20/0.47 # Positive orientable unit clauses : 102 0.20/0.47 # Positive unorientable unit clauses: 0 0.20/0.47 # Negative unit clauses : 7 0.20/0.47 # Non-unit-clauses : 211 0.20/0.47 # Current number of unprocessed clauses: 6506 0.20/0.47 # ...number of literals in the above : 17091 0.20/0.47 # Current number of archived formulas : 0 0.20/0.47 # Current number of archived clauses : 108 0.20/0.47 # Clause-clause subsumption calls (NU) : 8574 0.20/0.47 # Rec. Clause-clause subsumption calls : 3939 0.20/0.47 # Non-unit clause-clause subsumptions : 254 0.20/0.47 # Unit Clause-clause subsumption calls : 207 0.20/0.47 # Rewrite failures with RHS unbound : 0 0.20/0.47 # BW rewrite match attempts : 2 0.20/0.47 # BW rewrite match successes : 1 0.20/0.47 # Condensation attempts : 0 0.20/0.47 # Condensation successes : 0 0.20/0.47 # Termbank termtop insertions : 110776 0.20/0.47 0.20/0.47 # ------------------------------------------------- 0.20/0.47 # User time : 0.123 s 0.20/0.47 # System time : 0.004 s 0.20/0.47 # Total time : 0.127 s 0.20/0.47 # Maximum resident set size: 1632 pages 0.20/0.47 EOF