%------------------------------------------------------------------------------
% File : E-SAT---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 : n007.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.24s 0.32s
% Output : CNFRefutation 0.24s
% 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.08/0.21 % Computer : n007.cluster.edu
% 0.08/0.21 % Model : x86_64 x86_64
% 0.08/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21 % Memory : 8046.5625MB
% 0.08/0.21 % OS : Linux 6.8.0-71-generic
% 0.08/0.21 % CPULimit : 300
% 0.08/0.21 % WCLimit : 300
% 0.08/0.21 % DateTime : Tue Sep 29 16:22:05 UTC 2026
% 0.08/0.21 % CPUTime :
% 0.08/0.21 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.28 Running higher-order theorem proving
% 0.24/0.29 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.2zcLahv9VJ/E---3.1_3579855.p
% 0.24/0.32 % Version: 3.5.1-ho
% 0.24/0.32 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.24/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.32 % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.32 % Starting ho_unfolding_6 with 300s (1) cores
% 0.24/0.32 % Starting sh4l with 300s (1) cores
% 0.24/0.32 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.24/0.32 % ho_unfolding_6 with pid 3579872 completed with status 0
% 0.24/0.32 % Result found by ho_unfolding_6
% 0.24/0.32 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.24/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.32 % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.32 % Starting ho_unfolding_6 with 300s (1) cores
% 0.24/0.32 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.32 % No SInE strategy applied
% 0.24/0.32 % Search class: HGHSF-FFMM11-SFFFFFNN
% 0.24/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.32 % SubtermCWHack with pid 3579875 completed with status 0
% 0.24/0.32 % Result found by SubtermCWHack
% 0.24/0.32 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.24/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.32 % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.32 % Starting ho_unfolding_6 with 300s (1) cores
% 0.24/0.32 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.32 % No SInE strategy applied
% 0.24/0.32 % Search class: HGHSF-FFMM11-SFFFFFNN
% 0.24/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.32 % Preprocessing time : 0.002 s
% 0.24/0.32
% 0.24/0.32 % Proof found!
% 0.24/0.32 % SZS status Theorem
% 0.24/0.32 % SZS output start CNFRefutation
% 0.24/0.32 thf(decl_23, type, f: $o > $o).
% 0.24/0.32 thf(decl_24, type, h: $o > $i).
% 0.24/0.32 thf(decl_25, type, x: $o).
% 0.24/0.32 thf(decl_26, type, epred1_0: $o).
% 0.24/0.32 thf(decl_27, type, epred2_0: $o).
% 0.24/0.32 thf(decl_28, type, epred3_0: $o).
% 0.24/0.32 thf(decl_29, type, epred4_0: $o).
% 0.24/0.32 thf(decl_30, type, epred5_0: $o).
% 0.24/0.32 thf(decl_31, type, epred6_0: $o).
% 0.24/0.32 thf(2, conjecture, ((h @ ((f @ ((f @ ((f @ ((x)))))))))=(h @ ((f @ ((x)))))), file('/export/starexec/sandbox/tmp/tmp.2zcLahv9VJ/E---3.1_3579855.p', 2)).
% 0.24/0.32 thf(c_0_1, 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.24/0.32 thf(c_0_2, plain, ((epred4_0)<=>(((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|~(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|~(f @ $false)))|(f @ $true))), introduced(definition)).
% 0.24/0.32 thf(c_0_3, plain, ((epred5_0)<=>(((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|(f @ $false)))|(f @ $false))), introduced(definition)).
% 0.24/0.32 thf(c_0_4, 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_1]), c_0_2]), c_0_3])).
% 0.24/0.32 thf(c_0_5, 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.24/0.32 thf(c_0_6, plain, ((epred1_0)<=>(((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|~(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|~(f @ $false)))|~(f @ $true))), introduced(definition)).
% 0.24/0.32 thf(c_0_7, plain, ((epred2_0)<=>(((((~(x)|~(f @ $true))&((x)|~(f @ $false)))|(f @ $true))&(((~(x)|(f @ $true))&((x)|(f @ $false)))|(f @ $false)))|~(f @ $false))), introduced(definition)).
% 0.24/0.32 thf(c_0_8, 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_3])).
% 0.24/0.32 thf(c_0_9, 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_4])])])).
% 0.24/0.32 thf(c_0_10, 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_5]), c_0_6]), c_0_7])).
% 0.24/0.32 thf(c_0_11, 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_6])).
% 0.24/0.32 thf(c_0_12, 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_8])])])).
% 0.24/0.32 thf(c_0_13, plain, ((f @ (~($true)))|(x)|(epred6_0)|((h @ (~($true)))!=(h @ (~($true))))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.24/0.32 thf(c_0_14, 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_10])])])).
% 0.24/0.32 thf(c_0_15, 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_11])])])).
% 0.24/0.32 thf(c_0_16, 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_7])).
% 0.24/0.32 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_2])).
% 0.24/0.32 thf(c_0_18, plain, ((epred5_0)|~((x))|~((f @ (($true))))|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.24/0.32 thf(c_0_19, plain, ((f @ (($true)))|(epred6_0)|((h @ (~($true)))!=(h @ (~($true))))|~((x))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.24/0.32 thf(c_0_20, plain, ((epred5_0)|~((f @ (~($true))))), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.24/0.32 thf(c_0_21, plain, ((x)|(epred6_0)|(f @ (~($true)))), inference(cn,[status(thm)],[c_0_13])).
% 0.24/0.32 thf(c_0_22, plain, ((x)|(epred3_0)|~((f @ (~($true))))|((h @ (($true)))!=(h @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.24/0.32 thf(c_0_23, plain, ((f @ (~($true)))|(f @ (~($true)))|(x)|(epred1_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
% 0.24/0.32 thf(c_0_24, 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_16])])])).
% 0.24/0.32 thf(c_0_25, negated_conjecture, ~(((h @ ((f @ ((f @ ((f @ ((x)))))))))=(h @ ((f @ ((x))))))), inference(assume_negation,[status(cth)],[2])).
% 0.24/0.32 thf(c_0_26, 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.24/0.32 thf(c_0_27, plain, ((epred5_0)|~((x))|~((f @ (($true))))), inference(cn,[status(thm)],[c_0_18])).
% 0.24/0.32 thf(c_0_28, plain, ((epred6_0)|(f @ (($true)))|~((x))), inference(cn,[status(thm)],[c_0_19])).
% 0.24/0.32 thf(c_0_29, plain, ((x)|(epred6_0)|(epred5_0)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
% 0.24/0.32 thf(c_0_30, plain, ((x)|(epred3_0)|~((f @ (~($true))))), inference(cn,[status(thm)],[c_0_22])).
% 0.24/0.32 thf(c_0_31, plain, ((x)|(epred1_0)|(f @ (~($true)))), inference(cn,[status(thm)],[c_0_23])).
% 0.24/0.32 thf(c_0_32, plain, ((f @ (~($true)))|(epred2_0)), inference(split_conjunct,[status(thm)],[c_0_24])).
% 0.24/0.32 thf(c_0_33, negated_conjecture, ~(((epred3_0)&(epred6_0))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fool_unroll,[status(thm)],[c_0_25]), c_0_5]), c_0_1])).
% 0.24/0.32 thf(c_0_34, plain, ((f @ (~($true)))|(f @ (($true)))|(epred4_0)), inference(split_conjunct,[status(thm)],[c_0_26])).
% 0.24/0.32 thf(c_0_35, plain, ((epred4_0)|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_26])).
% 0.24/0.32 thf(c_0_36, plain, ((epred6_0)|~((epred4_0))|~((epred5_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.24/0.32 thf(c_0_37, plain, ((epred6_0)|(epred5_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29])).
% 0.24/0.32 thf(c_0_38, plain, ((epred3_0)|~((x))|~((f @ (($true))))|((h @ (($true)))!=(h @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.24/0.32 thf(c_0_39, plain, ((epred3_0)|~((epred1_0))|~((epred2_0))), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.24/0.32 thf(c_0_40, plain, ((epred1_0)|(x)|(epred3_0)), inference(spm,[status(thm)],[c_0_30, c_0_31])).
% 0.24/0.32 thf(c_0_41, plain, ((epred2_0)|(x)|(epred3_0)), inference(spm,[status(thm)],[c_0_30, c_0_32])).
% 0.24/0.32 thf(c_0_42, negated_conjecture, (~(epred3_0)|~(epred6_0)), inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])).
% 0.24/0.32 thf(c_0_43, plain, ((x)|(f @ (($true)))|(epred4_0)|~((f @ (~($true))))), inference(split_conjunct,[status(thm)],[c_0_26])).
% 0.24/0.32 thf(c_0_44, plain, ((f @ (~($true)))|(epred4_0)), inference(csr,[status(thm)],[c_0_34, c_0_35])).
% 0.24/0.32 thf(c_0_45, plain, ((epred6_0)|~((epred4_0))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
% 0.24/0.32 thf(c_0_46, plain, ((epred6_0)|(epred4_0)|~((x))), inference(spm,[status(thm)],[c_0_35, c_0_28])).
% 0.24/0.32 thf(c_0_47, plain, ((epred3_0)|~((x))|~((f @ (($true))))), inference(cn,[status(thm)],[c_0_38])).
% 0.24/0.32 thf(c_0_48, plain, ((x)|(epred3_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_41])).
% 0.24/0.32 thf(c_0_49, plain, ((epred2_0)|~((f @ (~($true))))|~((f @ (($true))))), inference(split_conjunct,[status(thm)],[c_0_24])).
% 0.24/0.32 thf(c_0_50, negated_conjecture, (~((epred3_0))|~((epred6_0))), inference(split_conjunct,[status(thm)],[c_0_42])).
% 0.24/0.32 thf(c_0_51, plain, ((epred4_0)|(x)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_43, c_0_44]), c_0_35])).
% 0.24/0.32 thf(c_0_52, plain, ((epred6_0)|~((x))), inference(spm,[status(thm)],[c_0_45, c_0_46])).
% 0.24/0.32 thf(c_0_53, plain, ((epred3_0)|~((f @ (($true))))), inference(csr,[status(thm)],[c_0_47, c_0_48])).
% 0.24/0.32 thf(c_0_54, plain, ((f @ (($true)))|(epred1_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
% 0.24/0.32 thf(c_0_55, plain, ((f @ (($true)))|(epred2_0)|~((f @ (~($true))))|~((x))), inference(split_conjunct,[status(thm)],[c_0_24])).
% 0.24/0.32 thf(c_0_56, plain, ((epred2_0)|~((f @ (($true))))), inference(csr,[status(thm)],[c_0_49, c_0_32])).
% 0.24/0.32 thf(c_0_57, negated_conjecture, ((x)|~((epred6_0))), inference(spm,[status(thm)],[c_0_50, c_0_48])).
% 0.24/0.32 thf(c_0_58, plain, (epred6_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_51]), c_0_52])).
% 0.24/0.32 thf(c_0_59, plain, ((epred1_0)|(epred3_0)), inference(spm,[status(thm)],[c_0_53, c_0_54])).
% 0.24/0.32 thf(c_0_60, plain, ((epred2_0)|~((x))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_55, c_0_32]), c_0_56])).
% 0.24/0.32 thf(c_0_61, negated_conjecture, (x), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57, c_0_58])])).
% 0.24/0.32 thf(c_0_62, plain, ((epred3_0)|~((epred2_0))), inference(spm,[status(thm)],[c_0_39, c_0_59])).
% 0.24/0.32 thf(c_0_63, plain, (epred2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60, c_0_61])])).
% 0.24/0.32 thf(c_0_64, negated_conjecture, ~((epred3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50, c_0_58])])).
% 0.24/0.32 thf(c_0_65, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62, c_0_63])]), c_0_64]), ['proof']).
% 0.24/0.32 % SZS output end CNFRefutation
% 0.24/0.32 % Parsed axioms : 4
% 0.24/0.32 % Removed by relevancy pruning/SinE : 0
% 0.24/0.32 % Initial clauses : 160
% 0.24/0.32 % Removed in clause preprocessing : 119
% 0.24/0.32 % Initial clauses in saturation : 41
% 0.24/0.32 % Processed clauses : 70
% 0.24/0.32 % ...of these trivial : 1
% 0.24/0.32 % ...subsumed : 14
% 0.24/0.32 % ...remaining for further processing : 55
% 0.24/0.32 % Other redundant clauses eliminated : 0
% 0.24/0.32 % Clauses deleted for lack of memory : 0
% 0.24/0.32 % Backward-subsumed : 22
% 0.24/0.32 % Backward-rewritten : 20
% 0.24/0.32 % Generated clauses : 45
% 0.24/0.32 % ...of the previous two non-redundant : 43
% 0.24/0.32 % ...aggressively subsumed : 0
% 0.24/0.32 % Contextual simplify-reflections : 12
% 0.24/0.32 % Paramodulations : 43
% 0.24/0.32 % Factorizations : 0
% 0.24/0.32 % NegExts : 0
% 0.24/0.32 % Equation resolutions : 0
% 0.24/0.32 % Disequality decompositions : 0
% 0.24/0.32 % Total rewrite steps : 21
% 0.24/0.32 % ...of those cached : 17
% 0.24/0.32 % Propositional unsat checks : 0
% 0.24/0.32 % Propositional check models : 0
% 0.24/0.32 % Propositional check unsatisfiable : 0
% 0.24/0.32 % Propositional clauses : 0
% 0.24/0.32 % Propositional clauses after purity: 0
% 0.24/0.32 % Propositional unsat core size : 0
% 0.24/0.32 % Propositional preprocessing time : 0.000
% 0.24/0.32 % Propositional encoding time : 0.000
% 0.24/0.32 % Propositional solver time : 0.000
% 0.24/0.32 % Success case prop preproc time : 0.000
% 0.24/0.32 % Success case prop encoding time : 0.000
% 0.24/0.32 % Success case prop solver time : 0.000
% 0.24/0.32 % Current number of processed clauses : 11
% 0.24/0.32 % Positive orientable unit clauses : 4
% 0.24/0.32 % Positive unorientable unit clauses: 0
% 0.24/0.32 % Negative unit clauses : 1
% 0.24/0.32 % Non-unit-clauses : 6
% 0.24/0.32 % Current number of unprocessed clauses: 10
% 0.24/0.32 % ...number of literals in the above : 38
% 0.24/0.32 % Current number of archived formulas : 0
% 0.24/0.32 % Current number of archived clauses : 44
% 0.24/0.32 % Clause-clause subsumption calls (NU) : 121
% 0.24/0.32 % Rec. Clause-clause subsumption calls : 114
% 0.24/0.32 % Non-unit clause-clause subsumptions : 46
% 0.24/0.32 % Unit Clause-clause subsumption calls : 9
% 0.24/0.32 % Rewrite failures with RHS unbound : 0
% 0.24/0.32 % BW rewrite match attempts : 4
% 0.24/0.32 % BW rewrite match successes : 4
% 0.24/0.32 % Condensation attempts : 0
% 0.24/0.32 % Condensation successes : 0
% 0.24/0.32 % Termbank termtop insertions : 5186
% 0.24/0.32 % Search garbage collected termcells : 1024
% 0.24/0.32
% 0.24/0.32 % -------------------------------------------------
% 0.24/0.32 % User time : 0.012 s
% 0.24/0.32 % System time : 0.000 s
% 0.24/0.32 % Total time : 0.012 s
% 0.24/0.32 % Maximum resident set size: 3624 pages
% 0.24/0.32
% 0.24/0.32 % -------------------------------------------------
% 0.24/0.32 % User time : 0.014 s
% 0.24/0.32 % System time : 0.005 s
% 0.24/0.32 % Total time : 0.019 s
% 0.24/0.32 % Maximum resident set size: 4608 pages
% 0.24/0.32 % E exiting
%------------------------------------------------------------------------------