↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEV243^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n017.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:35:16 AM UTC 2026

% Result   : Theorem 0.22s 0.31s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV243^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20  % Computer : n017.cluster.edu
% 0.10/0.20  % Model    : x86_64 x86_64
% 0.10/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20  % Memory   : 8046.5625MB
% 0.10/0.20  % OS       : Linux 6.8.0-71-generic
% 0.10/0.20  % CPULimit : 300
% 0.10/0.20  % WCLimit  : 300
% 0.10/0.20  % DateTime : Tue Sep 29 15:22:22 UTC 2026
% 0.10/0.20  % CPUTime  : 
% 0.10/0.20  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.25  Running higher-order theorem proving
% 0.22/0.26  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.2AVUae0GwD/E---3.1_458392.p
% 0.22/0.31  % Version: 3.5.1-ho
% 0.22/0.31  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.31  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.31  % Starting post_as_ho12 with 300s (1) cores
% 0.22/0.31  % Starting new_bool_9 with 300s (1) cores
% 0.22/0.31  % Starting post_as_ho1 with 300s (1) cores
% 0.22/0.31  % Starting post_as_ho4 with 300s (1) cores
% 0.22/0.31  % Starting post_as_ho2 with 300s (1) cores
% 0.22/0.31  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.31  % Starting full_lambda_10 with 300s (1) cores
% 0.22/0.31  % Starting new_ho_8 with 300s (1) cores
% 0.22/0.31  % post_as_ho1 with pid 458407 completed with status 0
% 0.22/0.31  % Result found by post_as_ho1
% 0.22/0.31  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.31  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.31  % Starting post_as_ho12 with 300s (1) cores
% 0.22/0.31  % Starting new_bool_9 with 300s (1) cores
% 0.22/0.31  % Starting post_as_ho1 with 300s (1) cores
% 0.22/0.31  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.31  % No SInE strategy applied
% 0.22/0.31  % Search class: HGHNF-FFSF21-SSSFFMBN
% 0.22/0.31  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.31  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.31  % SubtermCWHack with pid 458417 completed with status 0
% 0.22/0.31  % Result found by SubtermCWHack
% 0.22/0.31  % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.22/0.31  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.31  % Starting post_as_ho12 with 300s (1) cores
% 0.22/0.31  % Starting new_bool_9 with 300s (1) cores
% 0.22/0.31  % Starting post_as_ho1 with 300s (1) cores
% 0.22/0.31  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.31  % No SInE strategy applied
% 0.22/0.31  % Search class: HGHNF-FFSF21-SSSFFMBN
% 0.22/0.31  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.31  % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.31  % Preprocessing time       : 0.002 s
% 0.22/0.31  
% 0.22/0.31  % Proof found!
% 0.22/0.31  % SZS status Theorem
% 0.22/0.31  % SZS output start CNFRefutation
% 0.22/0.31  thf(decl_sort1, type, a: $tType).
% 0.22/0.31  thf(decl_23, type, cK: (a > $o) > a > $o).
% 0.22/0.31  thf(decl_24, type, esk1_2: (a > $o) > (a > $o) > a).
% 0.22/0.31  thf(decl_25, type, esk2_0: a).
% 0.22/0.31  thf(decl_26, type, esk3_1: (a > $o) > a).
% 0.22/0.31  thf(decl_27, type, epred1_0: a > $o).
% 0.22/0.31  thf(decl_28, type, epred2_0: a > $o).
% 0.22/0.31  thf(decl_29, type, epred3_1: a > a > $o).
% 0.22/0.31  thf(decl_30, type, esk4_2: a > (a > $o) > a).
% 0.22/0.31  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.2AVUae0GwD/E---3.1_458392.p', cTHM116_C_pme)).
% 0.22/0.31  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 @ (^[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))))))), inference(assume_negation,[status(cth)],[cTHM116_C_pme])).
% 0.22/0.31  thf(c_0_2, 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: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)],[c_0_1])).
% 0.22/0.31  thf(c_0_3, 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: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:a]:(?[X5:a > $o]:(((![X6:a]:(((X5 @ X6)=>((cK @ X5 @ X6)))))&(X5 @ Z0))))) @ esk2_0)))&((~(epred1_0 @ X22)|(cK @ epred1_0 @ X22)|(cK @ (^[Z0:a]:(?[X5:a > $o]:(((![X6:a]:(((X5 @ X6)=>((cK @ X5 @ X6)))))&(X5 @ Z0))))) @ esk2_0))&((epred1_0 @ esk2_0)|(cK @ (^[Z0: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_2])])])])])])).
% 0.22/0.31  thf(c_0_4, plain, ![X25:a]:(((epred2_0 @ X25)<=>?[X23:a > $o]:((![X24:a]:(((X23 @ X24)=>(cK @ X23 @ X24)))&(X23 @ X25))))), introduced(definition)).
% 0.22/0.31  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_3]), c_0_4])).
% 0.22/0.31  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.22/0.31  thf(c_0_7, 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_3]), c_0_4])).
% 0.22/0.31  thf(c_0_8, 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.22/0.31  thf(c_0_9, 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.22/0.31  thf(c_0_10, negated_conjecture, ![X1:a > $o]:(((X1 @ (esk3_1 @ X1))|~((cK @ epred2_0 @ esk2_0))|~((X1 @ esk2_0)))), inference(cn,[status(thm)],[c_0_7])).
% 0.22/0.31  thf(c_0_11, 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_3]), c_0_4])).
% 0.22/0.31  thf(c_0_12, plain, ![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_8, c_0_9]), c_0_10])).
% 0.22/0.31  thf(c_0_13, plain, ![X3:a]:(((epred3_1 @ X3 @ X3)|~((epred2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.22/0.31  thf(c_0_14, negated_conjecture, ((epred1_0 @ esk2_0)|(((cK @ epred2_0 @ esk2_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.22/0.31  thf(c_0_15, 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_3])).
% 0.22/0.31  thf(c_0_16, negated_conjecture, ![X3:a]:(((cK @ epred2_0 @ esk2_0)|(cK @ epred1_0 @ X3)|~((epred1_0 @ X3)))), inference(cn,[status(thm)],[c_0_11])).
% 0.22/0.31  thf(c_0_17, plain, (~((cK @ epred2_0 @ esk2_0))|~((epred2_0 @ esk2_0))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.22/0.31  thf(c_0_18, negated_conjecture, ((cK @ epred2_0 @ esk2_0)|(epred1_0 @ esk2_0)), inference(cn,[status(thm)],[c_0_14])).
% 0.22/0.31  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.22/0.31  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.22/0.31  thf(c_0_21, 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_15, c_0_16])).
% 0.22/0.31  thf(c_0_22, negated_conjecture, ((epred1_0 @ esk2_0)|~((epred2_0 @ esk2_0))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.22/0.31  thf(c_0_23, 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_15, c_0_9])).
% 0.22/0.31  thf(c_0_24, plain, ![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_16]), c_0_20])).
% 0.22/0.31  thf(c_0_25, 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_21, c_0_22]), c_0_17])).
% 0.22/0.31  thf(c_0_26, 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_9]), c_0_20])).
% 0.22/0.31  thf(c_0_27, 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_23, c_0_13])).
% 0.22/0.31  thf(c_0_28, 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_3])).
% 0.22/0.31  thf(c_0_29, plain, ![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_24, c_0_25]), c_0_17])).
% 0.22/0.31  thf(c_0_30, 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_26, c_0_27])).
% 0.22/0.31  thf(c_0_31, negated_conjecture, ![X3:a]:(((cK @ epred2_0 @ X3)|~((cK @ epred1_0 @ X3))|~((epred2_0 @ esk2_0)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_17])).
% 0.22/0.31  thf(c_0_32, negated_conjecture, ![X4:a, X3:a]:(((cK @ epred2_0 @ X3)|(cK @ epred2_0 @ X4)|~((cK @ (epred3_1 @ X3) @ X4))|~((epred2_0 @ X3)))), inference(spm,[status(thm)],[c_0_28, c_0_30])).
% 0.22/0.31  thf(c_0_33, 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_31, c_0_16]), c_0_17])).
% 0.22/0.31  thf(c_0_34, plain, ![X3:a, X4:a]:(((cK @ epred2_0 @ X3)|(cK @ epred2_0 @ X4)|~((epred3_1 @ X4 @ X3))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_32, c_0_9])).
% 0.22/0.31  thf(c_0_35, 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_15, c_0_20])).
% 0.22/0.31  thf(c_0_36, plain, ~((epred2_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_33]), c_0_22])).
% 0.22/0.31  thf(c_0_37, plain, ![X3:a]:(((cK @ epred2_0 @ X3)|~((epred2_0 @ X3)))), inference(spm,[status(thm)],[c_0_34, c_0_13])).
% 0.22/0.31  thf(c_0_38, 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(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_18]), c_0_36])).
% 0.22/0.31  thf(c_0_39, negated_conjecture, ![X1:a > $o, X3:a]:(((cK @ (cK @ epred2_0) @ X3)|~((epred2_0 @ (esk1_2 @ (cK @ epred2_0) @ X1)))|~((cK @ X1 @ X3)))), inference(spm,[status(thm)],[c_0_28, c_0_37])).
% 0.22/0.31  thf(c_0_40, plain, ((epred2_0 @ (esk1_2 @ (cK @ epred2_0) @ epred2_0))|(epred1_0 @ esk2_0)), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_38]), c_0_36]), c_0_18])).
% 0.22/0.31  thf(c_0_41, negated_conjecture, ![X3:a]:(((cK @ (cK @ epred2_0) @ X3)|(epred1_0 @ esk2_0)|~((cK @ epred2_0 @ X3)))), inference(spm,[status(thm)],[c_0_39, c_0_40])).
% 0.22/0.31  thf(c_0_42, negated_conjecture, ((epred1_0 @ esk2_0)|~((cK @ epred2_0 @ (esk3_1 @ (cK @ epred2_0))))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_41]), c_0_18])).
% 0.22/0.31  thf(c_0_43, negated_conjecture, (epred1_0 @ esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_10]), c_0_18])).
% 0.22/0.31  thf(c_0_44, plain, (cK @ epred2_0 @ esk2_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_43]), c_0_36])).
% 0.22/0.31  thf(c_0_45, plain, ![X1:a > $o]:(((cK @ X1 @ (esk4_2 @ esk2_0 @ (cK @ epred2_0)))|(epred2_0 @ (esk1_2 @ X1 @ epred2_0)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_44]), c_0_36])).
% 0.22/0.31  thf(c_0_46, plain, (epred2_0 @ (esk1_2 @ (cK @ epred2_0) @ epred2_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_45]), c_0_44])]), c_0_36])).
% 0.22/0.31  thf(c_0_47, negated_conjecture, ![X1:a > $o]:((~((cK @ X1 @ (esk3_1 @ X1)))|~((X1 @ esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_44])])).
% 0.22/0.31  thf(c_0_48, negated_conjecture, ![X3:a]:(((cK @ (cK @ epred2_0) @ X3)|~((cK @ epred2_0 @ X3)))), inference(spm,[status(thm)],[c_0_39, c_0_46])).
% 0.22/0.31  thf(c_0_49, negated_conjecture, ~((cK @ epred2_0 @ (esk3_1 @ (cK @ epred2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_48]), c_0_44])])).
% 0.22/0.31  thf(c_0_50, negated_conjecture, ![X1:a > $o]:(((X1 @ (esk3_1 @ X1))|~((X1 @ esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_44])])).
% 0.22/0.31  thf(c_0_51, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_44])]), ['proof']).
% 0.22/0.31  % SZS output end CNFRefutation
% 0.22/0.31  % Parsed axioms                        : 3
% 0.22/0.31  % Removed by relevancy pruning/SinE    : 0
% 0.22/0.31  % Initial clauses                      : 12
% 0.22/0.31  % Removed in clause preprocessing      : 2
% 0.22/0.31  % Initial clauses in saturation        : 10
% 0.22/0.31  % Processed clauses                    : 59
% 0.22/0.31  % ...of these trivial                  : 0
% 0.22/0.31  % ...subsumed                          : 7
% 0.22/0.31  % ...remaining for further processing  : 52
% 0.22/0.31  % Other redundant clauses eliminated   : 0
% 0.22/0.31  % Clauses deleted for lack of memory   : 0
% 0.22/0.31  % Backward-subsumed                    : 10
% 0.22/0.31  % Backward-rewritten                   : 15
% 0.22/0.31  % Generated clauses                    : 120
% 0.22/0.31  % ...of the previous two non-redundant : 108
% 0.22/0.31  % ...aggressively subsumed             : 0
% 0.22/0.31  % Contextual simplify-reflections      : 11
% 0.22/0.31  % Paramodulations                      : 120
% 0.22/0.31  % Factorizations                       : 0
% 0.22/0.31  % NegExts                              : 0
% 0.22/0.31  % Equation resolutions                 : 0
% 0.22/0.31  % Disequality decompositions           : 0
% 0.22/0.31  % Total rewrite steps                  : 19
% 0.22/0.31  % ...of those cached                   : 17
% 0.22/0.31  % Propositional unsat checks           : 0
% 0.22/0.31  %    Propositional check models        : 0
% 0.22/0.31  %    Propositional check unsatisfiable : 0
% 0.22/0.31  %    Propositional clauses             : 0
% 0.22/0.31  %    Propositional clauses after purity: 0
% 0.22/0.31  %    Propositional unsat core size     : 0
% 0.22/0.31  %    Propositional preprocessing time  : 0.000
% 0.22/0.31  %    Propositional encoding time       : 0.000
% 0.22/0.31  %    Propositional solver time         : 0.000
% 0.22/0.31  %    Success case prop preproc time    : 0.000
% 0.22/0.31  %    Success case prop encoding time   : 0.000
% 0.22/0.31  %    Success case prop solver time     : 0.000
% 0.22/0.31  % Current number of processed clauses  : 27
% 0.22/0.31  %    Positive orientable unit clauses  : 3
% 0.22/0.31  %    Positive unorientable unit clauses: 0
% 0.22/0.31  %    Negative unit clauses             : 2
% 0.22/0.31  %    Non-unit-clauses                  : 22
% 0.22/0.31  % Current number of unprocessed clauses: 48
% 0.22/0.31  % ...number of literals in the above   : 197
% 0.22/0.31  % Current number of archived formulas  : 0
% 0.22/0.31  % Current number of archived clauses   : 25
% 0.22/0.31  % Clause-clause subsumption calls (NU) : 270
% 0.22/0.31  % Rec. Clause-clause subsumption calls : 170
% 0.22/0.31  % Non-unit clause-clause subsumptions  : 18
% 0.22/0.31  % Unit Clause-clause subsumption calls : 13
% 0.22/0.31  % Rewrite failures with RHS unbound    : 0
% 0.22/0.31  % BW rewrite match attempts            : 2
% 0.22/0.31  % BW rewrite match successes           : 2
% 0.22/0.31  % Condensation attempts                : 0
% 0.22/0.31  % Condensation successes               : 0
% 0.22/0.31  % Termbank termtop insertions          : 3747
% 0.22/0.31  % Search garbage collected termcells   : 498
% 0.22/0.31  
% 0.22/0.31  % -------------------------------------------------
% 0.22/0.31  % User time                : 0.015 s
% 0.22/0.31  % System time              : 0.003 s
% 0.22/0.31  % Total time               : 0.018 s
% 0.22/0.31  % Maximum resident set size: 3376 pages
% 0.22/0.31  
% 0.22/0.31  % -------------------------------------------------
% 0.22/0.31  % User time                : 0.016 s
% 0.22/0.31  % System time              : 0.010 s
% 0.22/0.31  % Total time               : 0.025 s
% 0.22/0.31  % Maximum resident set size: 4608 pages
% 0.22/0.31  % E exiting
%------------------------------------------------------------------------------