%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PHI006^4 : TPTP v9.3.1. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:20:08 AM UTC 2026
% Result : ContradictoryAxioms 0.20s 0.28s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI006^4 : TPTP v9.3.1. Released v6.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n009.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 13:19:45 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.24 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/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p
% 0.20/0.28 % Version: 3.5.1-ho
% 0.20/0.28 % Preprocessing class: HSMSSMSSMLLNHFN.
% 0.20/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.28 % Starting new_ho_11 with 1500s (5) cores
% 0.20/0.28 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.28 % Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.28 % Starting sh4l with 300s (1) cores
% 0.20/0.28 % new_ho_11 with pid 3964617 completed with status 0
% 0.20/0.28 % Result found by new_ho_11
% 0.20/0.28 % Preprocessing class: HSMSSMSSMLLNHFN.
% 0.20/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.28 % Starting new_ho_11 with 1500s (5) cores
% 0.20/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.28 % No SInE strategy applied
% 0.20/0.28 % Search class: HGHNS-FFSF33-SHFSMMBN
% 0.20/0.28 % partial match(3): HGHNS-FFMF33-SHSSMSBN
% 0.20/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.28 % Starting new_ho_11 with 151s (1) cores
% 0.20/0.28 % Starting lpo8_s with 136s (1) cores
% 0.20/0.28 % Starting lpo6_lambda_fix with 136s (1) cores
% 0.20/0.28 % Starting sh2lt with 136s (1) cores
% 0.20/0.28 % sh2lt with pid 3964628 completed with status 0
% 0.20/0.28 % Result found by sh2lt
% 0.20/0.28 % Preprocessing class: HSMSSMSSMLLNHFN.
% 0.20/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.28 % Starting new_ho_11 with 1500s (5) cores
% 0.20/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.28 % No SInE strategy applied
% 0.20/0.28 % Search class: HGHNS-FFSF33-SHFSMMBN
% 0.20/0.28 % partial match(3): HGHNS-FFMF33-SHSSMSBN
% 0.20/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.28 % Starting new_ho_11 with 151s (1) cores
% 0.20/0.28 % Starting lpo8_s with 136s (1) cores
% 0.20/0.28 % Starting lpo6_lambda_fix with 136s (1) cores
% 0.20/0.28 % Starting sh2lt with 136s (1) cores
% 0.20/0.28 % Preprocessing time : 0.002 s
% 0.20/0.28 % Presaturation interreduction done
% 0.20/0.28
% 0.20/0.28 % Proof found!
% 0.20/0.28 % SZS status ContradictoryAxioms
% 0.20/0.28 % SZS output start CNFRefutation
% 0.20/0.28 thf(decl_sort1, type, mu: $tType).
% 0.20/0.28 thf(decl_26, type, mnot: ($i > $o) > $i > $o).
% 0.20/0.28 thf(decl_28, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.28 thf(decl_29, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.28 thf(decl_33, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.20/0.28 thf(decl_34, type, mforall_indset: ((mu > $i > $o) > $i > $o) > $i > $o).
% 0.20/0.28 thf(decl_36, type, mexists_ind: (mu > $i > $o) > $i > $o).
% 0.20/0.28 thf(decl_39, type, mbox: ($i > $o) > $i > $o).
% 0.20/0.28 thf(decl_41, type, mvalid: ($i > $o) > $o).
% 0.20/0.28 thf(decl_43, type, positive: (mu > $i > $o) > $i > $o).
% 0.20/0.28 thf(decl_45, type, essence: (mu > $i > $o) > mu > $i > $o).
% 0.20/0.28 thf(decl_46, type, necessary_existence: mu > $i > $o).
% 0.20/0.28 thf(decl_47, type, esk1_3: $i > (mu > $i > $o) > (mu > $i > $o) > $i).
% 0.20/0.28 thf(decl_48, type, esk2_3: $i > (mu > $i > $o) > (mu > $i > $o) > mu).
% 0.20/0.28 thf(decl_49, type, epred1_1: (mu > $i > $o) > mu > $i > $o).
% 0.20/0.28 thf(decl_51, type, epred3_0: mu > $i > $o).
% 0.20/0.28 thf(decl_53, type, epred5_3: $i > mu > (mu > $i > $o) > mu > $i > $o).
% 0.20/0.28 thf(decl_54, type, esk3_3: $i > mu > (mu > $i > $o) > $i).
% 0.20/0.28 thf(decl_55, type, esk4_3: $i > mu > (mu > $i > $o) > mu).
% 0.20/0.28 thf(decl_56, type, esk5_4: $i > mu > (mu > $i > $o) > $i > mu).
% 0.20/0.28 thf(decl_57, type, epred6_2: $i > mu > mu > $i > $o).
% 0.20/0.28 thf(decl_58, type, esk6_2: $i > mu > $i).
% 0.20/0.28 thf(decl_101, type, esk49_0: mu).
% 0.20/0.28 thf(decl_102, type, esk50_0: $i).
% 0.20/0.28 thf(defD2, axiom, ((essence)=(^[X22:mu > $i > $o, X1:mu]:(mforall_indset @ (^[X23:mu > $i > $o]:(mimplies @ (X23 @ X1) @ (mbox @ (mforall_ind @ (^[X2:mu]:(mimplies @ (X22 @ X2) @ (X23 @ X2)))))))))), file('/export/starexec/sandbox2/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', defD2)).
% 0.20/0.28 thf(mimplies, axiom, ((mimplies)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:((((X4 @ X3))=>((X5 @ X3)))))), file('/export/starexec/sandbox2/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', mimplies)).
% 0.20/0.28 thf(mforall_ind, axiom, ((mforall_ind)=(^[X6:mu > $i > $o, X3:$i]:(![X1:mu]:((X6 @ X1 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', mforall_ind)).
% 0.20/0.28 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/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', mforall_indset)).
% 0.20/0.28 thf(mbox, axiom, ((mbox)=(^[X4:$i > $o, X3:$i]:(![X15:$i]:((X4 @ X15))))), file('/export/starexec/sandbox2/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', mbox)).
% 0.20/0.28 thf(defD3, axiom, ((necessary_existence)=(^[X1:mu]:(mforall_indset @ (^[X24:mu > $i > $o]:(mimplies @ (essence @ X24 @ X1) @ (mbox @ (mexists_ind @ (^[X2:mu]:(X24 @ X2))))))))), file('/export/starexec/sandbox2/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', defD3)).
% 0.20/0.28 thf(mexists_ind, axiom, ((mexists_ind)=(^[X11:mu > $i > $o, X3:$i]:(?[X1:mu]:((X11 @ X1 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', mexists_ind)).
% 0.20/0.28 thf(mnot, axiom, ((mnot)=(^[X4:$i > $o, X3:$i]:(~((X4 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', mnot)).
% 0.20/0.28 thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', mvalid)).
% 0.20/0.28 thf(mand, axiom, ((mand)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:((((X4 @ X3))&((X5 @ X3)))))), file('/export/starexec/sandbox2/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', mand)).
% 0.20/0.28 thf(axA1a, axiom, (mvalid @ (mforall_indset @ (^[X16:mu > $i > $o]:(mimplies @ (positive @ (^[X1:mu]:(mnot @ (X16 @ X1)))) @ (mnot @ (positive @ X16)))))), file('/export/starexec/sandbox2/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', axA1a)).
% 0.20/0.28 thf(axA5, axiom, (mvalid @ (positive @ necessary_existence)), file('/export/starexec/sandbox2/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', axA5)).
% 0.20/0.28 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/tmp/tmp.YLz6dvZQKS/E---3.1_3964604.p', axA2)).
% 0.20/0.28 thf(c_0_13, plain, ((essence)=(^[Z0:mu > $i > $o, Z1:mu, Z2:$i]:(![X28:mu > $i > $o]:(((((X28 @ Z1 @ Z2))=>((![X27:$i]:((![X26:mu]:(((((Z0 @ X26 @ X27))=>((X28 @ X26 @ X27))))))))))))))), inference(fof_simplification,[status(thm)],[defD2])).
% 0.20/0.28 thf(c_0_14, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:((((Z0 @ Z2))=>((Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[mimplies])).
% 0.20/0.28 thf(c_0_15, plain, ((mforall_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(![X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_ind])).
% 0.20/0.28 thf(c_0_16, plain, ((mforall_indset)=(^[Z0:(mu > $i > $o) > $i > $o, Z1:$i]:(![X8:mu > $i > $o]:((Z0 @ X8 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_indset])).
% 0.20/0.28 thf(c_0_17, plain, ((mbox)=(^[Z0:$i > $o, Z1:$i]:(![X15:$i]:((Z0 @ X15))))), inference(fof_simplification,[status(thm)],[mbox])).
% 0.20/0.28 thf(c_0_18, plain, ((necessary_existence)=(^[Z0:mu, Z1:$i]:(![X34:mu > $i > $o]:(((((![X29:mu > $i > $o]:(((((X29 @ Z0 @ Z1))=>((![X30:$i]:((![X31:mu]:(((((X34 @ X31 @ X30))=>((X29 @ X31 @ X30))))))))))))))=>((![X33:$i]:((?[X32:mu]:((X34 @ X32 @ X33)))))))))))), inference(fof_simplification,[status(thm)],[defD3])).
% 0.20/0.28 thf(c_0_19, plain, ((mexists_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(?[X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mexists_ind])).
% 0.20/0.28 thf(c_0_20, plain, ((essence)=(^[Z0:mu > $i > $o, Z1:mu, Z2:$i]:(![X28:mu > $i > $o]:(((((X28 @ Z1 @ Z2))=>((![X27:$i]:((![X26:mu]:(((((Z0 @ X26 @ X27))=>((X28 @ X26 @ X27))))))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_13, c_0_14]), c_0_15]), c_0_16]), c_0_17])).
% 0.20/0.28 thf(c_0_21, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
% 0.20/0.28 thf(c_0_22, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
% 0.20/0.28 thf(c_0_23, plain, ((necessary_existence)=(^[Z0:mu, Z1:$i]:(![X34:mu > $i > $o]:(((((![X29:mu > $i > $o]:(((((X29 @ Z0 @ Z1))=>((![X30:$i]:((![X31:mu]:(((((X34 @ X31 @ X30))=>((X29 @ X31 @ X30))))))))))))))=>((![X33:$i]:((?[X32:mu]:((X34 @ X32 @ X33)))))))))))), 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)],[c_0_18, c_0_14]), c_0_16]), c_0_19]), c_0_17]), c_0_20])).
% 0.20/0.28 thf(c_0_24, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:((((Z0 @ Z2))&((Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[mand])).
% 0.20/0.28 thf(c_0_25, plain, ![X36:$i, X35:mu > $i > $o]:(((positive @ (^[Z0:mu, Z1:$i]:(~(X35 @ Z0 @ Z1))) @ X36)=>~(positive @ X35 @ X36))), 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)],[axA1a]), c_0_21]), c_0_14]), c_0_16]), c_0_22])])).
% 0.20/0.28 thf(c_0_26, plain, ![X55:$i]:((positive @ (^[Z0:mu, Z1:$i]:(![X49:mu > $i > $o]:(((![X50:mu > $i > $o]:(((X50 @ Z0 @ Z1)=>(![X51:$i, X52:mu]:(((X49 @ X52 @ X51)=>(X50 @ X52 @ X51)))))))=>(![X53:$i]:(?[X54:mu]:(X49 @ X54 @ X53))))))) @ X55)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axA5, c_0_22]), c_0_23])).
% 0.20/0.28 thf(c_0_27, plain, ![X43:$i, X42:mu > $i > $o, X41:mu > $i > $o]:((((positive @ X42 @ X43)&![X40:$i, X39:mu]:(((X42 @ X39 @ X40)=>(X41 @ X39 @ X40))))=>(positive @ X41 @ X43))), 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_24]), c_0_14]), c_0_15]), c_0_16]), c_0_17]), c_0_22])).
% 0.20/0.28 thf(c_0_28, plain, ![X56:$i, X57:mu > $i > $o]:((~(positive @ (^[Z0:mu, Z1:$i]:(~(X57 @ Z0 @ Z1))) @ X56)|~(positive @ X57 @ X56))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])).
% 0.20/0.28 thf(c_0_29, plain, ![X71:$i, X70:mu, X6:mu > $i > $o]:(((epred1_1 @ X6 @ X70 @ X71)<=>~((X6 @ X70 @ X71)))), introduced(definition)).
% 0.20/0.28 thf(c_0_30, plain, ![X69:$i]:((positive @ (^[Z0:mu, Z1:$i]:(![X49:mu > $i > $o]:(((![X50:mu > $i > $o]:(((X50 @ Z0 @ Z1)=>(![X51:$i, X52:mu]:(((X49 @ X52 @ X51)=>(X50 @ X52 @ X51)))))))=>(![X53:$i]:(?[X54:mu]:(X49 @ X54 @ X53))))))) @ X69)), inference(variable_rename,[status(thm)],[c_0_26])).
% 0.20/0.28 thf(c_0_31, plain, ![X84:$i, X83:mu]:(((epred3_0 @ X83 @ X84)<=>![X77:mu > $i > $o]:((![X78:mu > $i > $o]:(((X78 @ X83 @ X84)=>![X79:$i, X80:mu]:(((X77 @ X80 @ X79)=>(X78 @ X80 @ X79)))))=>![X81:$i]:(?[X82:mu]:((X77 @ X82 @ X81))))))), introduced(definition)).
% 0.20/0.28 thf(c_0_32, plain, ![X60:$i, X61:mu > $i > $o, X62:mu > $i > $o]:((((X61 @ (esk2_3 @ X60 @ X61 @ X62) @ (esk1_3 @ X60 @ X61 @ X62))|~(positive @ X61 @ X60)|(positive @ X62 @ X60))&(~(X62 @ (esk2_3 @ X60 @ X61 @ X62) @ (esk1_3 @ X60 @ X61 @ X62))|~(positive @ X61 @ X60)|(positive @ X62 @ X60)))), 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_27])])])])])).
% 0.20/0.28 thf(c_0_33, plain, ![X6:mu > $i > $o, X3:$i]:((~((((positive @ (epred1_1 @ X6) @ X3))=(($true))))|~((positive @ X6 @ X3)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_28]), c_0_29])).
% 0.20/0.28 thf(c_0_34, plain, ![X27:$i]:((((positive @ epred3_0 @ X27))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_30]), c_0_31])).
% 0.20/0.28 thf(c_0_35, plain, ![X8:mu > $i > $o, X6:mu > $i > $o, X3:$i]:(((positive @ X6 @ X3)|~((X6 @ (esk2_3 @ X3 @ X8 @ X6) @ (esk1_3 @ X3 @ X8 @ X6)))|~((positive @ X8 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.20/0.28 thf(c_0_36, plain, ![X6:mu > $i > $o, X3:$i]:((~((positive @ (epred1_1 @ X6) @ X3))|~((positive @ X6 @ X3)))), inference(cn,[status(thm)],[c_0_33])).
% 0.20/0.28 thf(c_0_37, plain, ![X3:$i]:((positive @ epred3_0 @ X3)), inference(cn,[status(thm)],[c_0_34])).
% 0.20/0.28 thf(c_0_38, plain, ![X6:mu > $i > $o, X3:$i]:(((positive @ (^[Z0:mu, Z1:$i]:(($true))) @ X3)|~((positive @ X6 @ X3)))), inference(primitive_enumeration,[status(thm)],[c_0_35])).
% 0.20/0.28 thf(c_0_39, plain, ![X6:mu > $i > $o, X3:$i]:((((epred1_1 @ X6)!=(epred3_0))|~((positive @ X6 @ X3)))), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_36, c_0_37])])).
% 0.20/0.28 thf(c_0_40, plain, ![X3:$i]:((positive @ (^[Z0:mu, Z1:$i]:(($true))) @ X3)), inference(spm,[status(thm)],[c_0_38, c_0_37])).
% 0.20/0.28 thf(c_0_41, plain, ![X85:$i, X86:mu, X87:mu > $i > $o]:(((~(epred1_1 @ X87 @ X86 @ X85)|~(X87 @ X86 @ X85))&((X87 @ X86 @ X85)|(epred1_1 @ X87 @ X86 @ X85)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.20/0.28 thf(c_0_42, plain, ((epred1_1 @ (^[Z0:mu, Z1:$i]:(($true))))!=(epred3_0)), inference(spm,[status(thm)],[c_0_39, c_0_40])).
% 0.20/0.28 thf(c_0_43, plain, ![X1:mu, X6:mu > $i > $o, X3:$i]:((~((epred1_1 @ X6 @ X1 @ X3))|~((X6 @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_41])).
% 0.20/0.28 thf(c_0_44, plain, ![X94:$i, X95:mu, X96:mu > $i > $o, X100:$i, X103:mu > $i > $o, X104:$i, X105:mu, X107:mu]:(((((epred5_3 @ X94 @ X95 @ X96 @ X95 @ X94)|(X96 @ (esk5_4 @ X94 @ X95 @ X96 @ X100) @ X100)|~(epred3_0 @ X95 @ X94))&(((X96 @ (esk4_3 @ X94 @ X95 @ X96) @ (esk3_3 @ X94 @ X95 @ X96))|(X96 @ (esk5_4 @ X94 @ X95 @ X96 @ X100) @ X100)|~(epred3_0 @ X95 @ X94))&(~(epred5_3 @ X94 @ X95 @ X96 @ (esk4_3 @ X94 @ X95 @ X96) @ (esk3_3 @ X94 @ X95 @ X96))|(X96 @ (esk5_4 @ X94 @ X95 @ X96 @ X100) @ X100)|~(epred3_0 @ X95 @ X94))))&((~(X103 @ X95 @ X94)|(~(epred6_2 @ X94 @ X95 @ X105 @ X104)|(X103 @ X105 @ X104))|(epred3_0 @ X95 @ X94))&(~(epred6_2 @ X94 @ X95 @ X107 @ (esk6_2 @ X94 @ X95))|(epred3_0 @ X95 @ X94))))), 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)],[])])])])])])).
% 0.20/0.28 thf(c_0_45, plain, ((epred1_1 @ (^[Z0:mu, Z1:$i]:(($true))) @ esk49_0 @ esk50_0)<~>(epred3_0 @ esk49_0 @ esk50_0)), inference(neg_ext,[status(thm)],[c_0_42])).
% 0.20/0.28 thf(c_0_46, plain, ![X1:mu, X3:$i]:(~((epred1_1 @ (^[Z0:mu, Z1:$i]:(($true))) @ X1 @ X3))), inference(primitive_enumeration,[status(thm)],[c_0_43])).
% 0.20/0.28 thf(c_0_47, plain, ![X1:mu, X15:$i, X6:mu > $i > $o, X3:$i]:(((X6 @ (esk4_3 @ X3 @ X1 @ X6) @ (esk3_3 @ X3 @ X1 @ X6))|(X6 @ (esk5_4 @ X3 @ X1 @ X6 @ X15) @ X15)|~((epred3_0 @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_44])).
% 0.20/0.28 thf(c_0_48, plain, (epred3_0 @ esk49_0 @ esk50_0), inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_45]), c_0_46])).
% 0.20/0.28 thf(c_0_49, plain, ![X1:mu, X3:$i]:(~((epred3_0 @ X1 @ X3))), inference(primitive_enumeration,[status(thm)],[c_0_47])).
% 0.20/0.28 thf(c_0_50, plain, ($false), inference(sr,[status(thm)],[c_0_48, c_0_49]), ['proof']).
% 0.20/0.28 % SZS output end CNFRefutation
% 0.20/0.28 % Parsed axioms : 55
% 0.20/0.28 % Removed by relevancy pruning/SinE : 0
% 0.20/0.28 % Initial clauses : 43
% 0.20/0.28 % Removed in clause preprocessing : 26
% 0.20/0.28 % Initial clauses in saturation : 17
% 0.20/0.28 % Processed clauses : 167
% 0.20/0.28 % ...of these trivial : 0
% 0.20/0.28 % ...subsumed : 26
% 0.20/0.28 % ...remaining for further processing : 141
% 0.20/0.28 % Other redundant clauses eliminated : 3
% 0.20/0.28 % Clauses deleted for lack of memory : 0
% 0.20/0.28 % Backward-subsumed : 21
% 0.20/0.28 % Backward-rewritten : 1
% 0.20/0.28 % Generated clauses : 294
% 0.20/0.28 % ...of the previous two non-redundant : 257
% 0.20/0.28 % ...aggressively subsumed : 0
% 0.20/0.28 % Contextual simplify-reflections : 0
% 0.20/0.28 % Paramodulations : 136
% 0.20/0.28 % Factorizations : 0
% 0.20/0.28 % NegExts : 86
% 0.20/0.28 % Equation resolutions : 3
% 0.20/0.28 % Disequality decompositions : 0
% 0.20/0.28 % Total rewrite steps : 8
% 0.20/0.28 % ...of those cached : 2
% 0.20/0.28 % Propositional unsat checks : 0
% 0.20/0.28 % Propositional check models : 0
% 0.20/0.28 % Propositional check unsatisfiable : 0
% 0.20/0.28 % Propositional clauses : 0
% 0.20/0.28 % Propositional clauses after purity: 0
% 0.20/0.28 % Propositional unsat core size : 0
% 0.20/0.28 % Propositional preprocessing time : 0.000
% 0.20/0.28 % Propositional encoding time : 0.000
% 0.20/0.28 % Propositional solver time : 0.000
% 0.20/0.28 % Success case prop preproc time : 0.000
% 0.20/0.28 % Success case prop encoding time : 0.000
% 0.20/0.28 % Success case prop solver time : 0.000
% 0.20/0.28 % Current number of processed clauses : 78
% 0.20/0.28 % Positive orientable unit clauses : 5
% 0.20/0.28 % Positive unorientable unit clauses: 0
% 0.20/0.28 % Negative unit clauses : 20
% 0.20/0.28 % Non-unit-clauses : 53
% 0.20/0.28 % Current number of unprocessed clauses: 121
% 0.20/0.28 % ...number of literals in the above : 273
% 0.20/0.28 % Current number of archived formulas : 0
% 0.20/0.28 % Current number of archived clauses : 63
% 0.20/0.28 % Clause-clause subsumption calls (NU) : 472
% 0.20/0.28 % Rec. Clause-clause subsumption calls : 373
% 0.20/0.28 % Non-unit clause-clause subsumptions : 30
% 0.20/0.28 % Unit Clause-clause subsumption calls : 175
% 0.20/0.28 % Rewrite failures with RHS unbound : 0
% 0.20/0.28 % BW rewrite match attempts : 2
% 0.20/0.28 % BW rewrite match successes : 1
% 0.20/0.28 % Condensation attempts : 0
% 0.20/0.28 % Condensation successes : 0
% 0.20/0.28 % Termbank termtop insertions : 11569
% 0.20/0.28 % Search garbage collected termcells : 1270
% 0.20/0.28
% 0.20/0.28 % -------------------------------------------------
% 0.20/0.28 % User time : 0.017 s
% 0.20/0.28 % System time : 0.005 s
% 0.20/0.28 % Total time : 0.022 s
% 0.20/0.28 % Maximum resident set size: 3944 pages
% 0.20/0.28
% 0.20/0.28 % -------------------------------------------------
% 0.20/0.28 % User time : 0.077 s
% 0.20/0.28 % System time : 0.020 s
% 0.20/0.28 % Total time : 0.097 s
% 0.20/0.28 % Maximum resident set size: 4864 pages
% 0.20/0.28 % E exiting
%------------------------------------------------------------------------------