TSTP Solution File: SEU108+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU108+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:23 EDT 2023
% Result : Theorem 1.20s 0.67s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 56 ( 18 unt; 0 def)
% Number of atoms : 133 ( 12 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 134 ( 57 ~; 55 |; 12 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-3 aty)
% Number of variables : 92 ( 1 sgn; 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t20_finsub_1,conjecture,
! [X1] : preboolean(powerset(X1)),
file('/export/starexec/sandbox/tmp/tmp.GTjJ7YlXvO/E---3.1_6600.p',t20_finsub_1) ).
fof(t10_finsub_1,axiom,
! [X1] :
( preboolean(X1)
<=> ! [X2,X3] :
( ( in(X2,X1)
& in(X3,X1) )
=> ( in(set_union2(X2,X3),X1)
& in(set_difference(X2,X3),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.GTjJ7YlXvO/E---3.1_6600.p',t10_finsub_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.GTjJ7YlXvO/E---3.1_6600.p',t3_subset) ).
fof(dt_k4_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X1))
& element(X3,powerset(X1)) )
=> element(subset_union2(X1,X2,X3),powerset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.GTjJ7YlXvO/E---3.1_6600.p',dt_k4_subset_1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.GTjJ7YlXvO/E---3.1_6600.p',t1_subset) ).
fof(commutativity_k4_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X1))
& element(X3,powerset(X1)) )
=> subset_union2(X1,X2,X3) = subset_union2(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.GTjJ7YlXvO/E---3.1_6600.p',commutativity_k4_subset_1) ).
fof(redefinition_k4_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X1))
& element(X3,powerset(X1)) )
=> subset_union2(X1,X2,X3) = set_union2(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.GTjJ7YlXvO/E---3.1_6600.p',redefinition_k4_subset_1) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ empty(powerset(X1)),
file('/export/starexec/sandbox/tmp/tmp.GTjJ7YlXvO/E---3.1_6600.p',fc1_subset_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.GTjJ7YlXvO/E---3.1_6600.p',t2_subset) ).
fof(dt_k6_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X1))
& element(X3,powerset(X1)) )
=> element(subset_difference(X1,X2,X3),powerset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.GTjJ7YlXvO/E---3.1_6600.p',dt_k6_subset_1) ).
fof(redefinition_k6_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X1))
& element(X3,powerset(X1)) )
=> subset_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.GTjJ7YlXvO/E---3.1_6600.p',redefinition_k6_subset_1) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] : preboolean(powerset(X1)),
inference(assume_negation,[status(cth)],[t20_finsub_1]) ).
fof(c_0_12,negated_conjecture,
~ preboolean(powerset(esk13_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_13,plain,
! [X58,X59,X60,X61] :
( ( in(set_union2(X59,X60),X58)
| ~ in(X59,X58)
| ~ in(X60,X58)
| ~ preboolean(X58) )
& ( in(set_difference(X59,X60),X58)
| ~ in(X59,X58)
| ~ in(X60,X58)
| ~ preboolean(X58) )
& ( in(esk11_1(X61),X61)
| preboolean(X61) )
& ( in(esk12_1(X61),X61)
| preboolean(X61) )
& ( ~ in(set_union2(esk11_1(X61),esk12_1(X61)),X61)
| ~ in(set_difference(esk11_1(X61),esk12_1(X61)),X61)
| preboolean(X61) ) ),
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)],[t10_finsub_1])])])])])]) ).
fof(c_0_14,plain,
! [X71,X72] :
( ( ~ element(X71,powerset(X72))
| subset(X71,X72) )
& ( ~ subset(X71,X72)
| element(X71,powerset(X72)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_15,plain,
! [X16,X17,X18] :
( ~ element(X17,powerset(X16))
| ~ element(X18,powerset(X16))
| element(subset_union2(X16,X17,X18),powerset(X16)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_subset_1])]) ).
fof(c_0_16,plain,
! [X65,X66] :
( ~ in(X65,X66)
| element(X65,X66) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
cnf(c_0_17,negated_conjecture,
~ preboolean(powerset(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( in(esk11_1(X1),X1)
| preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( in(esk12_1(X1),X1)
| preboolean(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( element(subset_union2(X2,X1,X3),powerset(X2))
| ~ element(X1,powerset(X2))
| ~ element(X3,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
in(esk11_1(powerset(esk13_0)),powerset(esk13_0)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_24,plain,
! [X13,X14,X15] :
( ~ element(X14,powerset(X13))
| ~ element(X15,powerset(X13))
| subset_union2(X13,X14,X15) = subset_union2(X13,X15,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[commutativity_k4_subset_1])]) ).
cnf(c_0_25,negated_conjecture,
in(esk12_1(powerset(esk13_0)),powerset(esk13_0)),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_26,plain,
( subset(subset_union2(X1,X2,X3),X1)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
element(esk11_1(powerset(esk13_0)),powerset(esk13_0)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( subset_union2(X2,X1,X3) = subset_union2(X2,X3,X1)
| ~ element(X1,powerset(X2))
| ~ element(X3,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
element(esk12_1(powerset(esk13_0)),powerset(esk13_0)),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
fof(c_0_30,plain,
! [X51,X52,X53] :
( ~ element(X52,powerset(X51))
| ~ element(X53,powerset(X51))
| subset_union2(X51,X52,X53) = set_union2(X52,X53) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_subset_1])]) ).
cnf(c_0_31,negated_conjecture,
( subset(subset_union2(esk13_0,X1,esk11_1(powerset(esk13_0))),esk13_0)
| ~ element(X1,powerset(esk13_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( subset_union2(esk13_0,X1,esk12_1(powerset(esk13_0))) = subset_union2(esk13_0,esk12_1(powerset(esk13_0)),X1)
| ~ element(X1,powerset(esk13_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( subset_union2(X2,X1,X3) = set_union2(X1,X3)
| ~ element(X1,powerset(X2))
| ~ element(X3,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
subset(subset_union2(esk13_0,esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29]),c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
( subset_union2(esk13_0,X1,esk12_1(powerset(esk13_0))) = set_union2(X1,esk12_1(powerset(esk13_0)))
| ~ element(X1,powerset(esk13_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
fof(c_0_36,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
fof(c_0_37,plain,
! [X68,X69] :
( ~ element(X68,X69)
| empty(X69)
| in(X68,X69) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_38,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_39,negated_conjecture,
subset(set_union2(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_27])]) ).
fof(c_0_40,plain,
! [X26] : ~ empty(powerset(X26)),
inference(variable_rename,[status(thm)],[c_0_36]) ).
fof(c_0_41,plain,
! [X19,X20,X21] :
( ~ element(X20,powerset(X19))
| ~ element(X21,powerset(X19))
| element(subset_difference(X19,X20,X21),powerset(X19)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_subset_1])]) ).
fof(c_0_42,plain,
! [X54,X55,X56] :
( ~ element(X55,powerset(X54))
| ~ element(X56,powerset(X54))
| subset_difference(X54,X55,X56) = set_difference(X55,X56) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k6_subset_1])]) ).
cnf(c_0_43,plain,
( preboolean(X1)
| ~ in(set_union2(esk11_1(X1),esk12_1(X1)),X1)
| ~ in(set_difference(esk11_1(X1),esk12_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_44,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,negated_conjecture,
element(set_union2(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),powerset(esk13_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
( element(subset_difference(X2,X1,X3),powerset(X2))
| ~ element(X1,powerset(X2))
| ~ element(X3,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,plain,
( subset_difference(X2,X1,X3) = set_difference(X1,X3)
| ~ element(X1,powerset(X2))
| ~ element(X3,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( ~ in(set_union2(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),powerset(esk13_0))
| ~ in(set_difference(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),powerset(esk13_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
in(set_union2(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),powerset(esk13_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_51,plain,
( in(subset_difference(X1,X2,X3),powerset(X1))
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_47]),c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( subset_difference(esk13_0,X1,esk12_1(powerset(esk13_0))) = set_difference(X1,esk12_1(powerset(esk13_0)))
| ~ element(X1,powerset(esk13_0)) ),
inference(spm,[status(thm)],[c_0_48,c_0_29]) ).
cnf(c_0_53,negated_conjecture,
~ in(set_difference(esk11_1(powerset(esk13_0)),esk12_1(powerset(esk13_0))),powerset(esk13_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_54,negated_conjecture,
( in(set_difference(X1,esk12_1(powerset(esk13_0))),powerset(esk13_0))
| ~ element(X1,powerset(esk13_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_29])]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU108+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n015.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:48:15 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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.GTjJ7YlXvO/E---3.1_6600.p
% 1.20/0.67 # Version: 3.1pre001
% 1.20/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.20/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.20/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.20/0.67 # Starting new_bool_1 with 300s (1) cores
% 1.20/0.67 # Starting sh5l with 300s (1) cores
% 1.20/0.67 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6685 completed with status 0
% 1.20/0.67 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.20/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.20/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.20/0.67 # No SInE strategy applied
% 1.20/0.67 # Search class: FGHSM-FFMM31-SFFFFFNN
% 1.20/0.67 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.67 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.20/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.20/0.67 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 1.20/0.67 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.20/0.67 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 136s (1) cores
% 1.20/0.67 # G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 6695 completed with status 0
% 1.20/0.67 # Result found by G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.20/0.67 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.20/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.20/0.67 # No SInE strategy applied
% 1.20/0.67 # Search class: FGHSM-FFMM31-SFFFFFNN
% 1.20/0.67 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.67 # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.20/0.67 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.20/0.67 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 1.20/0.67 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.20/0.67 # Preprocessing time : 0.002 s
% 1.20/0.67 # Presaturation interreduction done
% 1.20/0.67
% 1.20/0.67 # Proof found!
% 1.20/0.67 # SZS status Theorem
% 1.20/0.67 # SZS output start CNFRefutation
% See solution above
% 1.20/0.67 # Parsed axioms : 43
% 1.20/0.67 # Removed by relevancy pruning/SinE : 0
% 1.20/0.67 # Initial clauses : 69
% 1.20/0.67 # Removed in clause preprocessing : 0
% 1.20/0.67 # Initial clauses in saturation : 69
% 1.20/0.67 # Processed clauses : 2412
% 1.20/0.67 # ...of these trivial : 42
% 1.20/0.67 # ...subsumed : 1470
% 1.20/0.67 # ...remaining for further processing : 900
% 1.20/0.67 # Other redundant clauses eliminated : 0
% 1.20/0.67 # Clauses deleted for lack of memory : 0
% 1.20/0.67 # Backward-subsumed : 55
% 1.20/0.67 # Backward-rewritten : 40
% 1.20/0.67 # Generated clauses : 9695
% 1.20/0.67 # ...of the previous two non-redundant : 8428
% 1.20/0.67 # ...aggressively subsumed : 0
% 1.20/0.67 # Contextual simplify-reflections : 9
% 1.20/0.67 # Paramodulations : 9695
% 1.20/0.67 # Factorizations : 0
% 1.20/0.67 # NegExts : 0
% 1.20/0.67 # Equation resolutions : 0
% 1.20/0.67 # Total rewrite steps : 2811
% 1.20/0.67 # Propositional unsat checks : 0
% 1.20/0.67 # Propositional check models : 0
% 1.20/0.67 # Propositional check unsatisfiable : 0
% 1.20/0.67 # Propositional clauses : 0
% 1.20/0.67 # Propositional clauses after purity: 0
% 1.20/0.67 # Propositional unsat core size : 0
% 1.20/0.67 # Propositional preprocessing time : 0.000
% 1.20/0.67 # Propositional encoding time : 0.000
% 1.20/0.67 # Propositional solver time : 0.000
% 1.20/0.67 # Success case prop preproc time : 0.000
% 1.20/0.67 # Success case prop encoding time : 0.000
% 1.20/0.67 # Success case prop solver time : 0.000
% 1.20/0.67 # Current number of processed clauses : 736
% 1.20/0.67 # Positive orientable unit clauses : 161
% 1.20/0.67 # Positive unorientable unit clauses: 3
% 1.20/0.67 # Negative unit clauses : 27
% 1.20/0.67 # Non-unit-clauses : 545
% 1.20/0.67 # Current number of unprocessed clauses: 6018
% 1.20/0.67 # ...number of literals in the above : 16662
% 1.20/0.67 # Current number of archived formulas : 0
% 1.20/0.67 # Current number of archived clauses : 164
% 1.20/0.67 # Clause-clause subsumption calls (NU) : 59029
% 1.20/0.67 # Rec. Clause-clause subsumption calls : 43488
% 1.20/0.67 # Non-unit clause-clause subsumptions : 778
% 1.20/0.67 # Unit Clause-clause subsumption calls : 4904
% 1.20/0.67 # Rewrite failures with RHS unbound : 0
% 1.20/0.67 # BW rewrite match attempts : 206
% 1.20/0.67 # BW rewrite match successes : 47
% 1.20/0.67 # Condensation attempts : 0
% 1.20/0.67 # Condensation successes : 0
% 1.20/0.67 # Termbank termtop insertions : 144523
% 1.20/0.67
% 1.20/0.67 # -------------------------------------------------
% 1.20/0.67 # User time : 0.167 s
% 1.20/0.67 # System time : 0.008 s
% 1.20/0.67 # Total time : 0.174 s
% 1.20/0.67 # Maximum resident set size: 1888 pages
% 1.20/0.67
% 1.20/0.67 # -------------------------------------------------
% 1.20/0.67 # User time : 0.780 s
% 1.20/0.67 # System time : 0.034 s
% 1.20/0.67 # Total time : 0.814 s
% 1.20/0.67 # Maximum resident set size: 1732 pages
% 1.20/0.67 % E---3.1 exiting
%------------------------------------------------------------------------------