%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ129+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 02:01:56 PM UTC 2026
% Result : Theorem 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 40 ( 11 unt; 0 def)
% Number of atoms : 283 ( 62 equ)
% Maximal formula atoms : 58 ( 7 avg)
% Number of connectives : 352 ( 109 ~; 87 |; 112 &)
% ( 1 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-1 aty)
% Number of variables : 111 ( 0 sgn 51 !; 39 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove,conjecture,
( ( ! [X17] :
( cyclist(X17)
=> ? [X18] :
( X17 = X18
& person(X18) ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( X15 = X16
& person(X16) ) )
& ! [X13] :
( ( property1(X13,honest,pos)
& person(X13) )
=> ~ ? [X14] :
( X13 = X14
& property1(X14,dishonest,pos) ) )
& ! [X11] :
( ( property1(X11,healthy,pos)
& person(X11) )
=> ~ ? [X12] :
( X11 = X12
& property1(X12,unhealthy,pos) ) )
& ! [X9] :
( ( property1(X9,unhealthy,pos)
& cyclist(X9) )
=> ? [X10] :
( X9 = X10
& property1(X10,dishonest,pos) ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( X7 = X8
& property1(X8,industrious,pos) ) )
& ! [X5] :
( ( property1(X5,industrious,pos)
& grocer(X5) )
=> ? [X6] :
( X5 = X6
& property1(X6,honest,pos) ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( X3 = X4
& property1(X4,healthy,pos) ) )
& ! [X1] :
( ( property1(X1,industrious,pos)
& property1(X1,honest,pos)
& person(X1) )
=> ? [X2] :
( X1 = X2
& property1(X2,healthy,pos) ) ) )
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( X19 = X20
& cyclist(X20) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
fof(c_0_1,plain,
( epred1_0
<=> ( ! [X17] :
( cyclist(X17)
=> ? [X18] :
( X17 = X18
& person(X18) ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( X15 = X16
& person(X16) ) )
& ! [X13] :
( ( property1(X13,honest,pos)
& person(X13) )
=> ~ ? [X14] :
( X13 = X14
& property1(X14,dishonest,pos) ) )
& ! [X11] :
( ( property1(X11,healthy,pos)
& person(X11) )
=> ~ ? [X12] :
( X11 = X12
& property1(X12,unhealthy,pos) ) )
& ! [X9] :
( ( property1(X9,unhealthy,pos)
& cyclist(X9) )
=> ? [X10] :
( X9 = X10
& property1(X10,dishonest,pos) ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( X7 = X8
& property1(X8,industrious,pos) ) )
& ! [X5] :
( ( property1(X5,industrious,pos)
& grocer(X5) )
=> ? [X6] :
( X5 = X6
& property1(X6,honest,pos) ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( X3 = X4
& property1(X4,healthy,pos) ) )
& ! [X1] :
( ( property1(X1,industrious,pos)
& property1(X1,honest,pos)
& person(X1) )
=> ? [X2] :
( X1 = X2
& property1(X2,healthy,pos) ) ) ) ),
introduced(definition) ).
fof(c_0_2,negated_conjecture,
~ ( ( ! [X17] :
( cyclist(X17)
=> ? [X18] :
( X17 = X18
& person(X18) ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( X15 = X16
& person(X16) ) )
& ! [X13] :
( ( property1(X13,honest,pos)
& person(X13) )
=> ~ ? [X14] :
( X13 = X14
& property1(X14,dishonest,pos) ) )
& ! [X11] :
( ( property1(X11,healthy,pos)
& person(X11) )
=> ~ ? [X12] :
( X11 = X12
& property1(X12,unhealthy,pos) ) )
& ! [X9] :
( ( property1(X9,unhealthy,pos)
& cyclist(X9) )
=> ? [X10] :
( X9 = X10
& property1(X10,dishonest,pos) ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( X7 = X8
& property1(X8,industrious,pos) ) )
& ! [X5] :
( ( property1(X5,industrious,pos)
& grocer(X5) )
=> ? [X6] :
( X5 = X6
& property1(X6,honest,pos) ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( X3 = X4
& property1(X4,healthy,pos) ) )
& ! [X1] :
( ( property1(X1,industrious,pos)
& property1(X1,honest,pos)
& person(X1) )
=> ? [X2] :
( X1 = X2
& property1(X2,healthy,pos) ) ) )
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( X19 = X20
& cyclist(X20) ) ) ),
inference(assume_negation,[status(cth)],[prove]) ).
fof(c_0_3,plain,
( epred1_0
=> ( ! [X17] :
( cyclist(X17)
=> ? [X18] :
( X17 = X18
& person(X18) ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( X15 = X16
& person(X16) ) )
& ! [X13] :
( ( property1(X13,honest,pos)
& person(X13) )
=> ~ ? [X14] :
( X13 = X14
& property1(X14,dishonest,pos) ) )
& ! [X11] :
( ( property1(X11,healthy,pos)
& person(X11) )
=> ~ ? [X12] :
( X11 = X12
& property1(X12,unhealthy,pos) ) )
& ! [X9] :
( ( property1(X9,unhealthy,pos)
& cyclist(X9) )
=> ? [X10] :
( X9 = X10
& property1(X10,dishonest,pos) ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( X7 = X8
& property1(X8,industrious,pos) ) )
& ! [X5] :
( ( property1(X5,industrious,pos)
& grocer(X5) )
=> ? [X6] :
( X5 = X6
& property1(X6,honest,pos) ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( X3 = X4
& property1(X4,healthy,pos) ) )
& ! [X1] :
( ( property1(X1,industrious,pos)
& property1(X1,honest,pos)
& person(X1) )
=> ? [X2] :
( X1 = X2
& property1(X2,healthy,pos) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_4,negated_conjecture,
~ ( epred1_0
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( X19 = X20
& cyclist(X20) ) ) ),
inference(apply_def,[status(thm)],[c_0_2,c_0_1]) ).
fof(c_0_5,plain,
! [X23,X25,X26,X27,X29,X31,X33,X34,X35,X36,X37,X39] :
( ( ~ epred1_0
| ~ cyclist(X39)
| X39 = esk8_1(X39) )
& ( ~ epred1_0
| ~ cyclist(X39)
| person(esk8_1(X39)) )
& ( ~ epred1_0
| ~ grocer(X37)
| X37 = esk7_1(X37) )
& ( ~ epred1_0
| ~ grocer(X37)
| person(esk7_1(X37)) )
& ( ~ epred1_0
| X35 != X36
| ~ property1(X36,dishonest,pos)
| ~ property1(X35,honest,pos)
| ~ person(X35) )
& ( ~ epred1_0
| X33 != X34
| ~ property1(X34,unhealthy,pos)
| ~ property1(X33,healthy,pos)
| ~ person(X33) )
& ( ~ epred1_0
| ~ property1(X31,unhealthy,pos)
| ~ cyclist(X31)
| X31 = esk6_1(X31) )
& ( ~ epred1_0
| ~ property1(X31,unhealthy,pos)
| ~ cyclist(X31)
| property1(esk6_1(X31),dishonest,pos) )
& ( ~ epred1_0
| ~ cyclist(X29)
| X29 = esk5_1(X29) )
& ( ~ epred1_0
| ~ cyclist(X29)
| property1(esk5_1(X29),industrious,pos) )
& ( ~ epred1_0
| ~ property1(X27,industrious,pos)
| ~ grocer(X27)
| X27 = esk4_1(X27) )
& ( ~ epred1_0
| ~ property1(X27,industrious,pos)
| ~ grocer(X27)
| property1(esk4_1(X27),honest,pos) )
& ( ~ epred1_0
| X25 != X26
| ~ property1(X26,healthy,pos)
| ~ grocer(X25) )
& ( ~ epred1_0
| ~ property1(X23,industrious,pos)
| ~ property1(X23,honest,pos)
| ~ person(X23)
| X23 = esk3_1(X23) )
& ( ~ epred1_0
| ~ property1(X23,industrious,pos)
| ~ property1(X23,honest,pos)
| ~ person(X23)
| property1(esk3_1(X23),healthy,pos) ) ),
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_3])])])])])]) ).
fof(c_0_6,negated_conjecture,
( esk1_0 = esk2_0
& cyclist(esk2_0)
& grocer(esk1_0)
& epred1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( ~ epred1_0
| ~ cyclist(X1)
| property1(esk5_1(X1),industrious,pos) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ epred1_0
| ~ cyclist(X1)
| X1 = esk5_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ cyclist(X1)
| property1(esk5_1(X1),industrious,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_11,plain,
( ~ cyclist(X1)
| esk5_1(X1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8])]) ).
cnf(c_0_12,negated_conjecture,
cyclist(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ grocer(X1)
| X1 = esk4_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( ~ cyclist(X1)
| property1(X1,industrious,pos) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
cyclist(esk1_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ grocer(X1)
| property1(esk4_1(X1),honest,pos) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( ~ property1(X1,industrious,pos)
| ~ grocer(X1)
| esk4_1(X1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_8])]) ).
cnf(c_0_19,negated_conjecture,
property1(esk1_0,industrious,pos),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
grocer(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,plain,
( ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| ~ person(X1)
| X1 = esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,plain,
( ~ property1(X1,industrious,pos)
| ~ grocer(X1)
| property1(esk4_1(X1),honest,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_8])]) ).
cnf(c_0_23,plain,
esk4_1(esk1_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,plain,
( ~ epred1_0
| ~ grocer(X1)
| person(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,plain,
( ~ epred1_0
| ~ grocer(X1)
| X1 = esk7_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,plain,
( ~ person(X1)
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| esk3_1(X1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_8])]) ).
cnf(c_0_27,negated_conjecture,
property1(esk1_0,honest,pos),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_23]),c_0_20])]) ).
cnf(c_0_28,plain,
( ~ grocer(X1)
| person(esk7_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_8])]) ).
cnf(c_0_29,plain,
( ~ grocer(X1)
| esk7_1(X1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_8])]) ).
cnf(c_0_30,plain,
( ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| ~ person(X1)
| property1(esk3_1(X1),healthy,pos) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_31,negated_conjecture,
( ~ person(esk1_0)
| esk3_1(esk1_0) = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19])]) ).
cnf(c_0_32,plain,
( ~ grocer(X1)
| person(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( ~ person(X1)
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| property1(esk3_1(X1),healthy,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_8])]) ).
cnf(c_0_34,plain,
esk3_1(esk1_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_20])]) ).
cnf(c_0_35,plain,
( ~ epred1_0
| X1 != X2
| ~ property1(X2,healthy,pos)
| ~ grocer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_36,negated_conjecture,
( ~ person(esk1_0)
| property1(esk1_0,healthy,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_27]),c_0_34]),c_0_19])]) ).
cnf(c_0_37,plain,
( ~ property1(X1,healthy,pos)
| ~ grocer(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_8])])]) ).
cnf(c_0_38,plain,
property1(esk1_0,healthy,pos),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_32]),c_0_20])]) ).
cnf(c_0_39,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ129+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n003.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 03:54:15 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3349108 completed with status 0
% 0.12/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44 % No SInE strategy applied
% 0.12/0.44 % Search class: FHHSF-FFSS11-SFFFFFNN
% 0.12/0.44 % partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.44 % new_bool_3 with pid 3349115 completed with status 0
% 0.12/0.44 % Result found by new_bool_3
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44 % No SInE strategy applied
% 0.12/0.44 % Search class: FHHSF-FFSS11-SFFFFFNN
% 0.12/0.44 % partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44 % Presaturation interreduction done
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Theorem
% 0.12/0.44 % SZS output start CNFRefutation
% See solution above
% 0.12/0.44 % Parsed axioms : 1
% 0.12/0.44 % Removed by relevancy pruning/SinE : 0
% 0.12/0.44 % Initial clauses : 19
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 19
% 0.12/0.44 % Processed clauses : 64
% 0.12/0.44 % ...of these trivial : 0
% 0.12/0.44 % ...subsumed : 3
% 0.12/0.44 % ...remaining for further processing : 61
% 0.12/0.44 % Other redundant clauses eliminated : 3
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 0
% 0.12/0.44 % Backward-rewritten : 2
% 0.12/0.44 % Generated clauses : 37
% 0.12/0.44 % ...of the previous two non-redundant : 31
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 3
% 0.12/0.44 % Paramodulations : 34
% 0.12/0.44 % Factorizations : 0
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 3
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 49
% 0.12/0.44 % ...of those cached : 40
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 37
% 0.12/0.44 % Positive orientable unit clauses : 9
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 0
% 0.12/0.44 % Non-unit-clauses : 28
% 0.12/0.44 % Current number of unprocessed clauses: 4
% 0.12/0.44 % ...number of literals in the above : 16
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 21
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 227
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 116
% 0.12/0.44 % Non-unit clause-clause subsumptions : 6
% 0.12/0.44 % Unit Clause-clause subsumption calls : 41
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 2
% 0.12/0.44 % BW rewrite match successes : 2
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 2304
% 0.12/0.44 % Search garbage collected termcells : 381
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.004 s
% 0.12/0.44 % System time : 0.002 s
% 0.12/0.44 % Total time : 0.006 s
% 0.12/0.44 % Maximum resident set size: 3648 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.015 s
% 0.12/0.44 % System time : 0.011 s
% 0.12/0.44 % Total time : 0.026 s
% 0.12/0.44 % Maximum resident set size: 4608 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------