%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO011+1 : 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 : n008.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:59:32 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 43 ( 9 unt; 0 def)
% Number of atoms : 194 ( 11 equ)
% Maximal formula atoms : 49 ( 4 avg)
% Number of connectives : 224 ( 73 ~; 85 |; 54 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-2 aty)
% Number of variables : 79 ( 8 sgn 33 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X110] :
( occurrence_of(X110,tptp0)
=> ? [X111,X112] :
( ( occurrence_of(X112,tptp2)
=> ~ ? [X114] :
( min_precedes(X111,X114,tptp0)
& subactivity_occurrence(X114,X110)
& occurrence_of(X114,tptp1) ) )
& ( occurrence_of(X112,tptp1)
=> ~ ? [X113] :
( min_precedes(X111,X113,tptp0)
& subactivity_occurrence(X113,X110)
& occurrence_of(X113,tptp2) ) )
& leaf_occ(X112,X110) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X7)
& occurrence_of(X5,X6) )
=> X6 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(sos_21,axiom,
! [X57,X58] :
( leaf(X57,X58)
<=> ( ~ ? [X60] : min_precedes(X57,X60,X58)
& ( ? [X59] : min_precedes(X59,X57,X58)
| root(X57,X58) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(sos_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( leaf(X103,X105)
& subactivity_occurrence(X103,X104)
& occurrence_of(X104,X105) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(sos_35,axiom,
! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108,X109] :
( leaf_occ(X109,X106)
& next_subocc(X108,X109,tptp0)
& ( occurrence_of(X109,tptp2)
| occurrence_of(X109,tptp1) )
& next_subocc(X107,X108,tptp0)
& occurrence_of(X108,tptp4)
& root_occ(X107,X106)
& occurrence_of(X107,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35) ).
fof(sos_01,axiom,
! [X3] :
( activity_occurrence(X3)
=> ? [X4] :
( occurrence_of(X3,X4)
& activity(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
fof(sos,axiom,
! [X1,X2] :
( occurrence_of(X2,X1)
=> ( activity_occurrence(X2)
& activity(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(sos_47,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_47) ).
fof(c_0_8,negated_conjecture,
~ ! [X110] :
( occurrence_of(X110,tptp0)
=> ? [X111,X112] :
( ( occurrence_of(X112,tptp2)
=> ~ ? [X114] :
( min_precedes(X111,X114,tptp0)
& subactivity_occurrence(X114,X110)
& occurrence_of(X114,tptp1) ) )
& ( occurrence_of(X112,tptp1)
=> ~ ? [X113] :
( min_precedes(X111,X113,tptp0)
& subactivity_occurrence(X113,X110)
& occurrence_of(X113,tptp2) ) )
& leaf_occ(X112,X110) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,plain,
! [X147,X148,X149] :
( X148 = X149
| ~ occurrence_of(X147,X149)
| ~ occurrence_of(X147,X148) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
fof(c_0_10,negated_conjecture,
! [X116,X117] :
( ( ~ leaf_occ(X117,esk1_0)
| min_precedes(X116,esk2_2(X116,X117),tptp0)
| min_precedes(X116,esk3_2(X116,X117),tptp0) )
& ( ~ leaf_occ(X117,esk1_0)
| min_precedes(X116,esk2_2(X116,X117),tptp0)
| subactivity_occurrence(esk3_2(X116,X117),esk1_0) )
& ( ~ leaf_occ(X117,esk1_0)
| min_precedes(X116,esk2_2(X116,X117),tptp0)
| occurrence_of(esk3_2(X116,X117),tptp1) )
& ( ~ leaf_occ(X117,esk1_0)
| min_precedes(X116,esk2_2(X116,X117),tptp0)
| occurrence_of(X117,tptp2) )
& ( ~ leaf_occ(X117,esk1_0)
| subactivity_occurrence(esk2_2(X116,X117),esk1_0)
| min_precedes(X116,esk3_2(X116,X117),tptp0) )
& ( ~ leaf_occ(X117,esk1_0)
| subactivity_occurrence(esk2_2(X116,X117),esk1_0)
| subactivity_occurrence(esk3_2(X116,X117),esk1_0) )
& ( ~ leaf_occ(X117,esk1_0)
| subactivity_occurrence(esk2_2(X116,X117),esk1_0)
| occurrence_of(esk3_2(X116,X117),tptp1) )
& ( ~ leaf_occ(X117,esk1_0)
| subactivity_occurrence(esk2_2(X116,X117),esk1_0)
| occurrence_of(X117,tptp2) )
& ( ~ leaf_occ(X117,esk1_0)
| occurrence_of(esk2_2(X116,X117),tptp2)
| min_precedes(X116,esk3_2(X116,X117),tptp0) )
& ( ~ leaf_occ(X117,esk1_0)
| occurrence_of(esk2_2(X116,X117),tptp2)
| subactivity_occurrence(esk3_2(X116,X117),esk1_0) )
& ( ~ leaf_occ(X117,esk1_0)
| occurrence_of(esk2_2(X116,X117),tptp2)
| occurrence_of(esk3_2(X116,X117),tptp1) )
& ( ~ leaf_occ(X117,esk1_0)
| occurrence_of(esk2_2(X116,X117),tptp2)
| occurrence_of(X117,tptp2) )
& ( ~ leaf_occ(X117,esk1_0)
| occurrence_of(X117,tptp1)
| min_precedes(X116,esk3_2(X116,X117),tptp0) )
& ( ~ leaf_occ(X117,esk1_0)
| occurrence_of(X117,tptp1)
| subactivity_occurrence(esk3_2(X116,X117),esk1_0) )
& ( ~ leaf_occ(X117,esk1_0)
| occurrence_of(X117,tptp1)
| occurrence_of(esk3_2(X116,X117),tptp1) )
& ( ~ leaf_occ(X117,esk1_0)
| occurrence_of(X117,tptp1)
| occurrence_of(X117,tptp2) )
& occurrence_of(esk1_0,tptp0) ),
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_8])])])])])]) ).
fof(c_0_11,plain,
! [X165,X166,X168,X169,X170,X171] :
( ( leaf(X169,X170)
| min_precedes(X169,esk14_2(X169,X170),X170)
| ~ min_precedes(X171,X169,X170) )
& ( leaf(X169,X170)
| min_precedes(X169,esk14_2(X169,X170),X170)
| ~ root(X169,X170) )
& ( ~ leaf(X165,X166)
| ~ min_precedes(X165,X168,X166) )
& ( ~ leaf(X165,X166)
| min_precedes(esk13_2(X165,X166),X165,X166)
| root(X165,X166) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])])])])]) ).
cnf(c_0_12,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X150,X151,X153,X154,X155] :
( ( leaf_occ(X153,X154)
| ~ leaf(X153,X155)
| ~ subactivity_occurrence(X153,X154)
| ~ occurrence_of(X154,X155) )
& ( ~ leaf_occ(X150,X151)
| leaf(X150,esk8_2(X150,X151)) )
& ( ~ leaf_occ(X150,X151)
| subactivity_occurrence(X150,X151) )
& ( ~ leaf_occ(X150,X151)
| occurrence_of(X151,esk8_2(X150,X151)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_34])])])])])])]) ).
cnf(c_0_15,plain,
( ~ leaf(X1,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ leaf_occ(X2,esk1_0)
| occurrence_of(X2,tptp1)
| min_precedes(X1,esk3_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,plain,
! [X156] :
( ( ~ occurrence_of(X156,tptp0)
| leaf_occ(esk11_1(X156),X156) )
& ( ~ occurrence_of(X156,tptp0)
| next_subocc(esk10_1(X156),esk11_1(X156),tptp0) )
& ( ~ occurrence_of(X156,tptp0)
| occurrence_of(esk11_1(X156),tptp2)
| occurrence_of(esk11_1(X156),tptp1) )
& ( ~ occurrence_of(X156,tptp0)
| next_subocc(esk9_1(X156),esk10_1(X156),tptp0) )
& ( ~ occurrence_of(X156,tptp0)
| occurrence_of(esk10_1(X156),tptp4) )
& ( ~ occurrence_of(X156,tptp0)
| root_occ(esk9_1(X156),X156) )
& ( ~ occurrence_of(X156,tptp0)
| occurrence_of(esk9_1(X156),tptp3) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_35])])])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ occurrence_of(esk1_0,X1)
| X1 = tptp0 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( ~ leaf_occ(X2,X1)
| occurrence_of(X1,esk8_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| min_precedes(X2,esk2_2(X2,X1),tptp0)
| occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( ~ leaf(X2,tptp0)
| ~ leaf_occ(X1,esk1_0)
| occurrence_of(X1,tptp1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ occurrence_of(X1,tptp0)
| leaf_occ(esk11_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( ~ leaf_occ(X1,X2)
| leaf(X1,esk8_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| esk8_2(X1,esk1_0) = tptp0 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( ~ leaf(X2,tptp0)
| ~ leaf_occ(X1,esk1_0)
| occurrence_of(X1,tptp2) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
fof(c_0_26,plain,
! [X162] :
( ( ~ activity_occurrence(X162)
| occurrence_of(X162,esk12_1(X162)) )
& ( ~ activity_occurrence(X162)
| activity(esk12_1(X162)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_01])])])])]) ).
fof(c_0_27,plain,
! [X160,X161] :
( ( ~ occurrence_of(X161,X160)
| activity_occurrence(X161) )
& ( ~ occurrence_of(X161,X160)
| activity(X160) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ leaf(X1,tptp0)
| occurrence_of(esk11_1(esk1_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13])]) ).
cnf(c_0_29,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ leaf(X1,tptp0)
| occurrence_of(esk11_1(esk1_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_22]),c_0_13])]) ).
cnf(c_0_31,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk12_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| occurrence_of(esk11_1(esk1_0),tptp1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_34,plain,
tptp1 != tptp2,
inference(fof_simplification,[status(thm)],[sos_47]) ).
cnf(c_0_35,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| occurrence_of(esk11_1(esk1_0),tptp2) ),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_36,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk12_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_31]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
occurrence_of(esk11_1(esk1_0),tptp1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_13])]) ).
fof(c_0_38,plain,
tptp1 != tptp2,
inference(fof_nnf,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
occurrence_of(esk11_1(esk1_0),tptp2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_22]),c_0_13])]) ).
cnf(c_0_40,negated_conjecture,
esk12_1(esk11_1(esk1_0)) = tptp1,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
tptp1 != tptp2,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_39]),c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO011+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 03:43:25 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % new_bool_1 with pid 70240 completed with status 0
% 0.11/0.45 % Result found by new_bool_1
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 70244 completed with status 0
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.45 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Theorem
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 49
% 0.11/0.45 % Removed by relevancy pruning/SinE : 13
% 0.11/0.45 % Initial clauses : 86
% 0.11/0.45 % Removed in clause preprocessing : 0
% 0.11/0.45 % Initial clauses in saturation : 86
% 0.11/0.45 % Processed clauses : 287
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 72
% 0.11/0.45 % ...remaining for further processing : 215
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 4
% 0.11/0.45 % Backward-rewritten : 25
% 0.11/0.45 % Generated clauses : 617
% 0.11/0.45 % ...of the previous two non-redundant : 405
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 4
% 0.11/0.45 % Paramodulations : 617
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 300
% 0.11/0.45 % ...of those cached : 274
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 186
% 0.11/0.45 % Positive orientable unit clauses : 25
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 14
% 0.11/0.45 % Non-unit-clauses : 147
% 0.11/0.45 % Current number of unprocessed clauses: 197
% 0.11/0.45 % ...number of literals in the above : 621
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 29
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 6770
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 6073
% 0.11/0.45 % Non-unit clause-clause subsumptions : 64
% 0.11/0.45 % Unit Clause-clause subsumption calls : 376
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 10
% 0.11/0.45 % BW rewrite match successes : 10
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 10724
% 0.11/0.45 % Search garbage collected termcells : 1288
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.015 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.019 s
% 0.11/0.45 % Maximum resident set size: 4004 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.020 s
% 0.11/0.45 % System time : 0.006 s
% 0.11/0.45 % Total time : 0.026 s
% 0.11/0.45 % Maximum resident set size: 4608 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------