%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT392-1 : 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 : n013.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 : Thu Sep 24 01:05:15 PM UTC 2026
% Result : Unsatisfiable 3.92s 1.12s
% Output : CNFRefutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 2
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 4 RR)
% Number of literals : 52 ( 51 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 148 ( 51 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos,axiom,
mult(plus(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3),plus(mult(plus(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)),plus(mult(plus(X2,plus(plus(mult(X4,mult(X2,X5)),mult(X6,X2)),X2)),plus(X7,mult(X2,plus(plus(mult(X2,X8),mult(X6,X2)),X2)))),mult(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)))),mult(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
cnf(goals,negated_conjecture,
plus(plus(mult(a,b),mult(b,c)),b) != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_2,axiom,
mult(plus(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3),plus(mult(plus(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)),plus(mult(plus(X2,plus(plus(mult(X4,mult(X2,X5)),mult(X6,X2)),X2)),plus(X7,mult(X2,plus(plus(mult(X2,X8),mult(X6,X2)),X2)))),mult(X1,mult(mult(plus(X4,X2),plus(X2,X5)),X2)))),mult(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3))) = X2,
sos ).
cnf(c_0_3,plain,
mult(plus(mult(plus(X1,mult(plus(X2,X3),plus(X3,mult(X2,X3)))),plus(mult(plus(X2,X3),plus(X3,mult(X2,X3))),mult(X1,mult(plus(X2,X3),plus(X3,mult(X2,X3)))))),X4),plus(mult(plus(X1,mult(mult(plus(mult(plus(X2,X3),plus(X3,mult(X2,X3))),mult(plus(X2,X3),plus(X3,mult(X2,X3)))),plus(mult(plus(X2,X3),plus(X3,mult(X2,X3))),X5)),mult(plus(X2,X3),plus(X3,mult(X2,X3))))),plus(X3,mult(X1,mult(mult(plus(mult(plus(X2,X3),plus(X3,mult(X2,X3))),mult(plus(X2,X3),plus(X3,mult(X2,X3)))),plus(mult(plus(X2,X3),plus(X3,mult(X2,X3))),X5)),mult(plus(X2,X3),plus(X3,mult(X2,X3))))))),mult(mult(plus(X1,mult(plus(X2,X3),plus(X3,mult(X2,X3)))),plus(mult(plus(X2,X3),plus(X3,mult(X2,X3))),mult(X1,mult(plus(X2,X3),plus(X3,mult(X2,X3)))))),X4))) = mult(plus(X2,X3),plus(X3,mult(X2,X3))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
mult(plus(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3),plus(mult(plus(X1,mult(mult(plus(X2,X2),plus(X2,X4)),X2)),plus(mult(plus(X5,mult(mult(plus(X6,X2),plus(X2,X7)),X2)),plus(mult(plus(X2,plus(plus(mult(X6,mult(X2,X7)),mult(X8,X2)),X2)),plus(X9,mult(X2,plus(plus(mult(X2,X10),mult(X8,X2)),X2)))),mult(X5,mult(mult(plus(X6,X2),plus(X2,X7)),X2)))),mult(X1,mult(mult(plus(X2,X2),plus(X2,X4)),X2)))),mult(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
mult(plus(mult(plus(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X2),plus(X2,mult(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X2))),X3),plus(X2,mult(mult(plus(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X2),plus(X2,mult(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,plain,
mult(plus(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3),plus(mult(plus(X1,mult(mult(plus(X2,X2),plus(X2,X4)),X2)),plus(X2,mult(X1,mult(mult(plus(X2,X2),plus(X2,X4)),X2)))),mult(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
mult(plus(X1,X2),plus(X1,mult(X1,X2))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_8,plain,
mult(plus(X1,mult(mult(plus(X2,X2),plus(X2,X3)),X2)),plus(X2,mult(X1,mult(mult(plus(X2,X2),plus(X2,X3)),X2)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_6]),c_0_6]),c_0_7]) ).
cnf(c_0_9,plain,
mult(plus(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3),plus(X2,mult(mult(plus(X1,X2),plus(X2,mult(X1,X2))),X3))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_7]),c_0_8]) ).
cnf(c_0_10,plain,
mult(plus(X1,mult(mult(plus(X2,X3),plus(X3,X4)),X3)),plus(mult(plus(X3,plus(plus(mult(X2,mult(X3,X4)),mult(X5,X3)),X3)),plus(X6,mult(X3,plus(plus(mult(X3,X7),mult(X5,X3)),X3)))),mult(X1,mult(mult(plus(X2,X3),plus(X3,X4)),X3)))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_2]),c_0_2]),c_0_7]) ).
cnf(c_0_11,plain,
mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
mult(plus(X1,X2),plus(X2,mult(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_11]) ).
cnf(c_0_13,plain,
plus(plus(mult(X1,mult(X1,X2)),mult(X3,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
mult(plus(X1,X1),plus(X2,mult(X1,plus(plus(mult(X1,X3),mult(X4,X1)),X1)))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_15,plain,
mult(plus(X1,mult(X2,X2)),plus(X2,mult(X1,mult(X2,X2)))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_16,plain,
mult(plus(X1,X1),plus(X2,mult(X1,X1))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_17,plain,
mult(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
plus(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_17]),c_0_12]),c_0_12]),c_0_8]),c_0_12]),c_0_17]) ).
cnf(c_0_19,plain,
mult(plus(X1,mult(mult(plus(X2,X3),plus(X3,X4)),X3)),plus(X3,mult(X1,mult(mult(plus(X2,X3),plus(X3,X4)),X3)))) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_2]),c_0_2]),c_0_2]),c_0_7]),c_0_11]) ).
cnf(c_0_20,plain,
mult(X1,plus(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_18]),c_0_17]) ).
cnf(c_0_21,plain,
mult(mult(plus(X1,X2),plus(X2,X3)),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18]),c_0_20]) ).
cnf(c_0_22,plain,
mult(plus(X1,X2),X2) = X2,
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_23,plain,
mult(X1,plus(X1,mult(plus(mult(X1,mult(X1,X2)),mult(X3,X1)),X1))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_24,plain,
plus(plus(mult(X1,mult(X1,X2)),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_25,plain,
plus(plus(X1,X2),X2) = plus(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_22]),c_0_17]) ).
cnf(c_0_26,plain,
plus(plus(mult(plus(X1,X2),X1),mult(X3,plus(X1,X2))),plus(X1,X2)) = plus(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_2]),c_0_12]),c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_27,plain,
plus(plus(mult(X1,X1),mult(X2,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_23]) ).
cnf(c_0_28,plain,
plus(mult(X1,mult(X1,X2)),X1) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
plus(plus(mult(X1,plus(mult(X1,X1),mult(X2,X1))),mult(X3,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
plus(X1,plus(X2,X1)) = plus(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_10]),c_0_21]),c_0_22]),c_0_21]),c_0_21]) ).
cnf(c_0_31,plain,
plus(plus(mult(X1,plus(X1,mult(X2,X1))),X1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_17]) ).
cnf(c_0_32,plain,
mult(plus(plus(mult(X1,mult(X2,X3)),mult(X4,X2)),X2),plus(X5,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_30]),c_0_20]) ).
cnf(c_0_33,plain,
plus(mult(X1,plus(X1,mult(X2,X1))),X1) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_34,plain,
mult(mult(X1,plus(X1,X2)),X1) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_35,plain,
plus(plus(X1,mult(X2,X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_17]) ).
cnf(c_0_36,plain,
plus(plus(mult(X1,mult(X2,X3)),mult(X4,X2)),X2) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_37,plain,
mult(plus(plus(X1,X2),plus(X1,mult(X1,X2))),plus(plus(X1,X2),X1)) = plus(X1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_38,plain,
mult(X1,plus(X1,mult(X2,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_33]),c_0_34]),c_0_33]),c_0_17]) ).
cnf(c_0_39,plain,
plus(X1,plus(X1,mult(X2,X1))) = plus(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_15]),c_0_17]),c_0_35]),c_0_17]),c_0_17]) ).
cnf(c_0_40,plain,
plus(mult(X1,mult(X2,X3)),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_21]),c_0_25]) ).
cnf(c_0_41,plain,
plus(X1,mult(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_18]),c_0_35]),c_0_39]),c_0_35]),c_0_17]),c_0_39]) ).
cnf(c_0_42,plain,
plus(mult(X1,plus(X1,X2)),X1) = mult(X1,plus(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_34]),c_0_17]) ).
cnf(c_0_43,plain,
plus(mult(X1,X2),X1) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_21]) ).
cnf(c_0_44,plain,
mult(X1,mult(X2,X1)) = mult(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_41]),c_0_41]),c_0_21]),c_0_41]),c_0_30]),c_0_20]),c_0_32]),c_0_21]),c_0_41]),c_0_41]),c_0_7]) ).
cnf(c_0_45,plain,
mult(X1,plus(X1,X2)) = X1,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
plus(plus(mult(a,b),mult(b,c)),b) != b,
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_47,plain,
plus(plus(mult(X1,X2),mult(X3,X2)),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_44]),c_0_44]) ).
cnf(c_0_48,plain,
mult(mult(X1,X2),X1) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_45,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
plus(plus(mult(a,b),mult(b,c)),b) != b,
c_0_46 ).
cnf(c_0_50,plain,
plus(plus(mult(X1,X2),mult(X2,X3)),X2) = X2,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LAT392-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n013.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Sun Sep 20 23:57:50 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.92/1.12 % Version: 3.5.1
% 3.92/1.12 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.92/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.92/1.12 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.92/1.12 % Starting new_bool_3 with 300s (1) cores
% 3.92/1.12 % Starting new_bool_1 with 300s (1) cores
% 3.92/1.12 % Starting sh5l with 300s (1) cores
% 3.92/1.12 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3728302 completed with status 0
% 3.92/1.12 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.92/1.12 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.92/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.92/1.12 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.92/1.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.92/1.12 % No SInE strategy applied
% 3.92/1.12 % Search class: FUUPF-FFSF22-DFFFFFNN
% 3.92/1.12 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.92/1.12 % Starting SubtermCWHack with 136s (1) cores
% 3.92/1.12 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.92/1.12 % Starting G----_0008_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 3.92/1.12 % Starting new_bool_3 with 136s (1) cores
% 3.92/1.12 % Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 3.92/1.12 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3728308 completed with status 0
% 3.92/1.12 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.92/1.12 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.92/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.92/1.12 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.92/1.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.92/1.12 % No SInE strategy applied
% 3.92/1.12 % Search class: FUUPF-FFSF22-DFFFFFNN
% 3.92/1.12 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.92/1.12 % Starting SubtermCWHack with 136s (1) cores
% 3.92/1.12 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.92/1.12 % Preprocessing time : 0.002 s
% 3.92/1.12
% 3.92/1.12 % Proof found!
% 3.92/1.12 % SZS status Unsatisfiable
% 3.92/1.12 % SZS output start CNFRefutation
% See solution above
% 3.92/1.12 % Parsed axioms : 2
% 3.92/1.12 % Removed by relevancy pruning/SinE : 0
% 3.92/1.12 % Initial clauses : 2
% 3.92/1.12 % Removed in clause preprocessing : 0
% 3.92/1.12 % Initial clauses in saturation : 2
% 3.92/1.12 % Processed clauses : 397
% 3.92/1.12 % ...of these trivial : 278
% 3.92/1.12 % ...subsumed : 0
% 3.92/1.12 % ...remaining for further processing : 119
% 3.92/1.12 % Other redundant clauses eliminated : 0
% 3.92/1.12 % Clauses deleted for lack of memory : 0
% 3.92/1.12 % Backward-subsumed : 0
% 3.92/1.12 % Backward-rewritten : 60
% 3.92/1.12 % Generated clauses : 16181
% 3.92/1.12 % ...of the previous two non-redundant : 10006
% 3.92/1.12 % ...aggressively subsumed : 0
% 3.92/1.12 % Contextual simplify-reflections : 0
% 3.92/1.12 % Paramodulations : 16181
% 3.92/1.12 % Factorizations : 0
% 3.92/1.12 % NegExts : 0
% 3.92/1.12 % Equation resolutions : 0
% 3.92/1.12 % Disequality decompositions : 0
% 3.92/1.12 % Total rewrite steps : 136496
% 3.92/1.12 % ...of those cached : 130066
% 3.92/1.12 % Propositional unsat checks : 0
% 3.92/1.12 % Propositional check models : 0
% 3.92/1.12 % Propositional check unsatisfiable : 0
% 3.92/1.12 % Propositional clauses : 0
% 3.92/1.12 % Propositional clauses after purity: 0
% 3.92/1.12 % Propositional unsat core size : 0
% 3.92/1.12 % Propositional preprocessing time : 0.000
% 3.92/1.12 % Propositional encoding time : 0.000
% 3.92/1.12 % Propositional solver time : 0.000
% 3.92/1.12 % Success case prop preproc time : 0.000
% 3.92/1.12 % Success case prop encoding time : 0.000
% 3.92/1.12 % Success case prop solver time : 0.000
% 3.92/1.12 % Current number of processed clauses : 59
% 3.92/1.12 % Positive orientable unit clauses : 59
% 3.92/1.12 % Positive unorientable unit clauses: 0
% 3.92/1.12 % Negative unit clauses : 0
% 3.92/1.12 % Non-unit-clauses : 0
% 3.92/1.12 % Current number of unprocessed clauses: 9193
% 3.92/1.12 % ...number of literals in the above : 9193
% 3.92/1.12 % Current number of archived formulas : 0
% 3.92/1.12 % Current number of archived clauses : 60
% 3.92/1.12 % Clause-clause subsumption calls (NU) : 0
% 3.92/1.12 % Rec. Clause-clause subsumption calls : 0
% 3.92/1.12 % Non-unit clause-clause subsumptions : 0
% 3.92/1.12 % Unit Clause-clause subsumption calls : 0
% 3.92/1.12 % Rewrite failures with RHS unbound : 0
% 3.92/1.12 % BW rewrite match attempts : 808
% 3.92/1.12 % BW rewrite match successes : 43
% 3.92/1.12 % Condensation attempts : 0
% 3.92/1.12 % Condensation successes : 0
% 3.92/1.12 % Termbank termtop insertions : 1680304
% 3.92/1.12 % Search garbage collected termcells : 2
% 3.92/1.12
% 3.92/1.12 % -------------------------------------------------
% 3.92/1.12 % User time : 0.547 s
% 3.92/1.12 % System time : 0.024 s
% 3.92/1.12 % Total time : 0.571 s
% 3.92/1.12 % Maximum resident set size: 3640 pages
% 3.92/1.12
% 3.92/1.12 % -------------------------------------------------
% 3.92/1.12 % User time : 2.772 s
% 3.92/1.12 % System time : 0.092 s
% 3.92/1.12 % Total time : 2.864 s
% 3.92/1.12 % Maximum resident set size: 4864 pages
% 3.92/1.12 % E exiting
%------------------------------------------------------------------------------