%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW438-1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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 03:10:42 PM UTC 2026
% Result : Unsatisfiable 28.57s 4.89s
% Output : CNFRefutation 28.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 9
% Syntax : Number of clauses : 56 ( 31 unt; 24 nHn; 50 RR)
% Number of literals : 99 ( 63 equ; 29 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 14 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-2 aty)
% Number of variables : 98 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wellformedness_5,axiom,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',wellformedness_5) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).
cnf(unfolding_5,axiom,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5))))
| heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))
| X3 = X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',unfolding_5) ).
cnf(premise_16,hypothesis,
heap(sep(lseg(x14,x12),sep(lseg(x2,x13),sep(lseg(x13,x6),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x7,x2),sep(lseg(x7,x16),sep(lseg(x3,x14),sep(lseg(x11,x4),sep(lseg(x6,x14),sep(lseg(x6,x16),emp))))))))))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_16) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',normalization) ).
cnf(premise_3,hypothesis,
x3 != x10,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_3) ).
cnf(premise_8,hypothesis,
x2 != x16,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_8) ).
cnf(premise_10,hypothesis,
x14 != x16,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_10) ).
cnf(premise_4,hypothesis,
x3 != x14,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_4) ).
cnf(c_0_9,plain,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[wellformedness_5]) ).
cnf(c_0_10,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_11,plain,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
| X1 = X3
| X1 = X2 ),
c_0_9 ).
cnf(c_0_12,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_13,plain,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5))))
| heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[unfolding_5]) ).
cnf(c_0_14,plain,
( ~ heap(sep(X4,sep(lseg(X1,X3),sep(lseg(X1,X2),X5))))
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
heap(sep(lseg(x14,x12),sep(lseg(x2,x13),sep(lseg(x13,x6),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x7,x2),sep(lseg(x7,x16),sep(lseg(x3,x14),sep(lseg(x11,x4),sep(lseg(x6,x14),sep(lseg(x6,x16),emp))))))))))))),
premise_16 ).
cnf(c_0_16,plain,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5))))
| heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))
| X3 = X4 ),
c_0_13 ).
cnf(c_0_17,plain,
( ~ heap(sep(X4,sep(X5,sep(lseg(X1,X2),sep(lseg(X1,X3),X6)))))
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_18,hypothesis,
heap(sep(lseg(x14,x12),sep(lseg(x2,x13),sep(lseg(x6,x14),sep(lseg(x6,x16),sep(lseg(x13,x6),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x3,x14),sep(lseg(x7,x2),sep(lseg(x7,x16),sep(lseg(x11,x4),emp))))))))))))),
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(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)],[c_0_15,c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_19,plain,
( ~ heap(sep(lseg(X3,X6),sep(lseg(X1,X2),sep(X4,sep(lseg(X6,X1),X5)))))
| heap(sep(lseg(X3,X1),sep(lseg(X1,X2),sep(X4,X5))))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_20,hypothesis,
( x6 = x14
| x16 = x6 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_22,plain,
( ~ heap(sep(lseg(X3,X5),sep(lseg(X5,X1),sep(lseg(X1,X2),X4))))
| heap(sep(lseg(X1,X2),sep(lseg(X3,X1),X4)))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_23,plain,
( ~ heap(sep(X4,sep(lseg(X3,X6),sep(lseg(X1,X2),sep(lseg(X6,X1),X5)))))
| heap(sep(lseg(X3,X1),sep(lseg(X1,X2),sep(X4,X5))))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_24,hypothesis,
( heap(sep(lseg(x14,x12),sep(lseg(x2,x13),sep(lseg(x6,x14),sep(lseg(x13,x6),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x3,x14),sep(lseg(x7,x2),sep(lseg(x7,x6),sep(lseg(x11,x4),emp))))))))))))
| x6 = x14 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_20]),c_0_21]) ).
cnf(c_0_25,plain,
( ~ heap(sep(X4,sep(lseg(X1,X2),sep(X5,sep(lseg(X1,X3),X6)))))
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_26,plain,
sep(X1,sep(X2,sep(X3,sep(X4,X5)))) = sep(X3,sep(X2,sep(X4,sep(X1,X5)))),
inference(spm,[status(thm)],[c_0_12,c_0_12]) ).
cnf(c_0_27,plain,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X3,X5),sep(lseg(X5,X1),X4))))
| heap(sep(lseg(X1,X2),sep(lseg(X3,X1),X4)))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_28,hypothesis,
( heap(sep(lseg(x14,x12),sep(lseg(x2,x6),sep(lseg(x6,x14),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x3,x14),sep(lseg(x7,x2),sep(lseg(x7,x6),sep(lseg(x11,x4),emp)))))))))))
| x6 = x14 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_10]),c_0_10]) ).
cnf(c_0_29,hypothesis,
x3 != x10,
inference(fof_simplification,[status(thm)],[premise_3]) ).
cnf(c_0_30,plain,
( ~ heap(sep(X4,sep(X5,sep(X6,sep(lseg(X1,X3),sep(lseg(X1,X2),X7))))))
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,hypothesis,
( heap(sep(lseg(x14,x12),sep(lseg(x2,x14),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x3,x14),sep(lseg(x7,x2),sep(lseg(x7,x6),sep(lseg(x11,x4),emp))))))))))
| x12 = x14
| x6 = x14 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,hypothesis,
x3 != x10,
c_0_29 ).
cnf(c_0_33,hypothesis,
( x10 = x2
| x6 = x14
| x12 = x14 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_34,hypothesis,
( heap(sep(lseg(x2,x6),sep(lseg(x6,x14),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x3,x14),sep(lseg(x7,x2),sep(lseg(x7,x6),sep(lseg(x11,x4),emp))))))))))
| x6 = x14
| x10 = x2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_33]),c_0_21]) ).
cnf(c_0_35,hypothesis,
x2 != x16,
inference(fof_simplification,[status(thm)],[premise_8]) ).
cnf(c_0_36,hypothesis,
( x10 = x2
| x6 = x14 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_34]),c_0_32]) ).
cnf(c_0_37,hypothesis,
x2 != x16,
c_0_35 ).
cnf(c_0_38,hypothesis,
( heap(sep(lseg(x14,x12),sep(lseg(x2,x6),sep(lseg(x2,x3),sep(lseg(x6,x14),sep(lseg(x13,x8),sep(lseg(x3,x14),sep(lseg(x7,x2),sep(lseg(x7,x6),sep(lseg(x11,x4),emp))))))))))
| x6 = x14 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_36]),c_0_21]),c_0_10]),c_0_10]) ).
cnf(c_0_39,hypothesis,
( x6 != x2
| x6 = x14 ),
inference(spm,[status(thm)],[c_0_37,c_0_20]) ).
cnf(c_0_40,hypothesis,
( x3 = x2
| x6 = x14 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_38]),c_0_39]) ).
cnf(c_0_41,hypothesis,
x6 = x14,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_40]),c_0_36]) ).
cnf(c_0_42,hypothesis,
x14 != x16,
inference(fof_simplification,[status(thm)],[premise_10]) ).
cnf(c_0_43,hypothesis,
heap(sep(lseg(x14,x16),sep(lseg(x14,x12),sep(lseg(x2,x13),sep(lseg(x13,x14),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x3,x14),sep(lseg(x7,x2),sep(lseg(x7,x16),sep(lseg(x11,x4),emp)))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_41]),c_0_21]),c_0_10]),c_0_10]) ).
cnf(c_0_44,hypothesis,
x14 != x16,
c_0_42 ).
cnf(c_0_45,plain,
( ~ heap(sep(lseg(X1,X2),sep(X4,sep(lseg(X3,X6),sep(lseg(X6,X1),X5)))))
| heap(sep(lseg(X3,X1),sep(lseg(X1,X2),sep(X4,X5))))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_46,hypothesis,
x12 = x14,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_43]),c_0_44]) ).
cnf(c_0_47,hypothesis,
heap(sep(lseg(x14,x16),sep(lseg(x2,x14),sep(lseg(x13,x8),sep(lseg(x10,x2),sep(lseg(x10,x3),sep(lseg(x3,x14),sep(lseg(x7,x2),sep(lseg(x7,x16),sep(lseg(x11,x4),emp)))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_43]),c_0_44]),c_0_46]),c_0_21]),c_0_10]) ).
cnf(c_0_48,hypothesis,
x10 = x2,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_47]),c_0_32]) ).
cnf(c_0_49,hypothesis,
heap(sep(lseg(x14,x16),sep(lseg(x2,x14),sep(lseg(x2,x3),sep(lseg(x13,x8),sep(lseg(x3,x14),sep(lseg(x7,x2),sep(lseg(x7,x16),sep(lseg(x11,x4),emp))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_21]),c_0_10]) ).
cnf(c_0_50,hypothesis,
x3 != x2,
inference(rw,[status(thm)],[c_0_32,c_0_48]) ).
cnf(c_0_51,hypothesis,
x2 = x14,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_49]),c_0_50]) ).
cnf(c_0_52,hypothesis,
x3 != x14,
inference(fof_simplification,[status(thm)],[premise_4]) ).
cnf(c_0_53,hypothesis,
heap(sep(lseg(x14,x16),sep(lseg(x14,x3),sep(lseg(x13,x8),sep(lseg(x3,x14),sep(lseg(x7,x14),sep(lseg(x7,x16),sep(lseg(x11,x4),emp)))))))),
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_47,c_0_51]),c_0_48]),c_0_51]),c_0_48]),c_0_51]),c_0_21]),c_0_21]),c_0_10]) ).
cnf(c_0_54,hypothesis,
x3 != x14,
c_0_52 ).
cnf(c_0_55,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_53]),c_0_44]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW438-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 09:53:20 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.57/4.89 % Version: 3.5.1
% 28.57/4.89 % Preprocessing class: FSMSSMSMSSSNFFN.
% 28.57/4.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 28.57/4.89 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 28.57/4.89 % Starting new_bool_3 with 300s (1) cores
% 28.57/4.89 % Starting new_bool_1 with 300s (1) cores
% 28.57/4.89 % Starting sh5l with 300s (1) cores
% 28.57/4.89 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2848100 completed with status 0
% 28.57/4.89 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 28.57/4.89 % Preprocessing class: FSMSSMSMSSSNFFN.
% 28.57/4.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 28.57/4.89 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 28.57/4.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 28.57/4.89 % No SInE strategy applied
% 28.57/4.89 % Search class: FGUSS-FFMF22-DFFFFFNN
% 28.57/4.89 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 28.57/4.89 % Starting SubtermCWHack with 136s (1) cores
% 28.57/4.89 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 28.57/4.89 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 303s (1) cores
% 28.57/4.89 % Starting new_bool_3 with 298s (1) cores
% 28.57/4.89 % Starting new_bool_1 with 291s (1) cores
% 28.57/4.89 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 2848107 completed with status 0
% 28.57/4.89 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 28.57/4.89 % Preprocessing class: FSMSSMSMSSSNFFN.
% 28.57/4.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 28.57/4.89 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 28.57/4.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 28.57/4.89 % No SInE strategy applied
% 28.57/4.89 % Search class: FGUSS-FFMF22-DFFFFFNN
% 28.57/4.89 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 28.57/4.89 % Starting SubtermCWHack with 136s (1) cores
% 28.57/4.89 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 28.57/4.89 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 303s (1) cores
% 28.57/4.89 % Preprocessing time : 0.002 s
% 28.57/4.89
% 28.57/4.89 % Proof found!
% 28.57/4.89 % SZS status Unsatisfiable
% 28.57/4.89 % SZS output start CNFRefutation
% See solution above
% 28.57/4.89 % Parsed axioms : 28
% 28.57/4.89 % Removed by relevancy pruning/SinE : 0
% 28.57/4.89 % Initial clauses : 28
% 28.57/4.89 % Removed in clause preprocessing : 1
% 28.57/4.89 % Initial clauses in saturation : 27
% 28.57/4.89 % Processed clauses : 4071
% 28.57/4.89 % ...of these trivial : 1
% 28.57/4.89 % ...subsumed : 3676
% 28.57/4.89 % ...remaining for further processing : 394
% 28.57/4.89 % Other redundant clauses eliminated : 22
% 28.57/4.89 % Clauses deleted for lack of memory : 0
% 28.57/4.89 % Backward-subsumed : 13
% 28.57/4.89 % Backward-rewritten : 21
% 28.57/4.89 % Generated clauses : 56412
% 28.57/4.89 % ...of the previous two non-redundant : 56196
% 28.57/4.89 % ...aggressively subsumed : 0
% 28.57/4.89 % Contextual simplify-reflections : 4
% 28.57/4.89 % Paramodulations : 56302
% 28.57/4.89 % Factorizations : 88
% 28.57/4.89 % NegExts : 0
% 28.57/4.89 % Equation resolutions : 22
% 28.57/4.89 % Disequality decompositions : 0
% 28.57/4.89 % Total rewrite steps : 1077
% 28.57/4.89 % ...of those cached : 666
% 28.57/4.89 % Propositional unsat checks : 0
% 28.57/4.89 % Propositional check models : 0
% 28.57/4.89 % Propositional check unsatisfiable : 0
% 28.57/4.89 % Propositional clauses : 0
% 28.57/4.89 % Propositional clauses after purity: 0
% 28.57/4.89 % Propositional unsat core size : 0
% 28.57/4.89 % Propositional preprocessing time : 0.000
% 28.57/4.89 % Propositional encoding time : 0.000
% 28.57/4.89 % Propositional solver time : 0.000
% 28.57/4.89 % Success case prop preproc time : 0.000
% 28.57/4.89 % Success case prop encoding time : 0.000
% 28.57/4.89 % Success case prop solver time : 0.000
% 28.57/4.89 % Current number of processed clauses : 360
% 28.57/4.89 % Positive orientable unit clauses : 10
% 28.57/4.89 % Positive unorientable unit clauses: 13
% 28.57/4.89 % Negative unit clauses : 55
% 28.57/4.89 % Non-unit-clauses : 282
% 28.57/4.89 % Current number of unprocessed clauses: 52107
% 28.57/4.89 % ...number of literals in the above : 130889
% 28.57/4.89 % Current number of archived formulas : 0
% 28.57/4.89 % Current number of archived clauses : 34
% 28.57/4.89 % Clause-clause subsumption calls (NU) : 46615
% 28.57/4.89 % Rec. Clause-clause subsumption calls : 46568
% 28.57/4.89 % Non-unit clause-clause subsumptions : 1307
% 28.57/4.89 % Unit Clause-clause subsumption calls : 1927
% 28.57/4.89 % Rewrite failures with RHS unbound : 0
% 28.57/4.89 % BW rewrite match attempts : 2627
% 28.57/4.89 % BW rewrite match successes : 879
% 28.57/4.89 % Condensation attempts : 0
% 28.57/4.89 % Condensation successes : 0
% 28.57/4.89 % Termbank termtop insertions : 984771
% 28.57/4.89 % Search garbage collected termcells : 58
% 28.57/4.89
% 28.57/4.89 % -------------------------------------------------
% 28.57/4.89 % User time : 2.081 s
% 28.57/4.89 % System time : 0.092 s
% 28.57/4.89 % Total time : 2.173 s
% 28.57/4.89 % Maximum resident set size: 3668 pages
% 28.57/4.89
% 28.57/4.89 % -------------------------------------------------
% 28.57/4.89 % User time : 16.992 s
% 28.57/4.89 % System time : 0.515 s
% 28.57/4.89 % Total time : 17.507 s
% 28.57/4.89 % Maximum resident set size: 4608 pages
% 28.57/4.89 % E exiting
%------------------------------------------------------------------------------