TSTP Solution File: SEU210+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU210+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:30:54 EDT 2023
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 71 ( 25 unt; 0 def)
% Number of atoms : 180 ( 30 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 195 ( 86 ~; 73 |; 24 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-3 aty)
% Number of variables : 112 ( 15 sgn; 51 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',rc1_xboole_0) ).
fof(rc1_relat_1,axiom,
? [X1] :
( empty(X1)
& relation(X1) ),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',rc1_relat_1) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',t5_subset) ).
fof(rc2_subset_1,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2) ),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',rc2_subset_1) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',d5_relat_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',existence_m1_subset_1) ).
fof(t174_relat_1,conjecture,
! [X1,X2] :
( relation(X2)
=> ~ ( X1 != empty_set
& subset(X1,relation_rng(X2))
& relation_inverse_image(X2,X1) = empty_set ) ),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',t174_relat_1) ).
fof(t166_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_inverse_image(X3,X2))
<=> ? [X4] :
( in(X4,relation_rng(X3))
& in(ordered_pair(X1,X4),X3)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',t166_relat_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',t7_boole) ).
fof(cc1_relat_1,axiom,
! [X1] :
( empty(X1)
=> relation(X1) ),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',cc1_relat_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.1snOMByzjp/E---3.1_20653.p',d3_tarski) ).
fof(c_0_13,plain,
! [X7] :
( ~ empty(X7)
| X7 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_14,plain,
empty(esk11_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(c_0_15,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
empty(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
empty_set = esk11_0,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_18,plain,
( empty(esk8_0)
& relation(esk8_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_relat_1])]) ).
cnf(c_0_19,plain,
( X1 = esk11_0
| ~ empty(X1) ),
inference(rw,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_20,plain,
empty(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X48,X49,X50] :
( ~ in(X48,X49)
| ~ element(X49,powerset(X50))
| ~ empty(X50) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
fof(c_0_22,plain,
! [X43] :
( element(esk12_1(X43),powerset(X43))
& empty(esk12_1(X43)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).
cnf(c_0_23,plain,
esk11_0 = esk8_0,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
element(esk12_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( X1 = esk8_0
| ~ empty(X1) ),
inference(rw,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_27,plain,
empty(esk12_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,plain,
! [X22,X23,X24,X26,X27,X28,X30] :
( ( ~ in(X24,X23)
| in(ordered_pair(esk5_3(X22,X23,X24),X24),X22)
| X23 != relation_rng(X22)
| ~ relation(X22) )
& ( ~ in(ordered_pair(X27,X26),X22)
| in(X26,X23)
| X23 != relation_rng(X22)
| ~ relation(X22) )
& ( ~ in(esk6_2(X22,X28),X28)
| ~ in(ordered_pair(X30,esk6_2(X22,X28)),X22)
| X28 = relation_rng(X22)
| ~ relation(X22) )
& ( in(esk6_2(X22,X28),X28)
| in(ordered_pair(esk7_2(X22,X28),esk6_2(X22,X28)),X22)
| X28 = relation_rng(X22)
| ~ relation(X22) ) ),
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_relat_1])])])])])]) ).
fof(c_0_29,plain,
! [X46,X47] :
( ~ element(X46,X47)
| empty(X47)
| in(X46,X47) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_30,plain,
! [X64] : element(esk14_1(X64),X64),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_31,plain,
( ~ empty(X1)
| ~ in(X2,esk12_1(X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
esk12_1(X1) = esk8_0,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
( in(ordered_pair(esk5_3(X3,X2,X1),X1),X3)
| ~ in(X1,X2)
| X2 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
element(esk14_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_36,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ~ ( X1 != empty_set
& subset(X1,relation_rng(X2))
& relation_inverse_image(X2,X1) = empty_set ) ),
inference(assume_negation,[status(cth)],[t174_relat_1]) ).
cnf(c_0_37,plain,
( ~ empty(X1)
| ~ in(X2,esk8_0) ),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( in(ordered_pair(esk5_3(X1,relation_rng(X1),X2),X2),X1)
| ~ relation(X1)
| ~ in(X2,relation_rng(X1)) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_39,plain,
relation(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_40,plain,
( empty(X1)
| in(esk14_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_41,plain,
! [X8,X9,X10,X12] :
( ( in(esk3_3(X8,X9,X10),relation_rng(X10))
| ~ in(X8,relation_inverse_image(X10,X9))
| ~ relation(X10) )
& ( in(ordered_pair(X8,esk3_3(X8,X9,X10)),X10)
| ~ in(X8,relation_inverse_image(X10,X9))
| ~ relation(X10) )
& ( in(esk3_3(X8,X9,X10),X9)
| ~ in(X8,relation_inverse_image(X10,X9))
| ~ relation(X10) )
& ( ~ in(X12,relation_rng(X10))
| ~ in(ordered_pair(X8,X12),X10)
| ~ in(X12,X9)
| in(X8,relation_inverse_image(X10,X9))
| ~ relation(X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t166_relat_1])])])])]) ).
cnf(c_0_42,plain,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_43,negated_conjecture,
( relation(esk2_0)
& esk1_0 != empty_set
& subset(esk1_0,relation_rng(esk2_0))
& relation_inverse_image(esk2_0,esk1_0) = empty_set ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])]) ).
fof(c_0_44,plain,
! [X51,X52] :
( ~ in(X51,X52)
| ~ empty(X52) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_45,plain,
! [X34] :
( ~ empty(X34)
| relation(X34) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relat_1])]) ).
cnf(c_0_46,plain,
( ~ empty(X1)
| ~ in(X2,relation_rng(esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_47,plain,
( X1 = esk8_0
| in(esk14_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_40]) ).
cnf(c_0_48,plain,
( in(X3,relation_inverse_image(X2,X4))
| ~ in(X1,relation_rng(X2))
| ~ in(ordered_pair(X3,X1),X2)
| ~ in(X1,X4)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
( in(X1,relation_rng(X2))
| ~ relation(X2)
| ~ in(ordered_pair(X3,X1),X2) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_50,negated_conjecture,
relation_inverse_image(esk2_0,esk1_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_51,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_52,plain,
( relation(X1)
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,plain,
( relation_rng(esk8_0) = esk8_0
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
fof(c_0_54,plain,
! [X13,X14,X15,X16,X17] :
( ( ~ subset(X13,X14)
| ~ in(X15,X13)
| in(X15,X14) )
& ( in(esk4_2(X16,X17),X16)
| subset(X16,X17) )
& ( ~ in(esk4_2(X16,X17),X17)
| subset(X16,X17) ) ),
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_55,plain,
( in(X1,relation_inverse_image(X2,X3))
| ~ relation(X2)
| ~ in(ordered_pair(X1,X4),X2)
| ~ in(X4,X3) ),
inference(csr,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
relation_inverse_image(esk2_0,esk1_0) = esk11_0,
inference(rw,[status(thm)],[c_0_50,c_0_17]) ).
cnf(c_0_57,plain,
( ~ empty(X1)
| ~ in(X2,relation_rng(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_38]),c_0_52]) ).
cnf(c_0_58,plain,
relation_rng(esk8_0) = esk8_0,
inference(spm,[status(thm)],[c_0_53,c_0_20]) ).
cnf(c_0_59,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_60,negated_conjecture,
subset(esk1_0,relation_rng(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_61,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_62,plain,
( in(esk5_3(X1,relation_rng(X1),X2),relation_inverse_image(X1,X3))
| ~ relation(X1)
| ~ in(X2,relation_rng(X1))
| ~ in(X2,X3) ),
inference(spm,[status(thm)],[c_0_55,c_0_38]) ).
cnf(c_0_63,negated_conjecture,
relation_inverse_image(esk2_0,esk1_0) = esk8_0,
inference(rw,[status(thm)],[c_0_56,c_0_23]) ).
cnf(c_0_64,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_65,plain,
~ in(X1,esk8_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_20])]) ).
cnf(c_0_66,negated_conjecture,
( in(X1,relation_rng(esk2_0))
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_67,negated_conjecture,
esk11_0 != esk1_0,
inference(rw,[status(thm)],[c_0_61,c_0_17]) ).
cnf(c_0_68,negated_conjecture,
~ in(X1,esk1_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]),c_0_65]),c_0_66]) ).
cnf(c_0_69,negated_conjecture,
esk8_0 != esk1_0,
inference(rw,[status(thm)],[c_0_67,c_0_23]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_47]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SEU210+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 07:58:41 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 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.1snOMByzjp/E---3.1_20653.p
% 0.15/0.45 # Version: 3.1pre001
% 0.15/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # sh5l with pid 20735 completed with status 0
% 0.15/0.45 # Result found by sh5l
% 0.15/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.15/0.45 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.15/0.45 # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 20741 completed with status 0
% 0.15/0.45 # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 # Starting sh5l with 300s (1) cores
% 0.15/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.45 # Search class: FGHSM-FFMM31-SFFFFFNN
% 0.15/0.45 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.15/0.45 # Preprocessing time : 0.001 s
% 0.15/0.45 # Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 # Proof found!
% 0.15/0.45 # SZS status Theorem
% 0.15/0.45 # SZS output start CNFRefutation
% See solution above
% 0.15/0.45 # Parsed axioms : 40
% 0.15/0.45 # Removed by relevancy pruning/SinE : 8
% 0.15/0.45 # Initial clauses : 50
% 0.15/0.45 # Removed in clause preprocessing : 0
% 0.15/0.45 # Initial clauses in saturation : 50
% 0.15/0.45 # Processed clauses : 712
% 0.15/0.45 # ...of these trivial : 4
% 0.15/0.45 # ...subsumed : 397
% 0.15/0.45 # ...remaining for further processing : 311
% 0.15/0.45 # Other redundant clauses eliminated : 2
% 0.15/0.45 # Clauses deleted for lack of memory : 0
% 0.15/0.45 # Backward-subsumed : 25
% 0.15/0.45 # Backward-rewritten : 19
% 0.15/0.45 # Generated clauses : 1273
% 0.15/0.45 # ...of the previous two non-redundant : 1115
% 0.15/0.45 # ...aggressively subsumed : 0
% 0.15/0.45 # Contextual simplify-reflections : 5
% 0.15/0.45 # Paramodulations : 1271
% 0.15/0.45 # Factorizations : 0
% 0.15/0.45 # NegExts : 0
% 0.15/0.45 # Equation resolutions : 2
% 0.15/0.45 # Total rewrite steps : 666
% 0.15/0.45 # Propositional unsat checks : 0
% 0.15/0.45 # Propositional check models : 0
% 0.15/0.45 # Propositional check unsatisfiable : 0
% 0.15/0.45 # Propositional clauses : 0
% 0.15/0.45 # Propositional clauses after purity: 0
% 0.15/0.45 # Propositional unsat core size : 0
% 0.15/0.45 # Propositional preprocessing time : 0.000
% 0.15/0.45 # Propositional encoding time : 0.000
% 0.15/0.45 # Propositional solver time : 0.000
% 0.15/0.45 # Success case prop preproc time : 0.000
% 0.15/0.45 # Success case prop encoding time : 0.000
% 0.15/0.45 # Success case prop solver time : 0.000
% 0.15/0.45 # Current number of processed clauses : 216
% 0.15/0.45 # Positive orientable unit clauses : 56
% 0.15/0.45 # Positive unorientable unit clauses: 1
% 0.15/0.45 # Negative unit clauses : 45
% 0.15/0.45 # Non-unit-clauses : 114
% 0.15/0.45 # Current number of unprocessed clauses: 466
% 0.15/0.45 # ...number of literals in the above : 1652
% 0.15/0.45 # Current number of archived formulas : 0
% 0.15/0.45 # Current number of archived clauses : 93
% 0.15/0.45 # Clause-clause subsumption calls (NU) : 2490
% 0.15/0.45 # Rec. Clause-clause subsumption calls : 1593
% 0.15/0.45 # Non-unit clause-clause subsumptions : 165
% 0.15/0.45 # Unit Clause-clause subsumption calls : 944
% 0.15/0.45 # Rewrite failures with RHS unbound : 0
% 0.15/0.45 # BW rewrite match attempts : 25
% 0.15/0.45 # BW rewrite match successes : 12
% 0.15/0.45 # Condensation attempts : 0
% 0.15/0.45 # Condensation successes : 0
% 0.15/0.45 # Termbank termtop insertions : 18606
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.030 s
% 0.15/0.45 # System time : 0.006 s
% 0.15/0.45 # Total time : 0.036 s
% 0.15/0.45 # Maximum resident set size: 1860 pages
% 0.15/0.45
% 0.15/0.45 # -------------------------------------------------
% 0.15/0.45 # User time : 0.030 s
% 0.15/0.45 # System time : 0.009 s
% 0.15/0.45 # Total time : 0.039 s
% 0.15/0.45 # Maximum resident set size: 1704 pages
% 0.15/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------