TSTP Solution File: SEU290+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU290+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:39 EDT 2023
% Result : Theorem 0.22s 0.56s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 62 ( 26 unt; 0 def)
% Number of atoms : 193 ( 62 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 206 ( 75 ~; 78 |; 35 &)
% ( 5 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 9 con; 0-3 aty)
% Number of variables : 83 ( 2 sgn; 50 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',rc1_xboole_0) ).
fof(rc1_relat_1,axiom,
? [X1] :
( empty(X1)
& relation(X1) ),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',rc1_relat_1) ).
fof(t6_funct_2,conjecture,
! [X1,X2,X3,X4] :
( ( function(X4)
& quasi_total(X4,X1,X2)
& relation_of2_as_subset(X4,X1,X2) )
=> ( in(X3,X1)
=> ( X2 = empty_set
| in(apply(X4,X3),relation_rng(X4)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',t6_funct_2) ).
fof(rc2_funct_1,axiom,
? [X1] :
( relation(X1)
& empty(X1)
& function(X1) ),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',rc2_funct_1) ).
fof(rc1_partfun1,axiom,
? [X1] :
( relation(X1)
& function(X1)
& one_to_one(X1)
& empty(X1) ),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',rc1_partfun1) ).
fof(d1_funct_2,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ( ( X2 = empty_set
=> X1 = empty_set )
=> ( quasi_total(X3,X1,X2)
<=> X1 = relation_dom_as_subset(X1,X2,X3) ) )
& ( X2 = empty_set
=> ( X1 = empty_set
| ( quasi_total(X3,X1,X2)
<=> X3 = empty_set ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',d1_funct_2) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',dt_m2_relset_1) ).
fof(d5_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,relation_dom(X1))
& X3 = apply(X1,X4) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',d5_funct_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',cc1_relset_1) ).
fof(redefinition_k4_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> relation_dom_as_subset(X1,X2,X3) = relation_dom(X3) ),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',redefinition_k4_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.kUsZbuU0vl/E---3.1_13446.p',redefinition_m2_relset_1) ).
fof(c_0_12,plain,
! [X38] :
( ~ empty(X38)
| X38 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_13,plain,
empty(esk21_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(c_0_14,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
empty(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
empty_set = esk21_0,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_17,plain,
( empty(esk16_0)
& relation(esk16_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_relat_1])]) ).
cnf(c_0_18,plain,
( X1 = esk21_0
| ~ empty(X1) ),
inference(rw,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_19,plain,
empty(esk16_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( function(X4)
& quasi_total(X4,X1,X2)
& relation_of2_as_subset(X4,X1,X2) )
=> ( in(X3,X1)
=> ( X2 = empty_set
| in(apply(X4,X3),relation_rng(X4)) ) ) ),
inference(assume_negation,[status(cth)],[t6_funct_2]) ).
cnf(c_0_21,plain,
esk21_0 = esk16_0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_22,plain,
( relation(esk12_0)
& empty(esk12_0)
& function(esk12_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_funct_1])]) ).
fof(c_0_23,negated_conjecture,
( function(esk4_0)
& quasi_total(esk4_0,esk1_0,esk2_0)
& relation_of2_as_subset(esk4_0,esk1_0,esk2_0)
& in(esk3_0,esk1_0)
& esk2_0 != empty_set
& ~ in(apply(esk4_0,esk3_0),relation_rng(esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_24,plain,
( X1 = esk16_0
| ~ empty(X1) ),
inference(rw,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_25,plain,
empty(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
esk2_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
esk16_0 = esk12_0,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_28,plain,
( relation(esk11_0)
& function(esk11_0)
& one_to_one(esk11_0)
& empty(esk11_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_partfun1])]) ).
cnf(c_0_29,negated_conjecture,
esk21_0 != esk2_0,
inference(rw,[status(thm)],[c_0_26,c_0_16]) ).
fof(c_0_30,plain,
! [X35,X36,X37] :
( ( ~ quasi_total(X37,X35,X36)
| X35 = relation_dom_as_subset(X35,X36,X37)
| X36 = empty_set
| ~ relation_of2_as_subset(X37,X35,X36) )
& ( X35 != relation_dom_as_subset(X35,X36,X37)
| quasi_total(X37,X35,X36)
| X36 = empty_set
| ~ relation_of2_as_subset(X37,X35,X36) )
& ( ~ quasi_total(X37,X35,X36)
| X35 = relation_dom_as_subset(X35,X36,X37)
| X35 != empty_set
| ~ relation_of2_as_subset(X37,X35,X36) )
& ( X35 != relation_dom_as_subset(X35,X36,X37)
| quasi_total(X37,X35,X36)
| X35 != empty_set
| ~ relation_of2_as_subset(X37,X35,X36) )
& ( ~ quasi_total(X37,X35,X36)
| X37 = empty_set
| X35 = empty_set
| X36 != empty_set
| ~ relation_of2_as_subset(X37,X35,X36) )
& ( X37 != empty_set
| quasi_total(X37,X35,X36)
| X35 = empty_set
| X36 != empty_set
| ~ relation_of2_as_subset(X37,X35,X36) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_funct_2])])]) ).
cnf(c_0_31,plain,
( X1 = esk12_0
| ~ empty(X1) ),
inference(rw,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_32,plain,
empty(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
esk16_0 != esk2_0,
inference(rw,[status(thm)],[c_0_29,c_0_21]) ).
fof(c_0_34,plain,
! [X39,X40,X41] :
( ~ relation_of2_as_subset(X41,X39,X40)
| element(X41,powerset(cartesian_product2(X39,X40))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
cnf(c_0_35,plain,
( X2 = relation_dom_as_subset(X2,X3,X1)
| X3 = empty_set
| ~ quasi_total(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
esk12_0 = esk11_0,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
esk2_0 != esk12_0,
inference(rw,[status(thm)],[c_0_33,c_0_27]) ).
fof(c_0_38,plain,
! [X11,X12,X13,X15,X16,X17,X19] :
( ( in(esk5_3(X11,X12,X13),relation_dom(X11))
| ~ in(X13,X12)
| X12 != relation_rng(X11)
| ~ relation(X11)
| ~ function(X11) )
& ( X13 = apply(X11,esk5_3(X11,X12,X13))
| ~ in(X13,X12)
| X12 != relation_rng(X11)
| ~ relation(X11)
| ~ function(X11) )
& ( ~ in(X16,relation_dom(X11))
| X15 != apply(X11,X16)
| in(X15,X12)
| X12 != relation_rng(X11)
| ~ relation(X11)
| ~ function(X11) )
& ( ~ in(esk6_2(X11,X17),X17)
| ~ in(X19,relation_dom(X11))
| esk6_2(X11,X17) != apply(X11,X19)
| X17 = relation_rng(X11)
| ~ relation(X11)
| ~ function(X11) )
& ( in(esk7_2(X11,X17),relation_dom(X11))
| in(esk6_2(X11,X17),X17)
| X17 = relation_rng(X11)
| ~ relation(X11)
| ~ function(X11) )
& ( esk6_2(X11,X17) = apply(X11,esk7_2(X11,X17))
| in(esk6_2(X11,X17),X17)
| X17 = relation_rng(X11)
| ~ relation(X11)
| ~ function(X11) ) ),
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)],[d5_funct_1])])])])])]) ).
fof(c_0_39,plain,
! [X69,X70,X71] :
( ~ element(X71,powerset(cartesian_product2(X69,X70)))
| relation(X71) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
cnf(c_0_40,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
relation_of2_as_subset(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_42,plain,
! [X63,X64,X65] :
( ~ relation_of2(X65,X63,X64)
| relation_dom_as_subset(X63,X64,X65) = relation_dom(X65) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_relset_1])]) ).
cnf(c_0_43,plain,
( relation_dom_as_subset(X1,X2,X3) = X1
| X2 = esk11_0
| ~ quasi_total(X3,X1,X2)
| ~ relation_of2_as_subset(X3,X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_16]),c_0_21]),c_0_27]),c_0_36]) ).
cnf(c_0_44,negated_conjecture,
quasi_total(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_45,negated_conjecture,
esk2_0 != esk11_0,
inference(rw,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_46,plain,
( in(X3,X4)
| ~ in(X1,relation_dom(X2))
| X3 != apply(X2,X1)
| X4 != relation_rng(X2)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_47,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,negated_conjecture,
element(esk4_0,powerset(cartesian_product2(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
( relation_dom_as_subset(X2,X3,X1) = relation_dom(X1)
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,negated_conjecture,
relation_dom_as_subset(esk1_0,esk2_0,esk4_0) = esk1_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_41])]),c_0_45]) ).
fof(c_0_51,plain,
! [X45,X46,X47] :
( ( ~ relation_of2_as_subset(X47,X45,X46)
| relation_of2(X47,X45,X46) )
& ( ~ relation_of2(X47,X45,X46)
| relation_of2_as_subset(X47,X45,X46) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
cnf(c_0_52,negated_conjecture,
~ in(apply(esk4_0,esk3_0),relation_rng(esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_53,plain,
( in(apply(X1,X2),relation_rng(X1))
| ~ relation(X1)
| ~ function(X1)
| ~ in(X2,relation_dom(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_46])]) ).
cnf(c_0_54,negated_conjecture,
relation(esk4_0),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
function(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_56,negated_conjecture,
( relation_dom(esk4_0) = esk1_0
| ~ relation_of2(esk4_0,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_58,negated_conjecture,
~ in(esk3_0,relation_dom(esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55])]) ).
cnf(c_0_59,negated_conjecture,
relation_dom(esk4_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_41])]) ).
cnf(c_0_60,negated_conjecture,
in(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SEU290+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.17 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n011.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 2400
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Mon Oct 2 08:14:23 EDT 2023
% 0.15/0.38 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 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.kUsZbuU0vl/E---3.1_13446.p
% 0.22/0.56 # Version: 3.1pre001
% 0.22/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 # Starting sh5l with 300s (1) cores
% 0.22/0.56 # sh5l with pid 13534 completed with status 0
% 0.22/0.56 # Result found by sh5l
% 0.22/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 # Starting sh5l with 300s (1) cores
% 0.22/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.56 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.22/0.56 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.56 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.22/0.56 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 13540 completed with status 0
% 0.22/0.56 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 # Starting sh5l with 300s (1) cores
% 0.22/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.56 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.22/0.56 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.56 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.22/0.56 # Preprocessing time : 0.004 s
% 0.22/0.56 # Presaturation interreduction done
% 0.22/0.56
% 0.22/0.56 # Proof found!
% 0.22/0.56 # SZS status Theorem
% 0.22/0.56 # SZS output start CNFRefutation
% See solution above
% 0.22/0.56 # Parsed axioms : 55
% 0.22/0.56 # Removed by relevancy pruning/SinE : 8
% 0.22/0.56 # Initial clauses : 91
% 0.22/0.56 # Removed in clause preprocessing : 2
% 0.22/0.56 # Initial clauses in saturation : 89
% 0.22/0.56 # Processed clauses : 299
% 0.22/0.56 # ...of these trivial : 3
% 0.22/0.56 # ...subsumed : 46
% 0.22/0.56 # ...remaining for further processing : 250
% 0.22/0.56 # Other redundant clauses eliminated : 10
% 0.22/0.56 # Clauses deleted for lack of memory : 0
% 0.22/0.56 # Backward-subsumed : 2
% 0.22/0.56 # Backward-rewritten : 33
% 0.22/0.56 # Generated clauses : 211
% 0.22/0.56 # ...of the previous two non-redundant : 195
% 0.22/0.56 # ...aggressively subsumed : 0
% 0.22/0.56 # Contextual simplify-reflections : 4
% 0.22/0.56 # Paramodulations : 203
% 0.22/0.56 # Factorizations : 0
% 0.22/0.56 # NegExts : 0
% 0.22/0.56 # Equation resolutions : 10
% 0.22/0.56 # Total rewrite steps : 135
% 0.22/0.56 # Propositional unsat checks : 0
% 0.22/0.56 # Propositional check models : 0
% 0.22/0.56 # Propositional check unsatisfiable : 0
% 0.22/0.56 # Propositional clauses : 0
% 0.22/0.56 # Propositional clauses after purity: 0
% 0.22/0.56 # Propositional unsat core size : 0
% 0.22/0.56 # Propositional preprocessing time : 0.000
% 0.22/0.56 # Propositional encoding time : 0.000
% 0.22/0.56 # Propositional solver time : 0.000
% 0.22/0.56 # Success case prop preproc time : 0.000
% 0.22/0.56 # Success case prop encoding time : 0.000
% 0.22/0.56 # Success case prop solver time : 0.000
% 0.22/0.56 # Current number of processed clauses : 122
% 0.22/0.56 # Positive orientable unit clauses : 48
% 0.22/0.56 # Positive unorientable unit clauses: 0
% 0.22/0.56 # Negative unit clauses : 11
% 0.22/0.56 # Non-unit-clauses : 63
% 0.22/0.56 # Current number of unprocessed clauses: 54
% 0.22/0.56 # ...number of literals in the above : 185
% 0.22/0.56 # Current number of archived formulas : 0
% 0.22/0.56 # Current number of archived clauses : 121
% 0.22/0.56 # Clause-clause subsumption calls (NU) : 1334
% 0.22/0.56 # Rec. Clause-clause subsumption calls : 961
% 0.22/0.56 # Non-unit clause-clause subsumptions : 44
% 0.22/0.56 # Unit Clause-clause subsumption calls : 240
% 0.22/0.56 # Rewrite failures with RHS unbound : 0
% 0.22/0.56 # BW rewrite match attempts : 8
% 0.22/0.56 # BW rewrite match successes : 6
% 0.22/0.56 # Condensation attempts : 0
% 0.22/0.56 # Condensation successes : 0
% 0.22/0.56 # Termbank termtop insertions : 6229
% 0.22/0.56
% 0.22/0.56 # -------------------------------------------------
% 0.22/0.56 # User time : 0.015 s
% 0.22/0.56 # System time : 0.005 s
% 0.22/0.56 # Total time : 0.019 s
% 0.22/0.56 # Maximum resident set size: 1896 pages
% 0.22/0.56
% 0.22/0.56 # -------------------------------------------------
% 0.22/0.56 # User time : 0.016 s
% 0.22/0.56 # System time : 0.008 s
% 0.22/0.56 # Total time : 0.024 s
% 0.22/0.56 # Maximum resident set size: 1728 pages
% 0.22/0.56 % E---3.1 exiting
% 0.22/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------