TSTP Solution File: SEV243^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV243^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Mon Jun 24 15:54:04 EDT 2024
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV243^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 21 18:54:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 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.KuDuYS01Iq/E---3.1_21025.p
% 0.21/0.53 # Version: 3.2.0-ho
% 0.21/0.53 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.53 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.53 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.53 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.53 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.53 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.53 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.53 # post_as_ho1 with pid 21183 completed with status 0
% 0.21/0.53 # Result found by post_as_ho1
% 0.21/0.53 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.53 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: HGHNF-FFSF21-SSSFFMBN
% 0.21/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.53 # new_ho_10 with pid 21196 completed with status 0
% 0.21/0.53 # Result found by new_ho_10
% 0.21/0.53 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.53 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.53 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: HGHNF-FFSF21-SSSFFMBN
% 0.21/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% 0.21/0.53 thf(decl_sort1, type, a: $tType).
% 0.21/0.53 thf(decl_22, type, cK: (a > $o) > a > $o).
% 0.21/0.53 thf(decl_23, type, esk1_2: (a > $o) > (a > $o) > a).
% 0.21/0.53 thf(decl_24, type, esk2_0: a).
% 0.21/0.53 thf(decl_25, type, esk3_1: (a > $o) > a).
% 0.21/0.53 thf(decl_26, type, epred1_0: a > $o).
% 0.21/0.53 thf(decl_27, type, epred2_0: a > $o).
% 0.21/0.53 thf(decl_28, type, epred3_1: a > a > $o).
% 0.21/0.53 thf(decl_29, type, esk4_2: a > (a > $o) > a).
% 0.21/0.53 thf(cTHM116_C_pme, conjecture, (![X1:a > $o, X2:a > $o]:((![X3:a]:(((X2 @ X3)=>(X1 @ X3)))=>![X3:a]:(((cK @ X2 @ X3)=>(cK @ X1 @ X3)))))=>![X3:a]:(((cK @ (^[X4:a]:(?[X5:a > $o]:((![X6:a]:(((X5 @ X6)=>(cK @ X5 @ X6)))&(X5 @ X4))))) @ X3)<=>?[X5:a > $o]:((![X4:a]:(((X5 @ X4)=>(cK @ X5 @ X4)))&(X5 @ X3)))))), file('/export/starexec/sandbox/tmp/tmp.KuDuYS01Iq/E---3.1_21025.p', cTHM116_C_pme)).
% 0.21/0.53 thf(c_0_1, negated_conjecture, ~((![X1:a > $o, X2:a > $o]:((![X3:a]:(((X2 @ X3)=>(X1 @ X3)))=>![X3:a]:(((cK @ X2 @ X3)=>(cK @ X1 @ X3)))))=>![X3:a]:(((cK @ (^[Z0/* 5 */:a]:(?[X5:a > $o]:((![X6:a]:((X5 @ X6=>(cK @ X5 @ X6)))&X5 @ Z0)))) @ X3)<=>?[X5:a > $o]:((![X4:a]:(((X5 @ X4)=>(cK @ X5 @ X4)))&(X5 @ X3))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM116_C_pme])])).
% 0.21/0.53 thf(c_0_2, negated_conjecture, ![X14:a > $o, X15:a > $o, X17:a, X19:a > $o, X22:a]:(((((X15 @ (esk1_2 @ X14 @ X15))|(~(cK @ X15 @ X17)|(cK @ X14 @ X17)))&(~(X14 @ (esk1_2 @ X14 @ X15))|(~(cK @ X15 @ X17)|(cK @ X14 @ X17))))&((((X19 @ (esk3_1 @ X19))|~(X19 @ esk2_0)|~(cK @ (^[Z0/* 5 */:a]:(?[X5:a > $o]:((![X6:a]:((X5 @ X6=>(cK @ X5 @ X6)))&X5 @ Z0)))) @ esk2_0))&(~(cK @ X19 @ (esk3_1 @ X19))|~(X19 @ esk2_0)|~(cK @ (^[Z0/* 5 */:a]:(?[X5:a > $o]:((![X6:a]:((X5 @ X6=>(cK @ X5 @ X6)))&X5 @ Z0)))) @ esk2_0)))&((~(epred1_0 @ X22)|(cK @ epred1_0 @ X22)|(cK @ (^[Z0/* 5 */:a]:(?[X5:a > $o]:((![X6:a]:((X5 @ X6=>(cK @ X5 @ X6)))&X5 @ Z0)))) @ esk2_0))&((epred1_0 @ esk2_0)|(cK @ (^[Z0/* 5 */:a]:(?[X5:a > $o]:((![X6:a]:((X5 @ X6=>(cK @ X5 @ X6)))&X5 @ Z0)))) @ esk2_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_1])])])])])])).
% 0.21/0.53 thf(c_0_3, plain, ![X25:a]:(((epred2_0 @ X25)<=>?[X23:a > $o]:((![X24:a]:(((X23 @ X24)=>(cK @ X23 @ X24)))&(X23 @ X25))))), introduced(definition)).
% 0.21/0.53 thf(c_0_4, negated_conjecture, ![X1:a > $o]:(((X1 @ (esk3_1 @ X1))|~((X1 @ esk2_0))|~((((cK @ epred2_0 @ esk2_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.21/0.53 thf(c_0_5, negated_conjecture, ![X1:a > $o]:((~((cK @ X1 @ (esk3_1 @ X1)))|~((X1 @ esk2_0))|~((((cK @ epred2_0 @ esk2_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.21/0.53 thf(c_0_6, plain, ![X35:a, X37:a, X38:a > $o]:((((~(epred3_1 @ X35 @ X37)|(cK @ (epred3_1 @ X35) @ X37)|~(epred2_0 @ X35))&((epred3_1 @ X35 @ X35)|~(epred2_0 @ X35)))&(((X38 @ (esk4_2 @ X35 @ X38))|~(X38 @ X35)|(epred2_0 @ X35))&(~(cK @ X38 @ (esk4_2 @ X35 @ X38))|~(X38 @ X35)|(epred2_0 @ X35))))), 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.21/0.53 thf(c_0_7, negated_conjecture, ![X1:a > $o, X2:a > $o, X3:a]:(((X1 @ (esk1_2 @ X2 @ X1))|(cK @ X2 @ X3)|~((cK @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.53 thf(c_0_8, negated_conjecture, ![X1:a > $o]:(((X1 @ (esk3_1 @ X1))|~((cK @ epred2_0 @ esk2_0))|~((X1 @ esk2_0)))), inference(cn,[status(thm)],[c_0_4])).
% 0.21/0.53 thf(c_0_9, negated_conjecture, ((epred1_0 @ esk2_0)|(((cK @ epred2_0 @ esk2_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.21/0.53 thf(c_0_10, negated_conjecture, ![X1:a > $o]:((~((cK @ X1 @ (esk3_1 @ X1)))|~((cK @ epred2_0 @ esk2_0))|~((X1 @ esk2_0)))), inference(cn,[status(thm)],[c_0_5])).
% 0.21/0.53 thf(c_0_11, plain, ![X4:a, X3:a]:(((cK @ (epred3_1 @ X3) @ X4)|~((epred3_1 @ X3 @ X4))|~((epred2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.21/0.53 thf(c_0_12, negated_conjecture, ![X1:a > $o, X2:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ X2)))|(X2 @ (esk1_2 @ X1 @ X2))|~((cK @ epred2_0 @ esk2_0))|~((cK @ X2 @ esk2_0)))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
% 0.21/0.53 thf(c_0_13, negated_conjecture, ((cK @ epred2_0 @ esk2_0)|(epred1_0 @ esk2_0)), inference(cn,[status(thm)],[c_0_9])).
% 0.21/0.53 thf(c_0_14, negated_conjecture, ![X3:a]:((~((cK @ epred2_0 @ esk2_0))|~((epred3_1 @ X3 @ esk2_0))|~((epred2_0 @ X3)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_8])).
% 0.21/0.53 thf(c_0_15, plain, ![X3:a]:(((epred3_1 @ X3 @ X3)|~((epred2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.21/0.53 thf(c_0_16, negated_conjecture, ![X3:a]:(((cK @ epred1_0 @ X3)|(((cK @ epred2_0 @ esk2_0))=(($true)))|~((epred1_0 @ X3)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.21/0.53 thf(c_0_17, negated_conjecture, ![X1:a > $o, X2:a > $o, X3:a]:(((cK @ X1 @ X3)|~((X1 @ (esk1_2 @ X1 @ X2)))|~((cK @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.53 thf(c_0_18, negated_conjecture, ![X1:a > $o, X2:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ X2)))|(X2 @ (esk1_2 @ X1 @ X2))|(epred1_0 @ esk2_0)|~((cK @ X2 @ esk2_0)))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.21/0.53 thf(c_0_19, plain, ![X1:a > $o, X3:a]:(((epred2_0 @ X3)|~((cK @ X1 @ (esk4_2 @ X3 @ X1)))|~((X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.21/0.53 thf(c_0_20, plain, ![X1:a > $o, X3:a]:(((X1 @ (esk4_2 @ X3 @ X1))|(epred2_0 @ X3)|~((X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.21/0.53 thf(c_0_21, plain, ![X1:a > $o, X4:a, X3:a]:(((epred3_1 @ X3 @ (esk1_2 @ X1 @ (epred3_1 @ X3)))|(cK @ X1 @ X4)|~((epred3_1 @ X3 @ X4))|~((epred2_0 @ X3)))), inference(spm,[status(thm)],[c_0_7, c_0_11])).
% 0.21/0.53 thf(c_0_22, plain, (~((cK @ epred2_0 @ esk2_0))|~((epred2_0 @ esk2_0))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.21/0.53 thf(c_0_23, negated_conjecture, ![X3:a]:(((cK @ epred2_0 @ esk2_0)|(cK @ epred1_0 @ X3)|~((epred1_0 @ X3)))), inference(cn,[status(thm)],[c_0_16])).
% 0.21/0.53 thf(c_0_24, negated_conjecture, ![X1:a > $o, X2:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ X2)))|~((cK @ epred2_0 @ esk2_0))|~((X1 @ (esk1_2 @ X1 @ X2)))|~((cK @ X2 @ esk2_0)))), inference(spm,[status(thm)],[c_0_17, c_0_8])).
% 0.21/0.53 thf(c_0_25, negated_conjecture, ![X1:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ epred2_0)))|(epred2_0 @ (esk1_2 @ X1 @ epred2_0))|(epred1_0 @ esk2_0))), inference(spm,[status(thm)],[c_0_18, c_0_13])).
% 0.21/0.53 thf(c_0_26, plain, ![X1:a > $o, X3:a, X4:a]:(((cK @ X1 @ X3)|~((X1 @ (esk1_2 @ X1 @ (epred3_1 @ X4))))|~((epred3_1 @ X4 @ X3))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_17, c_0_11])).
% 0.21/0.53 thf(c_0_27, plain, ![X3:a, X4:a]:(((epred2_0 @ X3)|~((epred3_1 @ X4 @ X3))|~((epred2_0 @ X4)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_11]), c_0_20])).
% 0.21/0.53 thf(c_0_28, plain, ![X1:a > $o, X3:a]:(((epred3_1 @ X3 @ (esk1_2 @ X1 @ (epred3_1 @ X3)))|(cK @ X1 @ X3)|~((epred2_0 @ X3)))), inference(spm,[status(thm)],[c_0_21, c_0_15])).
% 0.21/0.53 thf(c_0_29, plain, ![X1:a > $o, X2:a > $o, X3:a]:(((cK @ X1 @ (esk4_2 @ X3 @ (cK @ X2)))|(X2 @ (esk1_2 @ X1 @ X2))|(epred2_0 @ X3)|~((cK @ X2 @ X3)))), inference(spm,[status(thm)],[c_0_7, c_0_20])).
% 0.21/0.53 thf(c_0_30, negated_conjecture, ((epred1_0 @ esk2_0)|~((epred2_0 @ esk2_0))), inference(spm,[status(thm)],[c_0_22, c_0_13])).
% 0.21/0.53 thf(c_0_31, negated_conjecture, ![X1:a > $o, X3:a]:(((epred1_0 @ (esk1_2 @ X1 @ epred1_0))|(cK @ epred2_0 @ esk2_0)|(cK @ X1 @ X3)|~((epred1_0 @ X3)))), inference(spm,[status(thm)],[c_0_7, c_0_23])).
% 0.21/0.53 thf(c_0_32, negated_conjecture, ((cK @ epred2_0 @ (esk3_1 @ (cK @ epred2_0)))|(epred1_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_13])).
% 0.21/0.53 thf(c_0_33, plain, ![X1:a > $o, X3:a]:(((cK @ X1 @ X3)|~((X1 @ (esk1_2 @ X1 @ (epred3_1 @ X3))))|~((epred2_0 @ X3)))), inference(spm,[status(thm)],[c_0_26, c_0_15])).
% 0.21/0.53 thf(c_0_34, plain, ![X1:a > $o, X3:a]:(((epred2_0 @ (esk1_2 @ X1 @ (epred3_1 @ X3)))|(cK @ X1 @ X3)|~((epred2_0 @ X3)))), inference(spm,[status(thm)],[c_0_27, c_0_28])).
% 0.21/0.53 thf(c_0_35, negated_conjecture, ![X1:a > $o]:(((cK @ X1 @ (esk4_2 @ esk2_0 @ (cK @ epred2_0)))|(epred2_0 @ (esk1_2 @ X1 @ epred2_0))|(epred1_0 @ esk2_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_13]), c_0_30])).
% 0.21/0.53 thf(c_0_36, negated_conjecture, ![X3:a]:(((cK @ epred2_0 @ esk2_0)|(epred2_0 @ X3)|~((epred1_0 @ X3)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_23]), c_0_20])).
% 0.21/0.53 thf(c_0_37, negated_conjecture, ![X1:a > $o]:(((epred1_0 @ (esk1_2 @ X1 @ epred1_0))|(cK @ X1 @ esk2_0)|~((epred2_0 @ esk2_0)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_30]), c_0_22])).
% 0.21/0.53 thf(c_0_38, negated_conjecture, ![X1:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ epred2_0)))|(epred1_0 @ esk2_0)|~((X1 @ (esk1_2 @ X1 @ epred2_0))))), inference(spm,[status(thm)],[c_0_17, c_0_32])).
% 0.21/0.53 thf(c_0_39, plain, ![X3:a]:(((cK @ epred2_0 @ X3)|~((epred2_0 @ X3)))), inference(spm,[status(thm)],[c_0_33, c_0_34])).
% 0.21/0.53 thf(c_0_40, plain, ((epred2_0 @ (esk1_2 @ (cK @ epred2_0) @ epred2_0))|(epred1_0 @ esk2_0)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_35]), c_0_13]), c_0_30])).
% 0.21/0.53 thf(c_0_41, negated_conjecture, ![X1:a > $o, X3:a]:(((cK @ epred2_0 @ esk2_0)|(cK @ X1 @ X3)|~((X1 @ (esk1_2 @ X1 @ epred1_0)))|~((epred1_0 @ X3)))), inference(spm,[status(thm)],[c_0_17, c_0_23])).
% 0.21/0.53 thf(c_0_42, negated_conjecture, ![X1:a > $o]:(((epred2_0 @ (esk1_2 @ X1 @ epred1_0))|(cK @ X1 @ esk2_0)|~((epred2_0 @ esk2_0)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_22])).
% 0.21/0.53 thf(c_0_43, negated_conjecture, ((cK @ (cK @ epred2_0) @ (esk3_1 @ (cK @ epred2_0)))|(epred1_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_40])).
% 0.21/0.53 thf(c_0_44, negated_conjecture, ![X3:a]:(((cK @ epred2_0 @ X3)|~((epred2_0 @ esk2_0))|~((epred1_0 @ X3)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_42]), c_0_22])).
% 0.21/0.53 thf(c_0_45, negated_conjecture, (epred1_0 @ esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_43]), c_0_13])).
% 0.21/0.53 thf(c_0_46, plain, ~((epred2_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_44]), c_0_30])).
% 0.21/0.53 thf(c_0_47, negated_conjecture, (cK @ epred2_0 @ esk2_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_45]), c_0_46])).
% 0.21/0.53 thf(c_0_48, negated_conjecture, ![X1:a > $o, X2:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ X2)))|(X2 @ (esk1_2 @ X1 @ X2))|~((cK @ X2 @ esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_47])])).
% 0.21/0.53 thf(c_0_49, negated_conjecture, ![X1:a > $o, X2:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ X2)))|~((X1 @ (esk1_2 @ X1 @ X2)))|~((cK @ X2 @ esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_47])])).
% 0.21/0.53 thf(c_0_50, negated_conjecture, ![X1:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ epred2_0)))|(epred2_0 @ (esk1_2 @ X1 @ epred2_0)))), inference(spm,[status(thm)],[c_0_48, c_0_47])).
% 0.21/0.53 thf(c_0_51, negated_conjecture, (cK @ epred2_0 @ (esk3_1 @ (cK @ epred2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_47])])).
% 0.21/0.53 thf(c_0_52, negated_conjecture, ![X1:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ epred2_0)))|~((X1 @ (esk1_2 @ X1 @ epred2_0))))), inference(spm,[status(thm)],[c_0_17, c_0_51])).
% 0.21/0.53 thf(c_0_53, negated_conjecture, ![X1:a > $o]:((~((cK @ X1 @ (esk3_1 @ X1)))|~((X1 @ esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_47])])).
% 0.21/0.53 thf(c_0_54, plain, (cK @ (cK @ epred2_0) @ (esk3_1 @ (cK @ epred2_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_39]), c_0_50])).
% 0.21/0.53 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_47])]), ['proof']).
% 0.21/0.53 # SZS output end CNFRefutation
% 0.21/0.53 # Parsed axioms : 3
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 12
% 0.21/0.53 # Removed in clause preprocessing : 2
% 0.21/0.53 # Initial clauses in saturation : 10
% 0.21/0.53 # Processed clauses : 133
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 34
% 0.21/0.53 # ...remaining for further processing : 99
% 0.21/0.53 # Other redundant clauses eliminated : 0
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 5
% 0.21/0.53 # Backward-rewritten : 41
% 0.21/0.53 # Generated clauses : 336
% 0.21/0.53 # ...of the previous two non-redundant : 305
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 19
% 0.21/0.53 # Paramodulations : 336
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 0
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 54
% 0.21/0.53 # ...of those cached : 50
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 43
% 0.21/0.53 # Positive orientable unit clauses : 5
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 1
% 0.21/0.53 # Non-unit-clauses : 37
% 0.21/0.53 # Current number of unprocessed clauses: 164
% 0.21/0.53 # ...number of literals in the above : 767
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 56
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 1413
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 518
% 0.21/0.53 # Non-unit clause-clause subsumptions : 50
% 0.21/0.53 # Unit Clause-clause subsumption calls : 22
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 2
% 0.21/0.53 # BW rewrite match successes : 2
% 0.21/0.53 # Condensation attempts : 133
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 10015
% 0.21/0.53 # Search garbage collected termcells : 499
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.022 s
% 0.21/0.53 # System time : 0.001 s
% 0.21/0.53 # Total time : 0.023 s
% 0.21/0.53 # Maximum resident set size: 1920 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.022 s
% 0.21/0.53 # System time : 0.005 s
% 0.21/0.53 # Total time : 0.027 s
% 0.21/0.53 # Maximum resident set size: 1708 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E exiting
%------------------------------------------------------------------------------