0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.12 % Command : run_E %s %d THM 0.13/0.32 % Computer : n023.cluster.edu 0.13/0.32 % Model : x86_64 x86_64 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.32 % Memory : 8042.1875MB 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.32 % CPULimit : 1200 0.13/0.32 % WCLimit : 120 0.13/0.32 % DateTime : Wed Jul 14 14:22:56 EDT 2021 0.13/0.32 % CPUTime : 0.18/0.44 Running first-order theorem proving 0.18/0.44 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.18/0.44 # Version: 2.6 0.18/0.45 # No SInE strategy applied 0.18/0.45 # Trying AutoSched0 for 59 seconds 0.18/0.47 # AutoSched0-Mode selected heuristic G_E___208_B01_00_F1_SE_CS_SP_PS_S04AN 0.18/0.47 # and selection function SelectComplexExceptUniqMaxHorn. 0.18/0.47 # 0.18/0.47 # Preprocessing time : 0.015 s 0.18/0.47 # Presaturation interreduction done 0.18/0.47 0.18/0.47 # Proof found! 0.18/0.47 # SZS status Theorem 0.18/0.47 # SZS output start CNFRefutation 0.18/0.47 fof(co3, conjecture, ![X1, X2, X3, X4]:(pi_remove(triple(X1,X2,X3),X4)=>((i(remove_cpq(triple(X1,X2,X3),X4))=remove_pq(i(triple(X1,X2,X3)),X4)&pi_sharp_remove(i(triple(X1,X2,X3)),X4))<=phi(remove_cpq(triple(X1,X2,X3),X4)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', co3)). 0.18/0.47 fof(main3_li34, lemma, ![X1, X2, X3, X4]:(contains_pq(i(triple(X1,X2,X3)),X4)=>i(remove_cpq(triple(X1,X2,X3),X4))=remove_pq(i(triple(X1,X2,X3)),X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', main3_li34)). 0.18/0.47 fof(ax56, axiom, ![X1, X2]:(pi_sharp_remove(X1,X2)<=>contains_pq(X1,X2)), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax', ax56)). 0.18/0.47 fof(ax57, axiom, ![X1, X2]:(pi_remove(X1,X2)<=>pi_sharp_remove(i(X1),X2)), file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax', ax57)). 0.18/0.47 fof(c_0_4, negated_conjecture, ~(![X1, X2, X3, X4]:(pi_remove(triple(X1,X2,X3),X4)=>(phi(remove_cpq(triple(X1,X2,X3),X4))=>(i(remove_cpq(triple(X1,X2,X3),X4))=remove_pq(i(triple(X1,X2,X3)),X4)&pi_sharp_remove(i(triple(X1,X2,X3)),X4))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co3])])). 0.18/0.47 fof(c_0_5, negated_conjecture, (pi_remove(triple(esk5_0,esk6_0,esk7_0),esk8_0)&(phi(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))&(i(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))!=remove_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)|~pi_sharp_remove(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])). 0.18/0.47 fof(c_0_6, lemma, ![X350, X351, X352, X353]:(~contains_pq(i(triple(X350,X351,X352)),X353)|i(remove_cpq(triple(X350,X351,X352),X353))=remove_pq(i(triple(X350,X351,X352)),X353)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[main3_li34])])). 0.18/0.47 fof(c_0_7, plain, ![X323, X324]:((~pi_sharp_remove(X323,X324)|contains_pq(X323,X324))&(~contains_pq(X323,X324)|pi_sharp_remove(X323,X324))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])). 0.18/0.47 cnf(c_0_8, negated_conjecture, (i(remove_cpq(triple(esk5_0,esk6_0,esk7_0),esk8_0))!=remove_pq(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)|~pi_sharp_remove(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.18/0.47 cnf(c_0_9, lemma, (i(remove_cpq(triple(X1,X2,X3),X4))=remove_pq(i(triple(X1,X2,X3)),X4)|~contains_pq(i(triple(X1,X2,X3)),X4)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.18/0.47 cnf(c_0_10, plain, (contains_pq(X1,X2)|~pi_sharp_remove(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.18/0.47 fof(c_0_11, plain, ![X340, X341]:((~pi_remove(X340,X341)|pi_sharp_remove(i(X340),X341))&(~pi_sharp_remove(i(X340),X341)|pi_remove(X340,X341))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])). 0.18/0.47 cnf(c_0_12, negated_conjecture, (~pi_sharp_remove(i(triple(esk5_0,esk6_0,esk7_0)),esk8_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])). 0.18/0.47 cnf(c_0_13, plain, (pi_sharp_remove(i(X1),X2)|~pi_remove(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_11])). 0.18/0.47 cnf(c_0_14, negated_conjecture, (pi_remove(triple(esk5_0,esk6_0,esk7_0),esk8_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.18/0.47 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.18/0.47 # SZS output end CNFRefutation 0.18/0.47 # Proof object total steps : 16 0.18/0.47 # Proof object clause steps : 7 0.18/0.47 # Proof object formula steps : 9 0.18/0.47 # Proof object conjectures : 7 0.18/0.47 # Proof object clause conjectures : 4 0.18/0.47 # Proof object formula conjectures : 3 0.18/0.47 # Proof object initial clauses used : 5 0.18/0.47 # Proof object initial formulas used : 4 0.18/0.47 # Proof object generating inferences : 2 0.18/0.47 # Proof object simplifying inferences : 3 0.18/0.47 # Training examples: 0 positive, 0 negative 0.18/0.47 # Parsed axioms : 65 0.18/0.47 # Removed by relevancy pruning/SinE : 0 0.18/0.47 # Initial clauses : 91 0.18/0.47 # Removed in clause preprocessing : 2 0.18/0.47 # Initial clauses in saturation : 89 0.18/0.47 # Processed clauses : 258 0.18/0.47 # ...of these trivial : 0 0.18/0.47 # ...subsumed : 35 0.18/0.47 # ...remaining for further processing : 223 0.18/0.47 # Other redundant clauses eliminated : 4 0.18/0.47 # Clauses deleted for lack of memory : 0 0.18/0.47 # Backward-subsumed : 0 0.18/0.47 # Backward-rewritten : 0 0.18/0.47 # Generated clauses : 337 0.18/0.47 # ...of the previous two non-trivial : 305 0.18/0.47 # Contextual simplify-reflections : 4 0.18/0.47 # Paramodulations : 332 0.18/0.47 # Factorizations : 2 0.18/0.47 # NegExts : 0 0.18/0.47 # Equation resolutions : 4 0.18/0.47 # Propositional unsat checks : 0 0.18/0.47 # Propositional check models : 0 0.18/0.47 # Propositional check unsatisfiable : 0 0.18/0.47 # Propositional clauses : 0 0.18/0.47 # Propositional clauses after purity: 0 0.18/0.47 # Propositional unsat core size : 0 0.18/0.47 # Propositional preprocessing time : 0.000 0.18/0.47 # Propositional encoding time : 0.000 0.18/0.47 # Propositional solver time : 0.000 0.18/0.47 # Success case prop preproc time : 0.000 0.18/0.47 # Success case prop encoding time : 0.000 0.18/0.47 # Success case prop solver time : 0.000 0.18/0.47 # Current number of processed clauses : 131 0.18/0.47 # Positive orientable unit clauses : 25 0.18/0.47 # Positive unorientable unit clauses: 2 0.18/0.47 # Negative unit clauses : 24 0.18/0.47 # Non-unit-clauses : 80 0.18/0.47 # Current number of unprocessed clauses: 222 0.18/0.47 # ...number of literals in the above : 490 0.18/0.47 # Current number of archived formulas : 0 0.18/0.47 # Current number of archived clauses : 91 0.18/0.47 # Clause-clause subsumption calls (NU) : 1192 0.18/0.47 # Rec. Clause-clause subsumption calls : 993 0.18/0.47 # Non-unit clause-clause subsumptions : 9 0.18/0.47 # Unit Clause-clause subsumption calls : 138 0.18/0.47 # Rewrite failures with RHS unbound : 72 0.18/0.47 # BW rewrite match attempts : 18 0.18/0.47 # BW rewrite match successes : 12 0.18/0.47 # Condensation attempts : 0 0.18/0.47 # Condensation successes : 0 0.18/0.47 # Termbank termtop insertions : 10517 0.18/0.47 0.18/0.47 # ------------------------------------------------- 0.18/0.47 # User time : 0.020 s 0.18/0.47 # System time : 0.005 s 0.18/0.47 # Total time : 0.025 s 0.18/0.47 # Maximum resident set size: 1668 pages 0.18/0.47 EOF