%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PHI004^1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:07 AM UTC 2026
% Result : Theorem 0.21s 0.27s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI004^1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n001.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 13:23:20 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.24 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/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p
% 0.21/0.27 % Version: 3.5.1-ho
% 0.21/0.27 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.27 % Starting post_as_ho3 with 300s (1) cores
% 0.21/0.27 % Starting new_ho_12 with 300s (1) cores
% 0.21/0.27 % Starting new_bool_2 with 300s (1) cores
% 0.21/0.27 % new_ho_10_cnf2 with pid 1222385 completed with status 0
% 0.21/0.27 % Result found by new_ho_10_cnf2
% 0.21/0.27 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27 % No SInE strategy applied
% 0.21/0.27 % Search class: HGHNS-FFMF33-SHSSMSBN
% 0.21/0.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.27 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.27 % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.21/0.27 % Starting lpo8_s with 136s (1) cores
% 0.21/0.27 % Starting lpo6_lambda_fix with 136s (1) cores
% 0.21/0.27 % Starting sh2lt with 136s (1) cores
% 0.21/0.27 % SubtermCWHack with pid 1222390 completed with status 0
% 0.21/0.27 % Result found by SubtermCWHack
% 0.21/0.27 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.21/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27 % No SInE strategy applied
% 0.21/0.27 % Search class: HGHNS-FFMF33-SHSSMSBN
% 0.21/0.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.27 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.27 % Preprocessing time : 0.002 s
% 0.21/0.27
% 0.21/0.27 % Proof found!
% 0.21/0.27 % SZS status Theorem
% 0.21/0.27 % SZS output start CNFRefutation
% 0.21/0.27 thf(decl_sort1, type, mu: $tType).
% 0.21/0.27 thf(decl_26, type, mnot: ($i > $o) > $i > $o).
% 0.21/0.27 thf(decl_28, type, mand: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.27 thf(decl_29, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.27 thf(decl_31, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
% 0.21/0.27 thf(decl_33, type, mforall_ind: (mu > $i > $o) > $i > $o).
% 0.21/0.27 thf(decl_34, type, mforall_indset: ((mu > $i > $o) > $i > $o) > $i > $o).
% 0.21/0.27 thf(decl_39, type, mbox_generic: ($i > $i > $o) > ($i > $o) > $i > $o).
% 0.21/0.27 thf(decl_41, type, rel: $i > $i > $o).
% 0.21/0.27 thf(decl_42, type, mbox: ($i > $o) > $i > $o).
% 0.21/0.27 thf(decl_44, type, mvalid: ($i > $o) > $o).
% 0.21/0.27 thf(decl_46, type, positive: (mu > $i > $o) > $i > $o).
% 0.21/0.27 thf(decl_47, type, god: mu > $i > $o).
% 0.21/0.27 thf(decl_48, type, essence: (mu > $i > $o) > mu > $i > $o).
% 0.21/0.27 thf(decl_52, type, esk3_0: $i).
% 0.21/0.27 thf(decl_53, type, esk4_0: mu).
% 0.21/0.27 thf(decl_54, type, epred1_0: mu > $i > $o).
% 0.21/0.27 thf(decl_55, type, epred2_0: mu > $i > $o).
% 0.21/0.27 thf(decl_56, type, esk5_0: $i).
% 0.21/0.27 thf(decl_57, type, esk6_0: mu).
% 0.21/0.27 thf(decl_58, type, epred3_1: (mu > $i > $o) > mu > $i > $o).
% 0.21/0.27 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/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', mbox_generic)).
% 0.21/0.27 thf(defD1, axiom, ((god)=(^[X1:mu]:(mforall_indset @ (^[X20:mu > $i > $o]:(mimplies @ (positive @ X20) @ (X20 @ X1)))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', defD1)).
% 0.21/0.27 thf(mimplies, axiom, ((mimplies)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:((((X4 @ X3))=>((X5 @ X3)))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', mimplies)).
% 0.21/0.27 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/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', mforall_indset)).
% 0.21/0.27 thf(defD2, axiom, ((essence)=(^[X22:mu > $i > $o, X1:mu]:(mand @ (X22 @ X1) @ (mforall_indset @ (^[X23:mu > $i > $o]:(mimplies @ (X23 @ X1) @ (mbox @ (mforall_ind @ (^[X2:mu]:(mimplies @ (X22 @ X2) @ (X23 @ X2))))))))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', defD2)).
% 0.21/0.27 thf(mand, axiom, ((mand)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:((((X4 @ X3))&((X5 @ X3)))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', mand)).
% 0.21/0.27 thf(mforall_ind, axiom, ((mforall_ind)=(^[X6:mu > $i > $o, X3:$i]:(![X1:mu]:((X6 @ X1 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', mforall_ind)).
% 0.21/0.27 thf(mbox, axiom, ((mbox)=(^[Z0:$i > $o, Z1:$i]:(![X25:$i]:(((~((rel @ Z1 @ X25)))|((Z0 @ X25))))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', mbox)).
% 0.21/0.27 thf(mnot, axiom, ((mnot)=(^[X4:$i > $o, X3:$i]:(~((X4 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', mnot)).
% 0.21/0.27 thf(mequiv, axiom, ((mequiv)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:((((X4 @ X3))<=>((X5 @ X3)))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', mequiv)).
% 0.21/0.27 thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', mvalid)).
% 0.21/0.27 thf(thmT2, conjecture, (mvalid @ (mforall_ind @ (^[X1:mu]:(mimplies @ (god @ X1) @ (essence @ god @ X1))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', thmT2)).
% 0.21/0.27 thf(axA1, axiom, (mvalid @ (mforall_indset @ (^[X17:mu > $i > $o]:(mequiv @ (positive @ (^[X1:mu]:(mnot @ (X17 @ X1)))) @ (mnot @ (positive @ X17)))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', axA1)).
% 0.21/0.27 thf(axA4, axiom, (mvalid @ (mforall_indset @ (^[X21:mu > $i > $o]:(mimplies @ (positive @ X21) @ (mbox @ (positive @ X21)))))), file('/export/starexec/sandbox/tmp/tmp.DLWdsBsJzm/E---3.1_1222349.p', axA4)).
% 0.21/0.27 thf(c_0_14, plain, ((mbox_generic)=(^[Z0:$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.27 thf(c_0_15, plain, ((god)=(^[Z0:mu, Z1:$i]:(![X27:mu > $i > $o]:(((((positive @ X27 @ Z1))=>((X27 @ Z0 @ Z1)))))))), inference(fof_simplification,[status(thm)],[defD1])).
% 0.21/0.27 thf(c_0_16, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:((((Z0 @ Z2))=>((Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[mimplies])).
% 0.21/0.27 thf(c_0_17, 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.21/0.27 thf(c_0_18, plain, ((essence)=(^[Z0:mu > $i > $o, Z1:mu, Z2:$i]:((((Z0 @ Z1 @ Z2))&((![X30:mu > $i > $o]:(((((X30 @ Z1 @ Z2))=>((![X29:$i]:(((~((rel @ Z2 @ X29)))|((![X28:mu]:(((((Z0 @ X28 @ X29))=>((X30 @ X28 @ X29)))))))))))))))))))), inference(fof_simplification,[status(thm)],[defD2])).
% 0.21/0.27 thf(c_0_19, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:((((Z0 @ Z2))&((Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[mand])).
% 0.21/0.27 thf(c_0_20, plain, ((mforall_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(![X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_ind])).
% 0.21/0.27 thf(c_0_21, axiom, ((mbox)=(^[Z0:$i > $o, Z1:$i]:(![X25:$i]:(((~((rel @ Z1 @ X25)))|((Z0 @ X25))))))), inference(apply_def,[status(thm)],[mbox, c_0_14])).
% 0.21/0.27 thf(c_0_22, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
% 0.21/0.27 thf(c_0_23, plain, ((mequiv)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:((((Z0 @ Z2))<=>((Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[mequiv])).
% 0.21/0.27 thf(c_0_24, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
% 0.21/0.27 thf(c_0_25, negated_conjecture, ~((mvalid @ (mforall_ind @ (^[X1:mu]:(mimplies @ (god @ X1) @ (essence @ god @ X1)))))), inference(assume_negation,[status(cth)],[thmT2])).
% 0.21/0.27 thf(c_0_26, plain, ((god)=(^[Z0: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_15, c_0_16]), c_0_17])).
% 0.21/0.27 thf(c_0_27, plain, ((essence)=(^[Z0:mu > $i > $o, Z1:mu, Z2:$i]:((((Z0 @ Z1 @ Z2))&((![X30:mu > $i > $o]:(((((X30 @ Z1 @ Z2))=>((![X29:$i]:(((~((rel @ Z2 @ X29)))|((![X28:mu]:(((((Z0 @ X28 @ X29))=>((X30 @ X28 @ X29)))))))))))))))))))), 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_19]), c_0_16]), c_0_20]), c_0_17]), c_0_21])).
% 0.21/0.27 thf(c_0_28, plain, ![X38:$i, X37:mu > $i > $o]:(((positive @ (^[Z0: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_22]), c_0_23]), c_0_17]), c_0_24])])).
% 0.21/0.27 thf(c_0_29, negated_conjecture, ~(![X62:$i, X61:mu]:((![X56:mu > $i > $o]:(((positive @ X56 @ X62)=>(X56 @ X61 @ X62)))=>(![X57:mu > $i > $o]:(((positive @ X57 @ X62)=>(X57 @ X61 @ X62)))&![X58:mu > $i > $o]:(((X58 @ X61 @ X62)=>![X59:$i]:((~(rel @ X62 @ X59)|![X60:mu]:((![X57:mu > $i > $o]:(((positive @ X57 @ X59)=>(X57 @ X60 @ X59)))=>(X58 @ X60 @ X59))))))))))), 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(fof_simplification,[status(thm)],[c_0_25]), c_0_16]), c_0_20]), c_0_24]), c_0_26]), c_0_27])])).
% 0.21/0.27 thf(c_0_30, plain, ![X63:$i, X64:mu > $i > $o]:(((~(positive @ (^[Z0:mu, Z1:$i]:(~(X64 @ Z0 @ Z1))) @ X63)|~(positive @ X64 @ X63))&((positive @ X64 @ X63)|(positive @ (^[Z0:mu, Z1:$i]:(~(X64 @ Z0 @ Z1))) @ X63)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])).
% 0.21/0.27 thf(c_0_31, plain, ![X84:$i, X83:mu, X6:mu > $i > $o]:(((epred3_1 @ X6 @ X83 @ X84)<=>~((X6 @ X83 @ X84)))), introduced(definition)).
% 0.21/0.27 thf(c_0_32, negated_conjecture, ![X77:mu > $i > $o, X82:mu > $i > $o]:(((~(positive @ X77 @ esk3_0)|(X77 @ esk4_0 @ esk3_0))&((((epred2_0 @ esk4_0 @ esk3_0)|(positive @ epred1_0 @ esk3_0))&(((rel @ esk3_0 @ esk5_0)|(positive @ epred1_0 @ esk3_0))&((~(positive @ X82 @ esk5_0)|(X82 @ esk6_0 @ esk5_0)|(positive @ epred1_0 @ esk3_0))&(~(epred2_0 @ esk6_0 @ esk5_0)|(positive @ epred1_0 @ esk3_0)))))&(((epred2_0 @ esk4_0 @ esk3_0)|~(epred1_0 @ esk4_0 @ esk3_0))&(((rel @ esk3_0 @ esk5_0)|~(epred1_0 @ esk4_0 @ esk3_0))&((~(positive @ X82 @ esk5_0)|(X82 @ esk6_0 @ esk5_0)|~(epred1_0 @ esk4_0 @ esk3_0))&(~(epred2_0 @ esk6_0 @ esk5_0)|~(epred1_0 @ esk4_0 @ esk3_0)))))))), 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_29])])])])])])).
% 0.21/0.27 thf(c_0_33, plain, ![X6:mu > $i > $o, X3:$i]:(((positive @ X6 @ X3)|(((positive @ (epred3_1 @ X6) @ X3))=(($true))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_30]), c_0_31])).
% 0.21/0.27 thf(c_0_34, plain, ![X48:$i, X47:mu > $i > $o]:(((positive @ X47 @ X48)=>![X46:$i]:((~(rel @ X48 @ X46)|(positive @ X47 @ X46))))), 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)],[axA4]), c_0_16]), c_0_17]), c_0_21]), c_0_24])])).
% 0.21/0.27 thf(c_0_35, plain, ![X98:$i, X99:mu, X100:mu > $i > $o]:(((~(epred3_1 @ X100 @ X99 @ X98)|~(X100 @ X99 @ X98))&((X100 @ X99 @ X98)|(epred3_1 @ X100 @ X99 @ X98)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.21/0.27 thf(c_0_36, negated_conjecture, ![X6:mu > $i > $o]:(((X6 @ esk4_0 @ esk3_0)|~((positive @ X6 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.21/0.27 thf(c_0_37, plain, ![X6:mu > $i > $o, X3:$i]:(((positive @ (epred3_1 @ X6) @ X3)|(positive @ X6 @ X3))), inference(cn,[status(thm)],[c_0_33])).
% 0.21/0.27 thf(c_0_38, plain, ![X71:$i, X72:mu > $i > $o, X73:$i]:((~(positive @ X72 @ X71)|(~(rel @ X71 @ X73)|(positive @ X72 @ X73)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])])).
% 0.21/0.27 thf(c_0_39, plain, ![X1:mu, X6:mu > $i > $o, X3:$i]:((~((epred3_1 @ X6 @ X1 @ X3))|~((X6 @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_35])).
% 0.21/0.27 thf(c_0_40, negated_conjecture, ![X6:mu > $i > $o]:(((epred3_1 @ X6 @ esk4_0 @ esk3_0)|(positive @ X6 @ esk3_0))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
% 0.21/0.27 thf(c_0_41, plain, ![X3:$i, X6:mu > $i > $o, X16:$i]:(((positive @ X6 @ X16)|~((positive @ X6 @ X3))|~((rel @ X3 @ X16)))), inference(split_conjunct,[status(thm)],[c_0_38])).
% 0.21/0.27 thf(c_0_42, negated_conjecture, ((rel @ esk3_0 @ esk5_0)|(positive @ epred1_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.21/0.27 thf(c_0_43, plain, ![X6:mu > $i > $o]:(((positive @ X6 @ esk3_0)|~((X6 @ esk4_0 @ esk3_0)))), inference(spm,[status(thm)],[c_0_39, c_0_40])).
% 0.21/0.27 thf(c_0_44, negated_conjecture, ((epred2_0 @ esk4_0 @ esk3_0)|(positive @ epred1_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.21/0.27 thf(c_0_45, negated_conjecture, ![X6:mu > $i > $o]:(((positive @ epred1_0 @ esk3_0)|(positive @ X6 @ esk5_0)|~((positive @ X6 @ esk3_0)))), inference(spm,[status(thm)],[c_0_41, c_0_42])).
% 0.21/0.27 thf(c_0_46, negated_conjecture, ((positive @ epred1_0 @ esk3_0)|(positive @ epred2_0 @ esk3_0)), inference(spm,[status(thm)],[c_0_43, c_0_44])).
% 0.21/0.27 thf(c_0_47, negated_conjecture, ![X6:mu > $i > $o]:(((X6 @ esk6_0 @ esk5_0)|(positive @ epred1_0 @ esk3_0)|~((positive @ X6 @ esk5_0)))), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.21/0.27 thf(c_0_48, negated_conjecture, ((positive @ epred2_0 @ esk5_0)|(positive @ epred1_0 @ esk3_0)), inference(spm,[status(thm)],[c_0_45, c_0_46])).
% 0.21/0.27 thf(c_0_49, negated_conjecture, ((positive @ epred1_0 @ esk3_0)|~((epred2_0 @ esk6_0 @ esk5_0))), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.21/0.27 thf(c_0_50, negated_conjecture, (positive @ epred1_0 @ esk3_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_48]), c_0_49])).
% 0.21/0.27 thf(c_0_51, negated_conjecture, ((rel @ esk3_0 @ esk5_0)|~((epred1_0 @ esk4_0 @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.21/0.27 thf(c_0_52, negated_conjecture, (epred1_0 @ esk4_0 @ esk3_0), inference(spm,[status(thm)],[c_0_36, c_0_50])).
% 0.21/0.27 thf(c_0_53, negated_conjecture, ![X6:mu > $i > $o]:(((X6 @ esk6_0 @ esk5_0)|~((positive @ X6 @ esk5_0))|~((epred1_0 @ esk4_0 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.21/0.27 thf(c_0_54, negated_conjecture, (rel @ esk3_0 @ esk5_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51, c_0_52])])).
% 0.21/0.27 thf(c_0_55, negated_conjecture, ((epred2_0 @ esk4_0 @ esk3_0)|~((epred1_0 @ esk4_0 @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.21/0.27 thf(c_0_56, negated_conjecture, ![X6:mu > $i > $o]:(((X6 @ esk6_0 @ esk5_0)|~((positive @ X6 @ esk5_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53, c_0_52])])).
% 0.21/0.27 thf(c_0_57, negated_conjecture, ![X6:mu > $i > $o]:(((positive @ X6 @ esk5_0)|~((positive @ X6 @ esk3_0)))), inference(spm,[status(thm)],[c_0_41, c_0_54])).
% 0.21/0.27 thf(c_0_58, negated_conjecture, ((positive @ epred2_0 @ esk3_0)|~((epred1_0 @ esk4_0 @ esk3_0))), inference(spm,[status(thm)],[c_0_43, c_0_55])).
% 0.21/0.27 thf(c_0_59, negated_conjecture, (~((epred2_0 @ esk6_0 @ esk5_0))|~((epred1_0 @ esk4_0 @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_32])).
% 0.21/0.27 thf(c_0_60, negated_conjecture, ![X6:mu > $i > $o]:(((X6 @ esk6_0 @ esk5_0)|~((positive @ X6 @ esk3_0)))), inference(spm,[status(thm)],[c_0_56, c_0_57])).
% 0.21/0.27 thf(c_0_61, negated_conjecture, (positive @ epred2_0 @ esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58, c_0_52])])).
% 0.21/0.27 thf(c_0_62, negated_conjecture, ~((epred2_0 @ esk6_0 @ esk5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59, c_0_52])])).
% 0.21/0.27 thf(c_0_63, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60, c_0_61]), c_0_62]), ['proof']).
% 0.21/0.27 % SZS output end CNFRefutation
% 0.21/0.27 % Parsed axioms : 59
% 0.21/0.27 % Removed by relevancy pruning/SinE : 0
% 0.21/0.27 % Initial clauses : 58
% 0.21/0.27 % Removed in clause preprocessing : 28
% 0.21/0.27 % Initial clauses in saturation : 30
% 0.21/0.27 % Processed clauses : 56
% 0.21/0.27 % ...of these trivial : 1
% 0.21/0.27 % ...subsumed : 6
% 0.21/0.27 % ...remaining for further processing : 49
% 0.21/0.27 % Other redundant clauses eliminated : 0
% 0.21/0.27 % Clauses deleted for lack of memory : 0
% 0.21/0.27 % Backward-subsumed : 0
% 0.21/0.27 % Backward-rewritten : 14
% 0.21/0.27 % Generated clauses : 69
% 0.21/0.27 % ...of the previous two non-redundant : 55
% 0.21/0.27 % ...aggressively subsumed : 0
% 0.21/0.27 % Contextual simplify-reflections : 1
% 0.21/0.27 % Paramodulations : 69
% 0.21/0.27 % Factorizations : 0
% 0.21/0.27 % NegExts : 0
% 0.21/0.27 % Equation resolutions : 0
% 0.21/0.27 % Disequality decompositions : 0
% 0.21/0.27 % Total rewrite steps : 31
% 0.21/0.27 % ...of those cached : 18
% 0.21/0.27 % Propositional unsat checks : 0
% 0.21/0.27 % Propositional check models : 0
% 0.21/0.27 % Propositional check unsatisfiable : 0
% 0.21/0.27 % Propositional clauses : 0
% 0.21/0.27 % Propositional clauses after purity: 0
% 0.21/0.27 % Propositional unsat core size : 0
% 0.21/0.27 % Propositional preprocessing time : 0.000
% 0.21/0.27 % Propositional encoding time : 0.000
% 0.21/0.27 % Propositional solver time : 0.000
% 0.21/0.27 % Success case prop preproc time : 0.000
% 0.21/0.27 % Success case prop encoding time : 0.000
% 0.21/0.27 % Success case prop solver time : 0.000
% 0.21/0.27 % Current number of processed clauses : 35
% 0.21/0.27 % Positive orientable unit clauses : 11
% 0.21/0.27 % Positive unorientable unit clauses: 0
% 0.21/0.27 % Negative unit clauses : 1
% 0.21/0.27 % Non-unit-clauses : 23
% 0.21/0.27 % Current number of unprocessed clauses: 26
% 0.21/0.27 % ...number of literals in the above : 84
% 0.21/0.27 % Current number of archived formulas : 0
% 0.21/0.27 % Current number of archived clauses : 14
% 0.21/0.27 % Clause-clause subsumption calls (NU) : 149
% 0.21/0.27 % Rec. Clause-clause subsumption calls : 131
% 0.21/0.27 % Non-unit clause-clause subsumptions : 7
% 0.21/0.27 % Unit Clause-clause subsumption calls : 14
% 0.21/0.27 % Rewrite failures with RHS unbound : 0
% 0.21/0.27 % BW rewrite match attempts : 2
% 0.21/0.27 % BW rewrite match successes : 2
% 0.21/0.27 % Condensation attempts : 0
% 0.21/0.27 % Condensation successes : 0
% 0.21/0.27 % Termbank termtop insertions : 5819
% 0.21/0.27 % Search garbage collected termcells : 1891
% 0.21/0.27
% 0.21/0.27 % -------------------------------------------------
% 0.21/0.27 % User time : 0.006 s
% 0.21/0.27 % System time : 0.007 s
% 0.21/0.27 % Total time : 0.012 s
% 0.21/0.27 % Maximum resident set size: 3952 pages
% 0.21/0.27
% 0.21/0.27 % -------------------------------------------------
% 0.21/0.27 % User time : 0.023 s
% 0.21/0.27 % System time : 0.019 s
% 0.21/0.27 % Total time : 0.042 s
% 0.21/0.27 % Maximum resident set size: 4864 pages
% 0.21/0.27 % E exiting
%------------------------------------------------------------------------------