%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO041^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:43:40 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO041^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.17 % Computer : n026.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 16:26:57 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running higher-order theorem proving
% 0.10/0.22 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.ztisRGanC4/E---3.1_808873.p
% 0.10/0.25 % Version: 3.5.1-ho
% 0.10/0.25 % Preprocessing class: HSSSSLSSSSSNFFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.10/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.25 % Starting sh4l with 300s (1) cores
% 0.10/0.25 % ehoh_best8_lambda with pid 808901 completed with status 0
% 0.10/0.25 % Result found by ehoh_best8_lambda
% 0.10/0.25 % Preprocessing class: HSSSSLSSSSSNFFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.10/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HGHNF-FFMS00-SFFFFFNN
% 0.10/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.25 % SubtermCWHack with pid 808905 completed with status 0
% 0.10/0.25 % Result found by SubtermCWHack
% 0.10/0.25 % Preprocessing class: HSSSSLSSSSSNFFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.10/0.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HGHNF-FFMS00-SFFFFFNN
% 0.10/0.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.25 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.25 % Preprocessing time : 0.001 s
% 0.10/0.25
% 0.10/0.25 % Proof found!
% 0.10/0.25 % SZS status Theorem
% 0.10/0.25 % SZS output start CNFRefutation
% 0.10/0.25 thf(decl_24, type, f: $o > $o).
% 0.10/0.25 thf(decl_25, type, g: $o > $o).
% 0.10/0.25 thf(decl_26, type, x: $o).
% 0.10/0.25 thf(decl_27, type, y: $o).
% 0.10/0.25 thf(decl_28, type, epred1_0: $o).
% 0.10/0.25 thf(decl_29, type, epred2_0: $o).
% 0.10/0.25 thf(decl_30, type, epred3_0: $o).
% 0.10/0.25 thf(3, conjecture, ~((((((x)<~>(y))&((g @ ((x)))<=>(y)))&((g @ ((y)))<=>(x)))&((f @ ((f @ ((f @ ((x)))))))<=>(g @ ((f @ ((x)))))))), file('/export/starexec/sandbox2/tmp/tmp.ztisRGanC4/E---3.1_808873.p', 3)).
% 0.10/0.25 thf(c_0_1, negated_conjecture, ~(~((((((x)<~>(y))&((g @ ((x)))<=>(y)))&((g @ ((y)))<=>(x)))&((f @ ((f @ ((f @ ((x)))))))<=>(g @ ((f @ ((x))))))))), inference(assume_negation,[status(cth)],[3])).
% 0.10/0.25 thf(c_0_2, plain, ((epred1_0)<=>((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|~(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|~(f @ $false)))), introduced(definition)).
% 0.10/0.25 thf(c_0_3, plain, ((epred2_0)<=>((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|(f @ $false)))), introduced(definition)).
% 0.10/0.25 thf(c_0_4, plain, ((epred3_0)<=>((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|(g @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|(g @ $false)))), introduced(definition)).
% 0.10/0.25 thf(c_0_5, negated_conjecture, ~(~((((~(((x)<=>(y)))&(((~(x)|(g @ $true))&((x)|(g @ $false)))<=>(y)))&(((~(y)|(g @ $true))&((y)|(g @ $false)))<=>(x)))&((((epred1_0)|(f @ $true))&((epred2_0)|(f @ $false)))<=>(epred3_0))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[c_0_1])]), c_0_2]), c_0_3]), c_0_4])).
% 0.10/0.25 thf(c_0_6, plain, ((((~(x)|~(f @ $true)|~(f @ $true)|~(epred1_0))&((x)|~(f @ $false)|~(f @ $true)|~(epred1_0)))&((~(x)|(f @ $true)|~(f @ $false)|~(epred1_0))&((x)|(f @ $false)|~(f @ $false)|~(epred1_0))))&(((((((~(x)|(x)|(~(x)|(x))|(epred1_0))&(~(f @ $false)|(x)|(~(x)|(x))|(epred1_0)))&((~(x)|~(f @ $true)|(~(x)|(x))|(epred1_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(x))|(epred1_0))))&((f @ $false)|(~(x)|(x))|(epred1_0)))&((((~(x)|(x)|((f @ $false)|(x))|(epred1_0))&(~(f @ $false)|(x)|((f @ $false)|(x))|(epred1_0)))&((~(x)|~(f @ $true)|((f @ $false)|(x))|(epred1_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(x))|(epred1_0))))&((f @ $false)|((f @ $false)|(x))|(epred1_0))))&(((((~(x)|(x)|(~(x)|(f @ $true))|(epred1_0))&(~(f @ $false)|(x)|(~(x)|(f @ $true))|(epred1_0)))&((~(x)|~(f @ $true)|(~(x)|(f @ $true))|(epred1_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(f @ $true))|(epred1_0))))&((f @ $false)|(~(x)|(f @ $true))|(epred1_0)))&((((~(x)|(x)|((f @ $false)|(f @ $true))|(epred1_0))&(~(f @ $false)|(x)|((f @ $false)|(f @ $true))|(epred1_0)))&((~(x)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred1_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred1_0))))&((f @ $false)|((f @ $false)|(f @ $true))|(epred1_0)))))&((((~(x)|(x)|(f @ $true)|(epred1_0))&(~(f @ $false)|(x)|(f @ $true)|(epred1_0)))&((~(x)|~(f @ $true)|(f @ $true)|(epred1_0))&(~(f @ $false)|~(f @ $true)|(f @ $true)|(epred1_0))))&((f @ $false)|(f @ $true)|(epred1_0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])).
% 0.10/0.25 thf(c_0_7, negated_conjecture, (((((~(x)|~(y))&((x)|(y)))&((((~(x)|(x)|(y))&(~(g @ $false)|(x)|(y)))&((~(x)|~(g @ $true)|(y))&(~(g @ $false)|~(g @ $true)|(y))))&((~(x)|(g @ $true)|~(y))&((x)|(g @ $false)|~(y)))))&((((~(y)|(y)|(x))&(~(g @ $false)|(y)|(x)))&((~(y)|~(g @ $true)|(x))&(~(g @ $false)|~(g @ $true)|(x))))&((~(y)|(g @ $true)|~(x))&((y)|(g @ $false)|~(x)))))&((((~(epred2_0)|~(epred1_0)|(epred3_0))&(~(f @ $false)|~(epred1_0)|(epred3_0)))&((~(epred2_0)|~(f @ $true)|(epred3_0))&(~(f @ $false)|~(f @ $true)|(epred3_0))))&(((epred1_0)|(f @ $true)|~(epred3_0))&((epred2_0)|(f @ $false)|~(epred3_0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
% 0.10/0.25 thf(c_0_8, plain, ((f @ (~($true)))|(f @ (~($true)))|(x)|(epred1_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.10/0.25 thf(c_0_9, plain, ((((~(x)|~(f @ $true)|(g @ $true)|~(epred3_0))&((x)|~(f @ $false)|(g @ $true)|~(epred3_0)))&((~(x)|(f @ $true)|(g @ $false)|~(epred3_0))&((x)|(f @ $false)|(g @ $false)|~(epred3_0))))&(((((((~(x)|(x)|(~(x)|(x))|(epred3_0))&(~(f @ $false)|(x)|(~(x)|(x))|(epred3_0)))&((~(x)|~(f @ $true)|(~(x)|(x))|(epred3_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(x))|(epred3_0))))&(~(g @ $false)|(~(x)|(x))|(epred3_0)))&((((~(x)|(x)|((f @ $false)|(x))|(epred3_0))&(~(f @ $false)|(x)|((f @ $false)|(x))|(epred3_0)))&((~(x)|~(f @ $true)|((f @ $false)|(x))|(epred3_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(x))|(epred3_0))))&(~(g @ $false)|((f @ $false)|(x))|(epred3_0))))&(((((~(x)|(x)|(~(x)|(f @ $true))|(epred3_0))&(~(f @ $false)|(x)|(~(x)|(f @ $true))|(epred3_0)))&((~(x)|~(f @ $true)|(~(x)|(f @ $true))|(epred3_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(f @ $true))|(epred3_0))))&(~(g @ $false)|(~(x)|(f @ $true))|(epred3_0)))&((((~(x)|(x)|((f @ $false)|(f @ $true))|(epred3_0))&(~(f @ $false)|(x)|((f @ $false)|(f @ $true))|(epred3_0)))&((~(x)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred3_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred3_0))))&(~(g @ $false)|((f @ $false)|(f @ $true))|(epred3_0)))))&((((~(x)|(x)|~(g @ $true)|(epred3_0))&(~(f @ $false)|(x)|~(g @ $true)|(epred3_0)))&((~(x)|~(f @ $true)|~(g @ $true)|(epred3_0))&(~(f @ $false)|~(f @ $true)|~(g @ $true)|(epred3_0))))&(~(g @ $false)|~(g @ $true)|(epred3_0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
% 0.10/0.25 thf(c_0_10, negated_conjecture, ((x)|(g @ (~($true)))|~((y))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.25 thf(c_0_11, negated_conjecture, ((x)|(y)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.25 thf(c_0_12, negated_conjecture, ((epred3_0)|~((f @ (~($true))))|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.25 thf(c_0_13, plain, ((x)|(epred1_0)|(f @ (~($true)))), inference(cn,[status(thm)],[c_0_8])).
% 0.10/0.25 thf(c_0_14, plain, ((x)|(f @ (($true)))|(epred1_0)|~((f @ (~($true))))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.10/0.25 thf(c_0_15, plain, ((f @ (~($true)))|(f @ (($true)))|(epred1_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.10/0.25 thf(c_0_16, plain, ((f @ (~($true)))|(x)|(epred3_0)|~((g @ (~($true))))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.10/0.25 thf(c_0_17, negated_conjecture, ((g @ (~($true)))|(x)), inference(csr,[status(thm)],[c_0_10, c_0_11])).
% 0.10/0.25 thf(c_0_18, plain, ((x)|(epred1_0)|(epred3_0)|~((f @ (($true))))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.10/0.25 thf(c_0_19, plain, ((f @ (($true)))|(epred1_0)|(x)), inference(csr,[status(thm)],[c_0_14, c_0_15])).
% 0.10/0.25 thf(c_0_20, negated_conjecture, ((epred3_0)|~((f @ (~($true))))|~((epred1_0))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.25 thf(c_0_21, plain, ((f @ (~($true)))|(epred3_0)|(x)), inference(csr,[status(thm)],[c_0_16, c_0_17])).
% 0.10/0.25 thf(c_0_22, plain, ((epred3_0)|(epred1_0)|(x)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
% 0.10/0.25 thf(c_0_23, negated_conjecture, ((x)|~((y))|~((g @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.25 thf(c_0_24, plain, ((((~(x)|~(f @ $true)|(f @ $true)|~(epred2_0))&((x)|~(f @ $false)|(f @ $true)|~(epred2_0)))&((~(x)|(f @ $true)|(f @ $false)|~(epred2_0))&((x)|(f @ $false)|(f @ $false)|~(epred2_0))))&(((((((~(x)|(x)|(~(x)|(x))|(epred2_0))&(~(f @ $false)|(x)|(~(x)|(x))|(epred2_0)))&((~(x)|~(f @ $true)|(~(x)|(x))|(epred2_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(x))|(epred2_0))))&(~(f @ $false)|(~(x)|(x))|(epred2_0)))&((((~(x)|(x)|((f @ $false)|(x))|(epred2_0))&(~(f @ $false)|(x)|((f @ $false)|(x))|(epred2_0)))&((~(x)|~(f @ $true)|((f @ $false)|(x))|(epred2_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(x))|(epred2_0))))&(~(f @ $false)|((f @ $false)|(x))|(epred2_0))))&(((((~(x)|(x)|(~(x)|(f @ $true))|(epred2_0))&(~(f @ $false)|(x)|(~(x)|(f @ $true))|(epred2_0)))&((~(x)|~(f @ $true)|(~(x)|(f @ $true))|(epred2_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(f @ $true))|(epred2_0))))&(~(f @ $false)|(~(x)|(f @ $true))|(epred2_0)))&((((~(x)|(x)|((f @ $false)|(f @ $true))|(epred2_0))&(~(f @ $false)|(x)|((f @ $false)|(f @ $true))|(epred2_0)))&((~(x)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred2_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred2_0))))&(~(f @ $false)|((f @ $false)|(f @ $true))|(epred2_0)))))&((((~(x)|(x)|~(f @ $true)|(epred2_0))&(~(f @ $false)|(x)|~(f @ $true)|(epred2_0)))&((~(x)|~(f @ $true)|~(f @ $true)|(epred2_0))&(~(f @ $false)|~(f @ $true)|~(f @ $true)|(epred2_0))))&(~(f @ $false)|~(f @ $true)|(epred2_0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
% 0.10/0.25 thf(c_0_25, plain, ((x)|(g @ (($true)))|~((f @ (~($true))))|~((epred3_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.10/0.25 thf(c_0_26, negated_conjecture, ((x)|(epred3_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])).
% 0.10/0.25 thf(c_0_27, negated_conjecture, ((x)|~((g @ (($true))))), inference(csr,[status(thm)],[c_0_23, c_0_11])).
% 0.10/0.25 thf(c_0_28, plain, ((x)|(f @ (~($true)))|(f @ (~($true)))|~((epred2_0))), inference(split_conjunct,[status(thm)],[c_0_24])).
% 0.10/0.25 thf(c_0_29, plain, ((f @ (($true)))|(epred2_0)|~((f @ (~($true))))|~((x))), inference(split_conjunct,[status(thm)],[c_0_24])).
% 0.10/0.25 thf(c_0_30, plain, ((x)|~((f @ (~($true))))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_25, c_0_26]), c_0_27])).
% 0.10/0.25 thf(c_0_31, plain, ((epred2_0)|~((f @ (~($true))))|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_24])).
% 0.10/0.25 thf(c_0_32, plain, ((x)|(f @ (~($true)))|~((epred2_0))), inference(cn,[status(thm)],[c_0_28])).
% 0.10/0.25 thf(c_0_33, plain, ((epred2_0)|~((f @ (~($true))))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_29, c_0_30]), c_0_31])).
% 0.10/0.25 thf(c_0_34, negated_conjecture, ((epred2_0)|(f @ (~($true)))|~((epred3_0))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.25 thf(c_0_35, plain, ((x)|~((epred2_0))), inference(spm,[status(thm)],[c_0_30, c_0_32])).
% 0.10/0.25 thf(c_0_36, negated_conjecture, ((epred2_0)|~((epred3_0))), inference(spm,[status(thm)],[c_0_33, c_0_34])).
% 0.10/0.25 thf(c_0_37, negated_conjecture, ((y)|(g @ (~($true)))|~((x))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.25 thf(c_0_38, negated_conjecture, (~((x))|~((y))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.25 thf(c_0_39, plain, (x), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_26])).
% 0.10/0.25 thf(c_0_40, plain, ((epred2_0)|~((x))|~((f @ (($true))))|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_24])).
% 0.10/0.25 thf(c_0_41, negated_conjecture, ((g @ (~($true)))|(y)), inference(csr,[status(thm)],[c_0_37, c_0_17])).
% 0.10/0.25 thf(c_0_42, negated_conjecture, ~((y)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38, c_0_39])])).
% 0.10/0.25 thf(c_0_43, plain, ((epred2_0)|~((x))|~((f @ (($true))))), inference(cn,[status(thm)],[c_0_40])).
% 0.10/0.25 thf(c_0_44, plain, ((f @ (($true)))|(epred3_0)|~((g @ (~($true))))|~((x))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.10/0.25 thf(c_0_45, negated_conjecture, (g @ (~($true))), inference(sr,[status(thm)],[c_0_41, c_0_42])).
% 0.10/0.25 thf(c_0_46, negated_conjecture, ((y)|~((x))|~((g @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.25 thf(c_0_47, plain, ((g @ (($true)))|~((x))|~((f @ (($true))))|~((epred3_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.10/0.25 thf(c_0_48, plain, ((epred2_0)|~((f @ (($true))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43, c_0_39])])).
% 0.10/0.25 thf(c_0_49, plain, ((f @ (($true)))|(epred3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44, c_0_39]), c_0_45])])).
% 0.10/0.25 thf(c_0_50, negated_conjecture, ((y)|~((g @ (($true))))), inference(csr,[status(thm)],[c_0_46, c_0_27])).
% 0.10/0.25 thf(c_0_51, plain, ((g @ (($true)))|~((f @ (($true))))|~((epred3_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47, c_0_39])])).
% 0.10/0.25 thf(c_0_52, negated_conjecture, ((epred3_0)|~((epred2_0))|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.25 thf(c_0_53, plain, (epred2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48, c_0_49]), c_0_36])).
% 0.10/0.25 thf(c_0_54, negated_conjecture, (~((f @ (($true))))|~((epred3_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_51]), c_0_42])).
% 0.10/0.25 thf(c_0_55, negated_conjecture, ((epred1_0)|(f @ (($true)))|~((epred3_0))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.25 thf(c_0_56, plain, ((f @ (($true)))|(f @ (~($true)))|~((x))|~((epred2_0))), inference(split_conjunct,[status(thm)],[c_0_24])).
% 0.10/0.25 thf(c_0_57, negated_conjecture, (epred3_0), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52, c_0_53])]), c_0_49])).
% 0.10/0.25 thf(c_0_58, negated_conjecture, ((epred1_0)|~((epred3_0))), inference(spm,[status(thm)],[c_0_54, c_0_55])).
% 0.10/0.25 thf(c_0_59, plain, ((f @ (~($true)))|(f @ (($true)))|~((epred2_0))), inference(csr,[status(thm)],[c_0_56, c_0_32])).
% 0.10/0.25 thf(c_0_60, negated_conjecture, ~((f @ (($true)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54, c_0_57])])).
% 0.10/0.25 thf(c_0_61, plain, ((f @ (($true)))|~((x))|~((f @ (~($true))))|~((epred1_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.10/0.25 thf(c_0_62, negated_conjecture, (epred1_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58, c_0_57])])).
% 0.10/0.25 thf(c_0_63, plain, (f @ (~($true))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59, c_0_53])]), c_0_60])).
% 0.10/0.25 thf(c_0_64, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61, c_0_39]), c_0_62]), c_0_63])]), c_0_60]), ['proof']).
% 0.10/0.25 % SZS output end CNFRefutation
% 0.10/0.25 % Parsed axioms : 6
% 0.10/0.25 % Removed by relevancy pruning/SinE : 0
% 0.10/0.25 % Initial clauses : 112
% 0.10/0.25 % Removed in clause preprocessing : 67
% 0.10/0.25 % Initial clauses in saturation : 45
% 0.10/0.25 % Processed clauses : 76
% 0.10/0.25 % ...of these trivial : 0
% 0.10/0.25 % ...subsumed : 21
% 0.10/0.25 % ...remaining for further processing : 54
% 0.10/0.25 % Other redundant clauses eliminated : 0
% 0.10/0.25 % Clauses deleted for lack of memory : 0
% 0.10/0.25 % Backward-subsumed : 21
% 0.10/0.25 % Backward-rewritten : 23
% 0.10/0.25 % Generated clauses : 66
% 0.10/0.25 % ...of the previous two non-redundant : 45
% 0.10/0.25 % ...aggressively subsumed : 0
% 0.10/0.25 % Contextual simplify-reflections : 19
% 0.10/0.25 % Paramodulations : 65
% 0.10/0.25 % Factorizations : 0
% 0.10/0.25 % NegExts : 0
% 0.10/0.25 % Equation resolutions : 0
% 0.10/0.25 % Disequality decompositions : 0
% 0.10/0.25 % Total rewrite steps : 29
% 0.10/0.25 % ...of those cached : 23
% 0.10/0.25 % Propositional unsat checks : 0
% 0.10/0.25 % Propositional check models : 0
% 0.10/0.25 % Propositional check unsatisfiable : 0
% 0.10/0.25 % Propositional clauses : 0
% 0.10/0.25 % Propositional clauses after purity: 0
% 0.10/0.25 % Propositional unsat core size : 0
% 0.10/0.25 % Propositional preprocessing time : 0.000
% 0.10/0.25 % Propositional encoding time : 0.000
% 0.10/0.25 % Propositional solver time : 0.000
% 0.10/0.25 % Success case prop preproc time : 0.000
% 0.10/0.25 % Success case prop encoding time : 0.000
% 0.10/0.25 % Success case prop solver time : 0.000
% 0.10/0.25 % Current number of processed clauses : 9
% 0.10/0.25 % Positive orientable unit clauses : 6
% 0.10/0.25 % Positive unorientable unit clauses: 0
% 0.10/0.25 % Negative unit clauses : 2
% 0.10/0.25 % Non-unit-clauses : 1
% 0.10/0.25 % Current number of unprocessed clauses: 6
% 0.10/0.25 % ...number of literals in the above : 24
% 0.10/0.25 % Current number of archived formulas : 0
% 0.10/0.25 % Current number of archived clauses : 45
% 0.10/0.25 % Clause-clause subsumption calls (NU) : 107
% 0.10/0.25 % Rec. Clause-clause subsumption calls : 97
% 0.10/0.25 % Non-unit clause-clause subsumptions : 57
% 0.10/0.25 % Unit Clause-clause subsumption calls : 15
% 0.10/0.25 % Rewrite failures with RHS unbound : 0
% 0.10/0.25 % BW rewrite match attempts : 5
% 0.10/0.25 % BW rewrite match successes : 5
% 0.10/0.25 % Condensation attempts : 0
% 0.10/0.25 % Condensation successes : 0
% 0.10/0.25 % Termbank termtop insertions : 4422
% 0.10/0.25 % Search garbage collected termcells : 696
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.006 s
% 0.10/0.25 % System time : 0.003 s
% 0.10/0.25 % Total time : 0.009 s
% 0.10/0.25 % Maximum resident set size: 3624 pages
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.011 s
% 0.10/0.25 % System time : 0.004 s
% 0.10/0.25 % Total time : 0.015 s
% 0.10/0.25 % Maximum resident set size: 4864 pages
% 0.10/0.25 % E exiting
%------------------------------------------------------------------------------