0.08/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.14 % Command : run_E %s %d THM 0.14/0.36 % Computer : n013.cluster.edu 0.14/0.36 % Model : x86_64 x86_64 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.36 % Memory : 8042.1875MB 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 1200 0.14/0.36 % WCLimit : 120 0.14/0.36 % DateTime : Tue Jul 13 11:32:18 EDT 2021 0.14/0.36 % CPUTime : 0.22/0.51 Running first-order theorem proving 0.22/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 0.22/0.51 # Version: 2.6 0.22/0.52 # No SInE strategy applied 0.22/0.52 # Trying AutoSched0 for 59 seconds 0.45/0.65 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN 0.45/0.65 # and selection function SelectCQPrecWNTNp. 0.45/0.65 # 0.45/0.65 # Preprocessing time : 0.050 s 0.45/0.65 # Presaturation interreduction done 0.45/0.65 0.45/0.65 # Proof found! 0.45/0.65 # SZS status Theorem 0.45/0.65 # SZS output start CNFRefutation 0.45/0.65 fof('T-Weak-abs-2', axiom, ![X4, X8, X5, X6, X35, X14]:(vtcheck(vbind(X4,X8,X5),vabs(X6,X35,veabs),X14)<=((X4=X6&vlookup(X4,X5)=vnoType)&vtcheck(X5,vabs(X6,X35,veabs),X14))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'T-Weak-abs-2')). 0.45/0.65 fof('T-Weak-abs-1', axiom, ![X4, X8, X5, X6, X35, X14]:(((X6!=X4&vtcheck(X5,vabs(X6,X35,veabs),X14))&vnoType=vlookup(X4,X5))=>vtcheck(vbind(X4,X8,X5),vabs(X6,X35,veabs),X14)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'T-Weak-abs-1')). 0.45/0.65 fof('T-Weak-abs', conjecture, ![X4, X8, X5, X6, X35, X14]:((vtcheck(X5,vabs(X6,X35,veabs),X14)&vnoType=vlookup(X4,X5))=>vtcheck(vbind(X4,X8,X5),vabs(X6,X35,veabs),X14)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'T-Weak-abs')). 0.45/0.65 fof(c_0_3, plain, ![X4, X8, X5, X6, X35, X14]:(((X4=X6&vlookup(X4,X5)=vnoType)&vtcheck(X5,vabs(X6,X35,veabs),X14))=>vtcheck(vbind(X4,X8,X5),vabs(X6,X35,veabs),X14)), inference(fof_simplification,[status(thm)],['T-Weak-abs-2'])). 0.45/0.65 fof(c_0_4, plain, ![X624, X625, X626, X627, X628, X629]:(X624!=X627|vlookup(X624,X626)!=vnoType|~vtcheck(X626,vabs(X627,X628,veabs),X629)|vtcheck(vbind(X624,X625,X626),vabs(X627,X628,veabs),X629)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])). 0.45/0.65 fof(c_0_5, plain, ![X630, X631, X632, X633, X634, X635]:(X633=X630|~vtcheck(X632,vabs(X633,X634,veabs),X635)|vnoType!=vlookup(X630,X632)|vtcheck(vbind(X630,X631,X632),vabs(X633,X634,veabs),X635)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['T-Weak-abs-1'])])). 0.45/0.65 fof(c_0_6, negated_conjecture, ~(![X4, X8, X5, X6, X35, X14]:((vtcheck(X5,vabs(X6,X35,veabs),X14)&vnoType=vlookup(X4,X5))=>vtcheck(vbind(X4,X8,X5),vabs(X6,X35,veabs),X14))), inference(assume_negation,[status(cth)],['T-Weak-abs'])). 0.45/0.65 cnf(c_0_7, plain, (vtcheck(vbind(X1,X6,X3),vabs(X2,X4,veabs),X5)|X1!=X2|vlookup(X1,X3)!=vnoType|~vtcheck(X3,vabs(X2,X4,veabs),X5)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.45/0.65 cnf(c_0_8, plain, (X1=X2|vtcheck(vbind(X2,X6,X3),vabs(X1,X4,veabs),X5)|~vtcheck(X3,vabs(X1,X4,veabs),X5)|vnoType!=vlookup(X2,X3)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.45/0.65 fof(c_0_9, negated_conjecture, ((vtcheck(esk35_0,vabs(esk36_0,esk37_0,veabs),esk38_0)&vnoType=vlookup(esk33_0,esk35_0))&~vtcheck(vbind(esk33_0,esk34_0,esk35_0),vabs(esk36_0,esk37_0,veabs),esk38_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])). 0.45/0.65 cnf(c_0_10, plain, (vtcheck(vbind(X1,X2,X3),vabs(X4,X5,veabs),X6)|vlookup(X1,X3)!=vnoType|~vtcheck(X3,vabs(X4,X5,veabs),X6)), inference(csr,[status(thm)],[c_0_7, c_0_8])). 0.45/0.65 cnf(c_0_11, negated_conjecture, (vnoType=vlookup(esk33_0,esk35_0)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.45/0.65 cnf(c_0_12, negated_conjecture, (vtcheck(vbind(esk33_0,X1,esk35_0),vabs(X2,X3,veabs),X4)|~vtcheck(esk35_0,vabs(X2,X3,veabs),X4)), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.45/0.65 cnf(c_0_13, negated_conjecture, (vtcheck(esk35_0,vabs(esk36_0,esk37_0,veabs),esk38_0)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.45/0.65 cnf(c_0_14, negated_conjecture, (~vtcheck(vbind(esk33_0,esk34_0,esk35_0),vabs(esk36_0,esk37_0,veabs),esk38_0)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.45/0.65 cnf(c_0_15, negated_conjecture, (vtcheck(vbind(esk33_0,X1,esk35_0),vabs(esk36_0,esk37_0,veabs),esk38_0)), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.45/0.65 cnf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15])]), ['proof']). 0.45/0.65 # SZS output end CNFRefutation 0.45/0.65 # Proof object total steps : 17 0.45/0.65 # Proof object clause steps : 9 0.45/0.65 # Proof object formula steps : 8 0.45/0.65 # Proof object conjectures : 9 0.45/0.65 # Proof object clause conjectures : 6 0.45/0.65 # Proof object formula conjectures : 3 0.45/0.65 # Proof object initial clauses used : 5 0.45/0.65 # Proof object initial formulas used : 3 0.45/0.65 # Proof object generating inferences : 2 0.45/0.65 # Proof object simplifying inferences : 3 0.45/0.65 # Training examples: 0 positive, 0 negative 0.45/0.65 # Parsed axioms : 58 0.45/0.65 # Removed by relevancy pruning/SinE : 0 0.45/0.65 # Initial clauses : 370 0.45/0.65 # Removed in clause preprocessing : 10 0.45/0.65 # Initial clauses in saturation : 360 0.45/0.65 # Processed clauses : 815 0.45/0.65 # ...of these trivial : 5 0.45/0.65 # ...subsumed : 57 0.45/0.65 # ...remaining for further processing : 753 0.45/0.65 # Other redundant clauses eliminated : 40 0.45/0.65 # Clauses deleted for lack of memory : 0 0.45/0.65 # Backward-subsumed : 1 0.45/0.65 # Backward-rewritten : 3 0.45/0.65 # Generated clauses : 491 0.45/0.65 # ...of the previous two non-trivial : 395 0.45/0.65 # Contextual simplify-reflections : 1 0.45/0.65 # Paramodulations : 340 0.45/0.65 # Factorizations : 0 0.45/0.65 # NegExts : 0 0.45/0.65 # Equation resolutions : 162 0.45/0.65 # Propositional unsat checks : 0 0.45/0.65 # Propositional check models : 0 0.45/0.65 # Propositional check unsatisfiable : 0 0.45/0.65 # Propositional clauses : 0 0.45/0.65 # Propositional clauses after purity: 0 0.45/0.65 # Propositional unsat core size : 0 0.45/0.65 # Propositional preprocessing time : 0.000 0.45/0.65 # Propositional encoding time : 0.000 0.45/0.65 # Propositional solver time : 0.000 0.45/0.65 # Success case prop preproc time : 0.000 0.45/0.65 # Success case prop encoding time : 0.000 0.45/0.65 # Success case prop solver time : 0.000 0.45/0.65 # Current number of processed clauses : 397 0.45/0.65 # Positive orientable unit clauses : 23 0.45/0.65 # Positive unorientable unit clauses: 1 0.45/0.65 # Negative unit clauses : 17 0.45/0.65 # Non-unit-clauses : 356 0.45/0.65 # Current number of unprocessed clauses: 274 0.45/0.65 # ...number of literals in the above : 841 0.45/0.65 # Current number of archived formulas : 0 0.45/0.65 # Current number of archived clauses : 338 0.45/0.65 # Clause-clause subsumption calls (NU) : 81461 0.45/0.65 # Rec. Clause-clause subsumption calls : 26039 0.45/0.65 # Non-unit clause-clause subsumptions : 46 0.45/0.65 # Unit Clause-clause subsumption calls : 4520 0.45/0.65 # Rewrite failures with RHS unbound : 16 0.45/0.65 # BW rewrite match attempts : 25 0.45/0.65 # BW rewrite match successes : 7 0.45/0.65 # Condensation attempts : 0 0.45/0.65 # Condensation successes : 0 0.45/0.65 # Termbank termtop insertions : 36616 0.45/0.65 0.45/0.65 # ------------------------------------------------- 0.45/0.65 # User time : 0.127 s 0.45/0.65 # System time : 0.014 s 0.45/0.65 # Total time : 0.141 s 0.45/0.65 # Maximum resident set size: 1732 pages 0.45/0.65 EOF