TSTP Solution File: PHI005^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PHI005^2 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:18:06 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PHI005^2 : TPTP v8.2.0. Released v6.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 14:48:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.50 # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.50 # post_as_ho1 with pid 24083 completed with status 0
% 0.20/0.50 # Result found by post_as_ho1
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.50 # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGUNS-FFSF32-SHSSMSBN
% 0.20/0.50 # partial match(1): HGUNF-FFSF32-SHSSMSBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10_cnf2 with 163s (1) cores
% 0.20/0.50 # new_ho_10_cnf2 with pid 24088 completed with status 0
% 0.20/0.50 # Result found by new_ho_10_cnf2
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.50 # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HGUNS-FFSF32-SHSSMSBN
% 0.20/0.50 # partial match(1): HGUNF-FFSF32-SHSSMSBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10_cnf2 with 163s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% 0.20/0.50 thf(decl_sort1, type, mu: $tType).
% 0.20/0.50 thf(decl_28, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.50 thf(decl_32, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.20/0.50 thf(decl_33, type, mforall_indset: ((mu > $i > $o) > $i > $o) > $i > $o).
% 0.20/0.50 thf(decl_35, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.20/0.50 thf(decl_38, type, mbox_generic: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.20/0.50 thf(decl_39, type, mdia_generic: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.20/0.50 thf(decl_40, type, rel: $i > $i > $o).
% 0.20/0.50 thf(decl_41, type, mbox: ($i > $o) > $i > $o).
% 0.20/0.50 thf(decl_42, type, mdia: ($i > $o) > $i > $o).
% 0.20/0.50 thf(decl_43, type, mvalid: ($i > $o) > $o).
% 0.20/0.50 thf(decl_45, type, msymmetric: ($i > $i > $o) > $o).
% 0.20/0.50 thf(decl_46, type, positive: (mu > $i > $o) > $i > $o).
% 0.20/0.50 thf(decl_47, type, god: mu > $i > $o).
% 0.20/0.50 thf(decl_48, type, essence: (mu > $i > $o) > mu > $i > $o).
% 0.20/0.50 thf(decl_49, type, necessary_existence: mu > $i > $o).
% 0.20/0.50 thf(decl_50, type, esk1_1: $i > $i).
% 0.20/0.50 thf(decl_51, type, esk2_1: $i > mu).
% 0.20/0.50 thf(decl_52, type, epred1_2: $i > mu > mu > $i > $o).
% 0.20/0.50 thf(decl_53, type, esk3_0: $i).
% 0.20/0.50 thf(decl_54, type, esk4_0: $i).
% 0.20/0.50 thf(decl_55, type, epred2_1: mu > mu > $i > $o).
% 0.20/0.50 thf(decl_56, type, epred3_0: mu > $i > $o).
% 0.20/0.50 thf(decl_57, type, epred4_0: mu > $i > $o).
% 0.20/0.50 thf(decl_58, type, esk5_4: $i > mu > (mu > $i > $o) > $i > mu).
% 0.20/0.50 thf(decl_59, type, epred5_2: $i > mu > mu > $i > $o).
% 0.20/0.50 thf(decl_60, type, esk6_2: $i > mu > $i).
% 0.20/0.50 thf(decl_61, type, epred6_2: $i > mu > mu > $i > $o).
% 0.20/0.50 thf(mbox_generic, axiom, ((mbox_generic)=(^[X15:$i > $i > $o, X4:$i > $o, X3:$i]:(![X16:$i]:((~((X15 @ X3 @ X16))|(X4 @ X16)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mbox_generic)).
% 0.20/0.50 thf(defD1, axiom, ((god)=(^[X1:mu]:(mforall_indset @ (^[X19:mu > $i > $o]:(mimplies @ (positive @ X19) @ (X19 @ X1)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', defD1)).
% 0.20/0.50 thf(mimplies, axiom, ((mimplies)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)=>(X5 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mimplies)).
% 0.20/0.50 thf(mforall_indset, axiom, ((mforall_indset)=(^[X7:(mu > $i > $o) > $i > $o, X3:$i]:(![X8:mu > $i > $o]:((X7 @ X8 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mforall_indset)).
% 0.20/0.50 thf(defD3, axiom, ((necessary_existence)=(^[X1:mu]:(mforall_indset @ (^[X20:mu > $i > $o]:(mimplies @ (essence @ X20 @ X1) @ (mbox @ (mexists_ind @ (^[X2:mu]:(X20 @ X2))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', defD3)).
% 0.20/0.50 thf(mexists_ind, axiom, ((mexists_ind)=(^[X11:mu > $i > $o, X3:$i]:(?[X1:mu]:((X11 @ X1 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mexists_ind)).
% 0.20/0.50 thf(mbox, axiom, ((mbox)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(![X21:$i]:((~((rel @ Z1 @ X21))|(Z0 @ X21)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mbox)).
% 0.20/0.50 thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mvalid)).
% 0.20/0.50 thf(mdia_generic, axiom, ((mdia_generic)=(^[X15:$i > $i > $o, X4:$i > $o, X3:$i]:(?[X16:$i]:(((X15 @ X3 @ X16)&(X4 @ X16)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mdia_generic)).
% 0.20/0.50 thf(thmT3, conjecture, (mvalid @ (mbox @ (mexists_ind @ (^[X1:mu]:(god @ X1))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', thmT3)).
% 0.20/0.50 thf(mforall_ind, axiom, ((mforall_ind)=(^[X6:mu > $i > $o, X3:$i]:(![X1:mu]:((X6 @ X1 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mforall_ind)).
% 0.20/0.50 thf(axA5, axiom, (mvalid @ (positive @ necessary_existence)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axA5)).
% 0.20/0.50 thf(mdia, axiom, ((mdia)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(?[X22:$i]:(((rel @ Z1 @ X22)&(Z0 @ X22)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax', mdia)).
% 0.20/0.50 thf(thmT2, lemma, (mvalid @ (mforall_ind @ (^[X1:mu]:(mimplies @ (god @ X1) @ (essence @ god @ X1))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', thmT2)).
% 0.20/0.50 thf(corC, lemma, (mvalid @ (mdia @ (mexists_ind @ (^[X1:mu]:(god @ X1))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', corC)).
% 0.20/0.50 thf(msymmetric, axiom, ((msymmetric)=(^[X15:$i > $i > $o]:(![X17:$i, X18:$i]:(((X15 @ X17 @ X18)=>(X15 @ X18 @ X17)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^1.ax', msymmetric)).
% 0.20/0.50 thf(sym, axiom, (msymmetric @ rel), file('/export/starexec/sandbox/benchmark/Axioms/LCL016^1.ax', sym)).
% 0.20/0.50 thf(c_0_17, plain, ((mbox_generic)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(![X16:$i]:((~((Z0 @ Z2 @ X16))|(Z1 @ X16)))))), inference(fof_simplification,[status(thm)],[mbox_generic])).
% 0.20/0.50 thf(c_0_18, plain, ((god)=(^[Z0/* 19 */:mu, Z1:$i]:(![X23:mu > $i > $o]:((((positive @ X23 @ Z1)=>(X23 @ Z0 @ Z1))))))), inference(fof_simplification,[status(thm)],[defD1])).
% 0.20/0.50 thf(c_0_19, plain, ((mimplies)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])).
% 0.20/0.50 thf(c_0_20, plain, ((mforall_indset)=(^[Z0/* 19 */:(mu > $i > $o) > $i > $o, Z1:$i]:(![X8:mu > $i > $o]:((Z0 @ X8 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_indset])).
% 0.20/0.50 thf(c_0_21, plain, ((necessary_existence)=(^[Z0/* 19 */:mu, Z1:$i]:(![X26:mu > $i > $o]:((((essence @ X26 @ Z0 @ Z1)=>(![X25:$i]:((~((rel @ Z1 @ X25))|(?[X24:mu]:((X26 @ X24 @ X25)))))))))))), inference(fof_simplification,[status(thm)],[defD3])).
% 0.20/0.50 thf(c_0_22, plain, ((mexists_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(?[X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mexists_ind])).
% 0.20/0.50 thf(c_0_23, axiom, ((mbox)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(![X21:$i]:((~((rel @ Z1 @ X21))|(Z0 @ X21)))))), inference(apply_def,[status(thm)],[mbox, c_0_17])).
% 0.20/0.50 thf(c_0_24, plain, ((mvalid)=(^[Z0/* 6 */:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
% 0.20/0.50 thf(c_0_25, plain, ((god)=(^[Z0/* 19 */:mu, Z1:$i]:(![X23:mu > $i > $o]:((((positive @ X23 @ Z1)=>(X23 @ Z0 @ Z1))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18, c_0_19]), c_0_20])).
% 0.20/0.50 thf(c_0_26, plain, ((necessary_existence)=(^[Z0/* 19 */:mu, Z1:$i]:(![X26:mu > $i > $o]:((((essence @ X26 @ Z0 @ Z1)=>(![X25:$i]:((~((rel @ Z1 @ X25))|(?[X24:mu]:((X26 @ X24 @ X25)))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_21, c_0_19]), c_0_20]), c_0_22]), c_0_23])).
% 0.20/0.50 thf(c_0_27, plain, ((mdia_generic)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(?[X16:$i]:(((Z0 @ Z2 @ X16)&(Z1 @ X16)))))), inference(fof_simplification,[status(thm)],[mdia_generic])).
% 0.20/0.50 thf(c_0_28, negated_conjecture, ~(![X44:$i, X43:$i]:((~(rel @ X44 @ X43)|?[X42:mu]:(![X41:mu > $i > $o]:(((positive @ X41 @ X43)=>(X41 @ X42 @ X43))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thmT3])]), c_0_22]), c_0_23]), c_0_24]), c_0_25])])).
% 0.20/0.50 thf(c_0_29, plain, ((mforall_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(![X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_ind])).
% 0.20/0.50 thf(c_0_30, plain, ![X32:$i]:((positive @ (^[Z0/* 19 */:mu, Z1:$i]:(![X29:mu > $i > $o]:(((essence @ X29 @ Z0 @ Z1)=>![X30:$i]:((~((rel @ Z1 @ X30))|?[X31:mu]:(X29 @ X31 @ X30))))))) @ X32)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axA5, c_0_24]), c_0_26])).
% 0.20/0.50 thf(c_0_31, axiom, ((mdia)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(?[X22:$i]:(((rel @ Z1 @ X22)&(Z0 @ X22)))))), inference(apply_def,[status(thm)],[mdia, c_0_27])).
% 0.20/0.50 thf(c_0_32, plain, ![X80:$i, X81:mu, X82:mu > $i > $o, X83:$i, X84:mu]:(((~(epred4_0 @ X81 @ X80)|(~(positive @ X82 @ X80)|(X82 @ X81 @ X80)))&(((positive @ (epred6_2 @ X83 @ X84) @ X83)|(epred4_0 @ X84 @ X83))&(~(epred6_2 @ X83 @ X84 @ X84 @ X83)|(epred4_0 @ X84 @ X83))))), inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[])])])])])])])).
% 0.20/0.50 thf(c_0_33, negated_conjecture, ![X57:mu]:(((rel @ esk3_0 @ esk4_0)&((positive @ (epred2_1 @ X57) @ esk4_0)&~(epred2_1 @ X57 @ X57 @ esk4_0)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])])])).
% 0.20/0.50 thf(c_0_34, lemma, ![X40:$i, X39:mu]:((![X37:mu > $i > $o]:(((positive @ X37 @ X40)=>(X37 @ X39 @ X40)))=>(essence @ (^[Z0/* 19 */:mu, Z1:$i]:(![X38:mu > $i > $o]:(((positive @ X38 @ Z1)=>X38 @ Z0 @ Z1)))) @ X39 @ X40))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[thmT2]), c_0_19]), c_0_29]), c_0_24]), c_0_25])).
% 0.20/0.50 thf(c_0_35, plain, ![X47:$i]:((positive @ (^[Z0/* 19 */:mu, Z1:$i]:(![X29:mu > $i > $o]:(((essence @ X29 @ Z0 @ Z1)=>![X30:$i]:((~((rel @ Z1 @ X30))|?[X31:mu]:(X29 @ X31 @ X30))))))) @ X47)), inference(variable_rename,[status(thm)],[c_0_30])).
% 0.20/0.50 thf(c_0_36, plain, ![X63:$i, X62:mu]:(((epred3_0 @ X62 @ X63)<=>![X59:mu > $i > $o]:(((essence @ X59 @ X62 @ X63)=>![X60:$i]:((~((rel @ X63 @ X60))|?[X61:mu]:((X59 @ X61 @ X60)))))))), introduced(definition)).
% 0.20/0.50 thf(c_0_37, lemma, ![X36:$i]:(?[X35:$i]:(((rel @ X36 @ X35)&?[X34:mu]:(![X33:mu > $i > $o]:(((positive @ X33 @ X35)=>(X33 @ X34 @ X35))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[corC]), c_0_22]), c_0_31]), c_0_24]), c_0_25])).
% 0.20/0.50 thf(c_0_38, plain, ![X1:mu, X6:mu > $i > $o, X3:$i]:(((X6 @ X1 @ X3)|~((epred4_0 @ X1 @ X3))|~((positive @ X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.20/0.50 thf(c_0_39, negated_conjecture, ![X1:mu]:((positive @ (epred2_1 @ X1) @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_33])).
% 0.20/0.50 thf(c_0_40, lemma, ![X52:$i, X53:mu]:((((positive @ (epred1_2 @ X52 @ X53) @ X52)|(essence @ (^[Z0/* 19 */:mu, Z1:$i]:(![X38:mu > $i > $o]:(((positive @ X38 @ Z1)=>X38 @ Z0 @ Z1)))) @ X53 @ X52))&(~(epred1_2 @ X52 @ X53 @ X53 @ X52)|(essence @ (^[Z0/* 19 */:mu, Z1:$i]:(![X38:mu > $i > $o]:(((positive @ X38 @ Z1)=>X38 @ Z0 @ Z1)))) @ X53 @ X52)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])])])).
% 0.20/0.50 thf(c_0_41, plain, ![X66:$i, X65:mu]:(((epred4_0 @ X65 @ X66)<=>![X64:mu > $i > $o]:(((positive @ X64 @ X66)=>(X64 @ X65 @ X66))))), introduced(definition)).
% 0.20/0.50 thf(c_0_42, plain, ![X16:$i]:((((positive @ epred3_0 @ X16))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_35]), c_0_36])).
% 0.20/0.50 thf(c_0_43, lemma, ![X48:$i, X51:mu > $i > $o]:(((rel @ X48 @ (esk1_1 @ X48))&(~(positive @ X51 @ (esk1_1 @ X48))|(X51 @ (esk2_1 @ X48) @ (esk1_1 @ X48))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])])])).
% 0.20/0.50 thf(c_0_44, plain, ((msymmetric)=(^[Z0/* 6 */:$i > $i > $o]:(![X17:$i, X18:$i]:(((Z0 @ X17 @ X18)=>(Z0 @ X18 @ X17)))))), inference(fof_simplification,[status(thm)],[msymmetric])).
% 0.20/0.50 thf(c_0_45, negated_conjecture, ![X1:mu]:(~((epred2_1 @ X1 @ X1 @ esk4_0))), inference(split_conjunct,[status(thm)],[c_0_33])).
% 0.20/0.50 thf(c_0_46, negated_conjecture, ![X1:mu, X2:mu]:(((epred2_1 @ X1 @ X2 @ esk4_0)|~((epred4_0 @ X2 @ esk4_0)))), inference(spm,[status(thm)],[c_0_38, c_0_39])).
% 0.20/0.50 thf(c_0_47, plain, ![X70:$i, X71:mu, X72:mu > $i > $o, X73:$i, X75:$i, X76:mu, X79:mu]:(((~(epred3_0 @ X71 @ X70)|(~(essence @ X72 @ X71 @ X70)|(~(rel @ X70 @ X73)|(X72 @ (esk5_4 @ X70 @ X71 @ X72 @ X73) @ X73))))&(((essence @ (epred5_2 @ X75 @ X76) @ X76 @ X75)|(epred3_0 @ X76 @ X75))&(((rel @ X75 @ (esk6_2 @ X75 @ X76))|(epred3_0 @ X76 @ X75))&(~(epred5_2 @ X75 @ X76 @ X79 @ (esk6_2 @ X75 @ X76))|(epred3_0 @ X76 @ X75)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[inference(fof_simplification,[status(thm)],[])])])])])])])])).
% 0.20/0.50 thf(c_0_48, lemma, ![X1:mu, X3:$i]:(((((essence @ epred4_0 @ X1 @ X3))=(($true)))|~((epred1_2 @ X3 @ X1 @ X1 @ X3)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_40]), c_0_41])).
% 0.20/0.50 thf(c_0_49, lemma, ![X1:mu, X3:$i]:(((positive @ (epred1_2 @ X3 @ X1) @ X3)|(((essence @ epred4_0 @ X1 @ X3))=(($true))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_40]), c_0_41])).
% 0.20/0.50 thf(c_0_50, plain, ![X3:$i]:((positive @ epred3_0 @ X3)), inference(cn,[status(thm)],[c_0_42])).
% 0.20/0.50 thf(c_0_51, plain, ![X1:mu, X3:$i]:(((epred4_0 @ X1 @ X3)|~((epred6_2 @ X3 @ X1 @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.20/0.50 thf(c_0_52, lemma, ![X6:mu > $i > $o, X3:$i]:(((X6 @ (esk2_1 @ X3) @ (esk1_1 @ X3))|~((positive @ X6 @ (esk1_1 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_43])).
% 0.20/0.50 thf(c_0_53, plain, ![X1:mu, X3:$i]:(((positive @ (epred6_2 @ X3 @ X1) @ X3)|(epred4_0 @ X1 @ X3))), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.20/0.50 thf(c_0_54, plain, ![X27:$i, X28:$i]:(((rel @ X27 @ X28)=>(rel @ X28 @ X27))), inference(apply_def,[status(thm)],[sym, c_0_44])).
% 0.20/0.50 thf(c_0_55, negated_conjecture, ![X1:mu]:(~((epred4_0 @ X1 @ esk4_0))), inference(spm,[status(thm)],[c_0_45, c_0_46])).
% 0.20/0.50 thf(c_0_56, plain, ![X1:mu, X3:$i, X6:mu > $i > $o, X16:$i]:(((X6 @ (esk5_4 @ X3 @ X1 @ X6 @ X16) @ X16)|~((epred3_0 @ X1 @ X3))|~((essence @ X6 @ X1 @ X3))|~((rel @ X3 @ X16)))), inference(split_conjunct,[status(thm)],[c_0_47])).
% 0.20/0.50 thf(c_0_57, lemma, ![X1:mu, X3:$i]:(((essence @ epred4_0 @ X1 @ X3)|~((epred1_2 @ X3 @ X1 @ X1 @ X3)))), inference(cn,[status(thm)],[c_0_48])).
% 0.20/0.50 thf(c_0_58, lemma, ![X1:mu, X3:$i]:(((positive @ (epred1_2 @ X3 @ X1) @ X3)|(essence @ epred4_0 @ X1 @ X3))), inference(cn,[status(thm)],[c_0_49])).
% 0.20/0.50 thf(c_0_59, plain, ![X1:mu, X3:$i]:(((epred3_0 @ X1 @ X3)|~((epred4_0 @ X1 @ X3)))), inference(spm,[status(thm)],[c_0_38, c_0_50])).
% 0.20/0.50 thf(c_0_60, plain, ![X3:$i]:((epred4_0 @ (esk2_1 @ X3) @ (esk1_1 @ X3))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_52]), c_0_53])).
% 0.20/0.50 thf(c_0_61, plain, ![X45:$i, X46:$i]:((~(rel @ X45 @ X46)|(rel @ X46 @ X45))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])])])).
% 0.20/0.50 thf(c_0_62, negated_conjecture, ![X1:mu, X3:$i]:((~((essence @ epred4_0 @ X1 @ X3))|~((rel @ X3 @ esk4_0))|~((epred3_0 @ X1 @ X3)))), inference(spm,[status(thm)],[c_0_55, c_0_56])).
% 0.20/0.50 thf(c_0_63, lemma, ![X3:$i]:((essence @ epred4_0 @ (esk2_1 @ X3) @ (esk1_1 @ X3))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57, c_0_52]), c_0_58])).
% 0.20/0.50 thf(c_0_64, plain, ![X3:$i]:((epred3_0 @ (esk2_1 @ X3) @ (esk1_1 @ X3))), inference(spm,[status(thm)],[c_0_59, c_0_60])).
% 0.20/0.50 thf(c_0_65, plain, ![X3:$i, X16:$i]:(((rel @ X16 @ X3)|~((rel @ X3 @ X16)))), inference(split_conjunct,[status(thm)],[c_0_61])).
% 0.20/0.50 thf(c_0_66, lemma, ![X3:$i]:((rel @ X3 @ (esk1_1 @ X3))), inference(split_conjunct,[status(thm)],[c_0_43])).
% 0.20/0.50 thf(c_0_67, lemma, ![X3:$i]:(~((rel @ (esk1_1 @ X3) @ esk4_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62, c_0_63]), c_0_64])])).
% 0.20/0.50 thf(c_0_68, lemma, ![X3:$i]:((rel @ (esk1_1 @ X3) @ X3)), inference(spm,[status(thm)],[c_0_65, c_0_66])).
% 0.20/0.50 thf(c_0_69, lemma, ($false), inference(spm,[status(thm)],[c_0_67, c_0_68]), ['proof']).
% 0.20/0.50 # SZS output end CNFRefutation
% 0.20/0.50 # Parsed axioms : 59
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 45
% 0.20/0.50 # Removed in clause preprocessing : 29
% 0.20/0.50 # Initial clauses in saturation : 16
% 0.20/0.50 # Processed clauses : 48
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 1
% 0.20/0.50 # ...remaining for further processing : 47
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 2
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 27
% 0.20/0.50 # ...of the previous two non-redundant : 22
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 2
% 0.20/0.50 # Paramodulations : 27
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 4
% 0.20/0.50 # ...of those cached : 1
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 29
% 0.20/0.50 # Positive orientable unit clauses : 9
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 3
% 0.20/0.50 # Non-unit-clauses : 17
% 0.20/0.50 # Current number of unprocessed clauses: 6
% 0.20/0.50 # ...number of literals in the above : 23
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 18
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 72
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 63
% 0.20/0.50 # Non-unit clause-clause subsumptions : 3
% 0.20/0.50 # Unit Clause-clause subsumption calls : 13
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 1
% 0.20/0.50 # BW rewrite match successes : 1
% 0.20/0.50 # Condensation attempts : 48
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 3419
% 0.20/0.50 # Search garbage collected termcells : 916
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.011 s
% 0.20/0.50 # System time : 0.000 s
% 0.20/0.50 # Total time : 0.011 s
% 0.20/0.50 # Maximum resident set size: 2092 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.013 s
% 0.20/0.50 # System time : 0.002 s
% 0.20/0.50 # Total time : 0.015 s
% 0.20/0.50 # Maximum resident set size: 1792 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------