TSTP Solution File: PRO014+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PRO014+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:10:15 EDT 2024
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 44 ( 13 unt; 0 def)
% Number of atoms : 214 ( 0 equ)
% Maximal formula atoms : 36 ( 4 avg)
% Number of connectives : 272 ( 102 ~; 115 |; 49 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 74 ( 0 sgn 30 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_32,axiom,
! [X96,X97] :
( ( occurrence_of(X97,tptp0)
& subactivity_occurrence(X96,X97)
& arboreal(X96)
& ~ leaf_occ(X96,X97) )
=> ? [X98,X99,X100] :
( occurrence_of(X98,tptp3)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X99,tptp4)
& next_subocc(X98,X99,tptp0)
& ( occurrence_of(X100,tptp2)
| occurrence_of(X100,tptp1) )
& next_subocc(X99,X100,tptp0)
& leaf(X100,tptp0) ) ),
file('/export/starexec/sandbox/tmp/tmp.LgCdAPK6pe/E---3.1_32554.p',sos_32) ).
fof(goals,conjecture,
! [X101,X102] :
( ( occurrence_of(X102,tptp0)
& subactivity_occurrence(X101,X102)
& arboreal(X101)
& ~ leaf_occ(X101,X102) )
=> ? [X103,X104] :
( occurrence_of(X103,tptp3)
& next_subocc(X101,X103,tptp0)
& ( occurrence_of(X104,tptp2)
| occurrence_of(X104,tptp1) )
& min_precedes(X103,X104,tptp0)
& leaf(X104,tptp0) ) ),
file('/export/starexec/sandbox/tmp/tmp.LgCdAPK6pe/E---3.1_32554.p',goals) ).
fof(sos_04,axiom,
! [X16,X17,X18] :
( next_subocc(X16,X17,X18)
<=> ( min_precedes(X16,X17,X18)
& ~ ? [X19] :
( min_precedes(X16,X19,X18)
& min_precedes(X19,X17,X18) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LgCdAPK6pe/E---3.1_32554.p',sos_04) ).
fof(sos,axiom,
! [X1,X2,X3,X4] :
( ( min_precedes(X1,X2,X4)
& min_precedes(X2,X3,X4) )
=> min_precedes(X1,X3,X4) ),
file('/export/starexec/sandbox/tmp/tmp.LgCdAPK6pe/E---3.1_32554.p',sos) ).
fof(c_0_4,plain,
! [X96,X97] :
( ( occurrence_of(X97,tptp0)
& subactivity_occurrence(X96,X97)
& arboreal(X96)
& ~ leaf_occ(X96,X97) )
=> ? [X98,X99,X100] :
( occurrence_of(X98,tptp3)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X99,tptp4)
& next_subocc(X98,X99,tptp0)
& ( occurrence_of(X100,tptp2)
| occurrence_of(X100,tptp1) )
& next_subocc(X99,X100,tptp0)
& leaf(X100,tptp0) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_5,negated_conjecture,
~ ! [X101,X102] :
( ( occurrence_of(X102,tptp0)
& subactivity_occurrence(X101,X102)
& arboreal(X101)
& ~ leaf_occ(X101,X102) )
=> ? [X103,X104] :
( occurrence_of(X103,tptp3)
& next_subocc(X101,X103,tptp0)
& ( occurrence_of(X104,tptp2)
| occurrence_of(X104,tptp1) )
& min_precedes(X103,X104,tptp0)
& leaf(X104,tptp0) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
fof(c_0_6,plain,
! [X129,X130] :
( ( occurrence_of(esk8_1(X129),tptp3)
| ~ occurrence_of(X130,tptp0)
| ~ subactivity_occurrence(X129,X130)
| ~ arboreal(X129)
| leaf_occ(X129,X130) )
& ( next_subocc(X129,esk8_1(X129),tptp0)
| ~ occurrence_of(X130,tptp0)
| ~ subactivity_occurrence(X129,X130)
| ~ arboreal(X129)
| leaf_occ(X129,X130) )
& ( occurrence_of(esk9_1(X129),tptp4)
| ~ occurrence_of(X130,tptp0)
| ~ subactivity_occurrence(X129,X130)
| ~ arboreal(X129)
| leaf_occ(X129,X130) )
& ( next_subocc(esk8_1(X129),esk9_1(X129),tptp0)
| ~ occurrence_of(X130,tptp0)
| ~ subactivity_occurrence(X129,X130)
| ~ arboreal(X129)
| leaf_occ(X129,X130) )
& ( occurrence_of(esk10_1(X129),tptp2)
| occurrence_of(esk10_1(X129),tptp1)
| ~ occurrence_of(X130,tptp0)
| ~ subactivity_occurrence(X129,X130)
| ~ arboreal(X129)
| leaf_occ(X129,X130) )
& ( next_subocc(esk9_1(X129),esk10_1(X129),tptp0)
| ~ occurrence_of(X130,tptp0)
| ~ subactivity_occurrence(X129,X130)
| ~ arboreal(X129)
| leaf_occ(X129,X130) )
& ( leaf(esk10_1(X129),tptp0)
| ~ occurrence_of(X130,tptp0)
| ~ subactivity_occurrence(X129,X130)
| ~ arboreal(X129)
| leaf_occ(X129,X130) ) ),
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)],[c_0_4])])])])])])]) ).
fof(c_0_7,negated_conjecture,
! [X107,X108] :
( occurrence_of(esk2_0,tptp0)
& subactivity_occurrence(esk1_0,esk2_0)
& arboreal(esk1_0)
& ~ leaf_occ(esk1_0,esk2_0)
& ( ~ occurrence_of(X108,tptp2)
| ~ occurrence_of(X107,tptp3)
| ~ next_subocc(esk1_0,X107,tptp0)
| ~ min_precedes(X107,X108,tptp0)
| ~ leaf(X108,tptp0) )
& ( ~ occurrence_of(X108,tptp1)
| ~ occurrence_of(X107,tptp3)
| ~ next_subocc(esk1_0,X107,tptp0)
| ~ min_precedes(X107,X108,tptp0)
| ~ leaf(X108,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_5])])])])])]) ).
cnf(c_0_8,plain,
( next_subocc(esk9_1(X1),esk10_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
occurrence_of(esk2_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( leaf(esk10_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X145,X146,X147,X148,X149,X150,X151] :
( ( min_precedes(X145,X146,X147)
| ~ next_subocc(X145,X146,X147) )
& ( ~ min_precedes(X145,X148,X147)
| ~ min_precedes(X148,X146,X147)
| ~ next_subocc(X145,X146,X147) )
& ( min_precedes(X149,esk12_3(X149,X150,X151),X151)
| ~ min_precedes(X149,X150,X151)
| next_subocc(X149,X150,X151) )
& ( min_precedes(esk12_3(X149,X150,X151),X150,X151)
| ~ min_precedes(X149,X150,X151)
| next_subocc(X149,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_04])])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( next_subocc(esk9_1(X1),esk10_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
subactivity_occurrence(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
arboreal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
~ leaf_occ(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( next_subocc(esk8_1(X1),esk9_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( leaf(esk10_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_18,plain,
( occurrence_of(esk10_1(X1),tptp2)
| occurrence_of(esk10_1(X1),tptp1)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_19,plain,
! [X134,X135,X136,X137] :
( ~ min_precedes(X134,X135,X137)
| ~ min_precedes(X135,X136,X137)
| min_precedes(X134,X136,X137) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])]) ).
cnf(c_0_20,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
next_subocc(esk9_1(esk1_0),esk10_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( next_subocc(esk8_1(X1),esk9_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X2,tptp3)
| ~ next_subocc(esk1_0,X2,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ leaf(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
leaf(esk10_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk10_1(X1),tptp1)
| occurrence_of(esk10_1(X1),tptp2)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X2,tptp3)
| ~ next_subocc(esk1_0,X2,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ leaf(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,plain,
( occurrence_of(esk8_1(X1),tptp3)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_28,plain,
( next_subocc(X1,esk8_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_29,plain,
( min_precedes(X1,X4,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X2,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,negated_conjecture,
min_precedes(esk9_1(esk1_0),esk10_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_31,negated_conjecture,
next_subocc(esk8_1(esk1_0),esk9_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_32,negated_conjecture,
( ~ next_subocc(esk1_0,X1,tptp0)
| ~ occurrence_of(esk10_1(esk1_0),tptp1)
| ~ occurrence_of(X1,tptp3)
| ~ min_precedes(X1,esk10_1(esk1_0),tptp0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( occurrence_of(esk10_1(esk1_0),tptp2)
| occurrence_of(esk10_1(esk1_0),tptp1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_34,negated_conjecture,
( ~ next_subocc(esk1_0,X1,tptp0)
| ~ occurrence_of(esk10_1(esk1_0),tptp2)
| ~ occurrence_of(X1,tptp3)
| ~ min_precedes(X1,esk10_1(esk1_0),tptp0) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_35,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk8_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_9]) ).
cnf(c_0_36,negated_conjecture,
( next_subocc(X1,esk8_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_9]) ).
cnf(c_0_37,negated_conjecture,
( min_precedes(X1,esk10_1(esk1_0),tptp0)
| ~ min_precedes(X1,esk9_1(esk1_0),tptp0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
min_precedes(esk8_1(esk1_0),esk9_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
( ~ next_subocc(esk1_0,X1,tptp0)
| ~ occurrence_of(X1,tptp3)
| ~ min_precedes(X1,esk10_1(esk1_0),tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_40,negated_conjecture,
occurrence_of(esk8_1(esk1_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_41,negated_conjecture,
next_subocc(esk1_0,esk8_1(esk1_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_42,negated_conjecture,
min_precedes(esk8_1(esk1_0),esk10_1(esk1_0),tptp0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : PRO014+2 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 15:47:22 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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/tmp/tmp.LgCdAPK6pe/E---3.1_32554.p
% 0.17/0.47 # Version: 3.1.0
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # new_bool_3 with pid 32633 completed with status 0
% 0.17/0.47 # Result found by new_bool_3
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.17/0.47 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 32636 completed with status 0
% 0.17/0.47 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 0.17/0.47 # Preprocessing time : 0.002 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 46
% 0.17/0.47 # Removed by relevancy pruning/SinE : 7
% 0.17/0.47 # Initial clauses : 76
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 76
% 0.17/0.47 # Processed clauses : 355
% 0.17/0.47 # ...of these trivial : 10
% 0.17/0.47 # ...subsumed : 27
% 0.17/0.47 # ...remaining for further processing : 318
% 0.17/0.47 # Other redundant clauses eliminated : 0
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 3
% 0.17/0.47 # Backward-rewritten : 12
% 0.17/0.47 # Generated clauses : 432
% 0.17/0.47 # ...of the previous two non-redundant : 371
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 2
% 0.17/0.47 # Paramodulations : 432
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 0
% 0.17/0.47 # Disequality decompositions : 0
% 0.17/0.47 # Total rewrite steps : 144
% 0.17/0.47 # ...of those cached : 99
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 227
% 0.17/0.47 # Positive orientable unit clauses : 75
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 38
% 0.17/0.47 # Non-unit-clauses : 114
% 0.17/0.47 # Current number of unprocessed clauses: 159
% 0.17/0.47 # ...number of literals in the above : 354
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 91
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 5189
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 2123
% 0.17/0.47 # Non-unit clause-clause subsumptions : 13
% 0.17/0.47 # Unit Clause-clause subsumption calls : 450
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 14
% 0.17/0.47 # BW rewrite match successes : 5
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 11406
% 0.17/0.47 # Search garbage collected termcells : 1187
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.020 s
% 0.17/0.47 # System time : 0.003 s
% 0.17/0.47 # Total time : 0.023 s
% 0.17/0.47 # Maximum resident set size: 2060 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.022 s
% 0.17/0.47 # System time : 0.005 s
% 0.17/0.47 # Total time : 0.027 s
% 0.17/0.47 # Maximum resident set size: 1808 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.48 % E exiting
%------------------------------------------------------------------------------