0.00/0.05 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.17/0.45 % Computer : n006.cluster.edu 0.17/0.45 % Model : x86_64 x86_64 0.17/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.17/0.45 % Memory : 8046.5625MB 0.17/0.45 % OS : Linux 6.8.0-71-generic 0.17/0.45 % CPULimit : 1440 0.17/0.45 % WCLimit : 180 0.17/0.45 % DateTime : Mon Jul 27 10:14:49 UTC 2026 0.17/0.45 % CPUTime : 0.17/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 180 THM 0.21/0.51 Running first-order theorem proving 0.21/0.52 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/benchmark/theBenchmark.p 27.39/4.48 % Version: 3.5.1 27.39/4.48 % Preprocessing class: FSLSSMSMSSSNFFN. 27.39/4.48 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 27.39/4.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 900s (5) cores 27.39/4.48 % Starting new_bool_3 with 180s (1) cores 27.39/4.48 % Starting new_bool_1 with 180s (1) cores 27.39/4.48 % Starting sh5l with 180s (1) cores 27.39/4.48 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2687827 completed with status 0 27.39/4.48 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr 27.39/4.48 % Preprocessing class: FSLSSMSMSSSNFFN. 27.39/4.48 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 27.39/4.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 900s (5) cores 27.39/4.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 27.39/4.48 % No SInE strategy applied 27.39/4.48 % Search class: FGHSM-FFMM21-MFFFFFNN 27.39/4.48 % Scheduled 7 strats onto 5 cores with 900 seconds (900 total) 27.39/4.48 % Starting SubtermCWHack with 82s (1) cores 27.39/4.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 91s (1) cores 27.39/4.48 % Starting SAT001_MinMin_p005000_rr_RG with 82s (1) cores 27.39/4.48 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 82s (1) cores 27.39/4.48 % Starting new_bool_3 with 82s (1) cores 27.39/4.48 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2687834 completed with status 0 27.39/4.48 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr 27.39/4.48 % Preprocessing class: FSLSSMSMSSSNFFN. 27.39/4.48 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 27.39/4.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 900s (5) cores 27.39/4.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 27.39/4.48 % No SInE strategy applied 27.39/4.48 % Search class: FGHSM-FFMM21-MFFFFFNN 27.39/4.48 % Scheduled 7 strats onto 5 cores with 900 seconds (900 total) 27.39/4.48 % Starting SubtermCWHack with 82s (1) cores 27.39/4.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 91s (1) cores 27.39/4.48 % Preprocessing time : 0.002 s 27.39/4.48 % Presaturation interreduction done 27.39/4.48 27.39/4.48 % Proof found! 27.39/4.48 % SZS status Theorem 27.39/4.48 % SZS output start CNFRefutation 27.39/4.48 fof(conj, conjecture, ![X12, X13, X1, X3]:(((setIn(X1,alive)=>(~(leq(host(X1),host(X3)))=>((((~(setIn(X13,pids))&host(X1)=host(X13))&![X5]:((leq(X5,X13)<=host(X1)=host(X5))))=>(s(zero)!=host(X13)=>![X5]:((host(X5)!=host(X1)=>![X14, X15]:((host(X1)=host(X15)=>![X16]:((~((elem(m_Down(X16),queue(host(X5)))&elem(m_Down(X14),X12)))<=((((host(X15)!=host(X5)&host(X5)=host(X14))&host(X16)=host(X15))&((setIn(X15,alive)&X15!=X1)|X15=X13))&(X13=X5|(setIn(X5,alive)&X5!=X1)))))))))))<=((norm=index(status,host(X1))&host(X3)=index(ldr,host(X1)))|(host(X3)=host(index(elid,host(X1)))&wait=index(status,host(X1)))))))<=((((((((![X5, X17, X18]:((~(leq(host(X5),host(X18)))<=elem(m_Ack(X18,X5),queue(host(X17)))))&![X5, X18]:((((leq(X18,X5)&host(X5)=host(X18))&~(setIn(X5,alive)))=>~(setIn(X18,alive)))))&cons(m_Down(X3),X12)=queue(host(X1)))&![X5, X19, X17, X18]:((((((setIn(X17,alive)&host(X5)=host(X19))&host(X17)=host(X18))&setIn(X5,alive))&host(X5)!=host(X17))=>~((elem(m_Down(X18),queue(host(X5)))&elem(m_Down(X19),queue(host(X17))))))))&![X5, X18]:(((X18!=X5&host(X18)=host(X5))=>(~(setIn(X18,alive))|~(setIn(X5,alive))))))&![X5, X18]:((elem(m_Halt(X18),queue(host(X5)))=>~(leq(host(X5),host(X18))))))&![X5, X18]:((host(X18)!=host(X5)<=elem(m_Down(X18),queue(host(X5))))))&![X5, X18]:((elem(m_Down(X18),queue(host(X5)))=>~(setIn(X18,alive)))))&![X5, X18]:((~(elem(m_Down(X18),queue(host(X5))))<=setIn(X18,alive)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj)). 27.39/4.48 fof(axiom_46, axiom, ![X1, X3, X2]:(((elem(X1,X2)|X1=X3)<=>elem(X1,cons(X3,X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax', axiom_46)). 27.39/4.48 fof(c_0_2, plain, ![X12, X3, X1]:((epred1_3(X1,X3,X12)<=>((((((((![X5, X17, X18]:((elem(m_Ack(X18,X5),queue(host(X17)))=>~leq(host(X5),host(X18))))&![X5, X18]:((((leq(X18,X5)&host(X5)=host(X18))&~setIn(X5,alive))=>~setIn(X18,alive))))&cons(m_Down(X3),X12)=queue(host(X1)))&![X5, X19, X17, X18]:((((((setIn(X17,alive)&host(X5)=host(X19))&host(X17)=host(X18))&setIn(X5,alive))&host(X5)!=host(X17))=>~((elem(m_Down(X18),queue(host(X5)))&elem(m_Down(X19),queue(host(X17))))))))&![X5, X18]:(((X18!=X5&host(X18)=host(X5))=>(~setIn(X18,alive)|~setIn(X5,alive)))))&![X5, X18]:((elem(m_Halt(X18),queue(host(X5)))=>~leq(host(X5),host(X18)))))&![X5, X18]:((elem(m_Down(X18),queue(host(X5)))=>host(X18)!=host(X5))))&![X5, X18]:((elem(m_Down(X18),queue(host(X5)))=>~setIn(X18,alive))))&![X5, X18]:((setIn(X18,alive)=>~elem(m_Down(X18),queue(host(X5)))))))), introduced(definition)). 27.39/4.48 fof(c_0_3, negated_conjecture, ~(![X12, X13, X1, X3]:(((setIn(X1,alive)=>(~(leq(host(X1),host(X3)))=>((((~(setIn(X13,pids))&host(X1)=host(X13))&![X5]:((leq(X5,X13)<=host(X1)=host(X5))))=>(s(zero)!=host(X13)=>![X5]:((host(X5)!=host(X1)=>![X14, X15]:((host(X1)=host(X15)=>![X16]:((~((elem(m_Down(X16),queue(host(X5)))&elem(m_Down(X14),X12)))<=((((host(X15)!=host(X5)&host(X5)=host(X14))&host(X16)=host(X15))&((setIn(X15,alive)&X15!=X1)|X15=X13))&(X13=X5|(setIn(X5,alive)&X5!=X1)))))))))))<=((norm=index(status,host(X1))&host(X3)=index(ldr,host(X1)))|(host(X3)=host(index(elid,host(X1)))&wait=index(status,host(X1)))))))<=((((((((![X5, X17, X18]:((~(leq(host(X5),host(X18)))<=elem(m_Ack(X18,X5),queue(host(X17)))))&![X5, X18]:((((leq(X18,X5)&host(X5)=host(X18))&~(setIn(X5,alive)))=>~(setIn(X18,alive)))))&cons(m_Down(X3),X12)=queue(host(X1)))&![X5, X19, X17, X18]:((((((setIn(X17,alive)&host(X5)=host(X19))&host(X17)=host(X18))&setIn(X5,alive))&host(X5)!=host(X17))=>~((elem(m_Down(X18),queue(host(X5)))&elem(m_Down(X19),queue(host(X17))))))))&![X5, X18]:(((X18!=X5&host(X18)=host(X5))=>(~(setIn(X18,alive))|~(setIn(X5,alive))))))&![X5, X18]:((elem(m_Halt(X18),queue(host(X5)))=>~(leq(host(X5),host(X18))))))&![X5, X18]:((host(X18)!=host(X5)<=elem(m_Down(X18),queue(host(X5))))))&![X5, X18]:((elem(m_Down(X18),queue(host(X5)))=>~(setIn(X18,alive)))))&![X5, X18]:((~(elem(m_Down(X18),queue(host(X5))))<=setIn(X18,alive))))))), inference(assume_negation,[status(cth)],[conj])). 27.39/4.48 fof(c_0_4, plain, ![X12, X3, X1]:((epred1_3(X1,X3,X12)=>((((((((![X5, X17, X18]:((elem(m_Ack(X18,X5),queue(host(X17)))=>~leq(host(X5),host(X18))))&![X5, X18]:((((leq(X18,X5)&host(X5)=host(X18))&~setIn(X5,alive))=>~setIn(X18,alive))))&cons(m_Down(X3),X12)=queue(host(X1)))&![X5, X19, X17, X18]:((((((setIn(X17,alive)&host(X5)=host(X19))&host(X17)=host(X18))&setIn(X5,alive))&host(X5)!=host(X17))=>~((elem(m_Down(X18),queue(host(X5)))&elem(m_Down(X19),queue(host(X17))))))))&![X5, X18]:(((X18!=X5&host(X18)=host(X5))=>(~setIn(X18,alive)|~setIn(X5,alive)))))&![X5, X18]:((elem(m_Halt(X18),queue(host(X5)))=>~leq(host(X5),host(X18)))))&![X5, X18]:((elem(m_Down(X18),queue(host(X5)))=>host(X18)!=host(X5))))&![X5, X18]:((elem(m_Down(X18),queue(host(X5)))=>~setIn(X18,alive))))&![X5, X18]:((setIn(X18,alive)=>~elem(m_Down(X18),queue(host(X5)))))))), inference(split_equiv,[status(thm)],[c_0_2])). 27.39/4.48 fof(c_0_5, negated_conjecture, ~(![X12, X13, X1, X3]:((epred1_3(X1,X3,X12)=>(setIn(X1,alive)=>(~leq(host(X1),host(X3))=>(((norm=index(status,host(X1))&host(X3)=index(ldr,host(X1)))|(host(X3)=host(index(elid,host(X1)))&wait=index(status,host(X1))))=>(((~setIn(X13,pids)&host(X1)=host(X13))&![X5]:((host(X1)=host(X5)=>leq(X5,X13))))=>(s(zero)!=host(X13)=>![X5]:((host(X5)!=host(X1)=>![X14, X15]:((host(X1)=host(X15)=>![X16]:((((((host(X15)!=host(X5)&host(X5)=host(X14))&host(X16)=host(X15))&((setIn(X15,alive)&X15!=X1)|X15=X13))&(X13=X5|(setIn(X5,alive)&X5!=X1)))=>~((elem(m_Down(X16),queue(host(X5)))&elem(m_Down(X14),X12))))))))))))))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3]), c_0_2])). 27.39/4.48 fof(c_0_6, plain, ![X158, X159, X160, X161, X162, X163, X164, X165, X166, X167, X168, X169, X170, X171, X172, X173, X174, X175, X176, X177, X178, X179]:((((((((((~elem(m_Ack(X163,X161),queue(host(X162)))|~leq(host(X161),host(X163))|~epred1_3(X160,X159,X158))&(~leq(X165,X164)|host(X164)!=host(X165)|setIn(X164,alive)|~setIn(X165,alive)|~epred1_3(X160,X159,X158)))&(cons(m_Down(X159),X158)=queue(host(X160))|~epred1_3(X160,X159,X158)))&(~setIn(X168,alive)|host(X166)!=host(X167)|host(X168)!=host(X169)|~setIn(X166,alive)|host(X166)=host(X168)|(~elem(m_Down(X169),queue(host(X166)))|~elem(m_Down(X167),queue(host(X168))))|~epred1_3(X160,X159,X158)))&(X171=X170|host(X171)!=host(X170)|(~setIn(X171,alive)|~setIn(X170,alive))|~epred1_3(X160,X159,X158)))&(~elem(m_Halt(X173),queue(host(X172)))|~leq(host(X172),host(X173))|~epred1_3(X160,X159,X158)))&(~elem(m_Down(X175),queue(host(X174)))|host(X175)!=host(X174)|~epred1_3(X160,X159,X158)))&(~elem(m_Down(X177),queue(host(X176)))|~setIn(X177,alive)|~epred1_3(X160,X159,X158)))&(~setIn(X179,alive)|~elem(m_Down(X179),queue(host(X178)))|~epred1_3(X160,X159,X158)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])). 27.39/4.48 fof(c_0_7, negated_conjecture, ![X153]:((epred1_3(esk7_0,esk8_0,esk5_0)&(setIn(esk7_0,alive)&(~leq(host(esk7_0),host(esk8_0))&((((host(esk8_0)=host(index(elid,host(esk7_0)))|norm=index(status,host(esk7_0)))&(wait=index(status,host(esk7_0))|norm=index(status,host(esk7_0))))&((host(esk8_0)=host(index(elid,host(esk7_0)))|host(esk8_0)=index(ldr,host(esk7_0)))&(wait=index(status,host(esk7_0))|host(esk8_0)=index(ldr,host(esk7_0)))))&(((~setIn(esk6_0,pids)&host(esk7_0)=host(esk6_0))&(host(esk7_0)!=host(X153)|leq(X153,esk6_0)))&(s(zero)!=host(esk6_0)&(host(esk9_0)!=host(esk7_0)&(host(esk7_0)=host(esk11_0)&(((((host(esk11_0)!=host(esk9_0)&host(esk9_0)=host(esk10_0))&host(esk12_0)=host(esk11_0))&((setIn(esk11_0,alive)|esk11_0=esk6_0)&(esk11_0!=esk7_0|esk11_0=esk6_0)))&((setIn(esk9_0,alive)|esk6_0=esk9_0)&(esk9_0!=esk7_0|esk6_0=esk9_0)))&(elem(m_Down(esk12_0),queue(host(esk9_0)))&elem(m_Down(esk10_0),esk5_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_5])])])])])])). 27.39/4.48 cnf(c_0_8, plain, (X1=X2|host(X1)!=host(X2)|~setIn(X1,alive)|~setIn(X2,alive)|~epred1_3(X3,X4,X5)), inference(split_conjunct,[status(thm)],[c_0_6])). 27.39/4.48 cnf(c_0_9, negated_conjecture, (epred1_3(esk7_0,esk8_0,esk5_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 27.39/4.48 cnf(c_0_10, plain, (setIn(X2,alive)|~leq(X1,X2)|host(X2)!=host(X1)|~setIn(X1,alive)|~epred1_3(X3,X4,X5)), inference(split_conjunct,[status(thm)],[c_0_6])). 27.39/4.48 fof(c_0_11, plain, ![X103, X104, X105]:((((~elem(X103,X105)|elem(X103,cons(X104,X105)))&(X103!=X104|elem(X103,cons(X104,X105))))&(~elem(X103,cons(X104,X105))|(elem(X103,X105)|X103=X104)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_46])])])])). 27.39/4.48 cnf(c_0_12, plain, (cons(m_Down(X1),X2)=queue(host(X3))|~epred1_3(X3,X1,X2)), inference(split_conjunct,[status(thm)],[c_0_6])). 27.39/4.48 cnf(c_0_13, negated_conjecture, (X1=X2|host(X1)!=host(X2)|~setIn(X2,alive)|~setIn(X1,alive)), inference(spm,[status(thm)],[c_0_8, c_0_9])). 27.39/4.48 cnf(c_0_14, negated_conjecture, (setIn(esk7_0,alive)), inference(split_conjunct,[status(thm)],[c_0_7])). 27.39/4.48 cnf(c_0_15, negated_conjecture, (setIn(X1,alive)|host(X2)!=host(X1)|~setIn(X2,alive)|~leq(X2,X1)), inference(spm,[status(thm)],[c_0_10, c_0_9])). 27.39/4.48 cnf(c_0_16, plain, (elem(X1,cons(X3,X2))|~elem(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_11])). 27.39/4.48 cnf(c_0_17, negated_conjecture, (cons(m_Down(esk8_0),esk5_0)=queue(host(esk7_0))), inference(spm,[status(thm)],[c_0_12, c_0_9])). 27.39/4.48 cnf(c_0_18, negated_conjecture, (X1=esk7_0|host(X1)!=host(esk7_0)|~setIn(X1,alive)), inference(spm,[status(thm)],[c_0_13, c_0_14])). 27.39/4.48 cnf(c_0_19, negated_conjecture, (setIn(X1,alive)|host(esk7_0)!=host(X1)|~leq(esk7_0,X1)), inference(spm,[status(thm)],[c_0_15, c_0_14])). 27.39/4.48 cnf(c_0_20, plain, (host(X2)=host(X1)|~setIn(X1,alive)|host(X2)!=host(X3)|host(X1)!=host(X4)|~setIn(X2,alive)|~elem(m_Down(X4),queue(host(X2)))|~elem(m_Down(X3),queue(host(X1)))|~epred1_3(X5,X6,X7)), inference(split_conjunct,[status(thm)],[c_0_6])). 27.39/4.48 cnf(c_0_21, negated_conjecture, (elem(X1,queue(host(esk7_0)))|~elem(X1,esk5_0)), inference(spm,[status(thm)],[c_0_16, c_0_17])). 27.39/4.48 cnf(c_0_22, negated_conjecture, (host(esk12_0)=host(esk11_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 27.39/4.48 cnf(c_0_23, negated_conjecture, (host(esk7_0)=host(esk11_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 27.39/4.48 cnf(c_0_24, negated_conjecture, (X1=esk7_0|host(X1)!=host(esk7_0)|~leq(esk7_0,X1)), inference(spm,[status(thm)],[c_0_18, c_0_19])). 27.39/4.48 cnf(c_0_25, negated_conjecture, (leq(X1,esk6_0)|host(esk7_0)!=host(X1)), inference(split_conjunct,[status(thm)],[c_0_7])). 27.39/4.48 cnf(c_0_26, negated_conjecture, (host(esk7_0)=host(esk6_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 27.39/4.48 cnf(c_0_27, plain, (host(X1)=host(esk7_0)|host(esk7_0)!=host(X2)|host(X1)!=host(X3)|~epred1_3(X4,X5,X6)|~setIn(X1,alive)|~elem(m_Down(X2),queue(host(X1)))|~elem(m_Down(X3),esk5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_14])])). 27.39/4.48 cnf(c_0_28, negated_conjecture, (elem(m_Down(esk12_0),queue(host(esk9_0)))), inference(split_conjunct,[status(thm)],[c_0_7])). 27.39/4.48 cnf(c_0_29, negated_conjecture, (host(esk12_0)=host(esk7_0)), inference(rw,[status(thm)],[c_0_22, c_0_23])). 27.39/4.48 cnf(c_0_30, negated_conjecture, (host(esk9_0)!=host(esk7_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 27.39/4.48 cnf(c_0_31, negated_conjecture, (setIn(esk9_0,alive)|esk6_0=esk9_0), inference(split_conjunct,[status(thm)],[c_0_7])). 27.39/4.48 cnf(c_0_32, negated_conjecture, (esk6_0=esk7_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])])). 27.39/4.48 cnf(c_0_33, negated_conjecture, (host(esk9_0)!=host(X1)|~epred1_3(X2,X3,X4)|~setIn(esk9_0,alive)|~elem(m_Down(X1),esk5_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29])]), c_0_30])). 27.39/4.48 cnf(c_0_34, negated_conjecture, (esk9_0=esk7_0|setIn(esk9_0,alive)), inference(rw,[status(thm)],[c_0_31, c_0_32])). 27.39/4.48 cnf(c_0_35, negated_conjecture, (esk9_0=esk7_0|host(esk9_0)!=host(X1)|~epred1_3(X2,X3,X4)|~elem(m_Down(X1),esk5_0)), inference(spm,[status(thm)],[c_0_33, c_0_34])). 27.39/4.48 cnf(c_0_36, negated_conjecture, (elem(m_Down(esk10_0),esk5_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 27.39/4.48 cnf(c_0_37, negated_conjecture, (host(esk9_0)=host(esk10_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 27.39/4.48 cnf(c_0_38, negated_conjecture, (esk9_0=esk7_0|~epred1_3(X1,X2,X3)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37])])). 27.39/4.48 cnf(c_0_39, negated_conjecture, (esk9_0=esk7_0), inference(spm,[status(thm)],[c_0_38, c_0_9])). 27.39/4.48 cnf(c_0_40, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30, c_0_39])]), ['proof']). 27.39/4.48 % SZS output end CNFRefutation 27.39/4.48 % Parsed axioms : 67 27.39/4.48 % Removed by relevancy pruning/SinE : 0 27.39/4.48 % Initial clauses : 127 27.39/4.48 % Removed in clause preprocessing : 6 27.39/4.48 % Initial clauses in saturation : 121 27.39/4.48 % Processed clauses : 14509 27.39/4.48 % ...of these trivial : 204 27.39/4.48 % ...subsumed : 11290 27.39/4.48 % ...remaining for further processing : 3015 27.39/4.48 % Other redundant clauses eliminated : 26 27.39/4.48 % Clauses deleted for lack of memory : 0 27.39/4.48 % Backward-subsumed : 321 27.39/4.48 % Backward-rewritten : 91 27.39/4.48 % Generated clauses : 262801 27.39/4.48 % ...of the previous two non-redundant : 204942 27.39/4.48 % ...aggressively subsumed : 0 27.39/4.48 % Contextual simplify-reflections : 60 27.39/4.48 % Paramodulations : 262707 27.39/4.48 % Factorizations : 55 27.39/4.48 % NegExts : 0 27.39/4.48 % Equation resolutions : 39 27.39/4.48 % Disequality decompositions : 0 27.39/4.48 % Total rewrite steps : 72199 27.39/4.48 % ...of those cached : 71437 27.39/4.48 % Propositional unsat checks : 0 27.39/4.48 % Propositional check models : 0 27.39/4.48 % Propositional check unsatisfiable : 0 27.39/4.48 % Propositional clauses : 0 27.39/4.48 % Propositional clauses after purity: 0 27.39/4.48 % Propositional unsat core size : 0 27.39/4.48 % Propositional preprocessing time : 0.000 27.39/4.48 % Propositional encoding time : 0.000 27.39/4.48 % Propositional solver time : 0.000 27.39/4.48 % Success case prop preproc time : 0.000 27.39/4.48 % Success case prop encoding time : 0.000 27.39/4.48 % Success case prop solver time : 0.000 27.39/4.48 % Current number of processed clauses : 2481 27.39/4.48 % Positive orientable unit clauses : 119 27.39/4.48 % Positive unorientable unit clauses: 0 27.39/4.48 % Negative unit clauses : 101 27.39/4.48 % Non-unit-clauses : 2261 27.39/4.48 % Current number of unprocessed clauses: 189835 27.39/4.48 % ...number of literals in the above : 709659 27.39/4.48 % Current number of archived formulas : 0 27.39/4.48 % Current number of archived clauses : 527 27.39/4.48 % Clause-clause subsumption calls (NU) : 2079998 27.39/4.48 % Rec. Clause-clause subsumption calls : 1316280 27.39/4.48 % Non-unit clause-clause subsumptions : 8630 27.39/4.48 % Unit Clause-clause subsumption calls : 26672 27.39/4.48 % Rewrite failures with RHS unbound : 0 27.39/4.48 % BW rewrite match attempts : 788 27.39/4.48 % BW rewrite match successes : 7 27.39/4.48 % Condensation attempts : 0 27.39/4.48 % Condensation successes : 0 27.39/4.48 % Termbank termtop insertions : 3740894 27.39/4.48 % Search garbage collected termcells : 1709 27.39/4.48 27.39/4.48 % ------------------------------------------------- 27.39/4.48 % User time : 3.704 s 27.39/4.48 % System time : 0.139 s 27.39/4.48 % Total time : 3.843 s 27.39/4.48 % Maximum resident set size: 3412 pages 27.39/4.48 27.39/4.48 % ------------------------------------------------- 27.39/4.48 % User time : 18.691 s 27.39/4.48 % System time : 0.614 s 27.39/4.48 % Total time : 19.305 s 27.39/4.48 % Maximum resident set size: 4608 pages 27.39/4.48 % E exiting 27.39/4.48 EOF