%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU874^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 : n010.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:25:52 AM UTC 2026
% Result : Theorem 0.29s 0.42s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU874^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.28 % Computer : n010.cluster.edu
% 0.11/0.28 % Model : x86_64 x86_64
% 0.11/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.28 % Memory : 8046.5625MB
% 0.11/0.28 % OS : Linux 6.8.0-71-generic
% 0.11/0.28 % CPULimit : 300
% 0.11/0.28 % WCLimit : 300
% 0.11/0.28 % DateTime : Tue Sep 29 14:42:33 UTC 2026
% 0.11/0.29 % CPUTime :
% 0.11/0.29 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.29/0.35 Running higher-order theorem proving
% 0.29/0.36 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.RwPcWT1dmG/E---3.1_2951024.p
% 0.29/0.42 % Version: 3.5.1-ho
% 0.29/0.42 % partial match(1): HSSSSMSSSSMNHHA
% 0.29/0.42 % Preprocessing class: HSSSSMSSSSMNHHN.
% 0.29/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.42 % Starting post_as_ho5 with 1500s (5) cores
% 0.29/0.42 % Starting sh2lt with 300s (1) cores
% 0.29/0.42 % Starting ehoh_best8_lambda with 300s (1) cores
% 0.29/0.42 % Starting post_as_ho10 with 300s (1) cores
% 0.29/0.42 % sh2lt with pid 2951038 completed with status 0
% 0.29/0.42 % Result found by sh2lt
% 0.29/0.42 % partial match(1): HSSSSMSSSSMNHHA
% 0.29/0.42 % Preprocessing class: HSSSSMSSSSMNHHN.
% 0.29/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.42 % Starting post_as_ho5 with 1500s (5) cores
% 0.29/0.42 % Starting sh2lt with 300s (1) cores
% 0.29/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.29/0.42 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.29/0.42 % Search class: HGHSF-FFSF11-SHHFFMBN
% 0.29/0.42 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.42 % SubtermCWHack with pid 2951047 completed with status 0
% 0.29/0.42 % Result found by SubtermCWHack
% 0.29/0.42 % partial match(1): HSSSSMSSSSMNHHA
% 0.29/0.42 % Preprocessing class: HSSSSMSSSSMNHHN.
% 0.29/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.42 % Starting post_as_ho5 with 1500s (5) cores
% 0.29/0.42 % Starting sh2lt with 300s (1) cores
% 0.29/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.29/0.42 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.29/0.42 % Search class: HGHSF-FFSF11-SHHFFMBN
% 0.29/0.42 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.42 % Preprocessing time : 0.002 s
% 0.29/0.42
% 0.29/0.42 % Proof found!
% 0.29/0.42 % SZS status Theorem
% 0.29/0.42 % SZS output start CNFRefutation
% 0.29/0.42 thf(decl_sort1, type, a: $tType).
% 0.29/0.42 thf(decl_23, type, cX: a > $o).
% 0.29/0.42 thf(decl_24, type, esk1_0: a).
% 0.29/0.42 thf(decl_25, type, epred1_1: (a > $o) > (a > $o) > $o).
% 0.29/0.42 thf(decl_26, type, esk2_1: (a > $o) > a).
% 0.29/0.42 thf(decl_27, type, epred2_0: a > $o).
% 0.29/0.42 thf(decl_28, type, epred3_1: ((a > $o) > $o) > a > $o).
% 0.29/0.42 thf(decl_29, type, esk3_1: ((a > $o) > $o) > a).
% 0.29/0.42 thf(decl_31, type, epred5_0: a > $o).
% 0.29/0.42 thf(decl_32, type, epred6_2: a > (a > $o) > a > $o).
% 0.29/0.42 thf(cDOMLEMMA3_pme, conjecture, ((cX)=(^[X1:a]:(?[X2:a > $o]:(((((![X3:(a > $o) > $o]:((((((X3 @ (^[X4:a]:(~($true)))))&(![X5:a > $o]:((((X3 @ X5))=>(![X6:a]:((((X2 @ X6))=>((X3 @ (^[X7:a]:((((X5 @ X7))|(((X6)=(X7))))))))))))))))=>((X3 @ X2)))))&(![X8:a]:((((X2 @ X8))=>((cX @ X8)))))))&((X2 @ X1))))))), file('/export/starexec/sandbox/tmp/tmp.RwPcWT1dmG/E---3.1_2951024.p', cDOMLEMMA3_pme)).
% 0.29/0.42 thf(c_0_1, negated_conjecture, ~(((cX)=(^[X1:a]:(?[X2:a > $o]:(((((![X3:(a > $o) > $o]:((((((X3 @ (^[X4:a]:(~($true)))))&(![X5:a > $o]:((((X3 @ X5))=>(![X6:a]:((((X2 @ X6))=>((X3 @ (^[X7:a]:((((X5 @ X7))|(((X6)=(X7))))))))))))))))=>((X3 @ X2)))))&(![X8:a]:((((X2 @ X8))=>((cX @ X8)))))))&((X2 @ X1)))))))), inference(assume_negation,[status(cth)],[cDOMLEMMA3_pme])).
% 0.29/0.42 thf(c_0_2, negated_conjecture, ~(![X9:a]:(((cX @ X9)<=>?[X2:a > $o]:(((![X3:(a > $o) > $o]:((((X3 @ (^[Z0:a]:(~($true))))&![X5:a > $o]:(((X3 @ X5)=>![X6:a]:(((X2 @ X6)=>(X3 @ (^[Z0:a]:(((X5 @ Z0)|(((X6)=(Z0))))))))))))=>(X3 @ X2)))&![X8:a]:(((X2 @ X8)=>(cX @ X8))))&(X2 @ X9)))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])).
% 0.29/0.42 thf(c_0_3, negated_conjecture, ![X11:a > $o, X13:a > $o, X14:a, X17:(a > $o) > $o, X20:a]:(((((((X11 @ (esk2_1 @ X11))|(epred1_1 @ X11 @ (^[Z0:a]:(~($true))))|~(X11 @ esk1_0)|~(cX @ esk1_0))&(~(cX @ (esk2_1 @ X11))|(epred1_1 @ X11 @ (^[Z0:a]:(~($true))))|~(X11 @ esk1_0)|~(cX @ esk1_0)))&(((X11 @ (esk2_1 @ X11))|(~(epred1_1 @ X11 @ X13)|(~(X11 @ X14)|(epred1_1 @ X11 @ (^[Z0:a]:(((X13 @ Z0)|(((X14)=(Z0)))))))))|~(X11 @ esk1_0)|~(cX @ esk1_0))&(~(cX @ (esk2_1 @ X11))|(~(epred1_1 @ X11 @ X13)|(~(X11 @ X14)|(epred1_1 @ X11 @ (^[Z0:a]:(((X13 @ Z0)|(((X14)=(Z0)))))))))|~(X11 @ esk1_0)|~(cX @ esk1_0))))&(((X11 @ (esk2_1 @ X11))|~(epred1_1 @ X11 @ X11)|~(X11 @ esk1_0)|~(cX @ esk1_0))&(~(cX @ (esk2_1 @ X11))|~(epred1_1 @ X11 @ X11)|~(X11 @ esk1_0)|~(cX @ esk1_0))))&(((((X17 @ (epred3_1 @ X17))|~(X17 @ (^[Z0:a]:(~($true))))|(X17 @ epred2_0)|(cX @ esk1_0))&(((epred2_0 @ (esk3_1 @ X17))|~(X17 @ (^[Z0:a]:(~($true))))|(X17 @ epred2_0)|(cX @ esk1_0))&(~(X17 @ (^[Z0:a]:(((epred3_1 @ X17 @ Z0)|(((esk3_1 @ X17)=(Z0)))))))|~(X17 @ (^[Z0:a]:(~($true))))|(X17 @ epred2_0)|(cX @ esk1_0))))&(~(epred2_0 @ X20)|(cX @ X20)|(cX @ esk1_0)))&((epred2_0 @ esk1_0)|(cX @ esk1_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.29/0.42 thf(c_0_4, plain, ![X22:a]:(((epred5_0 @ X22)<=>~(($true)))), introduced(definition)).
% 0.29/0.42 thf(c_0_5, plain, ![X34:a]:(((~(epred5_0 @ X34)|~($true))&(($true)|(epred5_0 @ X34)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.29/0.42 thf(c_0_6, plain, ![X31:a, X32:a > $o, X33:a]:(((~(epred6_2 @ X33 @ X32 @ X31)|((X32 @ X31)|((X33)=(X31))))&((~(X32 @ X31)|(epred6_2 @ X33 @ X32 @ X31))&(((X33)!=(X31))|(epred6_2 @ X33 @ X32 @ X31))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 0.29/0.42 thf(c_0_7, negated_conjecture, ![X2:a > $o]:(((X2 @ (esk2_1 @ X2))|(((epred1_1 @ X2 @ epred5_0))=(($true)))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.29/0.42 thf(c_0_8, plain, ![X25:a, X5:a > $o, X1:a]:(((epred6_2 @ X1 @ X5 @ X25)<=>((X5 @ X25)|((X1)=(X25))))), introduced(definition)).
% 0.29/0.42 thf(c_0_9, plain, ![X1:a]:((~((epred5_0 @ X1))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.29/0.42 thf(c_0_10, plain, ![X1:a, X2:a > $o, X4:a]:(((X2 @ X4)|((X1)=(X4))|~((epred6_2 @ X1 @ X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.29/0.42 thf(c_0_11, negated_conjecture, ![X2:a > $o]:(((epred1_1 @ X2 @ epred5_0)|(X2 @ (esk2_1 @ X2))|~((cX @ esk1_0))|~((X2 @ esk1_0)))), inference(cn,[status(thm)],[c_0_7])).
% 0.29/0.42 thf(c_0_12, negated_conjecture, ![X1:a, X5:a > $o, X2:a > $o]:(((X2 @ (esk2_1 @ X2))|(((epred1_1 @ X2 @ (epred6_2 @ X1 @ X5)))=(($true)))|~((epred1_1 @ X2 @ X5))|~((X2 @ X1))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_8])).
% 0.29/0.42 thf(c_0_13, negated_conjecture, ![X2:a > $o]:(((((epred1_1 @ X2 @ epred5_0))=(($true)))|~((cX @ (esk2_1 @ X2)))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.29/0.42 thf(c_0_14, plain, ![X1:a]:(~((epred5_0 @ X1))), inference(cn,[status(thm)],[c_0_9])).
% 0.29/0.42 thf(c_0_15, plain, ![X1:a, X2:a > $o]:((((esk2_1 @ (epred6_2 @ X1 @ X2))=(X1))|(epred1_1 @ (epred6_2 @ X1 @ X2) @ epred5_0)|(X2 @ (esk2_1 @ (epred6_2 @ X1 @ X2)))|~((epred6_2 @ X1 @ X2 @ esk1_0))|~((cX @ esk1_0)))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
% 0.29/0.42 thf(c_0_16, negated_conjecture, ![X5:a > $o, X2:a > $o, X1:a]:(((epred1_1 @ X2 @ (epred6_2 @ X1 @ X5))|(X2 @ (esk2_1 @ X2))|~((cX @ esk1_0))|~((epred1_1 @ X2 @ X5))|~((X2 @ esk1_0))|~((X2 @ X1)))), inference(cn,[status(thm)],[c_0_12])).
% 0.29/0.42 thf(c_0_17, negated_conjecture, ((epred2_0 @ esk1_0)|(cX @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.29/0.42 thf(c_0_18, negated_conjecture, ![X2:a > $o]:(((epred1_1 @ X2 @ epred5_0)|~((cX @ (esk2_1 @ X2)))|~((cX @ esk1_0))|~((X2 @ esk1_0)))), inference(cn,[status(thm)],[c_0_13])).
% 0.29/0.42 thf(c_0_19, plain, ![X1:a]:((((esk2_1 @ (epred6_2 @ X1 @ epred5_0))=(X1))|(epred1_1 @ (epred6_2 @ X1 @ epred5_0) @ epred5_0)|~((epred6_2 @ X1 @ epred5_0 @ esk1_0))|~((cX @ esk1_0)))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.29/0.42 thf(c_0_20, negated_conjecture, ![X5:a > $o, X2:a > $o, X1:a]:(((epred1_1 @ X2 @ (epred6_2 @ X1 @ X5))|(epred2_0 @ esk1_0)|(X2 @ (esk2_1 @ X2))|~((epred1_1 @ X2 @ X5))|~((X2 @ esk1_0))|~((X2 @ X1)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
% 0.29/0.42 thf(c_0_21, negated_conjecture, ![X1:a]:(((epred1_1 @ (epred6_2 @ X1 @ epred5_0) @ epred5_0)|~((epred6_2 @ X1 @ epred5_0 @ esk1_0))|~((cX @ esk1_0))|~((cX @ X1)))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
% 0.29/0.42 thf(c_0_22, plain, ![X1:a, X2:a > $o, X4:a]:(((epred6_2 @ X1 @ X2 @ X4)|((X1)!=(X4)))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.29/0.42 thf(c_0_23, negated_conjecture, ![X4:a, X1:a]:(((epred6_2 @ X1 @ epred5_0 @ (esk2_1 @ (epred6_2 @ X1 @ epred5_0)))|(epred1_1 @ (epred6_2 @ X1 @ epred5_0) @ (epred6_2 @ X4 @ epred5_0))|(epred2_0 @ esk1_0)|~((epred6_2 @ X1 @ epred5_0 @ esk1_0))|~((epred6_2 @ X1 @ epred5_0 @ X4))|~((cX @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_17])).
% 0.29/0.42 thf(c_0_24, plain, ![X2:a > $o, X1:a]:((epred6_2 @ X1 @ X2 @ X1)), inference(er,[status(thm)],[c_0_22])).
% 0.29/0.42 thf(c_0_25, plain, ![X1:a]:(((epred6_2 @ esk1_0 @ epred5_0 @ (esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0)))|(epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ X1 @ epred5_0))|(epred2_0 @ esk1_0)|~((epred6_2 @ esk1_0 @ epred5_0 @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_17])).
% 0.29/0.42 thf(c_0_26, negated_conjecture, ![X2:a > $o]:(((X2 @ (esk2_1 @ X2))|~((epred1_1 @ X2 @ X2))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.29/0.42 thf(c_0_27, plain, ((epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ esk1_0 @ epred5_0))|(epred6_2 @ esk1_0 @ epred5_0 @ (esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0)))|(epred2_0 @ esk1_0)), inference(spm,[status(thm)],[c_0_25, c_0_24])).
% 0.29/0.42 thf(c_0_28, plain, ![X1:a, X2:a > $o]:((((esk2_1 @ (epred6_2 @ X1 @ X2))=(X1))|(X2 @ (esk2_1 @ (epred6_2 @ X1 @ X2)))|~((epred1_1 @ (epred6_2 @ X1 @ X2) @ (epred6_2 @ X1 @ X2)))|~((epred6_2 @ X1 @ X2 @ esk1_0))|~((cX @ esk1_0)))), inference(spm,[status(thm)],[c_0_10, c_0_26])).
% 0.29/0.42 thf(c_0_29, plain, (((esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0))=(esk1_0))|(epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ esk1_0 @ epred5_0))|(epred2_0 @ esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_27]), c_0_14])).
% 0.29/0.42 thf(c_0_30, negated_conjecture, ![X2:a > $o]:((~((cX @ (esk2_1 @ X2)))|~((epred1_1 @ X2 @ X2))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.29/0.42 thf(c_0_31, plain, (((esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0))=(esk1_0))|(epred2_0 @ esk1_0)), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_24])]), c_0_14]), c_0_17])).
% 0.29/0.42 thf(c_0_32, negated_conjecture, ![X1:a, X5:a > $o, X2:a > $o]:(((((epred1_1 @ X2 @ (epred6_2 @ X1 @ X5)))=(($true)))|~((cX @ (esk2_1 @ X2)))|~((epred1_1 @ X2 @ X5))|~((X2 @ X1))|~((X2 @ esk1_0))|~((cX @ esk1_0)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_8])).
% 0.29/0.42 thf(c_0_33, negated_conjecture, ((epred2_0 @ esk1_0)|~((epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ esk1_0 @ epred5_0)))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_24])]), c_0_17])).
% 0.29/0.42 thf(c_0_34, negated_conjecture, ![X5:a > $o, X2:a > $o, X1:a]:(((epred1_1 @ X2 @ (epred6_2 @ X1 @ X5))|~((cX @ (esk2_1 @ X2)))|~((cX @ esk1_0))|~((epred1_1 @ X2 @ X5))|~((X2 @ esk1_0))|~((X2 @ X1)))), inference(cn,[status(thm)],[c_0_32])).
% 0.29/0.42 thf(c_0_35, negated_conjecture, ((epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ epred5_0)|(epred2_0 @ esk1_0)), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_31]), c_0_24])]), c_0_17])).
% 0.29/0.42 thf(c_0_36, negated_conjecture, ((epred2_0 @ esk1_0)|~((cX @ (esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0))))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_24])]), c_0_17]), c_0_35])).
% 0.29/0.42 thf(c_0_37, negated_conjecture, ![X1:a]:(((cX @ X1)|(cX @ esk1_0)|~((epred2_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.29/0.42 thf(c_0_38, plain, (epred2_0 @ esk1_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_31]), c_0_17])).
% 0.29/0.42 thf(c_0_39, negated_conjecture, (cX @ esk1_0), inference(spm,[status(thm)],[c_0_37, c_0_38])).
% 0.29/0.42 thf(c_0_40, negated_conjecture, ![X5:a > $o, X2:a > $o, X1:a]:(((epred1_1 @ X2 @ (epred6_2 @ X1 @ X5))|(X2 @ (esk2_1 @ X2))|~((epred1_1 @ X2 @ X5))|~((X2 @ esk1_0))|~((X2 @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_39])])).
% 0.29/0.42 thf(c_0_41, negated_conjecture, ![X1:a]:(((epred1_1 @ (epred6_2 @ X1 @ epred5_0) @ epred5_0)|~((epred6_2 @ X1 @ epred5_0 @ esk1_0))|~((cX @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_39])])).
% 0.29/0.42 thf(c_0_42, negated_conjecture, ![X4:a, X1:a]:(((epred6_2 @ X1 @ epred5_0 @ (esk2_1 @ (epred6_2 @ X1 @ epred5_0)))|(epred1_1 @ (epred6_2 @ X1 @ epred5_0) @ (epred6_2 @ X4 @ epred5_0))|~((epred6_2 @ X1 @ epred5_0 @ esk1_0))|~((epred6_2 @ X1 @ epred5_0 @ X4))|~((cX @ X1)))), inference(spm,[status(thm)],[c_0_40, c_0_41])).
% 0.29/0.42 thf(c_0_43, plain, ![X1:a]:(((epred6_2 @ esk1_0 @ epred5_0 @ (esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0)))|(epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ X1 @ epred5_0))|~((epred6_2 @ esk1_0 @ epred5_0 @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_24]), c_0_39])])).
% 0.29/0.42 thf(c_0_44, plain, ((epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ esk1_0 @ epred5_0))|(epred6_2 @ esk1_0 @ epred5_0 @ (esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0)))), inference(spm,[status(thm)],[c_0_43, c_0_24])).
% 0.29/0.42 thf(c_0_45, plain, ![X1:a, X2:a > $o]:((((esk2_1 @ (epred6_2 @ X1 @ X2))=(X1))|(X2 @ (esk2_1 @ (epred6_2 @ X1 @ X2)))|~((epred1_1 @ (epred6_2 @ X1 @ X2) @ (epred6_2 @ X1 @ X2)))|~((epred6_2 @ X1 @ X2 @ esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_39])])).
% 0.29/0.42 thf(c_0_46, plain, (((esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0))=(esk1_0))|(epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ esk1_0 @ epred5_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_44]), c_0_14])).
% 0.29/0.42 thf(c_0_47, negated_conjecture, ![X2:a > $o]:((~((cX @ (esk2_1 @ X2)))|~((epred1_1 @ X2 @ X2))|~((X2 @ esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30, c_0_39])])).
% 0.29/0.42 thf(c_0_48, plain, ((esk2_1 @ (epred6_2 @ esk1_0 @ epred5_0))=(esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_24])]), c_0_14])).
% 0.29/0.42 thf(c_0_49, negated_conjecture, ![X2:a > $o]:(((epred1_1 @ X2 @ epred5_0)|~((cX @ (esk2_1 @ X2)))|~((X2 @ esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_39])])).
% 0.29/0.42 thf(c_0_50, negated_conjecture, ~((epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ (epred6_2 @ esk1_0 @ epred5_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_48]), c_0_39]), c_0_24])])).
% 0.29/0.42 thf(c_0_51, negated_conjecture, ![X5:a > $o, X2:a > $o, X1:a]:(((epred1_1 @ X2 @ (epred6_2 @ X1 @ X5))|~((cX @ (esk2_1 @ X2)))|~((epred1_1 @ X2 @ X5))|~((X2 @ esk1_0))|~((X2 @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_39])])).
% 0.29/0.42 thf(c_0_52, negated_conjecture, (epred1_1 @ (epred6_2 @ esk1_0 @ epred5_0) @ epred5_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_48]), c_0_39]), c_0_24])])).
% 0.29/0.42 thf(c_0_53, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_51]), c_0_48]), c_0_39]), c_0_52]), c_0_24])]), ['proof']).
% 0.29/0.42 % SZS output end CNFRefutation
% 0.29/0.42 % Parsed axioms : 3
% 0.29/0.42 % Removed by relevancy pruning/SinE : 2
% 0.29/0.42 % Initial clauses : 19
% 0.29/0.42 % Removed in clause preprocessing : 1
% 0.29/0.42 % Initial clauses in saturation : 18
% 0.29/0.42 % Processed clauses : 106
% 0.29/0.42 % ...of these trivial : 0
% 0.29/0.42 % ...subsumed : 26
% 0.29/0.42 % ...remaining for further processing : 80
% 0.58/0.42 % Other redundant clauses eliminated : 2
% 0.58/0.42 % Clauses deleted for lack of memory : 0
% 0.58/0.42 % Backward-subsumed : 1
% 0.58/0.42 % Backward-rewritten : 41
% 0.58/0.42 % Generated clauses : 145
% 0.58/0.42 % ...of the previous two non-redundant : 131
% 0.58/0.42 % ...aggressively subsumed : 0
% 0.58/0.42 % Contextual simplify-reflections : 15
% 0.58/0.42 % Paramodulations : 143
% 0.58/0.42 % Factorizations : 0
% 0.58/0.42 % NegExts : 0
% 0.58/0.42 % Equation resolutions : 2
% 0.58/0.42 % Disequality decompositions : 0
% 0.58/0.42 % Total rewrite steps : 115
% 0.58/0.42 % ...of those cached : 106
% 0.58/0.42 % Propositional unsat checks : 0
% 0.58/0.42 % Propositional check models : 0
% 0.58/0.42 % Propositional check unsatisfiable : 0
% 0.58/0.42 % Propositional clauses : 0
% 0.58/0.42 % Propositional clauses after purity: 0
% 0.58/0.42 % Propositional unsat core size : 0
% 0.58/0.42 % Propositional preprocessing time : 0.000
% 0.58/0.42 % Propositional encoding time : 0.000
% 0.58/0.42 % Propositional solver time : 0.000
% 0.58/0.42 % Success case prop preproc time : 0.000
% 0.58/0.42 % Success case prop encoding time : 0.000
% 0.58/0.42 % Success case prop solver time : 0.000
% 0.58/0.42 % Current number of processed clauses : 36
% 0.58/0.42 % Positive orientable unit clauses : 7
% 0.58/0.42 % Positive unorientable unit clauses: 0
% 0.58/0.42 % Negative unit clauses : 3
% 0.58/0.42 % Non-unit-clauses : 26
% 0.58/0.42 % Current number of unprocessed clauses: 23
% 0.58/0.42 % ...number of literals in the above : 114
% 0.58/0.42 % Current number of archived formulas : 0
% 0.58/0.42 % Current number of archived clauses : 42
% 0.58/0.42 % Clause-clause subsumption calls (NU) : 1429
% 0.58/0.42 % Rec. Clause-clause subsumption calls : 444
% 0.58/0.42 % Non-unit clause-clause subsumptions : 36
% 0.58/0.42 % Unit Clause-clause subsumption calls : 9
% 0.58/0.42 % Rewrite failures with RHS unbound : 0
% 0.58/0.42 % BW rewrite match attempts : 4
% 0.58/0.42 % BW rewrite match successes : 3
% 0.58/0.42 % Condensation attempts : 0
% 0.58/0.42 % Condensation successes : 0
% 0.58/0.42 % Termbank termtop insertions : 6670
% 0.58/0.42 % Search garbage collected termcells : 506
% 0.58/0.42
% 0.58/0.42 % -------------------------------------------------
% 0.58/0.42 % User time : 0.027 s
% 0.58/0.42 % System time : 0.002 s
% 0.58/0.42 % Total time : 0.029 s
% 0.58/0.42 % Maximum resident set size: 3892 pages
% 0.58/0.42
% 0.58/0.42 % -------------------------------------------------
% 0.58/0.42 % User time : 0.032 s
% 0.58/0.42 % System time : 0.006 s
% 0.58/0.42 % Total time : 0.037 s
% 0.58/0.42 % Maximum resident set size: 4608 pages
% 0.58/0.42 % E exiting
%------------------------------------------------------------------------------