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.13/0.34 % Computer : n019.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 02:13:21 EDT 2022 0.13/0.34 % CPUTime : 0.21/0.48 Running first-order on 8 cores theorem proving 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.21/0.48 # Version: 3.0pre003 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN. 0.21/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 600s (5) cores 0.21/0.49 # Starting new_bool_3 with 120s (1) cores 0.21/0.49 # Starting new_bool_1 with 120s (1) cores 0.21/0.49 # Starting sh5l with 120s (1) cores 0.21/0.49 # new_bool_3 with pid 25657 completed with status 0 0.21/0.49 # Result found by new_bool_3 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN. 0.21/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 600s (5) cores 0.21/0.49 # Starting new_bool_3 with 120s (1) cores 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.21/0.49 # ...ProofStateSinE()=5/5 0.21/0.49 # Search class: FHHSF-FFSF21-SFFFFFNN 0.21/0.49 # Scheduled 5 strats onto 1 cores with 120 seconds (120 total) 0.21/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 73s (1) cores 0.21/0.49 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25663 completed with status 0 0.21/0.49 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN. 0.21/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 600s (5) cores 0.21/0.49 # Starting new_bool_3 with 120s (1) cores 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.21/0.49 # ...ProofStateSinE()=5/5 0.21/0.49 # Search class: FHHSF-FFSF21-SFFFFFNN 0.21/0.49 # Scheduled 5 strats onto 1 cores with 120 seconds (120 total) 0.21/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 73s (1) cores 0.21/0.49 # Preprocessing time : 0.001 s 0.21/0.49 # Presaturation interreduction done 0.21/0.49 0.21/0.49 # Proof found! 0.21/0.49 # SZS status Theorem 0.21/0.49 # SZS output start CNFRefutation 0.21/0.49 tff(decl_22, type, h: $i > $i). 0.21/0.49 tff(decl_23, type, op2: ($i * $i) > $i). 0.21/0.49 tff(decl_24, type, op1: ($i * $i) > $i). 0.21/0.49 tff(decl_25, type, sorti1: $i > $o). 0.21/0.49 tff(decl_26, type, sorti2: $i > $o). 0.21/0.49 tff(decl_27, type, j: $i > $i). 0.21/0.49 tff(decl_28, type, esk1_1: $i > $i). 0.21/0.49 tff(decl_29, type, esk2_0: $i). 0.21/0.49 fof(co1, conjecture, (~((((![X1]:((![X2]:((op2(h(X1),h(X2))=h(op1(X1,X2))<=sorti1(X2)))<=sorti1(X1)))&![X3]:((sorti2(X3)=>![X4]:((sorti2(X4)=>op1(j(X3),j(X4))=j(op2(X3,X4)))))))&![X5]:((X5=j(h(X5))<=sorti1(X5))))&![X6]:((h(j(X6))=X6<=sorti2(X6)))))<=(![X7]:((sorti2(h(X7))<=sorti1(X7)))&![X8]:((sorti2(X8)=>sorti1(j(X8)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', co1)). 0.21/0.49 fof(ax4, axiom, ~(~(?[X7]:((sorti2(X7)&![X8]:((sorti2(X8)=>X7=op2(X8,X8))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax4)). 0.21/0.49 fof(ax1, axiom, ![X7]:((sorti1(X7)=>![X8]:((sorti1(op1(X7,X8))<=sorti1(X8))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax1)). 0.21/0.49 fof(ax3, axiom, ~(?[X7]:((sorti1(X7)&![X8]:((sorti1(X8)=>X7=op1(X8,X8)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax3)). 0.21/0.49 fof(c_0_4, negated_conjecture, ~(((![X7]:((sorti1(X7)=>sorti2(h(X7))))&![X8]:((sorti2(X8)=>sorti1(j(X8)))))=>~((((![X1]:((sorti1(X1)=>![X2]:((sorti1(X2)=>op2(h(X1),h(X2))=h(op1(X1,X2))))))&![X3]:((sorti2(X3)=>![X4]:((sorti2(X4)=>op1(j(X3),j(X4))=j(op2(X3,X4)))))))&![X5]:((sorti1(X5)=>X5=j(h(X5)))))&![X6]:((sorti2(X6)=>h(j(X6))=X6)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])])). 0.21/0.49 fof(c_0_5, plain, ![X24]:((sorti2(esk2_0)&(~sorti2(X24)|esk2_0=op2(X24,X24)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])). 0.21/0.49 fof(c_0_6, negated_conjecture, ![X9, X10, X11, X12, X13, X14, X15, X16]:((((~sorti1(X9)|sorti2(h(X9)))&(~sorti2(X10)|sorti1(j(X10))))&((((~sorti1(X11)|(~sorti1(X12)|op2(h(X11),h(X12))=h(op1(X11,X12))))&(~sorti2(X13)|(~sorti2(X14)|op1(j(X13),j(X14))=j(op2(X13,X14)))))&(~sorti1(X15)|X15=j(h(X15))))&(~sorti2(X16)|h(j(X16))=X16)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])). 0.21/0.49 cnf(c_0_7, plain, (esk2_0=op2(X1,X1)|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.21/0.49 cnf(c_0_8, negated_conjecture, (op2(h(X1),h(X2))=h(op1(X1,X2))|~sorti1(X1)|~sorti1(X2)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.21/0.49 cnf(c_0_9, negated_conjecture, (sorti2(h(X1))|~sorti1(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.21/0.49 fof(c_0_10, plain, ![X7]:((sorti1(X7)=>![X8]:((sorti1(X8)=>sorti1(op1(X7,X8)))))), inference(fof_simplification,[status(thm)],[ax1])). 0.21/0.49 cnf(c_0_11, negated_conjecture, (X1=j(h(X1))|~sorti1(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.21/0.49 cnf(c_0_12, negated_conjecture, (h(op1(X1,X1))=esk2_0|~sorti1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9])). 0.21/0.49 fof(c_0_13, plain, ![X17, X18]:((~sorti1(X17)|(~sorti1(X18)|sorti1(op1(X17,X18))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])). 0.21/0.49 cnf(c_0_14, negated_conjecture, (op1(X1,X1)=j(esk2_0)|~sorti1(op1(X1,X1))|~sorti1(X1)), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.21/0.49 cnf(c_0_15, plain, (sorti1(op1(X1,X2))|~sorti1(X1)|~sorti1(X2)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.21/0.49 fof(c_0_16, plain, ![X19]:(((sorti1(esk1_1(X19))|~sorti1(X19))&(X19!=op1(esk1_1(X19),esk1_1(X19))|~sorti1(X19)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])). 0.21/0.49 cnf(c_0_17, negated_conjecture, (op1(X1,X1)=j(esk2_0)|~sorti1(X1)), inference(spm,[status(thm)],[c_0_14, c_0_15])). 0.21/0.49 cnf(c_0_18, plain, (X1!=op1(esk1_1(X1),esk1_1(X1))|~sorti1(X1)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.21/0.49 cnf(c_0_19, negated_conjecture, (sorti1(j(esk2_0))|~sorti1(X1)), inference(spm,[status(thm)],[c_0_15, c_0_17])). 0.21/0.49 cnf(c_0_20, negated_conjecture, (~sorti1(esk1_1(j(esk2_0)))), inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_17])]), c_0_19])). 0.21/0.49 cnf(c_0_21, plain, (sorti1(esk1_1(X1))|~sorti1(X1)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.21/0.49 cnf(c_0_22, negated_conjecture, (~sorti1(j(esk2_0))), inference(spm,[status(thm)],[c_0_20, c_0_21])). 0.21/0.49 cnf(c_0_23, negated_conjecture, (sorti1(j(X1))|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.21/0.49 cnf(c_0_24, plain, (sorti2(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.21/0.49 cnf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])]), ['proof']). 0.21/0.49 # SZS output end CNFRefutation 0.21/0.49 # Parsed axioms : 5 0.21/0.49 # Removed by relevancy pruning/SinE : 0 0.21/0.49 # Initial clauses : 12 0.21/0.49 # Removed in clause preprocessing : 0 0.21/0.49 # Initial clauses in saturation : 12 0.21/0.49 # Processed clauses : 31 0.21/0.49 # ...of these trivial : 0 0.21/0.49 # ...subsumed : 1 0.21/0.49 # ...remaining for further processing : 30 0.21/0.49 # Other redundant clauses eliminated : 1 0.21/0.49 # Clauses deleted for lack of memory : 0 0.21/0.49 # Backward-subsumed : 1 0.21/0.49 # Backward-rewritten : 0 0.21/0.49 # Generated clauses : 26 0.21/0.49 # ...of the previous two non-redundant : 20 0.21/0.49 # ...aggressively subsumed : 0 0.21/0.49 # Contextual simplify-reflections : 2 0.21/0.49 # Paramodulations : 25 0.21/0.49 # Factorizations : 0 0.21/0.49 # NegExts : 0 0.21/0.49 # Equation resolutions : 1 0.21/0.49 # Propositional unsat checks : 0 0.21/0.49 # Propositional check models : 0 0.21/0.49 # Propositional check unsatisfiable : 0 0.21/0.49 # Propositional clauses : 0 0.21/0.49 # Propositional clauses after purity: 0 0.21/0.49 # Propositional unsat core size : 0 0.21/0.49 # Propositional preprocessing time : 0.000 0.21/0.49 # Propositional encoding time : 0.000 0.21/0.49 # Propositional solver time : 0.000 0.21/0.49 # Success case prop preproc time : 0.000 0.21/0.49 # Success case prop encoding time : 0.000 0.21/0.49 # Success case prop solver time : 0.000 0.21/0.49 # Current number of processed clauses : 17 0.21/0.49 # Positive orientable unit clauses : 1 0.21/0.49 # Positive unorientable unit clauses: 0 0.21/0.49 # Negative unit clauses : 2 0.21/0.49 # Non-unit-clauses : 14 0.21/0.49 # Current number of unprocessed clauses: 13 0.21/0.49 # ...number of literals in the above : 47 0.21/0.49 # Current number of archived formulas : 0 0.21/0.49 # Current number of archived clauses : 13 0.21/0.49 # Clause-clause subsumption calls (NU) : 4 0.21/0.49 # Rec. Clause-clause subsumption calls : 4 0.21/0.49 # Non-unit clause-clause subsumptions : 4 0.21/0.49 # Unit Clause-clause subsumption calls : 11 0.21/0.49 # Rewrite failures with RHS unbound : 0 0.21/0.49 # BW rewrite match attempts : 0 0.21/0.49 # BW rewrite match successes : 0 0.21/0.49 # Condensation attempts : 0 0.21/0.49 # Condensation successes : 0 0.21/0.49 # Termbank termtop insertions : 1416 0.21/0.49 0.21/0.49 # ------------------------------------------------- 0.21/0.49 # User time : 0.006 s 0.21/0.49 # System time : 0.001 s 0.21/0.49 # Total time : 0.007 s 0.21/0.49 # Maximum resident set size: 1700 pages 0.21/0.49 0.21/0.49 # ------------------------------------------------- 0.21/0.49 # User time : 0.008 s 0.21/0.49 # System time : 0.001 s 0.21/0.49 # Total time : 0.010 s 0.21/0.49 # Maximum resident set size: 1712 pages 0.21/0.49 EOF