TSTP Solution File: SEU238+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU238+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:25:26 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 58 ( 11 unt; 0 def)
% Number of atoms : 214 ( 24 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 272 ( 116 ~; 103 |; 32 &)
% ( 4 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn; 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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.lQKqk4Ycur/E---3.1_13408.p',fc3_ordinal1) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.lQKqk4Ycur/E---3.1_13408.p',antisymmetry_r2_hidden) ).
fof(t10_ordinal1,axiom,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox/tmp/tmp.lQKqk4Ycur/E---3.1_13408.p',t10_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox/tmp/tmp.lQKqk4Ycur/E---3.1_13408.p',d1_ordinal1) ).
fof(t33_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lQKqk4Ycur/E---3.1_13408.p',t33_ordinal1) ).
fof(t41_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( being_limit_ordinal(X1)
<=> ! [X2] :
( ordinal(X2)
=> ( in(X2,X1)
=> in(succ(X2),X1) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lQKqk4Ycur/E---3.1_13408.p',t41_ordinal1) ).
fof(t21_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
=> ! [X2] :
( ordinal(X2)
=> ( proper_subset(X1,X2)
=> in(X1,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lQKqk4Ycur/E---3.1_13408.p',t21_ordinal1) ).
fof(d8_xboole_0,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( subset(X1,X2)
& X1 != X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.lQKqk4Ycur/E---3.1_13408.p',d8_xboole_0) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.lQKqk4Ycur/E---3.1_13408.p',redefinition_r1_ordinal1) ).
fof(t42_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ( ~ ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lQKqk4Ycur/E---3.1_13408.p',t42_ordinal1) ).
fof(c_0_10,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_11,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(c_0_12,plain,
! [X50] : in(X50,succ(X50)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
fof(c_0_13,plain,
! [X18] : succ(X18) = set_union2(X18,singleton(X18)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_14,plain,
! [X58,X59] :
( ( ~ in(X58,X59)
| ordinal_subset(succ(X58),X59)
| ~ ordinal(X59)
| ~ ordinal(X58) )
& ( ~ ordinal_subset(succ(X58),X59)
| in(X58,X59)
| ~ ordinal(X59)
| ~ ordinal(X58) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_ordinal1])])])]) ).
fof(c_0_15,plain,
! [X28] :
( ( ~ empty(succ(X28))
| ~ ordinal(X28) )
& ( epsilon_transitive(succ(X28))
| ~ ordinal(X28) )
& ( epsilon_connected(succ(X28))
| ~ ordinal(X28) )
& ( ordinal(succ(X28))
| ~ ordinal(X28) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_16,plain,
! [X4,X5] :
( ~ in(X4,X5)
| ~ in(X5,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
cnf(c_0_17,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X62,X63] :
( ( ~ being_limit_ordinal(X62)
| ~ ordinal(X63)
| ~ in(X63,X62)
| in(succ(X63),X62)
| ~ ordinal(X62) )
& ( ordinal(esk14_1(X62))
| being_limit_ordinal(X62)
| ~ ordinal(X62) )
& ( in(esk14_1(X62),X62)
| being_limit_ordinal(X62)
| ~ ordinal(X62) )
& ( ~ in(succ(esk14_1(X62)),X62)
| being_limit_ordinal(X62)
| ~ ordinal(X62) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t41_ordinal1])])])])]) ).
fof(c_0_20,plain,
! [X54,X55] :
( ~ epsilon_transitive(X54)
| ~ ordinal(X55)
| ~ proper_subset(X54,X55)
| in(X54,X55) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t21_ordinal1])])]) ).
fof(c_0_21,plain,
! [X19,X20] :
( ( subset(X19,X20)
| ~ proper_subset(X19,X20) )
& ( X19 != X20
| ~ proper_subset(X19,X20) )
& ( ~ subset(X19,X20)
| X19 = X20
| proper_subset(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_xboole_0])])]) ).
fof(c_0_22,plain,
! [X45,X46] :
( ( ~ ordinal_subset(X45,X46)
| subset(X45,X46)
| ~ ordinal(X45)
| ~ ordinal(X46) )
& ( ~ subset(X45,X46)
| ordinal_subset(X45,X46)
| ~ ordinal(X45)
| ~ ordinal(X46) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_23,plain,
( ordinal_subset(succ(X1),X2)
| ~ in(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
( in(succ(X2),X1)
| ~ being_limit_ordinal(X1)
| ~ ordinal(X2)
| ~ in(X2,X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_28,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ( ~ ( ~ being_limit_ordinal(X1)
& ! [X2] :
( ordinal(X2)
=> X1 != succ(X2) ) )
& ~ ( ? [X2] :
( ordinal(X2)
& X1 = succ(X2) )
& being_limit_ordinal(X1) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t42_ordinal1])]) ).
cnf(c_0_29,plain,
( in(X1,X2)
| ~ epsilon_transitive(X1)
| ~ ordinal(X2)
| ~ proper_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
( X1 = X2
| proper_subset(X1,X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
( subset(X1,X2)
| ~ ordinal_subset(X1,X2)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
( ordinal_subset(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_33,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_34,plain,
( epsilon_transitive(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,plain,
~ in(set_union2(X1,singleton(X1)),X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_36,plain,
( in(set_union2(X2,singleton(X2)),X1)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ being_limit_ordinal(X1)
| ~ in(X2,X1) ),
inference(rw,[status(thm)],[c_0_27,c_0_18]) ).
fof(c_0_37,negated_conjecture,
! [X66] :
( ordinal(esk15_0)
& ( ordinal(esk16_0)
| ~ being_limit_ordinal(esk15_0) )
& ( esk15_0 = succ(esk16_0)
| ~ being_limit_ordinal(esk15_0) )
& ( being_limit_ordinal(esk15_0)
| ~ being_limit_ordinal(esk15_0) )
& ( ordinal(esk16_0)
| ~ ordinal(X66)
| esk15_0 != succ(X66) )
& ( esk15_0 = succ(esk16_0)
| ~ ordinal(X66)
| esk15_0 != succ(X66) )
& ( being_limit_ordinal(esk15_0)
| ~ ordinal(X66)
| esk15_0 != succ(X66) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])])]) ).
cnf(c_0_38,plain,
( being_limit_ordinal(X1)
| ~ in(succ(esk14_1(X1)),X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_39,plain,
( X1 = X2
| in(X1,X2)
| ~ subset(X1,X2)
| ~ epsilon_transitive(X1)
| ~ ordinal(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,plain,
( subset(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_41,plain,
( epsilon_transitive(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_34,c_0_18]) ).
cnf(c_0_42,plain,
( ~ being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(X1,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( esk15_0 = succ(esk16_0)
| ~ being_limit_ordinal(esk15_0) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( being_limit_ordinal(esk15_0)
| ~ ordinal(X1)
| esk15_0 != succ(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,plain,
( being_limit_ordinal(X1)
| ~ ordinal(X1)
| ~ in(set_union2(esk14_1(X1),singleton(esk14_1(X1))),X1) ),
inference(rw,[status(thm)],[c_0_38,c_0_18]) ).
cnf(c_0_46,plain,
( set_union2(X1,singleton(X1)) = X2
| in(set_union2(X1,singleton(X1)),X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_47,plain,
( in(esk14_1(X1),X1)
| being_limit_ordinal(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_48,plain,
( ordinal(esk14_1(X1))
| being_limit_ordinal(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_49,plain,
( ~ being_limit_ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_26])]),c_0_33]) ).
cnf(c_0_50,negated_conjecture,
( esk15_0 = set_union2(esk16_0,singleton(esk16_0))
| ~ being_limit_ordinal(esk15_0) ),
inference(rw,[status(thm)],[c_0_43,c_0_18]) ).
cnf(c_0_51,negated_conjecture,
( ordinal(esk16_0)
| ~ being_limit_ordinal(esk15_0) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_52,negated_conjecture,
( being_limit_ordinal(esk15_0)
| esk15_0 != set_union2(X1,singleton(X1))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_44,c_0_18]) ).
cnf(c_0_53,plain,
( set_union2(esk14_1(X1),singleton(esk14_1(X1))) = X1
| being_limit_ordinal(X1)
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]) ).
cnf(c_0_54,negated_conjecture,
~ being_limit_ordinal(esk15_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( being_limit_ordinal(X1)
| X1 != esk15_0
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_48]) ).
cnf(c_0_56,negated_conjecture,
ordinal(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU238+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 08:05:57 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.lQKqk4Ycur/E---3.1_13408.p
% 0.20/0.59 # Version: 3.1pre001
% 0.20/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.59 # Starting sh5l with 300s (1) cores
% 0.20/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 13613 completed with status 0
% 0.20/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.59 # No SInE strategy applied
% 0.20/0.59 # Search class: FGHSM-FFMM21-MFFFFFNN
% 0.20/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.59 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.20/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.59 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.59 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.59 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.59 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 13625 completed with status 0
% 0.20/0.59 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.20/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.59 # No SInE strategy applied
% 0.20/0.59 # Search class: FGHSM-FFMM21-MFFFFFNN
% 0.20/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.59 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 811s (1) cores
% 0.20/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.59 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.20/0.59 # Preprocessing time : 0.003 s
% 0.20/0.59
% 0.20/0.59 # Proof found!
% 0.20/0.59 # SZS status Theorem
% 0.20/0.59 # SZS output start CNFRefutation
% See solution above
% 0.20/0.59 # Parsed axioms : 59
% 0.20/0.59 # Removed by relevancy pruning/SinE : 0
% 0.20/0.59 # Initial clauses : 112
% 0.20/0.59 # Removed in clause preprocessing : 10
% 0.20/0.59 # Initial clauses in saturation : 102
% 0.20/0.59 # Processed clauses : 616
% 0.20/0.59 # ...of these trivial : 8
% 0.20/0.59 # ...subsumed : 233
% 0.20/0.59 # ...remaining for further processing : 375
% 0.20/0.59 # Other redundant clauses eliminated : 1
% 0.20/0.59 # Clauses deleted for lack of memory : 0
% 0.20/0.59 # Backward-subsumed : 29
% 0.20/0.59 # Backward-rewritten : 24
% 0.20/0.59 # Generated clauses : 1214
% 0.20/0.59 # ...of the previous two non-redundant : 1092
% 0.20/0.59 # ...aggressively subsumed : 0
% 0.20/0.59 # Contextual simplify-reflections : 32
% 0.20/0.59 # Paramodulations : 1213
% 0.20/0.59 # Factorizations : 0
% 0.20/0.59 # NegExts : 0
% 0.20/0.59 # Equation resolutions : 1
% 0.20/0.59 # Total rewrite steps : 508
% 0.20/0.59 # Propositional unsat checks : 0
% 0.20/0.59 # Propositional check models : 0
% 0.20/0.59 # Propositional check unsatisfiable : 0
% 0.20/0.59 # Propositional clauses : 0
% 0.20/0.59 # Propositional clauses after purity: 0
% 0.20/0.59 # Propositional unsat core size : 0
% 0.20/0.59 # Propositional preprocessing time : 0.000
% 0.20/0.59 # Propositional encoding time : 0.000
% 0.20/0.59 # Propositional solver time : 0.000
% 0.20/0.59 # Success case prop preproc time : 0.000
% 0.20/0.59 # Success case prop encoding time : 0.000
% 0.20/0.59 # Success case prop solver time : 0.000
% 0.20/0.59 # Current number of processed clauses : 321
% 0.20/0.59 # Positive orientable unit clauses : 53
% 0.20/0.59 # Positive unorientable unit clauses: 1
% 0.20/0.59 # Negative unit clauses : 18
% 0.20/0.59 # Non-unit-clauses : 249
% 0.20/0.59 # Current number of unprocessed clauses: 500
% 0.20/0.59 # ...number of literals in the above : 2873
% 0.20/0.59 # Current number of archived formulas : 0
% 0.20/0.59 # Current number of archived clauses : 54
% 0.20/0.59 # Clause-clause subsumption calls (NU) : 15177
% 0.20/0.59 # Rec. Clause-clause subsumption calls : 6692
% 0.20/0.59 # Non-unit clause-clause subsumptions : 212
% 0.20/0.59 # Unit Clause-clause subsumption calls : 899
% 0.20/0.59 # Rewrite failures with RHS unbound : 0
% 0.20/0.59 # BW rewrite match attempts : 23
% 0.20/0.59 # BW rewrite match successes : 21
% 0.20/0.59 # Condensation attempts : 0
% 0.20/0.59 # Condensation successes : 0
% 0.20/0.59 # Termbank termtop insertions : 46432
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.076 s
% 0.20/0.59 # System time : 0.007 s
% 0.20/0.59 # Total time : 0.083 s
% 0.20/0.59 # Maximum resident set size: 1952 pages
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.375 s
% 0.20/0.59 # System time : 0.019 s
% 0.20/0.59 # Total time : 0.394 s
% 0.20/0.59 # Maximum resident set size: 1720 pages
% 0.20/0.59 % E---3.1 exiting
% 0.20/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------