%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO040^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:42:12 AM UTC 2026
% Result : Theorem 0.23s 0.28s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO040^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n009.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 16:24:09 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.25 Running higher-order theorem proving
% 0.23/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.V7zewLaIVS/E---3.1_11105.p
% 0.23/0.28 % Version: 3.5.1-ho
% 0.23/0.28 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.28 % Starting ho_unfolding_6 with 300s (1) cores
% 0.23/0.28 % Starting sh4l with 300s (1) cores
% 0.23/0.28 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.23/0.28 % new_ho_10 with pid 11118 completed with status 0
% 0.23/0.28 % Result found by new_ho_10
% 0.23/0.28 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.28 % No SInE strategy applied
% 0.23/0.28 % Search class: HGHSF-FFMM11-SFFFFFNN
% 0.23/0.28 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.28 % Starting SubtermCWHack with 151s (1) cores
% 0.23/0.28 % Starting new_ho_10 with 901s (1) cores
% 0.23/0.28 % Starting sh5l with 151s (1) cores
% 0.23/0.28 % Starting new_bool_1 with 151s (1) cores
% 0.23/0.28 % Starting new_bool_9 with 146s (1) cores
% 0.23/0.28 % new_bool_1 with pid 11125 completed with status 0
% 0.23/0.28 % Result found by new_bool_1
% 0.23/0.28 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.23/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.28 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.28 % No SInE strategy applied
% 0.23/0.28 % Search class: HGHSF-FFMM11-SFFFFFNN
% 0.23/0.28 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.28 % Starting SubtermCWHack with 151s (1) cores
% 0.23/0.28 % Starting new_ho_10 with 901s (1) cores
% 0.23/0.28 % Starting sh5l with 151s (1) cores
% 0.23/0.28 % Starting new_bool_1 with 151s (1) cores
% 0.23/0.28 % Preprocessing time : 0.001 s
% 0.23/0.28 % Presaturation interreduction done
% 0.23/0.28
% 0.23/0.28 % Proof found!
% 0.23/0.28 % SZS status Theorem
% 0.23/0.28 % SZS output start CNFRefutation
% 0.23/0.28 thf(decl_23, type, f: $o > $o).
% 0.23/0.28 thf(decl_24, type, h: $o > $i).
% 0.23/0.28 thf(decl_25, type, x: $o).
% 0.23/0.28 thf(decl_26, type, epred1_0: $o).
% 0.23/0.28 thf(decl_27, type, epred2_0: $o).
% 0.23/0.28 thf(decl_28, type, epred3_0: $o).
% 0.23/0.28 thf(decl_29, type, epred4_0: $o).
% 0.23/0.28 thf(decl_30, type, epred5_0: $o).
% 0.23/0.28 thf(decl_31, type, epred6_0: $o).
% 0.23/0.28 thf(2, conjecture, ((h @ ((f @ ((f @ ((f @ ((x)))))))))=(h @ ((f @ ((x)))))), file('/export/starexec/sandbox/tmp/tmp.V7zewLaIVS/E---3.1_11105.p', 2)).
% 0.23/0.28 thf(c_0_1, plain, ((epred3_0)<=>(((((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|~(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|~(f @ $false)))|~(f @ $true))&(((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|(f @ $false)))|~(f @ $false)))|((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|((h @ $true)=(h @ $true)))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|((h @ $true)=(h @ $false)))))), introduced(definition)).
% 0.23/0.28 thf(c_0_2, plain, ((epred1_0)<=>(((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|~(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|~(f @ $false)))|~(f @ $true))), introduced(definition)).
% 0.23/0.28 thf(c_0_3, plain, ((epred2_0)<=>(((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|(f @ $false)))|~(f @ $false))), introduced(definition)).
% 0.23/0.28 thf(c_0_4, plain, ((((epred1_0)&(epred2_0))|((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|((h @ $true)=(h @ $true)))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|((h @ $true)=(h @ $false)))))=>(epred3_0)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_1]), c_0_2]), c_0_3])).
% 0.23/0.28 thf(c_0_5, plain, ((((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|(f @ $false)))|~(f @ $false))=>(epred2_0)), inference(split_equiv,[status(thm)],[c_0_3])).
% 0.23/0.28 thf(c_0_6, plain, ((~(epred1_0)|~(epred2_0)|(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))))&(((h @ $true)!=(h @ $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))))&(((h @ $true)!=(h @ $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))))&(((h @ $true)!=(h @ $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))))&(((h @ $true)!=(h @ $false))|((f @ $false)|(f @ $true))|(epred3_0)))))&((((~(x)|(x)|((h @ $true)!=(h @ $true))|(epred3_0))&(~(f @ $false)|(x)|((h @ $true)!=(h @ $true))|(epred3_0)))&((~(x)|~(f @ $true)|((h @ $true)!=(h @ $true))|(epred3_0))&(~(f @ $false)|~(f @ $true)|((h @ $true)!=(h @ $true))|(epred3_0))))&(((h @ $true)!=(h @ $false))|((h @ $true)!=(h @ $true))|(epred3_0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
% 0.23/0.28 thf(c_0_7, plain, ((((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|~(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|~(f @ $false)))|~(f @ $true))=>(epred1_0)), inference(split_equiv,[status(thm)],[c_0_2])).
% 0.23/0.28 thf(c_0_8, plain, ((((((((~(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))))&((f @ $false)|(epred2_0))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
% 0.23/0.28 thf(c_0_9, plain, ((epred4_0)<=>(((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|~(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|~(f @ $false)))|(f @ $true))), introduced(definition)).
% 0.23/0.28 thf(c_0_10, plain, ((epred5_0)<=>(((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|(f @ $false)))|(f @ $false))), introduced(definition)).
% 0.23/0.28 thf(c_0_11, plain, ((epred6_0)<=>(((((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|~(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|~(f @ $false)))|(f @ $true))&(((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|(f @ $false)))|(f @ $false)))|((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|((h @ $false)=(h @ $true)))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|((h @ $false)=(h @ $false)))))), introduced(definition)).
% 0.23/0.28 thf(c_0_12, negated_conjecture, ~(((h @ ((f @ ((f @ ((f @ ((x)))))))))=(h @ ((f @ ((x))))))), inference(assume_negation,[status(cth)],[2])).
% 0.23/0.28 thf(c_0_13, plain, ((epred3_0)|~((x))|~((f @ (($true))))|((h @ (($true)))!=(h @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.23/0.28 thf(c_0_14, plain, ((((((((~(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))))&((f @ $true)|(epred1_0))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
% 0.23/0.28 thf(c_0_15, plain, ((epred2_0)|~((f @ (~($true))))|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.28 thf(c_0_16, plain, ((f @ (~($true)))|(epred2_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.28 thf(c_0_17, plain, ((((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|~(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|~(f @ $false)))|(f @ $true))=>(epred4_0)), inference(split_equiv,[status(thm)],[c_0_9])).
% 0.23/0.28 thf(c_0_18, plain, ((((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|(f @ $false)))|(f @ $false))=>(epred5_0)), inference(split_equiv,[status(thm)],[c_0_10])).
% 0.23/0.28 thf(c_0_19, plain, ((((epred4_0)&(epred5_0))|((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|((h @ $false)=(h @ $true)))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|((h @ $false)=(h @ $false)))))=>(epred6_0)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_11]), c_0_9]), c_0_10])).
% 0.23/0.28 thf(c_0_20, negated_conjecture, ~(((epred3_0)&(epred6_0))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fool_unroll,[status(thm)],[c_0_12]), c_0_1]), c_0_11])).
% 0.23/0.28 thf(c_0_21, plain, ((epred3_0)|~((x))|~((f @ (($true))))), inference(cn,[status(thm)],[c_0_13])).
% 0.23/0.28 thf(c_0_22, plain, ((f @ (($true)))|(epred1_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.23/0.28 thf(c_0_23, plain, ((f @ (($true)))|(epred2_0)|~((f @ (~($true))))|~((x))), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.23/0.28 thf(c_0_24, plain, ((epred2_0)|~((f @ (($true))))), inference(csr,[status(thm)],[c_0_15, c_0_16])).
% 0.23/0.28 thf(c_0_25, plain, ((((((((~(x)|(x)|(~(x)|(x))|(epred4_0))&(~(f @ $false)|(x)|(~(x)|(x))|(epred4_0)))&((~(x)|~(f @ $true)|(~(x)|(x))|(epred4_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(x))|(epred4_0))))&((f @ $false)|(~(x)|(x))|(epred4_0)))&((((~(x)|(x)|((f @ $false)|(x))|(epred4_0))&(~(f @ $false)|(x)|((f @ $false)|(x))|(epred4_0)))&((~(x)|~(f @ $true)|((f @ $false)|(x))|(epred4_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(x))|(epred4_0))))&((f @ $false)|((f @ $false)|(x))|(epred4_0))))&(((((~(x)|(x)|(~(x)|(f @ $true))|(epred4_0))&(~(f @ $false)|(x)|(~(x)|(f @ $true))|(epred4_0)))&((~(x)|~(f @ $true)|(~(x)|(f @ $true))|(epred4_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(f @ $true))|(epred4_0))))&((f @ $false)|(~(x)|(f @ $true))|(epred4_0)))&((((~(x)|(x)|((f @ $false)|(f @ $true))|(epred4_0))&(~(f @ $false)|(x)|((f @ $false)|(f @ $true))|(epred4_0)))&((~(x)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred4_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred4_0))))&((f @ $false)|((f @ $false)|(f @ $true))|(epred4_0)))))&((((~(x)|(x)|(f @ $true)|(epred4_0))&(~(f @ $false)|(x)|(f @ $true)|(epred4_0)))&((~(x)|~(f @ $true)|(f @ $true)|(epred4_0))&(~(f @ $false)|~(f @ $true)|(f @ $true)|(epred4_0))))&((f @ $false)|(f @ $true)|(epred4_0))))&(~(f @ $true)|(epred4_0))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])).
% 0.23/0.28 thf(c_0_26, plain, ((((((((~(x)|(x)|(~(x)|(x))|(epred5_0))&(~(f @ $false)|(x)|(~(x)|(x))|(epred5_0)))&((~(x)|~(f @ $true)|(~(x)|(x))|(epred5_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(x))|(epred5_0))))&(~(f @ $false)|(~(x)|(x))|(epred5_0)))&((((~(x)|(x)|((f @ $false)|(x))|(epred5_0))&(~(f @ $false)|(x)|((f @ $false)|(x))|(epred5_0)))&((~(x)|~(f @ $true)|((f @ $false)|(x))|(epred5_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(x))|(epred5_0))))&(~(f @ $false)|((f @ $false)|(x))|(epred5_0))))&(((((~(x)|(x)|(~(x)|(f @ $true))|(epred5_0))&(~(f @ $false)|(x)|(~(x)|(f @ $true))|(epred5_0)))&((~(x)|~(f @ $true)|(~(x)|(f @ $true))|(epred5_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(f @ $true))|(epred5_0))))&(~(f @ $false)|(~(x)|(f @ $true))|(epred5_0)))&((((~(x)|(x)|((f @ $false)|(f @ $true))|(epred5_0))&(~(f @ $false)|(x)|((f @ $false)|(f @ $true))|(epred5_0)))&((~(x)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred5_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred5_0))))&(~(f @ $false)|((f @ $false)|(f @ $true))|(epred5_0)))))&((((~(x)|(x)|~(f @ $true)|(epred5_0))&(~(f @ $false)|(x)|~(f @ $true)|(epred5_0)))&((~(x)|~(f @ $true)|~(f @ $true)|(epred5_0))&(~(f @ $false)|~(f @ $true)|~(f @ $true)|(epred5_0))))&(~(f @ $false)|~(f @ $true)|(epred5_0))))&(~(f @ $false)|(epred5_0))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])).
% 0.23/0.28 thf(c_0_27, plain, ((~(epred4_0)|~(epred5_0)|(epred6_0))&(((((((~(x)|(x)|(~(x)|(x))|(epred6_0))&(~(f @ $false)|(x)|(~(x)|(x))|(epred6_0)))&((~(x)|~(f @ $true)|(~(x)|(x))|(epred6_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(x))|(epred6_0))))&(((h @ $false)!=(h @ $false))|(~(x)|(x))|(epred6_0)))&((((~(x)|(x)|((f @ $false)|(x))|(epred6_0))&(~(f @ $false)|(x)|((f @ $false)|(x))|(epred6_0)))&((~(x)|~(f @ $true)|((f @ $false)|(x))|(epred6_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(x))|(epred6_0))))&(((h @ $false)!=(h @ $false))|((f @ $false)|(x))|(epred6_0))))&(((((~(x)|(x)|(~(x)|(f @ $true))|(epred6_0))&(~(f @ $false)|(x)|(~(x)|(f @ $true))|(epred6_0)))&((~(x)|~(f @ $true)|(~(x)|(f @ $true))|(epred6_0))&(~(f @ $false)|~(f @ $true)|(~(x)|(f @ $true))|(epred6_0))))&(((h @ $false)!=(h @ $false))|(~(x)|(f @ $true))|(epred6_0)))&((((~(x)|(x)|((f @ $false)|(f @ $true))|(epred6_0))&(~(f @ $false)|(x)|((f @ $false)|(f @ $true))|(epred6_0)))&((~(x)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred6_0))&(~(f @ $false)|~(f @ $true)|((f @ $false)|(f @ $true))|(epred6_0))))&(((h @ $false)!=(h @ $false))|((f @ $false)|(f @ $true))|(epred6_0)))))&((((~(x)|(x)|((h @ $false)!=(h @ $true))|(epred6_0))&(~(f @ $false)|(x)|((h @ $false)!=(h @ $true))|(epred6_0)))&((~(x)|~(f @ $true)|((h @ $false)!=(h @ $true))|(epred6_0))&(~(f @ $false)|~(f @ $true)|((h @ $false)!=(h @ $true))|(epred6_0))))&(((h @ $false)!=(h @ $false))|((h @ $false)!=(h @ $true))|(epred6_0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])).
% 0.23/0.28 thf(c_0_28, negated_conjecture, (~(epred3_0)|~(epred6_0)), inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])).
% 0.23/0.28 thf(c_0_29, plain, ((epred3_0)|~((epred1_0))|~((epred2_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.23/0.28 thf(c_0_30, plain, ((epred1_0)|(epred3_0)|~((x))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
% 0.23/0.28 thf(c_0_31, plain, ((epred2_0)|~((x))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_23, c_0_16]), c_0_24])).
% 0.23/0.28 thf(c_0_32, plain, ((f @ (~($true)))|(f @ (~($true)))|(x)|(epred4_0)), inference(split_conjunct,[status(thm)],[c_0_25])).
% 0.23/0.28 thf(c_0_33, plain, ((epred5_0)|~((x))|~((f @ (($true))))|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_26])).
% 0.23/0.28 thf(c_0_34, plain, ((f @ (($true)))|(epred6_0)|((h @ (~($true)))!=(h @ (~($true))))|~((x))), inference(split_conjunct,[status(thm)],[c_0_27])).
% 0.23/0.28 thf(c_0_35, negated_conjecture, (~((epred3_0))|~((epred6_0))), inference(split_conjunct,[status(thm)],[c_0_28])).
% 0.23/0.28 thf(c_0_36, plain, ((epred3_0)|~((x))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31])).
% 0.23/0.28 thf(c_0_37, plain, ((x)|(f @ (($true)))|(epred4_0)|~((f @ (~($true))))), inference(split_conjunct,[status(thm)],[c_0_25])).
% 0.23/0.28 thf(c_0_38, plain, ((x)|(epred4_0)|(f @ (~($true)))), inference(cn,[status(thm)],[c_0_32])).
% 0.23/0.28 thf(c_0_39, plain, ((epred4_0)|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_25])).
% 0.23/0.28 thf(c_0_40, plain, ((epred5_0)|~((x))|~((f @ (($true))))), inference(cn,[status(thm)],[c_0_33])).
% 0.23/0.28 thf(c_0_41, plain, ((epred6_0)|(f @ (($true)))|~((x))), inference(cn,[status(thm)],[c_0_34])).
% 0.23/0.28 thf(c_0_42, negated_conjecture, (~((epred6_0))|~((x))), inference(spm,[status(thm)],[c_0_35, c_0_36])).
% 0.23/0.28 thf(c_0_43, plain, ((epred4_0)|(x)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_37, c_0_38]), c_0_39])).
% 0.23/0.28 thf(c_0_44, plain, ((epred6_0)|~((epred4_0))|~((epred5_0))), inference(split_conjunct,[status(thm)],[c_0_27])).
% 0.23/0.28 thf(c_0_45, plain, ((epred5_0)|~((x))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42])).
% 0.23/0.28 thf(c_0_46, plain, ((epred6_0)|(epred4_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_41]), c_0_43])).
% 0.23/0.28 thf(c_0_47, plain, ((f @ (~($true)))|(x)|(epred6_0)|((h @ (~($true)))!=(h @ (~($true))))), inference(split_conjunct,[status(thm)],[c_0_27])).
% 0.23/0.28 thf(c_0_48, plain, ~((x)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_45]), c_0_46]), c_0_42])).
% 0.23/0.28 thf(c_0_49, plain, ((x)|(epred6_0)|(f @ (~($true)))), inference(cn,[status(thm)],[c_0_47])).
% 0.23/0.28 thf(c_0_50, plain, (epred4_0), inference(sr,[status(thm)],[c_0_43, c_0_48])).
% 0.23/0.28 thf(c_0_51, plain, ((epred5_0)|~((f @ (~($true))))), inference(split_conjunct,[status(thm)],[c_0_26])).
% 0.23/0.28 thf(c_0_52, plain, ((f @ (~($true)))|(epred6_0)), inference(sr,[status(thm)],[c_0_49, c_0_48])).
% 0.23/0.28 thf(c_0_53, plain, ((epred6_0)|~((epred5_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44, c_0_50])])).
% 0.23/0.28 thf(c_0_54, plain, ((f @ (~($true)))|(f @ (~($true)))|(x)|(epred1_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.23/0.28 thf(c_0_55, plain, ((x)|(epred3_0)|~((f @ (~($true))))|((h @ (($true)))!=(h @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.23/0.28 thf(c_0_56, plain, (epred6_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_52]), c_0_53])).
% 0.23/0.28 thf(c_0_57, plain, ((x)|(epred1_0)|(f @ (~($true)))), inference(cn,[status(thm)],[c_0_54])).
% 0.23/0.28 thf(c_0_58, plain, ((x)|(epred3_0)|~((f @ (~($true))))), inference(cn,[status(thm)],[c_0_55])).
% 0.23/0.28 thf(c_0_59, negated_conjecture, ~((epred3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_56])])).
% 0.23/0.28 thf(c_0_60, plain, ((f @ (~($true)))|(epred1_0)), inference(sr,[status(thm)],[c_0_57, c_0_48])).
% 0.23/0.28 thf(c_0_61, plain, (epred2_0), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_16]), c_0_48]), c_0_59])).
% 0.23/0.28 thf(c_0_62, plain, (epred1_0), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_60]), c_0_48]), c_0_59])).
% 0.23/0.28 thf(c_0_63, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_61])]), c_0_59]), c_0_62])]), ['proof']).
% 0.23/0.28 % SZS output end CNFRefutation
% 0.23/0.28 % Parsed axioms : 4
% 0.23/0.28 % Removed by relevancy pruning/SinE : 0
% 0.23/0.28 % Initial clauses : 160
% 0.23/0.28 % Removed in clause preprocessing : 119
% 0.23/0.28 % Initial clauses in saturation : 41
% 0.23/0.28 % Processed clauses : 85
% 0.23/0.28 % ...of these trivial : 0
% 0.23/0.28 % ...subsumed : 20
% 0.23/0.28 % ...remaining for further processing : 64
% 0.23/0.28 % Other redundant clauses eliminated : 0
% 0.23/0.28 % Clauses deleted for lack of memory : 0
% 0.23/0.28 % Backward-subsumed : 14
% 0.23/0.28 % Backward-rewritten : 16
% 0.23/0.28 % Generated clauses : 73
% 0.23/0.28 % ...of the previous two non-redundant : 35
% 0.23/0.28 % ...aggressively subsumed : 0
% 0.23/0.28 % Contextual simplify-reflections : 13
% 0.23/0.28 % Paramodulations : 32
% 0.23/0.28 % Factorizations : 0
% 0.23/0.28 % NegExts : 0
% 0.23/0.28 % Equation resolutions : 0
% 0.23/0.28 % Disequality decompositions : 0
% 0.23/0.28 % Total rewrite steps : 17
% 0.23/0.28 % ...of those cached : 13
% 0.23/0.28 % Propositional unsat checks : 0
% 0.23/0.28 % Propositional check models : 0
% 0.23/0.28 % Propositional check unsatisfiable : 0
% 0.23/0.28 % Propositional clauses : 0
% 0.23/0.28 % Propositional clauses after purity: 0
% 0.23/0.28 % Propositional unsat core size : 0
% 0.23/0.28 % Propositional preprocessing time : 0.000
% 0.23/0.28 % Propositional encoding time : 0.000
% 0.23/0.28 % Propositional solver time : 0.000
% 0.23/0.28 % Success case prop preproc time : 0.000
% 0.23/0.28 % Success case prop encoding time : 0.000
% 0.23/0.28 % Success case prop solver time : 0.000
% 0.23/0.28 % Current number of processed clauses : 10
% 0.23/0.28 % Positive orientable unit clauses : 4
% 0.23/0.28 % Positive unorientable unit clauses: 0
% 0.23/0.28 % Negative unit clauses : 2
% 0.23/0.28 % Non-unit-clauses : 4
% 0.23/0.28 % Current number of unprocessed clauses: 10
% 0.23/0.28 % ...number of literals in the above : 31
% 0.23/0.28 % Current number of archived formulas : 0
% 0.23/0.28 % Current number of archived clauses : 54
% 0.23/0.28 % Clause-clause subsumption calls (NU) : 133
% 0.23/0.28 % Rec. Clause-clause subsumption calls : 116
% 0.23/0.28 % Non-unit clause-clause subsumptions : 40
% 0.23/0.28 % Unit Clause-clause subsumption calls : 14
% 0.23/0.28 % Rewrite failures with RHS unbound : 0
% 0.23/0.28 % BW rewrite match attempts : 4
% 0.23/0.28 % BW rewrite match successes : 4
% 0.23/0.28 % Condensation attempts : 0
% 0.23/0.28 % Condensation successes : 0
% 0.23/0.28 % Termbank termtop insertions : 5158
% 0.23/0.28 % Search garbage collected termcells : 1024
% 0.23/0.28
% 0.23/0.28 % -------------------------------------------------
% 0.23/0.28 % User time : 0.006 s
% 0.23/0.28 % System time : 0.002 s
% 0.23/0.28 % Total time : 0.008 s
% 0.23/0.28 % Maximum resident set size: 3624 pages
% 0.23/0.28
% 0.23/0.28 % -------------------------------------------------
% 0.23/0.28 % User time : 0.022 s
% 0.23/0.28 % System time : 0.009 s
% 0.23/0.28 % Total time : 0.031 s
% 0.23/0.28 % Maximum resident set size: 4608 pages
% 0.23/0.28 % E exiting
%------------------------------------------------------------------------------