%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW952+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:11:27 PM UTC 2026
% Result : Theorem 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 62 ( 34 unt; 0 def)
% Number of atoms : 98 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 68 ( 32 ~; 26 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-2 aty)
% Number of variables : 69 ( 3 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax136,axiom,
! [X48] :
( pred_attacker(tuple_R_in_2(X48,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X48),name_k))),constr_h(constr_xor(constr_xor(name_r1,X48),name_k))))))
=> pred_attacker(tuple_R_out_4(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax136) ).
fof(ax94,axiom,
! [X5,X6,X7] : constr_xor(X5,constr_xor(X6,X7)) = constr_xor(constr_xor(X5,X6),X7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax94) ).
fof(ax93,axiom,
! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax93) ).
fof(ax92,axiom,
! [X2] : constr_xor(X2,constr_ZERO) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax92) ).
fof(ax117,axiom,
! [X35,X36] :
( ( pred_attacker(X36)
& pred_attacker(X35) )
=> pred_attacker(tuple_R_in_2(X35,X36)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax117) ).
fof(ax91,axiom,
! [X1] : constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax91) ).
fof(ax103,axiom,
! [X18,X19] :
( pred_attacker(tuple_sess_1_out_2(X18,X19))
=> pred_attacker(X19) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax103) ).
fof(ax132,axiom,
pred_attacker(tuple_sess_1_out_2(name_r2_s1,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k))),constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax132) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(ax111,axiom,
! [X26] :
( pred_attacker(tuple_R_out_4(X26))
=> pred_attacker(X26) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax111) ).
fof(ax116,axiom,
! [X33,X34] :
( pred_attacker(tuple_R_out_1(X33,X34))
=> pred_attacker(X34) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax116) ).
fof(ax95,axiom,
! [X8,X9] :
( ( pred_attacker(X9)
& pred_attacker(X8) )
=> pred_attacker(constr_xor(X8,X9)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax95) ).
fof(ax134,axiom,
pred_attacker(tuple_R_out_1(constr_QUERY,name_r1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax134) ).
fof(ax102,axiom,
! [X16,X17] :
( pred_attacker(tuple_sess_1_out_2(X16,X17))
=> pred_attacker(X16) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax102) ).
fof(ax105,axiom,
! [X21] :
( pred_attacker(tuple_sess_1_out_1(X21))
=> pred_attacker(X21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax105) ).
fof(ax131,axiom,
pred_attacker(tuple_sess_1_out_1(name_r1_s1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax131) ).
fof(c_0_16,plain,
! [X96] :
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(X96,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X96),name_k))),constr_h(constr_xor(constr_xor(name_r1,X96),name_k)))))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax136])])]) ).
fof(c_0_17,plain,
! [X53,X54,X55] : constr_xor(X53,constr_xor(X54,X55)) = constr_xor(constr_xor(X53,X54),X55),
inference(variable_rename,[status(thm)],[ax94]) ).
fof(c_0_18,plain,
! [X51,X52] : constr_xor(X51,X52) = constr_xor(X52,X51),
inference(variable_rename,[status(thm)],[ax93]) ).
fof(c_0_19,plain,
! [X50] : constr_xor(X50,constr_ZERO) = X50,
inference(variable_rename,[status(thm)],[ax92]) ).
cnf(c_0_20,plain,
( ~ pred_attacker(tuple_R_in_2(X1,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1,X1),name_k))),constr_h(constr_xor(constr_xor(name_r1,X1),name_k))))))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(constr_xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X83,X84] :
( pred_attacker(tuple_R_in_2(X83,X84))
| ~ pred_attacker(X84)
| ~ pred_attacker(X83) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax117])])]) ).
fof(c_0_24,plain,
! [X49] : constr_xor(X49,X49) = constr_ZERO,
inference(variable_rename,[status(thm)],[ax91]) ).
cnf(c_0_25,plain,
constr_xor(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,plain,
! [X66,X67] :
( pred_attacker(X67)
| ~ pred_attacker(tuple_sess_1_out_2(X66,X67)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax103])])]) ).
cnf(c_0_27,plain,
( ~ pred_attacker(tuple_R_in_2(X1,constr_split_L(constr_xor(constr_h(constr_xor(name_r1,constr_xor(X1,name_k))),constr_rotate(name_ID,constr_h(constr_xor(name_r1,constr_xor(X1,name_k))))))))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_22]) ).
cnf(c_0_28,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(tuple_R_in_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X2,constr_xor(X3,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
constr_xor(X1,X1) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_32,plain,
( ~ pred_attacker(tuple_sess_1_out_2(X1,X2))
| pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
pred_attacker(tuple_sess_1_out_2(name_r2_s1,constr_split_L(constr_xor(constr_rotate(name_ID,constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k))),constr_h(constr_xor(constr_xor(name_r1_s1,name_r2_s1),name_k)))))),
inference(split_conjunct,[status(thm)],[ax132]) ).
fof(c_0_34,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_35,plain,
( ~ pred_attacker(X1)
| ~ pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_k,constr_xor(name_r1,X1))),constr_rotate(name_ID,constr_h(constr_xor(name_k,constr_xor(name_r1,X1)))))))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_29]) ).
cnf(c_0_36,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_30]),c_0_31]) ).
cnf(c_0_37,plain,
pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_r1_s1,constr_xor(name_k,name_r2_s1))),constr_rotate(name_ID,constr_h(constr_xor(name_r1_s1,constr_xor(name_k,name_r2_s1))))))),
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_32,c_0_33]),c_0_21]),c_0_21]),c_0_22]),c_0_22]),c_0_22]) ).
fof(c_0_38,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_34]) ).
fof(c_0_39,plain,
! [X74] :
( pred_attacker(X74)
| ~ pred_attacker(tuple_R_out_4(X74)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax111])])]) ).
cnf(c_0_40,plain,
( ~ pred_attacker(constr_xor(name_r1,X1))
| ~ pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_k,X1)),constr_rotate(name_ID,constr_h(constr_xor(name_k,X1))))))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
pred_attacker(constr_split_L(constr_xor(constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1))),constr_rotate(name_ID,constr_h(constr_xor(name_k,constr_xor(name_r1_s1,name_r2_s1))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_29]),c_0_22]),c_0_22]) ).
fof(c_0_42,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_nnf,[status(thm)],[c_0_38]) ).
fof(c_0_43,plain,
! [X81,X82] :
( pred_attacker(X82)
| ~ pred_attacker(tuple_R_out_1(X81,X82)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax116])])]) ).
cnf(c_0_44,plain,
( ~ pred_attacker(tuple_R_out_4(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,plain,
( ~ pred_attacker(constr_xor(name_r1,constr_xor(name_r1_s1,name_r2_s1)))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_47,plain,
! [X56,X57] :
( pred_attacker(constr_xor(X56,X57))
| ~ pred_attacker(X57)
| ~ pred_attacker(X56) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax95])])]) ).
cnf(c_0_48,plain,
( ~ pred_attacker(tuple_R_out_1(X1,X2))
| pred_attacker(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
pred_attacker(tuple_R_out_1(constr_QUERY,name_r1)),
inference(split_conjunct,[status(thm)],[ax134]) ).
fof(c_0_50,plain,
! [X64,X65] :
( pred_attacker(X64)
| ~ pred_attacker(tuple_sess_1_out_2(X64,X65)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax102])])]) ).
fof(c_0_51,plain,
! [X69] :
( pred_attacker(X69)
| ~ pred_attacker(tuple_sess_1_out_1(X69)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax105])])]) ).
cnf(c_0_52,plain,
~ pred_attacker(constr_xor(name_r1,constr_xor(name_r1_s1,name_r2_s1))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_53,plain,
( ~ pred_attacker(X2)
| ~ pred_attacker(X1)
| pred_attacker(constr_xor(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,plain,
pred_attacker(name_r1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
( ~ pred_attacker(tuple_sess_1_out_2(X1,X2))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
( ~ pred_attacker(tuple_sess_1_out_1(X1))
| pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_57,plain,
pred_attacker(tuple_sess_1_out_1(name_r1_s1)),
inference(split_conjunct,[status(thm)],[ax131]) ).
cnf(c_0_58,plain,
~ pred_attacker(constr_xor(name_r1_s1,name_r2_s1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_59,plain,
pred_attacker(name_r2_s1),
inference(spm,[status(thm)],[c_0_55,c_0_33]) ).
cnf(c_0_60,plain,
pred_attacker(name_r1_s1),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_53]),c_0_59]),c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW952+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/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 10:20:19 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.46 % Version: 3.5.1
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2897622 completed with status 0
% 0.14/0.46 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FHUSM-FFMM21-DFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.46 % Starting sh3 with 271s (1) cores
% 0.14/0.46 % Starting ho_unfolding_3 with 271s (1) cores
% 0.14/0.46 % Starting new_ho_10_cnf2 with 271s (1) cores
% 0.14/0.46 % new_ho_10_cnf2 with pid 2897636 completed with status 0
% 0.14/0.46 % Result found by new_ho_10_cnf2
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FHUSM-FFMM21-DFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.46 % Starting sh3 with 271s (1) cores
% 0.14/0.46 % Starting ho_unfolding_3 with 271s (1) cores
% 0.14/0.46 % Starting new_ho_10_cnf2 with 271s (1) cores
% 0.14/0.46 % Preprocessing time : 0.002 s
% 0.14/0.46 % Presaturation interreduction done
% 0.14/0.46
% 0.14/0.46 % Proof found!
% 0.14/0.46 % SZS status Theorem
% 0.14/0.46 % SZS output start CNFRefutation
% See solution above
% 0.14/0.46 % Parsed axioms : 138
% 0.14/0.46 % Removed by relevancy pruning/SinE : 0
% 0.14/0.46 % Initial clauses : 138
% 0.14/0.46 % Removed in clause preprocessing : 0
% 0.14/0.46 % Initial clauses in saturation : 138
% 0.14/0.46 % Processed clauses : 575
% 0.14/0.46 % ...of these trivial : 40
% 0.14/0.46 % ...subsumed : 181
% 0.14/0.46 % ...remaining for further processing : 354
% 0.14/0.46 % Other redundant clauses eliminated : 0
% 0.14/0.46 % Clauses deleted for lack of memory : 0
% 0.14/0.46 % Backward-subsumed : 5
% 0.14/0.46 % Backward-rewritten : 1
% 0.14/0.46 % Generated clauses : 1419
% 0.14/0.46 % ...of the previous two non-redundant : 1257
% 0.14/0.46 % ...aggressively subsumed : 0
% 0.14/0.46 % Contextual simplify-reflections : 0
% 0.14/0.46 % Paramodulations : 1419
% 0.14/0.46 % Factorizations : 0
% 0.14/0.46 % NegExts : 0
% 0.14/0.46 % Equation resolutions : 0
% 0.14/0.46 % Disequality decompositions : 0
% 0.14/0.46 % Total rewrite steps : 1371
% 0.14/0.46 % ...of those cached : 1176
% 0.14/0.46 % Propositional unsat checks : 0
% 0.14/0.46 % Propositional check models : 0
% 0.14/0.46 % Propositional check unsatisfiable : 0
% 0.14/0.46 % Propositional clauses : 0
% 0.14/0.46 % Propositional clauses after purity: 0
% 0.14/0.46 % Propositional unsat core size : 0
% 0.14/0.46 % Propositional preprocessing time : 0.000
% 0.14/0.46 % Propositional encoding time : 0.000
% 0.14/0.46 % Propositional solver time : 0.000
% 0.14/0.46 % Success case prop preproc time : 0.000
% 0.14/0.46 % Success case prop encoding time : 0.000
% 0.14/0.46 % Success case prop solver time : 0.000
% 0.14/0.46 % Current number of processed clauses : 210
% 0.14/0.46 % Positive orientable unit clauses : 35
% 0.14/0.46 % Positive unorientable unit clauses: 4
% 0.14/0.46 % Negative unit clauses : 94
% 0.14/0.46 % Non-unit-clauses : 77
% 0.14/0.46 % Current number of unprocessed clauses: 945
% 0.14/0.46 % ...number of literals in the above : 2351
% 0.14/0.46 % Current number of archived formulas : 0
% 0.14/0.46 % Current number of archived clauses : 144
% 0.14/0.46 % Clause-clause subsumption calls (NU) : 5322
% 0.14/0.46 % Rec. Clause-clause subsumption calls : 5184
% 0.14/0.46 % Non-unit clause-clause subsumptions : 137
% 0.14/0.46 % Unit Clause-clause subsumption calls : 3239
% 0.14/0.46 % Rewrite failures with RHS unbound : 0
% 0.14/0.46 % BW rewrite match attempts : 76
% 0.14/0.46 % BW rewrite match successes : 51
% 0.14/0.46 % Condensation attempts : 575
% 0.14/0.46 % Condensation successes : 2
% 0.14/0.46 % Termbank termtop insertions : 27810
% 0.14/0.46 % Search garbage collected termcells : 680
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.035 s
% 0.14/0.46 % System time : 0.008 s
% 0.14/0.46 % Total time : 0.043 s
% 0.14/0.46 % Maximum resident set size: 3732 pages
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.172 s
% 0.14/0.46 % System time : 0.023 s
% 0.14/0.46 % Total time : 0.195 s
% 0.14/0.46 % Maximum resident set size: 4864 pages
% 0.14/0.46 % E exiting
%------------------------------------------------------------------------------