TSTP Solution File: SEU236+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU236+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 19:31:05 EDT 2023
% Result : Theorem 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 14 unt; 0 def)
% Number of atoms : 174 ( 18 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 190 ( 75 ~; 73 |; 24 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn; 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.pQpbBEXm7z/E---3.1_23232.p',t33_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox/tmp/tmp.pQpbBEXm7z/E---3.1_23232.p',d1_ordinal1) ).
fof(fc3_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.pQpbBEXm7z/E---3.1_23232.p',fc3_ordinal1) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.pQpbBEXm7z/E---3.1_23232.p',redefinition_r1_ordinal1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.pQpbBEXm7z/E---3.1_23232.p',d3_tarski) ).
fof(t10_ordinal1,axiom,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox/tmp/tmp.pQpbBEXm7z/E---3.1_23232.p',t10_ordinal1) ).
fof(t8_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox/tmp/tmp.pQpbBEXm7z/E---3.1_23232.p',t8_xboole_1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.pQpbBEXm7z/E---3.1_23232.p',d2_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.pQpbBEXm7z/E---3.1_23232.p',cc1_ordinal1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.pQpbBEXm7z/E---3.1_23232.p',d1_tarski) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
inference(assume_negation,[status(cth)],[t33_ordinal1]) ).
fof(c_0_11,negated_conjecture,
( ordinal(esk18_0)
& ordinal(esk19_0)
& ( ~ in(esk18_0,esk19_0)
| ~ ordinal_subset(succ(esk18_0),esk19_0) )
& ( in(esk18_0,esk19_0)
| ordinal_subset(succ(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,
! [X16] : succ(X16) = set_union2(X16,singleton(X16)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_13,plain,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
inference(fof_simplification,[status(thm)],[fc3_ordinal1]) ).
fof(c_0_14,plain,
! [X58,X59] :
( ( ~ ordinal_subset(X58,X59)
| subset(X58,X59)
| ~ ordinal(X58)
| ~ ordinal(X59) )
& ( ~ subset(X58,X59)
| ordinal_subset(X58,X59)
| ~ ordinal(X58)
| ~ ordinal(X59) ) ),
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,esk19_0)
| ordinal_subset(succ(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,
! [X41] :
( ( ~ empty(succ(X41))
| ~ ordinal(X41) )
& ( epsilon_transitive(succ(X41))
| ~ ordinal(X41) )
& ( epsilon_connected(succ(X41))
| ~ ordinal(X41) )
& ( ordinal(succ(X41))
| ~ ordinal(X41) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( in(esk18_0,esk19_0)
| ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
ordinal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X28,X29,X30,X31,X32] :
( ( ~ subset(X28,X29)
| ~ in(X30,X28)
| in(X30,X29) )
& ( in(esk3_2(X31,X32),X31)
| subset(X31,X32) )
& ( ~ in(esk3_2(X31,X32),X32)
| subset(X31,X32) ) ),
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)],[d3_tarski])])])])])]) ).
cnf(c_0_23,negated_conjecture,
( subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| in(esk18_0,esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_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,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
ordinal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_26,plain,
! [X63] : in(X63,succ(X63)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
cnf(c_0_27,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| in(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_29,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| ~ ordinal_subset(succ(esk18_0),esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
( in(esk18_0,esk19_0)
| in(X1,esk19_0)
| ~ in(X1,set_union2(esk18_0,singleton(esk18_0))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_33,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| ~ ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
inference(rw,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_34,negated_conjecture,
in(esk18_0,esk19_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
~ ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_36,plain,
( ordinal_subset(X1,X2)
| ~ subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_37,plain,
! [X84,X85,X86] :
( ~ subset(X84,X85)
| ~ subset(X86,X85)
| subset(set_union2(X84,X86),X85) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])]) ).
cnf(c_0_38,negated_conjecture,
( ~ subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20])]) ).
cnf(c_0_39,plain,
( subset(set_union2(X1,X3),X2)
| ~ subset(X1,X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_40,plain,
! [X24,X25,X26] :
( ( ~ epsilon_transitive(X24)
| ~ in(X25,X24)
| subset(X25,X24) )
& ( in(esk2_1(X26),X26)
| epsilon_transitive(X26) )
& ( ~ subset(esk2_1(X26),X26)
| epsilon_transitive(X26) ) ),
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])])])])])]) ).
fof(c_0_41,plain,
! [X7] :
( ( epsilon_transitive(X7)
| ~ ordinal(X7) )
& ( epsilon_connected(X7)
| ~ ordinal(X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])]) ).
fof(c_0_42,plain,
! [X17,X18,X19,X20,X21,X22] :
( ( ~ in(X19,X18)
| X19 = X17
| X18 != singleton(X17) )
& ( X20 != X17
| in(X20,X18)
| X18 != singleton(X17) )
& ( ~ in(esk1_2(X21,X22),X22)
| esk1_2(X21,X22) != X21
| X22 = singleton(X21) )
& ( in(esk1_2(X21,X22),X22)
| esk1_2(X21,X22) = X21
| X22 = singleton(X21) ) ),
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_43,negated_conjecture,
( ~ subset(singleton(esk18_0),esk19_0)
| ~ subset(esk18_0,esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0))) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_45,plain,
( subset(X2,X1)
| ~ epsilon_transitive(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( in(esk3_2(singleton(esk18_0),esk19_0),singleton(esk18_0))
| ~ subset(esk18_0,esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0))) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_51,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( in(esk3_2(singleton(esk18_0),esk19_0),singleton(esk18_0))
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_20]),c_0_34])]) ).
cnf(c_0_53,negated_conjecture,
( ~ subset(esk18_0,esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0)))
| ~ in(esk3_2(singleton(esk18_0),esk19_0),esk19_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( esk3_2(singleton(esk18_0),esk19_0) = esk18_0
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0))) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( ~ ordinal(set_union2(esk18_0,singleton(esk18_0)))
| ~ in(esk3_2(singleton(esk18_0),esk19_0),esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_49]),c_0_20]),c_0_34])]) ).
cnf(c_0_56,negated_conjecture,
esk3_2(singleton(esk18_0),esk19_0) = esk18_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_24]),c_0_25])]) ).
cnf(c_0_57,negated_conjecture,
~ ordinal(set_union2(esk18_0,singleton(esk18_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56]),c_0_34])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SEU236+3 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n028.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 08:51:06 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.14/0.41 Running first-order model finding
% 0.14/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.pQpbBEXm7z/E---3.1_23232.p
% 0.14/0.43 # Version: 3.1pre001
% 0.14/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23309 completed with status 0
% 0.14/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 # No SInE strategy applied
% 0.14/0.43 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.14/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.43 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.43 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.14/0.43 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 23319 completed with status 0
% 0.14/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.14/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.43 # No SInE strategy applied
% 0.14/0.43 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.14/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.43 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 811s (1) cores
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.43 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.43 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 0.14/0.43 # Preprocessing time : 0.001 s
% 0.14/0.43 # Presaturation interreduction done
% 0.14/0.43
% 0.14/0.43 # Proof found!
% 0.14/0.43 # SZS status Theorem
% 0.14/0.43 # SZS output start CNFRefutation
% See solution above
% 0.14/0.43 # Parsed axioms : 52
% 0.14/0.43 # Removed by relevancy pruning/SinE : 0
% 0.14/0.43 # Initial clauses : 105
% 0.14/0.43 # Removed in clause preprocessing : 3
% 0.14/0.43 # Initial clauses in saturation : 102
% 0.14/0.43 # Processed clauses : 316
% 0.14/0.43 # ...of these trivial : 7
% 0.14/0.43 # ...subsumed : 39
% 0.14/0.43 # ...remaining for further processing : 270
% 0.14/0.43 # Other redundant clauses eliminated : 3
% 0.14/0.43 # Clauses deleted for lack of memory : 0
% 0.14/0.43 # Backward-subsumed : 14
% 0.14/0.43 # Backward-rewritten : 21
% 0.14/0.43 # Generated clauses : 228
% 0.14/0.43 # ...of the previous two non-redundant : 199
% 0.14/0.43 # ...aggressively subsumed : 0
% 0.14/0.43 # Contextual simplify-reflections : 2
% 0.14/0.43 # Paramodulations : 226
% 0.14/0.43 # Factorizations : 0
% 0.14/0.43 # NegExts : 0
% 0.14/0.43 # Equation resolutions : 3
% 0.14/0.43 # Total rewrite steps : 107
% 0.14/0.43 # Propositional unsat checks : 0
% 0.14/0.43 # Propositional check models : 0
% 0.14/0.43 # Propositional check unsatisfiable : 0
% 0.14/0.43 # Propositional clauses : 0
% 0.14/0.43 # Propositional clauses after purity: 0
% 0.14/0.43 # Propositional unsat core size : 0
% 0.14/0.43 # Propositional preprocessing time : 0.000
% 0.14/0.43 # Propositional encoding time : 0.000
% 0.14/0.43 # Propositional solver time : 0.000
% 0.14/0.43 # Success case prop preproc time : 0.000
% 0.14/0.43 # Success case prop encoding time : 0.000
% 0.14/0.43 # Success case prop solver time : 0.000
% 0.14/0.43 # Current number of processed clauses : 138
% 0.14/0.43 # Positive orientable unit clauses : 48
% 0.14/0.43 # Positive unorientable unit clauses: 1
% 0.14/0.43 # Negative unit clauses : 11
% 0.14/0.43 # Non-unit-clauses : 78
% 0.14/0.43 # Current number of unprocessed clauses: 76
% 0.14/0.43 # ...number of literals in the above : 227
% 0.14/0.43 # Current number of archived formulas : 0
% 0.14/0.43 # Current number of archived clauses : 131
% 0.14/0.43 # Clause-clause subsumption calls (NU) : 1703
% 0.14/0.43 # Rec. Clause-clause subsumption calls : 1444
% 0.14/0.43 # Non-unit clause-clause subsumptions : 34
% 0.14/0.43 # Unit Clause-clause subsumption calls : 123
% 0.14/0.43 # Rewrite failures with RHS unbound : 0
% 0.14/0.43 # BW rewrite match attempts : 37
% 0.14/0.43 # BW rewrite match successes : 30
% 0.14/0.43 # Condensation attempts : 0
% 0.14/0.43 # Condensation successes : 0
% 0.14/0.43 # Termbank termtop insertions : 6523
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.014 s
% 0.14/0.43 # System time : 0.003 s
% 0.14/0.43 # Total time : 0.017 s
% 0.14/0.43 # Maximum resident set size: 1920 pages
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.064 s
% 0.14/0.43 # System time : 0.009 s
% 0.14/0.43 # Total time : 0.073 s
% 0.14/0.43 # Maximum resident set size: 1732 pages
% 0.14/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------