TSTP Solution File: SEU344+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU344+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:43 EDT 2023
% Result : Theorem 356.10s 45.44s
% Output : CNFRefutation 356.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 50 ( 18 unt; 0 def)
% Number of atoms : 166 ( 44 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 187 ( 71 ~; 71 |; 23 &)
% ( 5 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 3 con; 0-3 aty)
% Number of variables : 68 ( 4 sgn; 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_lattice3,conjecture,
! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( below(boole_lattice(X1),X2,X3)
<=> subset(X2,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.0qcGsawK5X/E---3.1_31338.p',t2_lattice3) ).
fof(d1_lattice3,axiom,
! [X1,X2] :
( ( strict_latt_str(X2)
& latt_str(X2) )
=> ( X2 = boole_lattice(X1)
<=> ( the_carrier(X2) = powerset(X1)
& ! [X3] :
( element(X3,powerset(X1))
=> ! [X4] :
( element(X4,powerset(X1))
=> ( apply_binary(the_L_join(X2),X3,X4) = subset_union2(X1,X3,X4)
& apply_binary(the_L_meet(X2),X3,X4) = subset_intersection2(X1,X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.0qcGsawK5X/E---3.1_31338.p',d1_lattice3) ).
fof(dt_k1_lattice3,axiom,
! [X1] :
( strict_latt_str(boole_lattice(X1))
& latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.0qcGsawK5X/E---3.1_31338.p',dt_k1_lattice3) ).
fof(d3_lattices,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.0qcGsawK5X/E---3.1_31338.p',d3_lattices) ).
fof(fc1_lattice3,axiom,
! [X1] :
( ~ empty_carrier(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.0qcGsawK5X/E---3.1_31338.p',fc1_lattice3) ).
fof(t1_lattice3,lemma,
! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( join(boole_lattice(X1),X2,X3) = set_union2(X2,X3)
& meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.0qcGsawK5X/E---3.1_31338.p',t1_lattice3) ).
fof(dt_l3_lattices,axiom,
! [X1] :
( latt_str(X1)
=> ( meet_semilatt_str(X1)
& join_semilatt_str(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.0qcGsawK5X/E---3.1_31338.p',dt_l3_lattices) ).
fof(t12_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.0qcGsawK5X/E---3.1_31338.p',t12_xboole_1) ).
fof(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.0qcGsawK5X/E---3.1_31338.p',t7_xboole_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( below(boole_lattice(X1),X2,X3)
<=> subset(X2,X3) ) ) ),
inference(assume_negation,[status(cth)],[t2_lattice3]) ).
fof(c_0_10,plain,
! [X207,X208,X209,X210] :
( ( the_carrier(X208) = powerset(X207)
| X208 != boole_lattice(X207)
| ~ strict_latt_str(X208)
| ~ latt_str(X208) )
& ( apply_binary(the_L_join(X208),X209,X210) = subset_union2(X207,X209,X210)
| ~ element(X210,powerset(X207))
| ~ element(X209,powerset(X207))
| X208 != boole_lattice(X207)
| ~ strict_latt_str(X208)
| ~ latt_str(X208) )
& ( apply_binary(the_L_meet(X208),X209,X210) = subset_intersection2(X207,X209,X210)
| ~ element(X210,powerset(X207))
| ~ element(X209,powerset(X207))
| X208 != boole_lattice(X207)
| ~ strict_latt_str(X208)
| ~ latt_str(X208) )
& ( element(esk25_2(X207,X208),powerset(X207))
| the_carrier(X208) != powerset(X207)
| X208 = boole_lattice(X207)
| ~ strict_latt_str(X208)
| ~ latt_str(X208) )
& ( element(esk26_2(X207,X208),powerset(X207))
| the_carrier(X208) != powerset(X207)
| X208 = boole_lattice(X207)
| ~ strict_latt_str(X208)
| ~ latt_str(X208) )
& ( apply_binary(the_L_join(X208),esk25_2(X207,X208),esk26_2(X207,X208)) != subset_union2(X207,esk25_2(X207,X208),esk26_2(X207,X208))
| apply_binary(the_L_meet(X208),esk25_2(X207,X208),esk26_2(X207,X208)) != subset_intersection2(X207,esk25_2(X207,X208),esk26_2(X207,X208))
| the_carrier(X208) != powerset(X207)
| X208 = boole_lattice(X207)
| ~ strict_latt_str(X208)
| ~ latt_str(X208) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_lattice3])])])])]) ).
fof(c_0_11,plain,
! [X588] :
( strict_latt_str(boole_lattice(X588))
& latt_str(boole_lattice(X588)) ),
inference(variable_rename,[status(thm)],[dt_k1_lattice3]) ).
fof(c_0_12,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[d3_lattices]) ).
fof(c_0_13,negated_conjecture,
( element(esk406_0,the_carrier(boole_lattice(esk405_0)))
& element(esk407_0,the_carrier(boole_lattice(esk405_0)))
& ( ~ below(boole_lattice(esk405_0),esk406_0,esk407_0)
| ~ subset(esk406_0,esk407_0) )
& ( below(boole_lattice(esk405_0),esk406_0,esk407_0)
| subset(esk406_0,esk407_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_14,plain,
( the_carrier(X1) = powerset(X2)
| X1 != boole_lattice(X2)
| ~ strict_latt_str(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
strict_latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X1] :
( ~ empty_carrier(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_lattice3]) ).
fof(c_0_18,plain,
! [X381,X382,X383] :
( ( ~ below(X381,X382,X383)
| join(X381,X382,X383) = X383
| ~ element(X383,the_carrier(X381))
| ~ element(X382,the_carrier(X381))
| empty_carrier(X381)
| ~ join_semilatt_str(X381) )
& ( join(X381,X382,X383) != X383
| below(X381,X382,X383)
| ~ element(X383,the_carrier(X381))
| ~ element(X382,the_carrier(X381))
| empty_carrier(X381)
| ~ join_semilatt_str(X381) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_19,negated_conjecture,
element(esk407_0,the_carrier(boole_lattice(esk405_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
the_carrier(boole_lattice(X1)) = powerset(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_21,negated_conjecture,
element(esk406_0,the_carrier(boole_lattice(esk405_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_22,plain,
! [X699] :
( ~ empty_carrier(boole_lattice(X699))
& strict_latt_str(boole_lattice(X699)) ),
inference(variable_rename,[status(thm)],[c_0_17]) ).
fof(c_0_23,lemma,
! [X1607,X1608,X1609] :
( ( join(boole_lattice(X1607),X1608,X1609) = set_union2(X1608,X1609)
| ~ element(X1609,the_carrier(boole_lattice(X1607)))
| ~ element(X1608,the_carrier(boole_lattice(X1607))) )
& ( meet(boole_lattice(X1607),X1608,X1609) = set_intersection2(X1608,X1609)
| ~ element(X1609,the_carrier(boole_lattice(X1607)))
| ~ element(X1608,the_carrier(boole_lattice(X1607))) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_lattice3])])])]) ).
cnf(c_0_24,plain,
( join(X1,X2,X3) = X3
| empty_carrier(X1)
| ~ below(X1,X2,X3)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ join_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( below(boole_lattice(esk405_0),esk406_0,esk407_0)
| subset(esk406_0,esk407_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,negated_conjecture,
element(esk407_0,powerset(esk405_0)),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
element(esk406_0,powerset(esk405_0)),
inference(rw,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_28,plain,
~ empty_carrier(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_29,plain,
! [X654] :
( ( meet_semilatt_str(X654)
| ~ latt_str(X654) )
& ( join_semilatt_str(X654)
| ~ latt_str(X654) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])]) ).
cnf(c_0_30,lemma,
( join(boole_lattice(X1),X2,X3) = set_union2(X2,X3)
| ~ element(X3,the_carrier(boole_lattice(X1)))
| ~ element(X2,the_carrier(boole_lattice(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_31,lemma,
! [X1519,X1520] :
( ~ subset(X1519,X1520)
| set_union2(X1519,X1520) = X1520 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).
cnf(c_0_32,negated_conjecture,
( join(boole_lattice(esk405_0),esk406_0,esk407_0) = esk407_0
| subset(esk406_0,esk407_0)
| ~ join_semilatt_str(boole_lattice(esk405_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_20]),c_0_26]),c_0_20]),c_0_27])]),c_0_28]) ).
cnf(c_0_33,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,lemma,
( join(boole_lattice(X1),X2,X3) = set_union2(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_20]),c_0_20]) ).
cnf(c_0_35,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( join(boole_lattice(esk405_0),esk406_0,esk407_0) = esk407_0
| subset(esk406_0,esk407_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_16])]) ).
cnf(c_0_37,negated_conjecture,
( join(boole_lattice(esk405_0),X1,esk407_0) = set_union2(X1,esk407_0)
| ~ element(X1,powerset(esk405_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_26]) ).
fof(c_0_38,lemma,
! [X1929,X1930] : subset(X1929,set_union2(X1929,X1930)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
cnf(c_0_39,lemma,
( join(boole_lattice(esk405_0),esk406_0,esk407_0) = esk407_0
| set_union2(esk406_0,esk407_0) = esk407_0 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
join(boole_lattice(esk405_0),esk406_0,esk407_0) = set_union2(esk406_0,esk407_0),
inference(spm,[status(thm)],[c_0_37,c_0_27]) ).
cnf(c_0_41,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,lemma,
set_union2(esk406_0,esk407_0) = esk407_0,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
( ~ below(boole_lattice(esk405_0),esk406_0,esk407_0)
| ~ subset(esk406_0,esk407_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_44,lemma,
subset(esk406_0,esk407_0),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( below(X1,X2,X3)
| empty_carrier(X1)
| join(X1,X2,X3) != X3
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ join_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_46,negated_conjecture,
join(boole_lattice(esk405_0),esk406_0,esk407_0) = esk407_0,
inference(rw,[status(thm)],[c_0_40,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
~ below(boole_lattice(esk405_0),esk406_0,esk407_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_48,negated_conjecture,
~ join_semilatt_str(boole_lattice(esk405_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_20]),c_0_26]),c_0_20]),c_0_27])]),c_0_47]),c_0_28]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_33]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU344+2 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 08:45:00 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.48 Running first-order model finding
% 0.16/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.0qcGsawK5X/E---3.1_31338.p
% 356.10/45.44 # Version: 3.1pre001
% 356.10/45.44 # Preprocessing class: FSLMSMSSSSSNFFN.
% 356.10/45.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 356.10/45.44 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 356.10/45.44 # Starting new_bool_3 with 600s (2) cores
% 356.10/45.44 # Starting new_bool_1 with 600s (2) cores
% 356.10/45.44 # Starting sh5l with 300s (1) cores
% 356.10/45.44 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 31415 completed with status 0
% 356.10/45.44 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 356.10/45.44 # Preprocessing class: FSLMSMSSSSSNFFN.
% 356.10/45.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 356.10/45.44 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 356.10/45.44 # No SInE strategy applied
% 356.10/45.44 # Search class: FGHSM-SMLM32-MFFFFFNN
% 356.10/45.44 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 356.10/45.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 356.10/45.44 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 356.10/45.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 68s (1) cores
% 356.10/45.44 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 31424 completed with status 0
% 356.10/45.44 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 356.10/45.44 # Preprocessing class: FSLMSMSSSSSNFFN.
% 356.10/45.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 356.10/45.44 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 356.10/45.44 # No SInE strategy applied
% 356.10/45.44 # Search class: FGHSM-SMLM32-MFFFFFNN
% 356.10/45.44 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 356.10/45.44 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 356.10/45.44 # Preprocessing time : 0.038 s
% 356.10/45.44 # Presaturation interreduction done
% 356.10/45.44
% 356.10/45.44 # Proof found!
% 356.10/45.44 # SZS status Theorem
% 356.10/45.44 # SZS output start CNFRefutation
% See solution above
% 356.10/45.44 # Parsed axioms : 599
% 356.10/45.44 # Removed by relevancy pruning/SinE : 0
% 356.10/45.44 # Initial clauses : 2611
% 356.10/45.44 # Removed in clause preprocessing : 42
% 356.10/45.44 # Initial clauses in saturation : 2569
% 356.10/45.44 # Processed clauses : 76444
% 356.10/45.44 # ...of these trivial : 381
% 356.10/45.44 # ...subsumed : 52945
% 356.10/45.44 # ...remaining for further processing : 23118
% 356.10/45.44 # Other redundant clauses eliminated : 1321
% 356.10/45.44 # Clauses deleted for lack of memory : 0
% 356.10/45.44 # Backward-subsumed : 654
% 356.10/45.44 # Backward-rewritten : 907
% 356.10/45.44 # Generated clauses : 992507
% 356.10/45.44 # ...of the previous two non-redundant : 954021
% 356.10/45.44 # ...aggressively subsumed : 0
% 356.10/45.44 # Contextual simplify-reflections : 426
% 356.10/45.44 # Paramodulations : 991356
% 356.10/45.44 # Factorizations : 39
% 356.10/45.44 # NegExts : 0
% 356.10/45.44 # Equation resolutions : 1333
% 356.10/45.44 # Total rewrite steps : 112675
% 356.10/45.44 # Propositional unsat checks : 4
% 356.10/45.44 # Propositional check models : 1
% 356.10/45.44 # Propositional check unsatisfiable : 0
% 356.10/45.44 # Propositional clauses : 0
% 356.10/45.44 # Propositional clauses after purity: 0
% 356.10/45.44 # Propositional unsat core size : 0
% 356.10/45.44 # Propositional preprocessing time : 0.000
% 356.10/45.44 # Propositional encoding time : 2.120
% 356.10/45.44 # Propositional solver time : 0.964
% 356.10/45.44 # Success case prop preproc time : 0.000
% 356.10/45.44 # Success case prop encoding time : 0.000
% 356.10/45.44 # Success case prop solver time : 0.000
% 356.10/45.44 # Current number of processed clauses : 18518
% 356.10/45.44 # Positive orientable unit clauses : 1812
% 356.10/45.44 # Positive unorientable unit clauses: 6
% 356.10/45.44 # Negative unit clauses : 2310
% 356.10/45.44 # Non-unit-clauses : 14390
% 356.10/45.44 # Current number of unprocessed clauses: 881839
% 356.10/45.44 # ...number of literals in the above : 2970087
% 356.10/45.44 # Current number of archived formulas : 0
% 356.10/45.44 # Current number of archived clauses : 3970
% 356.10/45.44 # Clause-clause subsumption calls (NU) : 43537057
% 356.10/45.44 # Rec. Clause-clause subsumption calls : 21043711
% 356.10/45.44 # Non-unit clause-clause subsumptions : 30110
% 356.10/45.44 # Unit Clause-clause subsumption calls : 4853655
% 356.10/45.44 # Rewrite failures with RHS unbound : 0
% 356.10/45.44 # BW rewrite match attempts : 2484
% 356.10/45.44 # BW rewrite match successes : 205
% 356.10/45.44 # Condensation attempts : 0
% 356.10/45.44 # Condensation successes : 0
% 356.10/45.44 # Termbank termtop insertions : 25804406
% 356.10/45.44
% 356.10/45.44 # -------------------------------------------------
% 356.10/45.44 # User time : 43.204 s
% 356.10/45.44 # System time : 0.726 s
% 356.10/45.44 # Total time : 43.930 s
% 356.10/45.44 # Maximum resident set size: 9036 pages
% 356.10/45.44
% 356.10/45.44 # -------------------------------------------------
% 356.10/45.44 # User time : 129.902 s
% 356.10/45.44 # System time : 2.226 s
% 356.10/45.44 # Total time : 132.128 s
% 356.10/45.44 # Maximum resident set size: 2512 pages
% 356.10/45.44 % E---3.1 exiting
%------------------------------------------------------------------------------