TSTP Solution File: PHI003^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PHI003^1 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:04 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PHI003^1 : TPTP v8.2.0. Released v6.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.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:49:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.21/0.52 # Version: 3.1.0-ho
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.52 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.52 # Starting new_ho_12 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_2 with 300s (1) cores
% 0.21/0.52 # post_as_ho3 with pid 31981 completed with status 0
% 0.21/0.52 # Result found by post_as_ho3
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.52 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: HGHNS-FFMF33-SHSSMSBN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.52 # new_ho_10 with pid 31986 completed with status 0
% 0.21/0.52 # Result found by new_ho_10
% 0.21/0.52 # Preprocessing class: HSMSSMSSMLLNHSN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.52 # Starting post_as_ho3 with 300s (1) cores
% 0.21/0.52 # No SInE strategy applied
% 0.21/0.52 # Search class: HGHNS-FFMF33-SHSSMSBN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% 0.21/0.52 thf(decl_sort1, type, mu: $tType).
% 0.21/0.52 thf(decl_25, type, mnot: ($i > $o) > $i > $o).
% 0.21/0.52 thf(decl_27, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.52 thf(decl_28, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.52 thf(decl_30, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.52 thf(decl_32, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.21/0.52 thf(decl_33, type, mforall_indset: ((mu > $i > $o) > $i > $o) > $i > $o).
% 0.21/0.52 thf(decl_35, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.21/0.52 thf(decl_38, type, mbox_generic: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.21/0.52 thf(decl_39, type, mdia_generic: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.21/0.52 thf(decl_40, type, rel: $i > $i > $o).
% 0.21/0.52 thf(decl_41, type, mbox: ($i > $o) > $i > $o).
% 0.21/0.52 thf(decl_42, type, mdia: ($i > $o) > $i > $o).
% 0.21/0.52 thf(decl_43, type, mvalid: ($i > $o) > $o).
% 0.21/0.52 thf(decl_45, type, positive: (mu > $i > $o) > $i > $o).
% 0.21/0.52 thf(decl_46, type, god: mu > $i > $o).
% 0.21/0.52 thf(decl_49, type, esk1_3: $i > (mu > $i > $o) > (mu > $i > $o) > $i).
% 0.21/0.52 thf(decl_50, type, esk2_3: $i > (mu > $i > $o) > (mu > $i > $o) > mu).
% 0.21/0.52 thf(decl_51, type, esk3_0: $i).
% 0.21/0.52 thf(decl_52, type, epred1_2: $i > mu > mu > $i > $o).
% 0.21/0.52 thf(decl_53, type, epred2_1: (mu > $i > $o) > mu > $i > $o).
% 0.21/0.52 thf(decl_54, type, epred3_0: mu > $i > $o).
% 0.21/0.52 thf(decl_56, type, epred5_2: $i > mu > mu > $i > $o).
% 0.21/0.52 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/sandbox2/benchmark/Axioms/LCL016^0.ax', mdia_generic)).
% 0.21/0.52 thf(defD1, axiom, ((god)=(^[X1:mu]:(mforall_indset @ (^[X20:mu > $i > $o]:(mimplies @ (positive @ X20) @ (X20 @ X1)))))), file('/export/starexec/sandbox2/benchmark/Axioms/PHI001^0.ax', defD1)).
% 0.21/0.52 thf(mimplies, axiom, ((mimplies)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)=>(X5 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mimplies)).
% 0.21/0.52 thf(mforall_indset, axiom, ((mforall_indset)=(^[X7:(mu > $i > $o) > $i > $o, X3:$i]:(![X8:mu > $i > $o]:((X7 @ X8 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mforall_indset)).
% 0.21/0.52 thf(mexists_ind, axiom, ((mexists_ind)=(^[X11:mu > $i > $o, X3:$i]:(?[X1:mu]:((X11 @ X1 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mexists_ind)).
% 0.21/0.52 thf(mdia, axiom, ((mdia)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(?[X26:$i]:(((rel @ Z1 @ X26)&(Z0 @ X26)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mdia)).
% 0.21/0.52 thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mvalid)).
% 0.21/0.52 thf(corC, conjecture, (mvalid @ (mdia @ (mexists_ind @ (^[X1:mu]:(god @ X1))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', corC)).
% 0.21/0.52 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/sandbox2/benchmark/Axioms/LCL016^0.ax', mbox_generic)).
% 0.21/0.52 thf(mand, axiom, ((mand)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)&(X5 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mand)).
% 0.21/0.52 thf(mforall_ind, axiom, ((mforall_ind)=(^[X6:mu > $i > $o, X3:$i]:(![X1:mu]:((X6 @ X1 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mforall_ind)).
% 0.21/0.52 thf(mbox, axiom, ((mbox)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(![X25:$i]:((~((rel @ Z1 @ X25))|(Z0 @ X25)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mbox)).
% 0.21/0.52 thf(axA3, axiom, (mvalid @ (positive @ god)), file('/export/starexec/sandbox2/benchmark/Axioms/PHI001^0.ax', axA3)).
% 0.21/0.52 thf(mnot, axiom, ((mnot)=(^[X4:$i > $o, X3:$i]:(~((X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mnot)).
% 0.21/0.52 thf(mequiv, axiom, ((mequiv)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)<=>(X5 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mequiv)).
% 0.21/0.52 thf(axA2, axiom, (mvalid @ (mforall_indset @ (^[X18:mu > $i > $o]:(mforall_indset @ (^[X19:mu > $i > $o]:(mimplies @ (mand @ (positive @ X18) @ (mbox @ (mforall_ind @ (^[X1:mu]:(mimplies @ (X18 @ X1) @ (X19 @ X1)))))) @ (positive @ X19))))))), file('/export/starexec/sandbox2/benchmark/Axioms/PHI001^0.ax', axA2)).
% 0.21/0.52 thf(axA1, axiom, (mvalid @ (mforall_indset @ (^[X17:mu > $i > $o]:(mequiv @ (positive @ (^[X1:mu]:(mnot @ (X17 @ X1)))) @ (mnot @ (positive @ X17)))))), file('/export/starexec/sandbox2/benchmark/Axioms/PHI001^0.ax', axA1)).
% 0.21/0.52 thf(c_0_17, 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.21/0.52 thf(c_0_18, plain, ((god)=(^[Z0/* 19 */:mu, Z1:$i]:(![X27:mu > $i > $o]:((((positive @ X27 @ Z1)=>(X27 @ Z0 @ Z1))))))), inference(fof_simplification,[status(thm)],[defD1])).
% 0.21/0.52 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.21/0.52 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.21/0.52 thf(c_0_21, plain, ((mexists_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(?[X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mexists_ind])).
% 0.21/0.52 thf(c_0_22, axiom, ((mdia)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(?[X26:$i]:(((rel @ Z1 @ X26)&(Z0 @ X26)))))), inference(apply_def,[status(thm)],[mdia, c_0_17])).
% 0.21/0.52 thf(c_0_23, plain, ((mvalid)=(^[Z0/* 6 */:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
% 0.21/0.52 thf(c_0_24, plain, ((god)=(^[Z0/* 19 */:mu, Z1:$i]:(![X27:mu > $i > $o]:((((positive @ X27 @ Z1)=>(X27 @ Z0 @ Z1))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18, c_0_19]), c_0_20])).
% 0.21/0.52 thf(c_0_25, negated_conjecture, ~(![X59:$i]:(?[X58:$i]:(((rel @ X59 @ X58)&?[X57:mu]:(![X56:mu > $i > $o]:(((positive @ X56 @ X58)=>(X56 @ X57 @ X58)))))))), 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)],[corC])]), c_0_21]), c_0_22]), c_0_23]), c_0_24])).
% 0.21/0.52 thf(c_0_26, 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.21/0.52 thf(c_0_27, plain, ![X94:$i, X95:mu, X96:mu > $i > $o, X97:$i, X98:mu]:(((~(epred3_0 @ X95 @ X94)|(~(positive @ X96 @ X94)|(X96 @ X95 @ X94)))&(((positive @ (epred5_2 @ X97 @ X98) @ X97)|(epred3_0 @ X98 @ X97))&(~(epred5_2 @ X97 @ X98 @ X98 @ X97)|(epred3_0 @ X98 @ X97))))), 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.21/0.52 thf(c_0_28, negated_conjecture, ![X73:$i, X74:mu]:((((positive @ (epred1_2 @ X73 @ X74) @ X73)|~(rel @ esk3_0 @ X73))&(~(epred1_2 @ X73 @ X74 @ X74 @ X73)|~(rel @ esk3_0 @ X73)))), inference(distribute,[status(thm)],[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_25])])])])])])).
% 0.21/0.52 thf(c_0_29, plain, ((mand)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)&(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mand])).
% 0.21/0.52 thf(c_0_30, plain, ((mforall_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(![X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_ind])).
% 0.21/0.52 thf(c_0_31, axiom, ((mbox)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(![X25:$i]:((~((rel @ Z1 @ X25))|(Z0 @ X25)))))), inference(apply_def,[status(thm)],[mbox, c_0_26])).
% 0.21/0.52 thf(c_0_32, plain, ![X45:$i]:((positive @ (^[Z0/* 19 */:mu, Z1:$i]:(![X44:mu > $i > $o]:(((positive @ X44 @ Z1)=>X44 @ Z0 @ Z1)))) @ X45)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axA3, c_0_23]), c_0_24])).
% 0.21/0.52 thf(c_0_33, plain, ((mnot)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
% 0.21/0.52 thf(c_0_34, plain, ((mequiv)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)<=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mequiv])).
% 0.21/0.52 thf(c_0_35, plain, ![X1:mu, X6:mu > $i > $o, X3:$i]:(((X6 @ X1 @ X3)|~((epred3_0 @ X1 @ X3))|~((positive @ X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_27])).
% 0.21/0.52 thf(c_0_36, negated_conjecture, ![X1:mu, X3:$i]:(((positive @ (epred1_2 @ X3 @ X1) @ X3)|~((rel @ esk3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_28])).
% 0.21/0.52 thf(c_0_37, plain, ![X43:$i, X42:mu > $i > $o, X41:mu > $i > $o]:((((positive @ X42 @ X43)&![X40:$i]:((~(rel @ X43 @ X40)|![X39:mu]:(((X42 @ X39 @ X40)=>(X41 @ X39 @ X40))))))=>(positive @ X41 @ 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(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axA2]), c_0_29]), c_0_19]), c_0_30]), c_0_20]), c_0_31]), c_0_23])])).
% 0.21/0.52 thf(c_0_38, plain, ![X67:$i]:((positive @ (^[Z0/* 19 */:mu, Z1:$i]:(![X44:mu > $i > $o]:(((positive @ X44 @ Z1)=>X44 @ Z0 @ Z1)))) @ X67)), inference(variable_rename,[status(thm)],[c_0_32])).
% 0.21/0.52 thf(c_0_39, plain, ![X82:$i, X81:mu]:(((epred3_0 @ X81 @ X82)<=>![X80:mu > $i > $o]:(((positive @ X80 @ X82)=>(X80 @ X81 @ X82))))), introduced(definition)).
% 0.21/0.52 thf(c_0_40, plain, ![X38:$i, X37:mu > $i > $o]:(((positive @ (^[Z0/* 19 */:mu, Z1:$i]:(~(X37 @ Z0 @ Z1))) @ X38)<=>~(positive @ X37 @ X38))), 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)],[axA1]), c_0_33]), c_0_34]), c_0_20]), c_0_23])])).
% 0.21/0.52 thf(c_0_41, negated_conjecture, ![X1:mu, X3:$i]:((~((epred1_2 @ X3 @ X1 @ X1 @ X3))|~((rel @ esk3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_28])).
% 0.21/0.52 thf(c_0_42, negated_conjecture, ![X1:mu, X2:mu, X3:$i]:(((epred1_2 @ X3 @ X1 @ X2 @ X3)|~((rel @ esk3_0 @ X3))|~((epred3_0 @ X2 @ X3)))), inference(spm,[status(thm)],[c_0_35, c_0_36])).
% 0.21/0.52 thf(c_0_43, plain, ![X62:$i, X63:mu > $i > $o, X64:mu > $i > $o]:((((rel @ X62 @ (esk1_3 @ X62 @ X63 @ X64))|~(positive @ X63 @ X62)|(positive @ X64 @ X62))&(((X63 @ (esk2_3 @ X62 @ X63 @ X64) @ (esk1_3 @ X62 @ X63 @ X64))|~(positive @ X63 @ X62)|(positive @ X64 @ X62))&(~(X64 @ (esk2_3 @ X62 @ X63 @ X64) @ (esk1_3 @ X62 @ X63 @ X64))|~(positive @ X63 @ X62)|(positive @ X64 @ X62))))), 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_37])])])])])).
% 0.21/0.52 thf(c_0_44, plain, ![X3:$i]:((((positive @ epred3_0 @ X3))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_38]), c_0_39])).
% 0.21/0.52 thf(c_0_45, plain, ![X60:$i, X61:mu > $i > $o]:(((~(positive @ (^[Z0/* 19 */:mu, Z1:$i]:(~(X61 @ Z0 @ Z1))) @ X60)|~(positive @ X61 @ X60))&((positive @ X61 @ X60)|(positive @ (^[Z0/* 19 */:mu, Z1:$i]:(~(X61 @ Z0 @ Z1))) @ X60)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])])).
% 0.21/0.52 thf(c_0_46, plain, ![X77:$i, X76:mu, X6:mu > $i > $o]:(((epred2_1 @ X6 @ X76 @ X77)<=>~((X6 @ X76 @ X77)))), introduced(definition)).
% 0.21/0.52 thf(c_0_47, negated_conjecture, ![X1:mu, X3:$i]:((~((rel @ esk3_0 @ X3))|~((epred3_0 @ X1 @ X3)))), inference(spm,[status(thm)],[c_0_41, c_0_42])).
% 0.21/0.52 thf(c_0_48, plain, ![X8:mu > $i > $o, X6:mu > $i > $o, X3:$i]:(((X6 @ (esk2_3 @ X3 @ X6 @ X8) @ (esk1_3 @ X3 @ X6 @ X8))|(positive @ X8 @ X3)|~((positive @ X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_43])).
% 0.21/0.52 thf(c_0_49, plain, ![X3:$i]:((positive @ epred3_0 @ X3)), inference(cn,[status(thm)],[c_0_44])).
% 0.21/0.52 thf(c_0_50, plain, ![X6:mu > $i > $o, X3:$i]:((~((((positive @ (epred2_1 @ X6) @ X3))=(($true))))|~((positive @ X6 @ X3)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_45]), c_0_46])).
% 0.21/0.52 thf(c_0_51, negated_conjecture, ![X3:$i, X6:mu > $i > $o]:(((positive @ X6 @ X3)|~((rel @ esk3_0 @ (esk1_3 @ X3 @ epred3_0 @ X6))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_48]), c_0_49])])).
% 0.21/0.52 thf(c_0_52, plain, ![X8:mu > $i > $o, X6:mu > $i > $o, X3:$i]:(((rel @ X3 @ (esk1_3 @ X3 @ X6 @ X8))|(positive @ X8 @ X3)|~((positive @ X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_43])).
% 0.21/0.52 thf(c_0_53, plain, ![X6:mu > $i > $o, X3:$i]:((~((positive @ (epred2_1 @ X6) @ X3))|~((positive @ X6 @ X3)))), inference(cn,[status(thm)],[c_0_50])).
% 0.21/0.52 thf(c_0_54, negated_conjecture, ![X6:mu > $i > $o]:((positive @ X6 @ esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_52]), c_0_49])])).
% 0.21/0.52 thf(c_0_55, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53, c_0_54]), c_0_54])]), ['proof']).
% 0.21/0.52 # SZS output end CNFRefutation
% 0.21/0.52 # Parsed axioms : 59
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 51
% 0.21/0.52 # Removed in clause preprocessing : 28
% 0.21/0.52 # Initial clauses in saturation : 23
% 0.21/0.52 # Processed clauses : 58
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 58
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 1
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 42
% 0.21/0.52 # ...of the previous two non-redundant : 33
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 42
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 6
% 0.21/0.52 # ...of those cached : 2
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 34
% 0.21/0.52 # Positive orientable unit clauses : 3
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 0
% 0.21/0.52 # Non-unit-clauses : 31
% 0.21/0.52 # Current number of unprocessed clauses: 21
% 0.21/0.52 # ...number of literals in the above : 90
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 24
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 152
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 81
% 0.21/0.52 # Non-unit clause-clause subsumptions : 1
% 0.21/0.52 # Unit Clause-clause subsumption calls : 15
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 58
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 5659
% 0.21/0.52 # Search garbage collected termcells : 1622
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.011 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.014 s
% 0.21/0.52 # Maximum resident set size: 2216 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.014 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.019 s
% 0.21/0.52 # Maximum resident set size: 1792 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------