0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n010.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 960 0.12/0.33 % WCLimit : 120 0.12/0.33 % DateTime : Tue Aug 9 04:24:05 EDT 2022 0.12/0.33 % CPUTime : 0.18/0.46 Running first-order on 8 cores theorem proving 0.18/0.46 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 0.18/0.46 # Version: 3.0pre003 5.62/1.15 # Preprocessing class: FSMSSLSSSSSNFFN. 5.62/1.15 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 5.62/1.15 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 600s (5) cores 5.62/1.15 # Starting new_bool_3 with 120s (1) cores 5.62/1.15 # Starting new_bool_1 with 120s (1) cores 5.62/1.15 # Starting sh5l with 120s (1) cores 5.62/1.15 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 24013 completed with status 0 5.62/1.15 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 5.62/1.15 # Preprocessing class: FSMSSLSSSSSNFFN. 5.62/1.15 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 5.62/1.15 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 600s (5) cores 5.62/1.15 # No SInE strategy applied 5.62/1.15 # Search class: FGUSF-FFMM21-MFFFFFNN 5.62/1.15 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 5.62/1.15 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 300s (1) cores 5.62/1.15 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 61s (1) cores 5.62/1.15 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 61s (1) cores 5.62/1.15 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 61s (1) cores 5.62/1.15 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 61s (1) cores 5.62/1.15 # U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 24027 completed with status 0 5.62/1.15 # Result found by U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN 5.62/1.15 # Preprocessing class: FSMSSLSSSSSNFFN. 5.62/1.15 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 5.62/1.15 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 600s (5) cores 5.62/1.15 # No SInE strategy applied 5.62/1.15 # Search class: FGUSF-FFMM21-MFFFFFNN 5.62/1.15 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 5.62/1.15 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 300s (1) cores 5.62/1.15 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 61s (1) cores 5.62/1.15 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 61s (1) cores 5.62/1.15 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 61s (1) cores 5.62/1.15 # Preprocessing time : 0.002 s 5.62/1.15 # Presaturation interreduction done 5.62/1.15 5.62/1.15 # Proof found! 5.62/1.15 # SZS status Theorem 5.62/1.15 # SZS output start CNFRefutation 5.62/1.15 tff(decl_22, type, and_1: $o). 5.62/1.15 tff(decl_23, type, and: ($i * $i) > $i). 5.62/1.15 tff(decl_24, type, implies: ($i * $i) > $i). 5.62/1.15 tff(decl_25, type, is_a_theorem: $i > $o). 5.62/1.15 tff(decl_26, type, modus_tollens: $o). 5.62/1.15 tff(decl_27, type, not: $i > $i). 5.62/1.15 tff(decl_28, type, and_2: $o). 5.62/1.15 tff(decl_29, type, or: ($i * $i) > $i). 5.62/1.15 tff(decl_30, type, or_3: $o). 5.62/1.15 tff(decl_31, type, and_3: $o). 5.62/1.15 tff(decl_32, type, equivalence_3: $o). 5.62/1.15 tff(decl_33, type, equiv: ($i * $i) > $i). 5.62/1.15 tff(decl_34, type, kn2: $o). 5.62/1.15 tff(decl_35, type, kn3: $o). 5.62/1.15 tff(decl_36, type, or_1: $o). 5.62/1.15 tff(decl_37, type, cn3: $o). 5.62/1.15 tff(decl_38, type, cn1: $o). 5.62/1.15 tff(decl_39, type, equivalence_1: $o). 5.62/1.15 tff(decl_40, type, substitution_of_equivalents: $o). 5.62/1.15 tff(decl_41, type, r5: $o). 5.62/1.15 tff(decl_42, type, r2: $o). 5.62/1.15 tff(decl_43, type, or_2: $o). 5.62/1.15 tff(decl_44, type, cn2: $o). 5.62/1.15 tff(decl_45, type, implies_2: $o). 5.62/1.15 tff(decl_46, type, r1: $o). 5.62/1.15 tff(decl_47, type, r3: $o). 5.62/1.15 tff(decl_48, type, r4: $o). 5.62/1.15 tff(decl_49, type, kn1: $o). 5.62/1.15 tff(decl_50, type, equivalence_2: $o). 5.62/1.15 tff(decl_51, type, modus_ponens: $o). 5.62/1.15 tff(decl_52, type, implies_1: $o). 5.62/1.15 tff(decl_53, type, implies_3: $o). 5.62/1.15 tff(decl_54, type, op_implies_and: $o). 5.62/1.15 tff(decl_55, type, op_implies_or: $o). 5.62/1.15 tff(decl_56, type, op_equiv: $o). 5.62/1.15 tff(decl_57, type, op_or: $o). 5.62/1.15 tff(decl_58, type, op_and: $o). 5.62/1.15 tff(decl_59, type, esk1_0: $i). 5.62/1.15 tff(decl_60, type, esk2_0: $i). 5.62/1.15 tff(decl_61, type, esk3_0: $i). 5.62/1.15 tff(decl_62, type, esk4_0: $i). 5.62/1.15 tff(decl_63, type, esk5_0: $i). 5.62/1.15 tff(decl_64, type, esk6_0: $i). 5.62/1.15 tff(decl_65, type, esk7_0: $i). 5.62/1.15 tff(decl_66, type, esk8_0: $i). 5.62/1.15 tff(decl_67, type, esk9_0: $i). 5.62/1.15 tff(decl_68, type, esk10_0: $i). 5.62/1.15 tff(decl_69, type, esk11_0: $i). 5.62/1.15 tff(decl_70, type, esk12_0: $i). 5.62/1.15 tff(decl_71, type, esk13_0: $i). 5.62/1.15 tff(decl_72, type, esk14_0: $i). 5.62/1.15 tff(decl_73, type, esk15_0: $i). 5.62/1.15 tff(decl_74, type, esk16_0: $i). 5.62/1.15 tff(decl_75, type, esk17_0: $i). 5.62/1.15 tff(decl_76, type, esk18_0: $i). 5.62/1.15 tff(decl_77, type, esk19_0: $i). 5.62/1.15 tff(decl_78, type, esk20_0: $i). 5.62/1.15 tff(decl_79, type, esk21_0: $i). 5.62/1.15 tff(decl_80, type, esk22_0: $i). 5.62/1.15 tff(decl_81, type, esk23_0: $i). 5.62/1.15 tff(decl_82, type, esk24_0: $i). 5.62/1.15 tff(decl_83, type, esk25_0: $i). 5.62/1.15 tff(decl_84, type, esk26_0: $i). 5.62/1.15 tff(decl_85, type, esk27_0: $i). 5.62/1.15 tff(decl_86, type, esk28_0: $i). 5.62/1.15 tff(decl_87, type, esk29_0: $i). 5.62/1.15 tff(decl_88, type, esk30_0: $i). 5.62/1.15 tff(decl_89, type, esk31_0: $i). 5.62/1.15 tff(decl_90, type, esk32_0: $i). 5.62/1.15 tff(decl_91, type, esk33_0: $i). 5.62/1.15 tff(decl_92, type, esk34_0: $i). 5.62/1.15 tff(decl_93, type, esk35_0: $i). 5.62/1.15 tff(decl_94, type, esk36_0: $i). 5.62/1.15 tff(decl_95, type, esk37_0: $i). 5.62/1.15 tff(decl_96, type, esk38_0: $i). 5.62/1.15 tff(decl_97, type, esk39_0: $i). 5.62/1.15 tff(decl_98, type, esk40_0: $i). 5.62/1.15 tff(decl_99, type, esk41_0: $i). 5.62/1.15 tff(decl_100, type, esk42_0: $i). 5.62/1.15 tff(decl_101, type, esk43_0: $i). 5.62/1.15 tff(decl_102, type, esk44_0: $i). 5.62/1.15 tff(decl_103, type, esk45_0: $i). 5.62/1.15 tff(decl_104, type, esk46_0: $i). 5.62/1.15 tff(decl_105, type, esk47_0: $i). 5.62/1.15 tff(decl_106, type, esk48_0: $i). 5.62/1.15 tff(decl_107, type, esk49_0: $i). 5.62/1.15 tff(decl_108, type, esk50_0: $i). 5.62/1.15 tff(decl_109, type, esk51_0: $i). 5.62/1.15 tff(decl_110, type, esk52_0: $i). 5.62/1.15 tff(decl_111, type, esk53_0: $i). 5.62/1.15 tff(decl_112, type, esk54_0: $i). 5.62/1.15 tff(decl_113, type, esk55_0: $i). 5.62/1.15 fof(r4, axiom, (r4<=>![X4, X5, X6]:(is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', r4)). 5.62/1.15 fof(op_implies_or, axiom, (op_implies_or=>![X1, X2]:(or(not(X1),X2)=implies(X1,X2))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax', op_implies_or)). 5.62/1.15 fof(principia_r4, axiom, r4, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax', principia_r4)). 5.62/1.15 fof(principia_op_implies_or, axiom, op_implies_or, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax', principia_op_implies_or)). 5.62/1.15 fof(modus_ponens, axiom, (modus_ponens<=>![X1, X2]:(((is_a_theorem(X1)&is_a_theorem(implies(X1,X2)))=>is_a_theorem(X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', modus_ponens)). 5.62/1.15 fof(r5, axiom, (![X4, X5, X6]:(is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))))<=>r5), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', r5)). 5.62/1.15 fof(principia_modus_ponens, axiom, modus_ponens, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax', principia_modus_ponens)). 5.62/1.15 fof(principia_r5, axiom, r5, file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax', principia_r5)). 5.62/1.15 fof(implies_3, axiom, (![X1, X2, X3]:(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))<=>implies_3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax', implies_3)). 5.62/1.15 fof(hilbert_implies_3, conjecture, implies_3, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_implies_3)). 5.62/1.15 fof(c_0_10, plain, ![X91, X92, X93]:(((~r4|is_a_theorem(implies(or(X91,or(X92,X93)),or(X92,or(X91,X93)))))&(~is_a_theorem(implies(or(esk43_0,or(esk44_0,esk45_0)),or(esk44_0,or(esk43_0,esk45_0))))|r4))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r4])])])])). 5.62/1.15 fof(c_0_11, plain, ![X119, X120]:((~op_implies_or|or(not(X119),X120)=implies(X119,X120))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])])). 5.62/1.15 cnf(c_0_12, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4), inference(split_conjunct,[status(thm)],[c_0_10])). 5.62/1.15 cnf(c_0_13, plain, (r4), inference(split_conjunct,[status(thm)],[principia_r4])). 5.62/1.15 cnf(c_0_14, plain, (or(not(X1),X2)=implies(X1,X2)|~op_implies_or), inference(split_conjunct,[status(thm)],[c_0_11])). 5.62/1.15 cnf(c_0_15, plain, (op_implies_or), inference(split_conjunct,[status(thm)],[principia_op_implies_or])). 5.62/1.15 fof(c_0_16, plain, ![X103, X104]:(((~modus_ponens|(~is_a_theorem(X103)|~is_a_theorem(implies(X103,X104))|is_a_theorem(X104)))&(((is_a_theorem(esk49_0)|modus_ponens)&(is_a_theorem(implies(esk49_0,esk50_0))|modus_ponens))&(~is_a_theorem(esk50_0)|modus_ponens)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])])). 5.62/1.15 cnf(c_0_17, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_13])])). 5.62/1.15 cnf(c_0_18, plain, (or(not(X1),X2)=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15])])). 5.62/1.15 fof(c_0_19, plain, ![X66, X67, X68]:(((~is_a_theorem(implies(implies(esk30_0,esk31_0),implies(or(esk29_0,esk30_0),or(esk29_0,esk31_0))))|r5)&(~r5|is_a_theorem(implies(implies(X67,X68),implies(or(X66,X67),or(X66,X68))))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r5])])])])). 5.62/1.15 cnf(c_0_20, plain, (is_a_theorem(X2)|~modus_ponens|~is_a_theorem(X1)|~is_a_theorem(implies(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_16])). 5.62/1.15 cnf(c_0_21, plain, (modus_ponens), inference(split_conjunct,[status(thm)],[principia_modus_ponens])). 5.62/1.15 cnf(c_0_22, plain, (is_a_theorem(implies(implies(X1,or(X2,X3)),or(X2,implies(X1,X3))))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_18])). 5.62/1.15 cnf(c_0_23, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5), inference(split_conjunct,[status(thm)],[c_0_19])). 5.62/1.15 cnf(c_0_24, plain, (r5), inference(split_conjunct,[status(thm)],[principia_r5])). 5.62/1.15 fof(c_0_25, plain, ![X114, X115, X116]:(((~is_a_theorem(implies(implies(esk53_0,esk54_0),implies(implies(esk54_0,esk55_0),implies(esk53_0,esk55_0))))|implies_3)&(~implies_3|is_a_theorem(implies(implies(X114,X115),implies(implies(X115,X116),implies(X114,X116))))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_3])])])])). 5.62/1.15 fof(c_0_26, negated_conjecture, ~implies_3, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_implies_3])])). 5.62/1.15 cnf(c_0_27, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_21])])). 5.62/1.15 cnf(c_0_28, plain, (is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3))))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_18]), c_0_18])). 5.62/1.15 cnf(c_0_29, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_24])])). 5.62/1.15 cnf(c_0_30, plain, (implies_3|~is_a_theorem(implies(implies(esk53_0,esk54_0),implies(implies(esk54_0,esk55_0),implies(esk53_0,esk55_0))))), inference(split_conjunct,[status(thm)],[c_0_25])). 5.62/1.15 cnf(c_0_31, negated_conjecture, (~implies_3), inference(split_conjunct,[status(thm)],[c_0_26])). 5.62/1.15 cnf(c_0_32, plain, (is_a_theorem(implies(X1,implies(X2,X3)))|~is_a_theorem(implies(X2,implies(X1,X3)))), inference(spm,[status(thm)],[c_0_27, c_0_28])). 5.62/1.15 cnf(c_0_33, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2))))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_18]), c_0_18])). 5.62/1.15 cnf(c_0_34, plain, (~is_a_theorem(implies(implies(esk53_0,esk54_0),implies(implies(esk54_0,esk55_0),implies(esk53_0,esk55_0))))), inference(sr,[status(thm)],[c_0_30, c_0_31])). 5.62/1.15 cnf(c_0_35, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))), inference(spm,[status(thm)],[c_0_32, c_0_33])). 5.62/1.15 cnf(c_0_36, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_35])]), ['proof']). 5.62/1.15 # SZS output end CNFRefutation 5.62/1.15 # Parsed axioms : 45 5.62/1.15 # Removed by relevancy pruning/SinE : 0 5.62/1.15 # Initial clauses : 74 5.62/1.15 # Removed in clause preprocessing : 0 5.62/1.15 # Initial clauses in saturation : 74 5.62/1.15 # Processed clauses : 5868 5.62/1.15 # ...of these trivial : 1615 5.62/1.15 # ...subsumed : 2880 5.62/1.15 # ...remaining for further processing : 1373 5.62/1.15 # Other redundant clauses eliminated : 0 5.62/1.15 # Clauses deleted for lack of memory : 0 5.62/1.15 # Backward-subsumed : 0 5.62/1.15 # Backward-rewritten : 97 5.62/1.15 # Generated clauses : 58296 5.62/1.15 # ...of the previous two non-redundant : 40258 5.62/1.15 # ...aggressively subsumed : 0 5.62/1.15 # Contextual simplify-reflections : 0 5.62/1.15 # Paramodulations : 58296 5.62/1.15 # Factorizations : 0 5.62/1.15 # NegExts : 0 5.62/1.15 # Equation resolutions : 0 5.62/1.15 # Propositional unsat checks : 0 5.62/1.15 # Propositional check models : 0 5.62/1.15 # Propositional check unsatisfiable : 0 5.62/1.15 # Propositional clauses : 0 5.62/1.15 # Propositional clauses after purity: 0 5.62/1.15 # Propositional unsat core size : 0 5.62/1.15 # Propositional preprocessing time : 0.000 5.62/1.15 # Propositional encoding time : 0.000 5.62/1.15 # Propositional solver time : 0.000 5.62/1.15 # Success case prop preproc time : 0.000 5.62/1.15 # Success case prop encoding time : 0.000 5.62/1.15 # Success case prop solver time : 0.000 5.62/1.15 # Current number of processed clauses : 1215 5.62/1.15 # Positive orientable unit clauses : 752 5.62/1.15 # Positive unorientable unit clauses: 11 5.62/1.15 # Negative unit clauses : 4 5.62/1.15 # Non-unit-clauses : 448 5.62/1.15 # Current number of unprocessed clauses: 33683 5.62/1.15 # ...number of literals in the above : 46441 5.62/1.15 # Current number of archived formulas : 0 5.62/1.15 # Current number of archived clauses : 158 5.62/1.15 # Clause-clause subsumption calls (NU) : 75310 5.62/1.15 # Rec. Clause-clause subsumption calls : 75081 5.62/1.15 # Non-unit clause-clause subsumptions : 2798 5.62/1.15 # Unit Clause-clause subsumption calls : 1740 5.62/1.15 # Rewrite failures with RHS unbound : 0 5.62/1.15 # BW rewrite match attempts : 38511 5.62/1.15 # BW rewrite match successes : 143 5.62/1.15 # Condensation attempts : 0 5.62/1.15 # Condensation successes : 0 5.62/1.15 # Termbank termtop insertions : 1477721 5.62/1.15 5.62/1.15 # ------------------------------------------------- 5.62/1.15 # User time : 0.636 s 5.62/1.15 # System time : 0.033 s 5.62/1.15 # Total time : 0.669 s 5.62/1.15 # Maximum resident set size: 1944 pages 5.62/1.15 5.62/1.15 # ------------------------------------------------- 5.62/1.15 # User time : 3.214 s 5.62/1.15 # System time : 0.143 s 5.62/1.15 # Total time : 3.357 s 5.62/1.15 # Maximum resident set size: 1764 pages 5.62/1.15 EOF