0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.10/0.36 % Computer : n014.cluster.edu 0.10/0.36 % Model : x86_64 x86_64 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.36 % Memory : 8046.5625MB 0.10/0.36 % OS : Linux 6.8.0-71-generic 0.10/0.36 % CPULimit : 1440 0.10/0.36 % WCLimit : 180 0.10/0.36 % DateTime : Mon Jul 27 10:29:24 UTC 2026 0.10/0.36 % CPUTime : 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.10/0.40 Running first-order theorem proving 0.10/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 34.47/5.57 % Version: 3.5.1 34.47/5.57 % Preprocessing class: FSSSSMSSSSSNFFN. 34.47/5.57 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 34.47/5.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 900s (5) cores 34.47/5.57 % Starting new_bool_3 with 180s (1) cores 34.47/5.57 % Starting new_bool_1 with 180s (1) cores 34.47/5.57 % Starting sh5l with 180s (1) cores 34.47/5.57 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3532280 completed with status 0 34.47/5.57 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN 34.47/5.57 % Preprocessing class: FSSSSMSSSSSNFFN. 34.47/5.57 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 34.47/5.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 900s (5) cores 34.47/5.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 34.47/5.57 % No SInE strategy applied 34.47/5.57 % Search class: FHUNS-FFSF21-MFFFFFNN 34.47/5.57 % Scheduled 7 strats onto 5 cores with 900 seconds (900 total) 34.47/5.57 % Starting SubtermCWHack with 82s (1) cores 34.47/5.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 91s (1) cores 34.47/5.57 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 82s (1) cores 34.47/5.57 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 82s (1) cores 34.47/5.57 % Starting new_bool_3 with 82s (1) cores 34.47/5.57 % H----_011_C07_F1_PI_SE_SP_S0V with pid 3532287 completed with status 0 34.47/5.57 % Result found by H----_011_C07_F1_PI_SE_SP_S0V 34.47/5.57 % Preprocessing class: FSSSSMSSSSSNFFN. 34.47/5.57 % Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 34.47/5.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 900s (5) cores 34.47/5.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto) 34.47/5.57 % No SInE strategy applied 34.47/5.57 % Search class: FHUNS-FFSF21-MFFFFFNN 34.47/5.57 % Scheduled 7 strats onto 5 cores with 900 seconds (900 total) 34.47/5.57 % Starting SubtermCWHack with 82s (1) cores 34.47/5.57 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 91s (1) cores 34.47/5.57 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 82s (1) cores 34.47/5.57 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 82s (1) cores 34.47/5.57 % Preprocessing time : 0.001 s 34.47/5.57 34.47/5.57 % Proof found! 34.47/5.57 % SZS status Theorem 34.47/5.57 % SZS output start CNFRefutation 34.47/5.57 fof(condensed_detachment, axiom, ![X1, X2]:((is_a_theorem(X2)<=(is_a_theorem(implies(X1,X2))&is_a_theorem(X1)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', condensed_detachment)). 34.47/5.58 fof(cn_1, axiom, ![X1, X2, X3]:(is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cn_1)). 34.47/5.58 fof(cn_2, axiom, ![X1]:(is_a_theorem(implies(implies(not(X1),X1),X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cn_2)). 34.47/5.58 fof(cn_3, axiom, ![X1, X2]:(is_a_theorem(implies(X1,implies(not(X1),X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cn_3)). 34.47/5.58 fof(prove_cn_43, conjecture, is_a_theorem(implies(implies(x,y),implies(implies(y,not(x)),not(x)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_cn_43)). 34.47/5.58 fof(c_0_5, plain, ![X1, X2]:(((is_a_theorem(implies(X1,X2))&is_a_theorem(X1))=>is_a_theorem(X2))), inference(fof_simplification,[status(thm)],[condensed_detachment])). 34.47/5.58 fof(c_0_6, plain, ![X10, X11]:((~is_a_theorem(implies(X10,X11))|~is_a_theorem(X10)|is_a_theorem(X11))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])). 34.47/5.58 fof(c_0_7, plain, ![X7, X8, X9]:(is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9))))), inference(variable_rename,[status(thm)],[cn_1])). 34.47/5.58 cnf(c_0_8, plain, (is_a_theorem(X2)|~is_a_theorem(implies(X1,X2))|~is_a_theorem(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 34.47/5.58 cnf(c_0_9, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))), inference(split_conjunct,[status(thm)],[c_0_7])). 34.47/5.58 cnf(c_0_10, plain, (is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(implies(X3,X1))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 34.47/5.58 fof(c_0_11, plain, ![X6]:(is_a_theorem(implies(implies(not(X6),X6),X6))), inference(variable_rename,[status(thm)],[cn_2])). 34.47/5.58 cnf(c_0_12, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X3,X2))|~is_a_theorem(implies(X1,X3))), inference(spm,[status(thm)],[c_0_8, c_0_10])). 34.47/5.58 fof(c_0_13, plain, ![X4, X5]:(is_a_theorem(implies(X4,implies(not(X4),X5)))), inference(variable_rename,[status(thm)],[cn_3])). 34.47/5.58 cnf(c_0_14, plain, (is_a_theorem(implies(implies(not(X1),X1),X1))), inference(split_conjunct,[status(thm)],[c_0_11])). 34.47/5.58 cnf(c_0_15, plain, (is_a_theorem(implies(X1,implies(X2,X3)))|~is_a_theorem(implies(X1,implies(X4,X3)))|~is_a_theorem(implies(X2,X4))), inference(spm,[status(thm)],[c_0_12, c_0_10])). 34.47/5.58 cnf(c_0_16, plain, (is_a_theorem(implies(X1,implies(not(X1),X2)))), inference(split_conjunct,[status(thm)],[c_0_13])). 34.47/5.58 cnf(c_0_17, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(not(X2),X2)))), inference(spm,[status(thm)],[c_0_12, c_0_14])). 34.47/5.58 cnf(c_0_18, plain, (is_a_theorem(implies(X1,implies(X2,X3)))|~is_a_theorem(implies(X2,not(X1)))), inference(spm,[status(thm)],[c_0_15, c_0_16])). 34.47/5.58 cnf(c_0_19, plain, (is_a_theorem(implies(X1,implies(not(X2),X3)))|~is_a_theorem(implies(X1,X2))), inference(spm,[status(thm)],[c_0_12, c_0_16])). 34.47/5.58 cnf(c_0_20, plain, (is_a_theorem(implies(implies(X1,X2),X2))|~is_a_theorem(implies(not(X2),X1))), inference(spm,[status(thm)],[c_0_17, c_0_10])). 34.47/5.58 cnf(c_0_21, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(not(X2),not(X1)))), inference(spm,[status(thm)],[c_0_17, c_0_18])). 34.47/5.58 cnf(c_0_22, plain, (is_a_theorem(implies(not(X1),X2))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_8, c_0_16])). 34.47/5.58 cnf(c_0_23, plain, (is_a_theorem(implies(X1,implies(not(X2),X3)))|~is_a_theorem(implies(X1,X4))|~is_a_theorem(implies(X4,X2))), inference(spm,[status(thm)],[c_0_12, c_0_19])). 34.47/5.58 cnf(c_0_24, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(X3,X2)))|~is_a_theorem(implies(not(X2),X3))), inference(spm,[status(thm)],[c_0_12, c_0_20])). 34.47/5.58 cnf(c_0_25, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_21, c_0_22])). 34.47/5.58 cnf(c_0_26, plain, (is_a_theorem(implies(implies(not(X1),X1),implies(not(X2),X3)))|~is_a_theorem(implies(X1,X2))), inference(spm,[status(thm)],[c_0_23, c_0_14])). 34.47/5.58 cnf(c_0_27, plain, (is_a_theorem(implies(not(X1),X2))|~is_a_theorem(implies(X3,X1))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_8, c_0_19])). 34.47/5.58 cnf(c_0_28, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(not(X2),X3))|~is_a_theorem(implies(X3,X2))), inference(spm,[status(thm)],[c_0_24, c_0_25])). 34.47/5.58 cnf(c_0_29, plain, (is_a_theorem(implies(implies(not(X1),X1),X2))|~is_a_theorem(implies(X1,X2))), inference(spm,[status(thm)],[c_0_17, c_0_26])). 34.47/5.58 cnf(c_0_30, plain, (is_a_theorem(implies(not(implies(X1,X2)),X3))|~is_a_theorem(implies(X4,X2))|~is_a_theorem(implies(X1,X4))), inference(spm,[status(thm)],[c_0_27, c_0_10])). 34.47/5.58 cnf(c_0_31, plain, (is_a_theorem(implies(X1,implies(not(X2),X3)))|~is_a_theorem(implies(implies(not(X1),X4),X2))), inference(spm,[status(thm)],[c_0_23, c_0_16])). 34.47/5.58 cnf(c_0_32, plain, (is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1))), inference(spm,[status(thm)],[c_0_17, c_0_14])). 34.47/5.58 cnf(c_0_33, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(not(not(X2)),X3),X2))), inference(spm,[status(thm)],[c_0_28, c_0_16])). 34.47/5.58 cnf(c_0_34, plain, (is_a_theorem(implies(implies(not(X1),X1),X2))|~is_a_theorem(implies(X1,implies(not(X2),X2)))), inference(spm,[status(thm)],[c_0_17, c_0_29])). 34.47/5.58 cnf(c_0_35, plain, (is_a_theorem(implies(not(implies(X1,X2)),X3))|~is_a_theorem(implies(X1,implies(not(X2),X2)))), inference(spm,[status(thm)],[c_0_30, c_0_14])). 34.47/5.58 cnf(c_0_36, plain, (is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2)))), inference(spm,[status(thm)],[c_0_31, c_0_32])). 34.47/5.58 cnf(c_0_37, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(not(X2),implies(not(X2),X2)))), inference(spm,[status(thm)],[c_0_33, c_0_34])). 34.47/5.58 cnf(c_0_38, plain, (is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2))), inference(spm,[status(thm)],[c_0_35, c_0_36])). 34.47/5.58 cnf(c_0_39, plain, (is_a_theorem(X1)|~is_a_theorem(implies(not(X1),X2))|~is_a_theorem(implies(X2,X1))), inference(spm,[status(thm)],[c_0_8, c_0_20])). 34.47/5.58 cnf(c_0_40, plain, (is_a_theorem(implies(X1,implies(X2,X3)))|~is_a_theorem(implies(X2,X4))|~is_a_theorem(implies(X4,X3))), inference(spm,[status(thm)],[c_0_15, c_0_25])). 34.47/5.58 cnf(c_0_41, plain, (is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))|~is_a_theorem(implies(not(implies(X1,X3)),implies(X2,X3)))), inference(spm,[status(thm)],[c_0_24, c_0_9])). 34.47/5.58 cnf(c_0_42, plain, (is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2)))), inference(spm,[status(thm)],[c_0_37, c_0_38])). 34.47/5.58 cnf(c_0_43, plain, (is_a_theorem(X1)|~is_a_theorem(implies(implies(not(not(X1)),X2),X1))), inference(spm,[status(thm)],[c_0_39, c_0_16])). 34.47/5.58 cnf(c_0_44, plain, (is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))|~is_a_theorem(implies(X1,implies(X4,X2)))), inference(spm,[status(thm)],[c_0_12, c_0_9])). 34.47/5.58 cnf(c_0_45, plain, (is_a_theorem(implies(X1,implies(X2,X3)))|~is_a_theorem(implies(X4,X3))|~is_a_theorem(X4)), inference(spm,[status(thm)],[c_0_40, c_0_25])). 34.47/5.58 cnf(c_0_46, plain, (is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4)))|~is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3))), inference(spm,[status(thm)],[c_0_23, c_0_9])). 34.47/5.58 cnf(c_0_47, plain, (is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2)))), inference(spm,[status(thm)],[c_0_41, c_0_42])). 34.47/5.58 cnf(c_0_48, plain, (is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(implies(implies(not(not(implies(implies(X1,X2),implies(X3,X2)))),X4),implies(X3,X1)))), inference(spm,[status(thm)],[c_0_43, c_0_44])). 34.47/5.58 cnf(c_0_49, plain, (is_a_theorem(implies(X1,implies(X2,X3)))|~is_a_theorem(implies(not(X3),X3))), inference(spm,[status(thm)],[c_0_45, c_0_14])). 34.47/5.58 cnf(c_0_50, plain, (is_a_theorem(X1)|~is_a_theorem(implies(not(X1),X1))), inference(spm,[status(thm)],[c_0_8, c_0_14])). 34.47/5.58 cnf(c_0_51, plain, (is_a_theorem(implies(not(X1),X2))|~is_a_theorem(implies(not(X1),X1))), inference(spm,[status(thm)],[c_0_27, c_0_14])). 34.47/5.58 cnf(c_0_52, plain, (is_a_theorem(implies(X1,X1))), inference(spm,[status(thm)],[c_0_17, c_0_16])). 34.47/5.58 fof(c_0_53, negated_conjecture, ~(is_a_theorem(implies(implies(x,y),implies(implies(y,not(x)),not(x))))), inference(assume_negation,[status(cth)],[prove_cn_43])). 34.47/5.58 cnf(c_0_54, plain, (is_a_theorem(implies(X1,implies(implies(X2,X3),X4)))|~is_a_theorem(implies(implies(implies(X3,X5),implies(X2,X5)),X4))), inference(spm,[status(thm)],[c_0_40, c_0_9])). 34.47/5.58 cnf(c_0_55, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(not(X3),X3)))|~is_a_theorem(implies(X3,X2))), inference(spm,[status(thm)],[c_0_12, c_0_29])). 34.47/5.58 cnf(c_0_56, plain, (is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3)))), inference(spm,[status(thm)],[c_0_46, c_0_47])). 34.47/5.58 cnf(c_0_57, plain, (is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(implies(not(X1),X1))), inference(spm,[status(thm)],[c_0_48, c_0_49])). 34.47/5.58 cnf(c_0_58, plain, (is_a_theorem(implies(not(implies(X1,X1)),X2))), inference(spm,[status(thm)],[c_0_35, c_0_16])). 34.47/5.58 cnf(c_0_59, plain, (is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1)))), inference(spm,[status(thm)],[c_0_50, c_0_44])). 34.47/5.58 cnf(c_0_60, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(not(X2),X2))), inference(spm,[status(thm)],[c_0_21, c_0_51])). 34.47/5.58 cnf(c_0_61, plain, (is_a_theorem(implies(X1,implies(not(implies(not(X1),X2)),X3)))), inference(spm,[status(thm)],[c_0_31, c_0_52])). 34.47/5.58 fof(c_0_62, negated_conjecture, ~is_a_theorem(implies(implies(x,y),implies(implies(y,not(x)),not(x)))), inference(fof_simplification,[status(thm)],[c_0_53])). 34.47/5.58 cnf(c_0_63, plain, (is_a_theorem(implies(X1,implies(implies(not(X2),X3),implies(implies(X3,X2),X2))))), inference(spm,[status(thm)],[c_0_54, c_0_47])). 34.47/5.58 cnf(c_0_64, plain, (is_a_theorem(implies(implies(not(X1),X2),X3))|~is_a_theorem(implies(implies(implies(X2,X1),X1),X3))), inference(spm,[status(thm)],[c_0_55, c_0_56])). 34.47/5.58 cnf(c_0_65, plain, (is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2)))), inference(spm,[status(thm)],[c_0_57, c_0_58])). 34.47/5.58 cnf(c_0_66, plain, (is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(implies(not(implies(X3,X1)),implies(X3,X1)))), inference(spm,[status(thm)],[c_0_59, c_0_60])). 34.47/5.58 cnf(c_0_67, plain, (is_a_theorem(implies(not(implies(X1,implies(not(X1),X2))),X3))), inference(spm,[status(thm)],[c_0_35, c_0_61])). 34.47/5.58 fof(c_0_68, negated_conjecture, ~is_a_theorem(implies(implies(x,y),implies(implies(y,not(x)),not(x)))), inference(fof_nnf,[status(thm)],[c_0_62])). 34.47/5.58 cnf(c_0_69, plain, (is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1)))), inference(spm,[status(thm)],[c_0_43, c_0_63])). 34.47/5.58 cnf(c_0_70, plain, (is_a_theorem(implies(implies(not(X1),X1),implies(X2,X1)))), inference(spm,[status(thm)],[c_0_64, c_0_65])). 34.47/5.58 cnf(c_0_71, plain, (is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3)))), inference(spm,[status(thm)],[c_0_66, c_0_67])). 34.47/5.58 cnf(c_0_72, negated_conjecture, (~is_a_theorem(implies(implies(x,y),implies(implies(y,not(x)),not(x))))), inference(split_conjunct,[status(thm)],[c_0_68])). 34.47/5.58 cnf(c_0_73, plain, (is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))|~is_a_theorem(implies(X1,implies(not(X3),X2)))), inference(spm,[status(thm)],[c_0_12, c_0_69])). 34.47/5.58 cnf(c_0_74, plain, (is_a_theorem(implies(X1,implies(not(implies(X2,X1)),X3)))), inference(spm,[status(thm)],[c_0_31, c_0_70])). 34.47/5.58 cnf(c_0_75, plain, (is_a_theorem(implies(implies(implies(not(not(X1)),X2),X1),X1))), inference(spm,[status(thm)],[c_0_17, c_0_71])). 34.47/5.58 cnf(c_0_76, negated_conjecture, (~is_a_theorem(implies(implies(x,y),implies(not(not(x)),y)))), inference(spm,[status(thm)],[c_0_72, c_0_73])). 34.47/5.58 cnf(c_0_77, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(implies(X3,X1),X2))), inference(spm,[status(thm)],[c_0_55, c_0_74])). 34.47/5.58 cnf(c_0_78, plain, (is_a_theorem(implies(implies(not(X1),not(not(X1))),X1))), inference(spm,[status(thm)],[c_0_64, c_0_75])). 34.47/5.58 cnf(c_0_79, negated_conjecture, (~is_a_theorem(implies(not(not(x)),x))), inference(spm,[status(thm)],[c_0_76, c_0_10])). 34.47/5.58 cnf(c_0_80, plain, (is_a_theorem(implies(not(not(X1)),X1))), inference(spm,[status(thm)],[c_0_77, c_0_78])). 34.47/5.58 cnf(c_0_81, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79, c_0_80])]), ['proof']). 34.47/5.58 % SZS output end CNFRefutation 34.47/5.58 % Parsed axioms : 5 34.47/5.58 % Removed by relevancy pruning/SinE : 0 34.47/5.58 % Initial clauses : 5 34.47/5.58 % Removed in clause preprocessing : 0 34.47/5.58 % Initial clauses in saturation : 5 34.47/5.58 % Processed clauses : 27854 34.47/5.58 % ...of these trivial : 760 34.47/5.58 % ...subsumed : 25094 34.47/5.58 % ...remaining for further processing : 2000 34.47/5.58 % Other redundant clauses eliminated : 0 34.47/5.58 % Clauses deleted for lack of memory : 0 34.47/5.58 % Backward-subsumed : 315 34.47/5.58 % Backward-rewritten : 34 34.47/5.58 % Generated clauses : 271741 34.47/5.58 % ...of the previous two non-redundant : 256570 34.47/5.58 % ...aggressively subsumed : 0 34.47/5.58 % Contextual simplify-reflections : 0 34.47/5.58 % Paramodulations : 271741 34.47/5.58 % Factorizations : 0 34.47/5.58 % NegExts : 0 34.47/5.58 % Equation resolutions : 0 34.47/5.58 % Disequality decompositions : 0 34.47/5.58 % Total rewrite steps : 16809 34.47/5.58 % ...of those cached : 14436 34.47/5.58 % Propositional unsat checks : 0 34.47/5.58 % Propositional check models : 0 34.47/5.58 % Propositional check unsatisfiable : 0 34.47/5.58 % Propositional clauses : 0 34.47/5.58 % Propositional clauses after purity: 0 34.47/5.58 % Propositional unsat core size : 0 34.47/5.58 % Propositional preprocessing time : 0.000 34.47/5.58 % Propositional encoding time : 0.000 34.47/5.58 % Propositional solver time : 0.000 34.47/5.58 % Success case prop preproc time : 0.000 34.47/5.58 % Success case prop encoding time : 0.000 34.47/5.58 % Success case prop solver time : 0.000 34.47/5.58 % Current number of processed clauses : 1651 34.47/5.58 % Positive orientable unit clauses : 269 34.47/5.58 % Positive unorientable unit clauses: 0 34.47/5.58 % Negative unit clauses : 59 34.47/5.58 % Non-unit-clauses : 1323 34.47/5.58 % Current number of unprocessed clauses: 228628 34.47/5.58 % ...number of literals in the above : 701401 34.47/5.58 % Current number of archived formulas : 0 34.47/5.58 % Current number of archived clauses : 349 34.47/5.58 % Clause-clause subsumption calls (NU) : 548348 34.47/5.58 % Rec. Clause-clause subsumption calls : 476871 34.47/5.58 % Non-unit clause-clause subsumptions : 23345 34.47/5.58 % Unit Clause-clause subsumption calls : 19271 34.47/5.58 % Rewrite failures with RHS unbound : 0 34.47/5.58 % BW rewrite match attempts : 57956 34.47/5.58 % BW rewrite match successes : 26 34.47/5.58 % Condensation attempts : 0 34.47/5.58 % Condensation successes : 0 34.47/5.58 % Termbank termtop insertions : 4488700 34.47/5.58 % Search garbage collected termcells : 19 34.47/5.58 34.47/5.58 % ------------------------------------------------- 34.47/5.58 % User time : 4.197 s 34.47/5.58 % System time : 0.162 s 34.47/5.58 % Total time : 4.359 s 34.47/5.58 % Maximum resident set size: 3584 pages 34.47/5.58 34.47/5.58 % ------------------------------------------------- 34.47/5.58 % User time : 22.896 s 34.47/5.58 % System time : 0.945 s 34.47/5.58 % Total time : 23.841 s 34.47/5.58 % Maximum resident set size: 4864 pages 34.47/5.58 % E exiting 34.47/5.58 EOF