%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV028^5 : TPTP v9.3.1. Released v4.0.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:34:45 AM UTC 2026
% Result : Theorem 0.05s 0.25s
% Output : CNFRefutation 0.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV028^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.05/0.17 % Computer : n026.cluster.edu
% 0.05/0.17 % Model : x86_64 x86_64
% 0.05/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.17 % Memory : 8046.5625MB
% 0.05/0.17 % OS : Linux 6.8.0-71-generic
% 0.05/0.17 % CPULimit : 300
% 0.05/0.17 % WCLimit : 300
% 0.05/0.17 % DateTime : Tue Sep 29 15:07:02 UTC 2026
% 0.05/0.18 % CPUTime :
% 0.05/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.05/0.22 Running higher-order theorem proving
% 0.05/0.23 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.6aypaqOMue/E---3.1_713254.p
% 0.05/0.25 % Version: 3.5.1-ho
% 0.05/0.25 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.05/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.05/0.25 % Starting post_as_ho1 with 1500s (5) cores
% 0.05/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.05/0.25 % Starting new_ho_3 with 300s (1) cores
% 0.05/0.25 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.05/0.25 % new_ho_3 with pid 713269 completed with status 0
% 0.05/0.25 % Result found by new_ho_3
% 0.05/0.25 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.05/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.05/0.25 % Starting post_as_ho1 with 1500s (5) cores
% 0.05/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.05/0.25 % Starting new_ho_3 with 300s (1) cores
% 0.05/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.05/0.25 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.05/0.25 % Search class: HGHSF-FFSF21-SSSFFSBN
% 0.05/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.05/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.05/0.25 % SubtermCWHack with pid 713273 completed with status 0
% 0.05/0.25 % Result found by SubtermCWHack
% 0.05/0.25 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.05/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.05/0.25 % Starting post_as_ho1 with 1500s (5) cores
% 0.05/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.05/0.25 % Starting new_ho_3 with 300s (1) cores
% 0.05/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.05/0.25 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.05/0.25 % Search class: HGHSF-FFSF21-SSSFFSBN
% 0.05/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.05/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.05/0.25 % Preprocessing time : 0.001 s
% 0.05/0.25
% 0.05/0.25 % Proof found!
% 0.05/0.25 % SZS status Theorem
% 0.05/0.25 % SZS output start CNFRefutation
% 0.05/0.25 thf(decl_sort1, type, a: $tType).
% 0.05/0.25 thf(decl_23, type, cQ: a > a > $o).
% 0.05/0.25 thf(decl_24, type, epred1_0: $o).
% 0.05/0.25 thf(decl_25, type, esk1_0: a).
% 0.05/0.25 thf(decl_26, type, esk2_0: a).
% 0.05/0.25 thf(decl_27, type, esk3_0: a).
% 0.05/0.25 thf(decl_28, type, esk4_0: a).
% 0.05/0.25 thf(decl_29, type, esk5_0: a).
% 0.05/0.25 thf(decl_30, type, esk6_0: a).
% 0.05/0.25 thf(decl_31, type, esk7_1: (a > $o) > a).
% 0.05/0.25 thf(decl_32, type, esk8_1: (a > $o) > a).
% 0.05/0.25 thf(decl_33, type, esk9_1: (a > $o) > a).
% 0.05/0.25 thf(decl_34, type, epred2_1: a > a > $o).
% 0.05/0.25 thf(decl_35, type, esk10_1: a > a).
% 0.05/0.25 thf(decl_36, type, esk11_2: a > (a > $o) > a).
% 0.05/0.25 thf(decl_37, type, esk12_2: a > (a > $o) > a).
% 0.05/0.25 thf(cTHM558_pme, conjecture, ((![X1:a > $o]:(((?[X2:a]:((X1 @ X2))&![X3:a]:(((X1 @ X3)=>![X4:a]:(((X1 @ X4)<=>(cQ @ X3 @ X4))))))=>?[X2:a]:((X1 @ X2))))&![X3:a]:(?[X1:a > $o]:((((?[X2:a]:((X1 @ X2))&![X5:a]:(((X1 @ X5)=>![X4:a]:(((X1 @ X4)<=>(cQ @ X5 @ X4))))))&(X1 @ X3))&![X6:a > $o]:((((?[X2:a]:((X6 @ X2))&![X5:a]:(((X6 @ X5)=>![X4:a]:(((X6 @ X4)<=>(cQ @ X5 @ X4))))))&(X6 @ X3))=>((X6)=(X1))))))))=>((![X3:a]:((cQ @ X3 @ X3))&![X3:a, X4:a]:(((cQ @ X3 @ X4)=>(cQ @ X4 @ X3))))&![X3:a, X4:a, X2:a]:((((cQ @ X3 @ X4)&(cQ @ X4 @ X2))=>(cQ @ X3 @ X2))))), file('/export/starexec/sandbox2/tmp/tmp.6aypaqOMue/E---3.1_713254.p', cTHM558_pme)).
% 0.05/0.25 thf(c_0_1, plain, ((epred1_0)<=>(![X1:a > $o]:(((?[X2:a]:((X1 @ X2))&![X3:a]:(((X1 @ X3)=>![X4:a]:(((X1 @ X4)<=>(cQ @ X3 @ X4))))))=>?[X2:a]:((X1 @ X2))))&![X3:a]:(?[X1:a > $o]:((((?[X2:a]:((X1 @ X2))&![X5:a]:(((X1 @ X5)=>![X4:a]:(((X1 @ X4)<=>(cQ @ X5 @ X4))))))&(X1 @ X3))&![X6:a > $o]:((((?[X2:a]:((X6 @ X2))&![X5:a]:(((X6 @ X5)=>![X4:a]:(((X6 @ X4)<=>(cQ @ X5 @ X4))))))&(X6 @ X3))=>((X6)=(X1))))))))), introduced(definition)).
% 0.05/0.25 thf(c_0_2, negated_conjecture, ~(((![X1:a > $o]:(((?[X2:a]:((X1 @ X2))&![X3:a]:(((X1 @ X3)=>![X4:a]:(((X1 @ X4)<=>(cQ @ X3 @ X4))))))=>?[X2:a]:((X1 @ X2))))&![X3:a]:(?[X1:a > $o]:((((?[X2:a]:((X1 @ X2))&![X5:a]:(((X1 @ X5)=>![X4:a]:(((X1 @ X4)<=>(cQ @ X5 @ X4))))))&(X1 @ X3))&![X6:a > $o]:((((?[X2:a]:((X6 @ X2))&![X5:a]:(((X6 @ X5)=>![X4:a]:(((X6 @ X4)<=>(cQ @ X5 @ X4))))))&(X6 @ X3))=>((X6)=(X1))))))))=>((![X3:a]:((cQ @ X3 @ X3))&![X3:a, X4:a]:(((cQ @ X3 @ X4)=>(cQ @ X4 @ X3))))&![X3:a, X4:a, X2:a]:((((cQ @ X3 @ X4)&(cQ @ X4 @ X2))=>(cQ @ X3 @ X2)))))), inference(assume_negation,[status(cth)],[cTHM558_pme])).
% 0.05/0.25 thf(c_0_3, plain, ((epred1_0)=>(![X1:a > $o]:(((?[X2:a]:((X1 @ X2))&![X3:a]:(((X1 @ X3)=>![X4:a]:(((X1 @ X4)<=>(cQ @ X3 @ X4))))))=>?[X2:a]:((X1 @ X2))))&![X3:a]:(?[X1:a > $o]:((((?[X2:a]:((X1 @ X2))&![X5:a]:(((X1 @ X5)=>![X4:a]:(((X1 @ X4)<=>(cQ @ X5 @ X4))))))&(X1 @ X3))&![X6:a > $o]:((((?[X2:a]:((X6 @ X2))&![X5:a]:(((X6 @ X5)=>![X4:a]:(((X6 @ X4)<=>(cQ @ X5 @ X4))))))&(X6 @ X3))=>((X6)=(X1))))))))), inference(split_equiv,[status(thm)],[c_0_1])).
% 0.05/0.25 thf(c_0_4, negated_conjecture, ~(((epred1_0)=>((![X3:a]:((cQ @ X3 @ X3))&![X3:a, X4:a]:(((cQ @ X3 @ X4)=>(cQ @ X4 @ X3))))&![X3:a, X4:a, X2:a]:((((cQ @ X3 @ X4)&(cQ @ X4 @ X2))=>(cQ @ X3 @ X2)))))), inference(apply_def,[status(thm)],[c_0_2, c_0_1])).
% 0.05/0.25 thf(c_0_5, plain, ![X33:a > $o, X34:a, X38:a, X41:a, X42:a, X43:a, X44:a > $o, X45:a]:(((((X33 @ (esk7_1 @ X33))|~(X33 @ X34)|(X33 @ (esk9_1 @ X33))|~(epred1_0))&((~(X33 @ (esk8_1 @ X33))|~(cQ @ (esk7_1 @ X33) @ (esk8_1 @ X33))|~(X33 @ X34)|(X33 @ (esk9_1 @ X33))|~(epred1_0))&((X33 @ (esk8_1 @ X33))|(cQ @ (esk7_1 @ X33) @ (esk8_1 @ X33))|~(X33 @ X34)|(X33 @ (esk9_1 @ X33))|~(epred1_0))))&(((((epred2_1 @ X38 @ (esk10_1 @ X38))|~(epred1_0))&((~(epred2_1 @ X38 @ X42)|(cQ @ X41 @ X42)|~(epred2_1 @ X38 @ X41)|~(epred1_0))&(~(cQ @ X41 @ X43)|(epred2_1 @ X38 @ X43)|~(epred2_1 @ X38 @ X41)|~(epred1_0))))&((epred2_1 @ X38 @ X38)|~(epred1_0)))&(((X44 @ (esk11_2 @ X38 @ X44))|~(X44 @ X45)|~(X44 @ X38)|((X44)=(epred2_1 @ X38))|~(epred1_0))&((~(X44 @ (esk12_2 @ X38 @ X44))|~(cQ @ (esk11_2 @ X38 @ X44) @ (esk12_2 @ X38 @ X44))|~(X44 @ X45)|~(X44 @ X38)|((X44)=(epred2_1 @ X38))|~(epred1_0))&((X44 @ (esk12_2 @ X38 @ X44))|(cQ @ (esk11_2 @ X38 @ X44) @ (esk12_2 @ X38 @ X44))|~(X44 @ X45)|~(X44 @ X38)|((X44)=(epred2_1 @ X38))|~(epred1_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(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])])).
% 0.05/0.25 thf(c_0_6, negated_conjecture, ((epred1_0)&(((((cQ @ esk4_0 @ esk5_0)|((cQ @ esk2_0 @ esk3_0)|~(cQ @ esk1_0 @ esk1_0)))&((cQ @ esk5_0 @ esk6_0)|((cQ @ esk2_0 @ esk3_0)|~(cQ @ esk1_0 @ esk1_0))))&(~(cQ @ esk4_0 @ esk6_0)|((cQ @ esk2_0 @ esk3_0)|~(cQ @ esk1_0 @ esk1_0))))&((((cQ @ esk4_0 @ esk5_0)|(~(cQ @ esk3_0 @ esk2_0)|~(cQ @ esk1_0 @ esk1_0)))&((cQ @ esk5_0 @ esk6_0)|(~(cQ @ esk3_0 @ esk2_0)|~(cQ @ esk1_0 @ esk1_0))))&(~(cQ @ esk4_0 @ esk6_0)|(~(cQ @ esk3_0 @ esk2_0)|~(cQ @ esk1_0 @ esk1_0)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])).
% 0.05/0.25 thf(c_0_7, plain, ![X2:a, X3:a, X4:a]:(((cQ @ X4 @ X3)|~((epred2_1 @ X2 @ X3))|~((epred2_1 @ X2 @ X4))|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.05/0.25 thf(c_0_8, negated_conjecture, (epred1_0), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.05/0.25 thf(c_0_9, plain, ![X2:a]:(((epred2_1 @ X2 @ X2)|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.05/0.25 thf(c_0_10, plain, ![X2:a, X4:a, X3:a]:(((cQ @ X2 @ X3)|~((epred2_1 @ X4 @ X2))|~((epred2_1 @ X4 @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8])])).
% 0.05/0.25 thf(c_0_11, plain, ![X2:a]:((epred2_1 @ X2 @ X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_8])])).
% 0.05/0.25 thf(c_0_12, plain, ![X2:a, X3:a]:(((cQ @ X2 @ X3)|~((epred2_1 @ X2 @ X3)))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
% 0.05/0.25 thf(c_0_13, plain, ![X4:a, X3:a, X2:a]:(((epred2_1 @ X4 @ X3)|~((cQ @ X2 @ X3))|~((epred2_1 @ X4 @ X2))|~((epred1_0)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.05/0.25 thf(c_0_14, negated_conjecture, ((cQ @ esk5_0 @ esk6_0)|(cQ @ esk2_0 @ esk3_0)|~((cQ @ esk1_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.05/0.25 thf(c_0_15, plain, ![X2:a]:((cQ @ X2 @ X2)), inference(spm,[status(thm)],[c_0_12, c_0_11])).
% 0.05/0.25 thf(c_0_16, plain, ![X2:a, X3:a, X4:a]:(((epred2_1 @ X2 @ X3)|~((cQ @ X4 @ X3))|~((epred2_1 @ X2 @ X4)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_8])])).
% 0.05/0.25 thf(c_0_17, negated_conjecture, ((cQ @ esk2_0 @ esk3_0)|(cQ @ esk5_0 @ esk6_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15])])).
% 0.05/0.25 thf(c_0_18, negated_conjecture, ((cQ @ esk4_0 @ esk5_0)|(cQ @ esk2_0 @ esk3_0)|~((cQ @ esk1_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.05/0.25 thf(c_0_19, negated_conjecture, ![X2:a]:(((cQ @ esk2_0 @ esk3_0)|(epred2_1 @ X2 @ esk6_0)|~((epred2_1 @ X2 @ esk5_0)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
% 0.05/0.25 thf(c_0_20, negated_conjecture, ((cQ @ esk2_0 @ esk3_0)|(cQ @ esk4_0 @ esk5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_15])])).
% 0.05/0.25 thf(c_0_21, plain, ![X2:a]:(((cQ @ esk2_0 @ esk3_0)|(cQ @ X2 @ esk6_0)|~((epred2_1 @ X2 @ esk5_0)))), inference(spm,[status(thm)],[c_0_12, c_0_19])).
% 0.05/0.25 thf(c_0_22, negated_conjecture, ![X2:a]:(((cQ @ esk2_0 @ esk3_0)|(epred2_1 @ X2 @ esk5_0)|~((epred2_1 @ X2 @ esk4_0)))), inference(spm,[status(thm)],[c_0_16, c_0_20])).
% 0.05/0.25 thf(c_0_23, negated_conjecture, ((cQ @ esk2_0 @ esk3_0)|~((cQ @ esk4_0 @ esk6_0))|~((cQ @ esk1_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.05/0.25 thf(c_0_24, negated_conjecture, ((cQ @ esk5_0 @ esk6_0)|~((cQ @ esk3_0 @ esk2_0))|~((cQ @ esk1_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.05/0.25 thf(c_0_25, negated_conjecture, ![X2:a]:(((cQ @ esk2_0 @ esk3_0)|(cQ @ X2 @ esk6_0)|~((epred2_1 @ X2 @ esk4_0)))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
% 0.05/0.25 thf(c_0_26, negated_conjecture, ((cQ @ esk2_0 @ esk3_0)|~((cQ @ esk4_0 @ esk6_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_15])])).
% 0.05/0.25 thf(c_0_27, negated_conjecture, ((cQ @ esk5_0 @ esk6_0)|~((cQ @ esk3_0 @ esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_15])])).
% 0.05/0.25 thf(c_0_28, negated_conjecture, ((cQ @ esk4_0 @ esk5_0)|~((cQ @ esk3_0 @ esk2_0))|~((cQ @ esk1_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.05/0.25 thf(c_0_29, plain, (cQ @ esk2_0 @ esk3_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_11]), c_0_26])).
% 0.05/0.25 thf(c_0_30, negated_conjecture, ![X2:a]:(((epred2_1 @ X2 @ esk6_0)|~((cQ @ esk3_0 @ esk2_0))|~((epred2_1 @ X2 @ esk5_0)))), inference(spm,[status(thm)],[c_0_16, c_0_27])).
% 0.05/0.25 thf(c_0_31, negated_conjecture, ((cQ @ esk4_0 @ esk5_0)|~((cQ @ esk3_0 @ esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_15])])).
% 0.05/0.25 thf(c_0_32, plain, ![X2:a]:(((epred2_1 @ X2 @ esk3_0)|~((epred2_1 @ X2 @ esk2_0)))), inference(spm,[status(thm)],[c_0_16, c_0_29])).
% 0.05/0.25 thf(c_0_33, plain, ![X2:a]:(((cQ @ X2 @ esk6_0)|~((cQ @ esk3_0 @ esk2_0))|~((epred2_1 @ X2 @ esk5_0)))), inference(spm,[status(thm)],[c_0_12, c_0_30])).
% 0.05/0.25 thf(c_0_34, negated_conjecture, ![X2:a]:(((epred2_1 @ X2 @ esk5_0)|~((cQ @ esk3_0 @ esk2_0))|~((epred2_1 @ X2 @ esk4_0)))), inference(spm,[status(thm)],[c_0_16, c_0_31])).
% 0.05/0.25 thf(c_0_35, negated_conjecture, (~((cQ @ esk4_0 @ esk6_0))|~((cQ @ esk3_0 @ esk2_0))|~((cQ @ esk1_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.05/0.25 thf(c_0_36, plain, ![X3:a, X2:a]:(((cQ @ esk3_0 @ X2)|~((epred2_1 @ X3 @ esk2_0))|~((epred2_1 @ X3 @ X2)))), inference(spm,[status(thm)],[c_0_10, c_0_32])).
% 0.05/0.25 thf(c_0_37, negated_conjecture, ![X2:a]:(((cQ @ X2 @ esk6_0)|~((cQ @ esk3_0 @ esk2_0))|~((epred2_1 @ X2 @ esk4_0)))), inference(spm,[status(thm)],[c_0_33, c_0_34])).
% 0.05/0.25 thf(c_0_38, negated_conjecture, (~((cQ @ esk3_0 @ esk2_0))|~((cQ @ esk4_0 @ esk6_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_15])])).
% 0.05/0.25 thf(c_0_39, plain, ![X2:a]:(((cQ @ esk3_0 @ X2)|~((epred2_1 @ esk2_0 @ X2)))), inference(spm,[status(thm)],[c_0_36, c_0_11])).
% 0.05/0.25 thf(c_0_40, plain, ~((cQ @ esk3_0 @ esk2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_11]), c_0_38])).
% 0.05/0.25 thf(c_0_41, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_11]), c_0_40]), ['proof']).
% 0.05/0.25 % SZS output end CNFRefutation
% 0.05/0.25 % Parsed axioms : 3
% 0.05/0.25 % Removed by relevancy pruning/SinE : 2
% 0.05/0.25 % Initial clauses : 17
% 0.05/0.25 % Removed in clause preprocessing : 0
% 0.05/0.25 % Initial clauses in saturation : 17
% 0.05/0.25 % Processed clauses : 46
% 0.05/0.25 % ...of these trivial : 0
% 0.05/0.25 % ...subsumed : 4
% 0.05/0.25 % ...remaining for further processing : 42
% 0.05/0.25 % Other redundant clauses eliminated : 0
% 0.05/0.25 % Clauses deleted for lack of memory : 0
% 0.05/0.25 % Backward-subsumed : 8
% 0.05/0.25 % Backward-rewritten : 14
% 0.05/0.25 % Generated clauses : 89
% 0.05/0.25 % ...of the previous two non-redundant : 91
% 0.05/0.25 % ...aggressively subsumed : 0
% 0.05/0.25 % Contextual simplify-reflections : 2
% 0.05/0.25 % Paramodulations : 88
% 0.05/0.25 % Factorizations : 0
% 0.05/0.25 % NegExts : 0
% 0.05/0.25 % Equation resolutions : 0
% 0.05/0.25 % Disequality decompositions : 0
% 0.05/0.25 % Total rewrite steps : 24
% 0.05/0.25 % ...of those cached : 19
% 0.05/0.25 % Propositional unsat checks : 0
% 0.05/0.25 % Propositional check models : 0
% 0.05/0.25 % Propositional check unsatisfiable : 0
% 0.05/0.25 % Propositional clauses : 0
% 0.05/0.25 % Propositional clauses after purity: 0
% 0.05/0.25 % Propositional unsat core size : 0
% 0.05/0.25 % Propositional preprocessing time : 0.000
% 0.05/0.25 % Propositional encoding time : 0.000
% 0.05/0.25 % Propositional solver time : 0.000
% 0.05/0.25 % Success case prop preproc time : 0.000
% 0.05/0.25 % Success case prop encoding time : 0.000
% 0.05/0.25 % Success case prop solver time : 0.000
% 0.05/0.25 % Current number of processed clauses : 20
% 0.05/0.25 % Positive orientable unit clauses : 6
% 0.05/0.25 % Positive unorientable unit clauses: 0
% 0.05/0.25 % Negative unit clauses : 1
% 0.05/0.25 % Non-unit-clauses : 13
% 0.05/0.25 % Current number of unprocessed clauses: 60
% 0.05/0.25 % ...number of literals in the above : 218
% 0.05/0.25 % Current number of archived formulas : 0
% 0.05/0.25 % Current number of archived clauses : 22
% 0.05/0.25 % Clause-clause subsumption calls (NU) : 178
% 0.05/0.25 % Rec. Clause-clause subsumption calls : 167
% 0.05/0.25 % Non-unit clause-clause subsumptions : 6
% 0.05/0.25 % Unit Clause-clause subsumption calls : 12
% 0.05/0.25 % Rewrite failures with RHS unbound : 0
% 0.05/0.25 % BW rewrite match attempts : 8
% 0.05/0.25 % BW rewrite match successes : 2
% 0.05/0.25 % Condensation attempts : 0
% 0.05/0.25 % Condensation successes : 0
% 0.05/0.25 % Termbank termtop insertions : 3182
% 0.05/0.25 % Search garbage collected termcells : 566
% 0.05/0.25
% 0.05/0.25 % -------------------------------------------------
% 0.05/0.25 % User time : 0.005 s
% 0.05/0.25 % System time : 0.003 s
% 0.05/0.25 % Total time : 0.008 s
% 0.05/0.25 % Maximum resident set size: 3636 pages
% 0.05/0.25
% 0.05/0.25 % -------------------------------------------------
% 0.05/0.25 % User time : 0.007 s
% 0.05/0.25 % System time : 0.008 s
% 0.05/0.25 % Total time : 0.014 s
% 0.05/0.25 % Maximum resident set size: 4864 pages
% 0.05/0.25 % E exiting
%------------------------------------------------------------------------------