TSTP Solution File: NUM401+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM401+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:55:37 EDT 2023
% Result : Theorem 0.23s 0.59s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 61 ( 13 unt; 0 def)
% Number of atoms : 201 ( 44 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 223 ( 83 ~; 96 |; 24 &)
% ( 9 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 95 ( 5 sgn; 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t34_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,succ(X2))
<=> ordinal_subset(X1,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.04qI6vkhTI/E---3.1_16423.p',t34_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox2/tmp/tmp.04qI6vkhTI/E---3.1_16423.p',d1_ordinal1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.04qI6vkhTI/E---3.1_16423.p',d2_xboole_0) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.04qI6vkhTI/E---3.1_16423.p',redefinition_r1_ordinal1) ).
fof(t24_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.04qI6vkhTI/E---3.1_16423.p',t24_ordinal1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.04qI6vkhTI/E---3.1_16423.p',d1_tarski) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.04qI6vkhTI/E---3.1_16423.p',cc1_ordinal1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.04qI6vkhTI/E---3.1_16423.p',d2_ordinal1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.04qI6vkhTI/E---3.1_16423.p',d10_xboole_0) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.04qI6vkhTI/E---3.1_16423.p',reflexivity_r1_tarski) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,succ(X2))
<=> ordinal_subset(X1,X2) ) ) ),
inference(assume_negation,[status(cth)],[t34_ordinal1]) ).
fof(c_0_11,negated_conjecture,
( ordinal(esk18_0)
& ordinal(esk19_0)
& ( ~ in(esk18_0,succ(esk19_0))
| ~ ordinal_subset(esk18_0,esk19_0) )
& ( in(esk18_0,succ(esk19_0))
| ordinal_subset(esk18_0,esk19_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_12,plain,
! [X19] : succ(X19) = set_union2(X19,singleton(X19)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_13,plain,
! [X31,X32,X33,X34,X35,X36,X37,X38] :
( ( ~ in(X34,X33)
| in(X34,X31)
| in(X34,X32)
| X33 != set_union2(X31,X32) )
& ( ~ in(X35,X31)
| in(X35,X33)
| X33 != set_union2(X31,X32) )
& ( ~ in(X35,X32)
| in(X35,X33)
| X33 != set_union2(X31,X32) )
& ( ~ in(esk3_3(X36,X37,X38),X36)
| ~ in(esk3_3(X36,X37,X38),X38)
| X38 = set_union2(X36,X37) )
& ( ~ in(esk3_3(X36,X37,X38),X37)
| ~ in(esk3_3(X36,X37,X38),X38)
| X38 = set_union2(X36,X37) )
& ( in(esk3_3(X36,X37,X38),X38)
| in(esk3_3(X36,X37,X38),X36)
| in(esk3_3(X36,X37,X38),X37)
| X38 = set_union2(X36,X37) ) ),
inference(distribute,[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)],[d2_xboole_0])])])])])]) ).
fof(c_0_14,plain,
! [X64,X65] :
( ( ~ ordinal_subset(X64,X65)
| subset(X64,X65)
| ~ ordinal(X64)
| ~ ordinal(X65) )
& ( ~ subset(X64,X65)
| ordinal_subset(X64,X65)
| ~ ordinal(X64)
| ~ ordinal(X65) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_15,negated_conjecture,
( in(esk18_0,succ(esk19_0))
| ordinal_subset(esk18_0,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t24_ordinal1]) ).
fof(c_0_18,plain,
! [X20,X21,X22,X23,X24,X25] :
( ( ~ in(X22,X21)
| X22 = X20
| X21 != singleton(X20) )
& ( X23 != X20
| in(X23,X21)
| X21 != singleton(X20) )
& ( ~ in(esk1_2(X24,X25),X25)
| esk1_2(X24,X25) != X24
| X25 = singleton(X24) )
& ( in(esk1_2(X24,X25),X25)
| esk1_2(X24,X25) = X24
| X25 = singleton(X24) ) ),
inference(distribute,[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)],[d1_tarski])])])])])]) ).
cnf(c_0_19,plain,
( in(X1,X3)
| in(X1,X4)
| ~ in(X1,X2)
| X2 != set_union2(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( ordinal_subset(esk18_0,esk19_0)
| in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
ordinal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
ordinal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,negated_conjecture,
( ~ in(esk18_0,succ(esk19_0))
| ~ ordinal_subset(esk18_0,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_25,plain,
! [X74,X75] :
( ~ ordinal(X74)
| ~ ordinal(X75)
| in(X74,X75)
| X74 = X75
| in(X75,X74) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_26,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( subset(esk18_0,esk19_0)
| in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
fof(c_0_29,plain,
! [X8] :
( ( epsilon_transitive(X8)
| ~ ordinal(X8) )
& ( epsilon_connected(X8)
| ~ ordinal(X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ ordinal_subset(esk18_0,esk19_0)
| ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(rw,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_31,plain,
( ordinal_subset(X1,X2)
| ~ subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,plain,
( in(X1,X2)
| X1 = X2
| in(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_34,plain,
! [X27,X28,X29] :
( ( ~ epsilon_transitive(X27)
| ~ in(X28,X27)
| subset(X28,X27) )
& ( in(esk2_1(X29),X29)
| epsilon_transitive(X29) )
& ( ~ subset(esk2_1(X29),X29)
| epsilon_transitive(X29) ) ),
inference(distribute,[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)],[d2_ordinal1])])])])])]) ).
cnf(c_0_35,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_36,negated_conjecture,
( subset(esk18_0,esk19_0)
| in(esk18_0,singleton(esk19_0))
| in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( ~ subset(esk18_0,esk19_0)
| ~ in(esk18_0,set_union2(esk19_0,singleton(esk19_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22]),c_0_23])]) ).
cnf(c_0_39,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_40,negated_conjecture,
( X1 = esk19_0
| in(X1,esk19_0)
| in(esk19_0,X1)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_22]) ).
cnf(c_0_41,plain,
( subset(X2,X1)
| ~ epsilon_transitive(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( esk18_0 = esk19_0
| subset(esk18_0,esk19_0)
| in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
epsilon_transitive(esk19_0),
inference(spm,[status(thm)],[c_0_37,c_0_22]) ).
fof(c_0_44,plain,
! [X17,X18] :
( ( subset(X17,X18)
| X17 != X18 )
& ( subset(X18,X17)
| X17 != X18 )
& ( ~ subset(X17,X18)
| ~ subset(X18,X17)
| X17 = X18 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
cnf(c_0_45,plain,
( in(X1,X3)
| ~ in(X1,X2)
| X3 != set_union2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_46,negated_conjecture,
( ~ subset(esk18_0,esk19_0)
| ~ in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( esk18_0 = esk19_0
| in(esk19_0,esk18_0)
| in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_23]) ).
cnf(c_0_48,negated_conjecture,
( esk18_0 = esk19_0
| subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_49,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( esk18_0 = esk19_0
| in(esk19_0,esk18_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_52,negated_conjecture,
epsilon_transitive(esk18_0),
inference(spm,[status(thm)],[c_0_37,c_0_23]) ).
cnf(c_0_53,negated_conjecture,
( esk18_0 = esk19_0
| ~ subset(esk19_0,esk18_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_48]) ).
fof(c_0_54,plain,
! [X68] : subset(X68,X68),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_55,plain,
( in(X1,X3)
| X1 != X2
| X3 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_56,negated_conjecture,
( ~ subset(esk18_0,esk19_0)
| ~ in(esk18_0,singleton(esk19_0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
esk18_0 = esk19_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_51]),c_0_52])]),c_0_53]) ).
cnf(c_0_58,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_59,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_55])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_57]),c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : NUM401+1 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n029.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 2400
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon Oct 2 14:53:06 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 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/tmp/tmp.04qI6vkhTI/E---3.1_16423.p
% 0.23/0.59 # Version: 3.1pre001
% 0.23/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.59 # Starting sh5l with 300s (1) cores
% 0.23/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 16501 completed with status 0
% 0.23/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.59 # No SInE strategy applied
% 0.23/0.59 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.23/0.59 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.59 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.59 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.23/0.59 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.59 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.23/0.59 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 16511 completed with status 0
% 0.23/0.59 # Result found by G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.59 # No SInE strategy applied
% 0.23/0.59 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.23/0.59 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.59 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.59 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.23/0.59 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.59 # Preprocessing time : 0.002 s
% 0.23/0.59 # Presaturation interreduction done
% 0.23/0.59
% 0.23/0.59 # Proof found!
% 0.23/0.59 # SZS status Theorem
% 0.23/0.59 # SZS output start CNFRefutation
% See solution above
% 0.23/0.59 # Parsed axioms : 54
% 0.23/0.59 # Removed by relevancy pruning/SinE : 0
% 0.23/0.59 # Initial clauses : 112
% 0.23/0.59 # Removed in clause preprocessing : 3
% 0.23/0.59 # Initial clauses in saturation : 109
% 0.23/0.59 # Processed clauses : 586
% 0.23/0.59 # ...of these trivial : 15
% 0.23/0.59 # ...subsumed : 205
% 0.23/0.59 # ...remaining for further processing : 366
% 0.23/0.59 # Other redundant clauses eliminated : 14
% 0.23/0.59 # Clauses deleted for lack of memory : 0
% 0.23/0.59 # Backward-subsumed : 12
% 0.23/0.59 # Backward-rewritten : 70
% 0.23/0.59 # Generated clauses : 1188
% 0.23/0.59 # ...of the previous two non-redundant : 1089
% 0.23/0.59 # ...aggressively subsumed : 0
% 0.23/0.59 # Contextual simplify-reflections : 7
% 0.23/0.59 # Paramodulations : 1173
% 0.23/0.59 # Factorizations : 2
% 0.23/0.59 # NegExts : 0
% 0.23/0.59 # Equation resolutions : 14
% 0.23/0.59 # Total rewrite steps : 337
% 0.23/0.59 # Propositional unsat checks : 0
% 0.23/0.59 # Propositional check models : 0
% 0.23/0.59 # Propositional check unsatisfiable : 0
% 0.23/0.59 # Propositional clauses : 0
% 0.23/0.59 # Propositional clauses after purity: 0
% 0.23/0.59 # Propositional unsat core size : 0
% 0.23/0.59 # Propositional preprocessing time : 0.000
% 0.23/0.59 # Propositional encoding time : 0.000
% 0.23/0.59 # Propositional solver time : 0.000
% 0.23/0.59 # Success case prop preproc time : 0.000
% 0.23/0.59 # Success case prop encoding time : 0.000
% 0.23/0.59 # Success case prop solver time : 0.000
% 0.23/0.59 # Current number of processed clauses : 177
% 0.23/0.59 # Positive orientable unit clauses : 55
% 0.23/0.59 # Positive unorientable unit clauses: 1
% 0.23/0.59 # Negative unit clauses : 28
% 0.23/0.59 # Non-unit-clauses : 93
% 0.23/0.59 # Current number of unprocessed clauses: 662
% 0.23/0.59 # ...number of literals in the above : 2446
% 0.23/0.59 # Current number of archived formulas : 0
% 0.23/0.59 # Current number of archived clauses : 183
% 0.23/0.59 # Clause-clause subsumption calls (NU) : 3558
% 0.23/0.59 # Rec. Clause-clause subsumption calls : 2897
% 0.23/0.59 # Non-unit clause-clause subsumptions : 92
% 0.23/0.59 # Unit Clause-clause subsumption calls : 1432
% 0.23/0.59 # Rewrite failures with RHS unbound : 0
% 0.23/0.59 # BW rewrite match attempts : 42
% 0.23/0.59 # BW rewrite match successes : 31
% 0.23/0.59 # Condensation attempts : 0
% 0.23/0.59 # Condensation successes : 0
% 0.23/0.59 # Termbank termtop insertions : 16646
% 0.23/0.59
% 0.23/0.59 # -------------------------------------------------
% 0.23/0.59 # User time : 0.041 s
% 0.23/0.59 # System time : 0.002 s
% 0.23/0.59 # Total time : 0.043 s
% 0.23/0.59 # Maximum resident set size: 1936 pages
% 0.23/0.59
% 0.23/0.59 # -------------------------------------------------
% 0.23/0.59 # User time : 0.150 s
% 0.23/0.59 # System time : 0.014 s
% 0.23/0.59 # Total time : 0.164 s
% 0.23/0.59 # Maximum resident set size: 1732 pages
% 0.23/0.59 % E---3.1 exiting
% 0.23/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------