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 : n003.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 03:00:21 EDT 2022 0.13/0.34 % CPUTime : 0.20/0.47 Running first-order on 8 cores theorem proving 0.20/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.20/0.48 # Version: 3.0pre003 0.20/0.51 # Preprocessing class: FSMSSMSMSSSNFFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 600s (5) cores 0.20/0.51 # Starting new_bool_3 with 120s (1) cores 0.20/0.51 # Starting new_bool_1 with 120s (1) cores 0.20/0.51 # Starting sh5l with 120s (1) cores 0.20/0.51 # new_bool_1 with pid 6853 completed with status 0 0.20/0.51 # Result found by new_bool_1 0.20/0.51 # Preprocessing class: FSMSSMSMSSSNFFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 600s (5) cores 0.20/0.51 # Starting new_bool_3 with 120s (1) cores 0.20/0.51 # Starting new_bool_1 with 120s (1) cores 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.20/0.51 # ...ProofStateSinE()=10/33 0.20/0.51 # Search class: FGHNF-FFSM22-SFFFFFNN 0.20/0.51 # partial match(1): FGHNF-FFSF22-SFFFFFNN 0.20/0.51 # Scheduled 5 strats onto 1 cores with 120 seconds (120 total) 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 73s (1) cores 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 6856 completed with status 0 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG 0.20/0.51 # Preprocessing class: FSMSSMSMSSSNFFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 600s (5) cores 0.20/0.51 # Starting new_bool_3 with 120s (1) cores 0.20/0.51 # Starting new_bool_1 with 120s (1) cores 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0) 0.20/0.51 # ...ProofStateSinE()=10/33 0.20/0.51 # Search class: FGHNF-FFSM22-SFFFFFNN 0.20/0.51 # partial match(1): FGHNF-FFSF22-SFFFFFNN 0.20/0.51 # Scheduled 5 strats onto 1 cores with 120 seconds (120 total) 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 73s (1) cores 0.20/0.51 # Preprocessing time : 0.002 s 0.20/0.51 # Presaturation interreduction done 0.20/0.51 0.20/0.51 # Proof found! 0.20/0.51 # SZS status Theorem 0.20/0.51 # SZS output start CNFRefutation 0.20/0.51 tff(decl_22, type, model: ($i * $i) > $o). 0.20/0.51 tff(decl_23, type, esa: $i). 0.20/0.51 tff(decl_24, type, status: ($i * $i * $i) > $o). 0.20/0.51 tff(decl_25, type, tca: $i). 0.20/0.51 tff(decl_26, type, wec: $i). 0.20/0.51 tff(decl_27, type, wtc: $i). 0.20/0.51 tff(decl_28, type, eqv: $i). 0.20/0.51 tff(decl_29, type, cax: $i). 0.20/0.51 tff(decl_30, type, wth: $i). 0.20/0.51 tff(decl_31, type, unp: $i). 0.20/0.51 tff(decl_32, type, thm: $i). 0.20/0.51 tff(decl_33, type, csa: $i). 0.20/0.51 tff(decl_34, type, not: $i > $i). 0.20/0.51 tff(decl_35, type, eth: $i). 0.20/0.51 tff(decl_36, type, wca: $i). 0.20/0.51 tff(decl_37, type, noc: $i). 0.20/0.51 tff(decl_38, type, tau: $i). 0.20/0.51 tff(decl_39, type, uns: $i). 0.20/0.51 tff(decl_40, type, sap: $i). 0.20/0.51 tff(decl_41, type, sat: $i). 0.20/0.51 tff(decl_42, type, tac: $i). 0.20/0.51 tff(decl_43, type, sca: $i). 0.20/0.51 tff(decl_44, type, xora: ($i * $i) > $o). 0.20/0.51 tff(decl_45, type, isa: ($i * $i) > $o). 0.20/0.51 tff(decl_46, type, nevera: ($i * $i) > $o). 0.20/0.51 tff(decl_47, type, nota: ($i * $i) > $o). 0.20/0.51 tff(decl_48, type, mighta: ($i * $i) > $o). 0.20/0.51 tff(decl_49, type, esk1_2: ($i * $i) > $i). 0.20/0.51 tff(decl_50, type, esk2_2: ($i * $i) > $i). 0.20/0.51 tff(decl_51, type, esk3_2: ($i * $i) > $i). 0.20/0.51 tff(decl_52, type, esk4_2: ($i * $i) > $i). 0.20/0.51 tff(decl_53, type, esk5_2: ($i * $i) > $i). 0.20/0.51 tff(decl_54, type, esk6_2: ($i * $i) > $i). 0.20/0.51 tff(decl_55, type, esk7_0: $i). 0.20/0.51 tff(decl_56, type, esk8_0: $i). 0.20/0.51 tff(decl_57, type, esk9_0: $i). 0.20/0.51 tff(decl_58, type, esk10_0: $i). 0.20/0.51 tff(decl_59, type, esk11_0: $i). 0.20/0.51 tff(decl_60, type, esk12_0: $i). 0.20/0.51 tff(decl_61, type, esk13_0: $i). 0.20/0.51 tff(decl_62, type, esk14_0: $i). 0.20/0.51 tff(decl_63, type, esk15_0: $i). 0.20/0.51 tff(decl_64, type, esk16_0: $i). 0.20/0.51 tff(decl_65, type, esk17_0: $i). 0.20/0.51 tff(decl_66, type, esk18_0: $i). 0.20/0.51 tff(decl_67, type, esk19_0: $i). 0.20/0.51 tff(decl_68, type, esk20_0: $i). 0.20/0.51 tff(decl_69, type, esk21_0: $i). 0.20/0.51 tff(decl_70, type, esk22_0: $i). 0.20/0.51 tff(decl_71, type, esk23_0: $i). 0.20/0.51 tff(decl_72, type, esk24_0: $i). 0.20/0.51 fof(wec, axiom, ![X1, X2]:((((?[X4]:(model(X4,X1))&?[X5]:((~(model(X5,X1))&model(X5,X2))))&![X3]:((model(X3,X2)<=model(X3,X1))))<=>status(X1,X2,wec))), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax', wec)). 0.20/0.51 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.51 fof(isa, axiom, ![X9, X10]:((![X1, X2]:((status(X1,X2,X9)=>status(X1,X2,X10)))<=>isa(X9,X10))), file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax', isa)). 0.20/0.51 fof(isa_wec_thm, conjecture, isa(wec,thm), file('/export/starexec/sandbox/benchmark/theBenchmark.p', isa_wec_thm)). 0.20/0.51 fof(c_0_4, plain, ![X1, X2]:((((?[X4]:(model(X4,X1))&?[X5]:((~model(X5,X1)&model(X5,X2))))&![X3]:((model(X3,X1)=>model(X3,X2))))<=>status(X1,X2,wec))), inference(fof_simplification,[status(thm)],[wec])). 0.20/0.51 fof(c_0_5, plain, ![X1, X2]:((status(X1,X2,thm)<=>![X4]:((model(X4,X1)=>model(X4,X2))))), inference(fof_simplification,[status(thm)],[thm])). 0.20/0.51 fof(c_0_6, plain, ![X25, X26, X27, X28, X30, X31, X34]:((((model(esk4_2(X25,X26),X25)|(~model(X27,X25)|(model(X28,X25)|~model(X28,X26)))|status(X25,X26,wec))&(~model(esk4_2(X25,X26),X26)|(~model(X27,X25)|(model(X28,X25)|~model(X28,X26)))|status(X25,X26,wec)))&(((model(esk5_2(X30,X31),X30)|~status(X30,X31,wec))&((~model(esk6_2(X30,X31),X30)|~status(X30,X31,wec))&(model(esk6_2(X30,X31),X31)|~status(X30,X31,wec))))&(~model(X34,X30)|model(X34,X31)|~status(X30,X31,wec))))), 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)],[c_0_4])])])])])])). 0.20/0.51 fof(c_0_7, plain, ![X11, X12, X15, X16, X17, X18]:((((status(esk1_2(X11,X12),esk2_2(X11,X12),X11)|isa(X11,X12))&(~status(esk1_2(X11,X12),esk2_2(X11,X12),X12)|isa(X11,X12)))&(~isa(X15,X16)|(~status(X17,X18,X15)|status(X17,X18,X16))))), 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)],[isa])])])])])])). 0.20/0.51 fof(c_0_8, plain, ![X19, X20, X21, X22, X23]:(((~status(X19,X20,thm)|(~model(X21,X19)|model(X21,X20)))&((model(esk3_2(X22,X23),X22)|status(X22,X23,thm))&(~model(esk3_2(X22,X23),X23)|status(X22,X23,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)],[c_0_5])])])])])])). 0.20/0.51 cnf(c_0_9, plain, (model(X1,X3)|~model(X1,X2)|~status(X2,X3,wec)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.20/0.51 cnf(c_0_10, plain, (status(esk1_2(X1,X2),esk2_2(X1,X2),X1)|isa(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.51 cnf(c_0_11, plain, (status(X1,X2,thm)|~model(esk3_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.20/0.51 cnf(c_0_12, plain, (isa(wec,X1)|model(X2,esk2_2(wec,X1))|~model(X2,esk1_2(wec,X1))), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.20/0.51 cnf(c_0_13, plain, (isa(wec,X1)|status(X2,esk2_2(wec,X1),thm)|~model(esk3_2(X2,esk2_2(wec,X1)),esk1_2(wec,X1))), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.20/0.51 cnf(c_0_14, plain, (model(esk3_2(X1,X2),X1)|status(X1,X2,thm)), inference(split_conjunct,[status(thm)],[c_0_8])). 0.20/0.51 fof(c_0_15, negated_conjecture, ~isa(wec,thm), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[isa_wec_thm])])). 0.20/0.51 cnf(c_0_16, plain, (isa(X1,X2)|~status(esk1_2(X1,X2),esk2_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.20/0.51 cnf(c_0_17, plain, (isa(wec,X1)|status(esk1_2(wec,X1),esk2_2(wec,X1),thm)), inference(spm,[status(thm)],[c_0_13, c_0_14])). 0.20/0.51 cnf(c_0_18, negated_conjecture, (~isa(wec,thm)), inference(split_conjunct,[status(thm)],[c_0_15])). 0.20/0.51 cnf(c_0_19, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), ['proof']). 0.20/0.51 # SZS output end CNFRefutation 0.20/0.51 # Parsed axioms : 33 0.20/0.51 # Removed by relevancy pruning/SinE : 23 0.20/0.51 # Initial clauses : 28 0.20/0.51 # Removed in clause preprocessing : 0 0.20/0.51 # Initial clauses in saturation : 28 0.20/0.51 # Processed clauses : 256 0.20/0.51 # ...of these trivial : 0 0.20/0.51 # ...subsumed : 90 0.20/0.51 # ...remaining for further processing : 166 0.20/0.51 # Other redundant clauses eliminated : 0 0.20/0.51 # Clauses deleted for lack of memory : 0 0.20/0.51 # Backward-subsumed : 9 0.20/0.51 # Backward-rewritten : 6 0.20/0.51 # Generated clauses : 700 0.20/0.51 # ...of the previous two non-redundant : 597 0.20/0.51 # ...aggressively subsumed : 0 0.20/0.51 # Contextual simplify-reflections : 7 0.20/0.51 # Paramodulations : 700 0.20/0.51 # Factorizations : 0 0.20/0.51 # NegExts : 0 0.20/0.51 # Equation resolutions : 0 0.20/0.51 # Propositional unsat checks : 0 0.20/0.51 # Propositional check models : 0 0.20/0.51 # Propositional check unsatisfiable : 0 0.20/0.51 # Propositional clauses : 0 0.20/0.51 # Propositional clauses after purity: 0 0.20/0.51 # Propositional unsat core size : 0 0.20/0.51 # Propositional preprocessing time : 0.000 0.20/0.51 # Propositional encoding time : 0.000 0.20/0.51 # Propositional solver time : 0.000 0.20/0.51 # Success case prop preproc time : 0.000 0.20/0.51 # Success case prop encoding time : 0.000 0.20/0.51 # Success case prop solver time : 0.000 0.20/0.51 # Current number of processed clauses : 123 0.20/0.51 # Positive orientable unit clauses : 15 0.20/0.51 # Positive unorientable unit clauses: 0 0.20/0.51 # Negative unit clauses : 12 0.20/0.51 # Non-unit-clauses : 96 0.20/0.51 # Current number of unprocessed clauses: 354 0.20/0.51 # ...number of literals in the above : 1570 0.20/0.51 # Current number of archived formulas : 0 0.20/0.51 # Current number of archived clauses : 43 0.20/0.51 # Clause-clause subsumption calls (NU) : 1750 0.20/0.51 # Rec. Clause-clause subsumption calls : 863 0.20/0.51 # Non-unit clause-clause subsumptions : 102 0.20/0.51 # Unit Clause-clause subsumption calls : 83 0.20/0.51 # Rewrite failures with RHS unbound : 0 0.20/0.51 # BW rewrite match attempts : 19 0.20/0.51 # BW rewrite match successes : 2 0.20/0.51 # Condensation attempts : 0 0.20/0.51 # Condensation successes : 0 0.20/0.51 # Termbank termtop insertions : 13953 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.020 s 0.20/0.51 # System time : 0.007 s 0.20/0.51 # Total time : 0.027 s 0.20/0.51 # Maximum resident set size: 1896 pages 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.021 s 0.20/0.51 # System time : 0.009 s 0.20/0.51 # Total time : 0.030 s 0.20/0.51 # Maximum resident set size: 1760 pages 0.20/0.51 EOF