TSTP Solution File: SEU304+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU304+2 : 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:31:33 EDT 2023
% Result : Theorem 6.75s 1.47s
% Output : CNFRefutation 6.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 49 ( 14 unt; 0 def)
% Number of atoms : 203 ( 27 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 234 ( 80 ~; 79 |; 46 &)
% ( 4 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 77 ( 0 sgn; 53 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(redefinition_k4_lattices,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> meet_commut(X1,X2,X3) = meet(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.yNo0PFL9Q6/E---3.1_941.p',redefinition_k4_lattices) ).
fof(t23_lattices,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_absorbing(X1)
& latt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> below(X1,meet_commut(X1,X2,X3),X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yNo0PFL9Q6/E---3.1_941.p',t23_lattices) ).
fof(d8_lattices,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& latt_str(X1) )
=> ( meet_absorbing(X1)
<=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> join(X1,meet(X1,X2,X3),X3) = X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yNo0PFL9Q6/E---3.1_941.p',d8_lattices) ).
fof(dt_k4_lattices,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> element(meet_commut(X1,X2,X3),the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.yNo0PFL9Q6/E---3.1_941.p',dt_k4_lattices) ).
fof(dt_l3_lattices,axiom,
! [X1] :
( latt_str(X1)
=> ( meet_semilatt_str(X1)
& join_semilatt_str(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yNo0PFL9Q6/E---3.1_941.p',dt_l3_lattices) ).
fof(commutativity_k4_lattices,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> meet_commut(X1,X2,X3) = meet_commut(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.yNo0PFL9Q6/E---3.1_941.p',commutativity_k4_lattices) ).
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/sandbox2/tmp/tmp.yNo0PFL9Q6/E---3.1_941.p',d3_lattices) ).
fof(c_0_7,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> meet_commut(X1,X2,X3) = meet(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[redefinition_k4_lattices]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_absorbing(X1)
& latt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> below(X1,meet_commut(X1,X2,X3),X2) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t23_lattices])]) ).
fof(c_0_9,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& latt_str(X1) )
=> ( meet_absorbing(X1)
<=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> join(X1,meet(X1,X2,X3),X3) = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[d8_lattices]) ).
fof(c_0_10,plain,
! [X33,X34,X35] :
( empty_carrier(X33)
| ~ meet_commutative(X33)
| ~ meet_semilatt_str(X33)
| ~ element(X34,the_carrier(X33))
| ~ element(X35,the_carrier(X33))
| meet_commut(X33,X34,X35) = meet(X33,X34,X35) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_11,negated_conjecture,
( ~ empty_carrier(esk1_0)
& meet_commutative(esk1_0)
& meet_absorbing(esk1_0)
& latt_str(esk1_0)
& element(esk2_0,the_carrier(esk1_0))
& element(esk3_0,the_carrier(esk1_0))
& ~ below(esk1_0,meet_commut(esk1_0,esk2_0,esk3_0),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> element(meet_commut(X1,X2,X3),the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[dt_k4_lattices]) ).
fof(c_0_13,plain,
! [X64,X65,X66] :
( ( ~ meet_absorbing(X64)
| ~ element(X65,the_carrier(X64))
| ~ element(X66,the_carrier(X64))
| join(X64,meet(X64,X65,X66),X66) = X66
| empty_carrier(X64)
| ~ latt_str(X64) )
& ( element(esk9_1(X64),the_carrier(X64))
| meet_absorbing(X64)
| empty_carrier(X64)
| ~ latt_str(X64) )
& ( element(esk10_1(X64),the_carrier(X64))
| meet_absorbing(X64)
| empty_carrier(X64)
| ~ latt_str(X64) )
& ( join(X64,meet(X64,esk9_1(X64),esk10_1(X64)),esk10_1(X64)) != esk10_1(X64)
| meet_absorbing(X64)
| empty_carrier(X64)
| ~ latt_str(X64) ) ),
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_9])])])])]) ).
cnf(c_0_14,plain,
( empty_carrier(X1)
| meet_commut(X1,X2,X3) = meet(X1,X2,X3)
| ~ meet_commutative(X1)
| ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
meet_commutative(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,plain,
! [X62] :
( ( meet_semilatt_str(X62)
| ~ latt_str(X62) )
& ( join_semilatt_str(X62)
| ~ latt_str(X62) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])]) ).
fof(c_0_19,plain,
! [X30,X31,X32] :
( empty_carrier(X30)
| ~ meet_commutative(X30)
| ~ meet_semilatt_str(X30)
| ~ element(X31,the_carrier(X30))
| ~ element(X32,the_carrier(X30))
| element(meet_commut(X30,X31,X32),the_carrier(X30)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
cnf(c_0_20,plain,
( join(X1,meet(X1,X2,X3),X3) = X3
| empty_carrier(X1)
| ~ meet_absorbing(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
meet_absorbing(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
latt_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( meet(esk1_0,X1,esk2_0) = meet_commut(esk1_0,X1,esk2_0)
| ~ meet_semilatt_str(esk1_0)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_24,plain,
( meet_semilatt_str(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( empty_carrier(X1)
| element(meet_commut(X1,X2,X3),the_carrier(X1))
| ~ meet_commutative(X1)
| ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& meet_commutative(X1)
& meet_semilatt_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> meet_commut(X1,X2,X3) = meet_commut(X1,X3,X2) ),
inference(fof_simplification,[status(thm)],[commutativity_k4_lattices]) ).
fof(c_0_27,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]) ).
cnf(c_0_28,negated_conjecture,
( join(esk1_0,meet(esk1_0,X1,esk2_0),esk2_0) = esk2_0
| ~ element(X1,the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_21]),c_0_22])]),c_0_17]) ).
cnf(c_0_29,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
( meet(esk1_0,X1,esk2_0) = meet_commut(esk1_0,X1,esk2_0)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]) ).
cnf(c_0_31,negated_conjecture,
( element(meet_commut(esk1_0,X1,esk2_0),the_carrier(esk1_0))
| ~ meet_semilatt_str(esk1_0)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_16])]),c_0_17]) ).
fof(c_0_32,plain,
! [X27,X28,X29] :
( empty_carrier(X27)
| ~ meet_commutative(X27)
| ~ meet_semilatt_str(X27)
| ~ element(X28,the_carrier(X27))
| ~ element(X29,the_carrier(X27))
| meet_commut(X27,X28,X29) = meet_commut(X27,X29,X28) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])]) ).
fof(c_0_33,plain,
! [X24,X25,X26] :
( ( ~ below(X24,X25,X26)
| join(X24,X25,X26) = X26
| ~ element(X26,the_carrier(X24))
| ~ element(X25,the_carrier(X24))
| empty_carrier(X24)
| ~ join_semilatt_str(X24) )
& ( join(X24,X25,X26) != X26
| below(X24,X25,X26)
| ~ element(X26,the_carrier(X24))
| ~ element(X25,the_carrier(X24))
| empty_carrier(X24)
| ~ join_semilatt_str(X24) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])]) ).
cnf(c_0_34,negated_conjecture,
join(esk1_0,meet(esk1_0,esk3_0,esk2_0),esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
meet(esk1_0,esk3_0,esk2_0) = meet_commut(esk1_0,esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( element(meet_commut(esk1_0,X1,esk2_0),the_carrier(esk1_0))
| ~ element(X1,the_carrier(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_24]),c_0_22])]) ).
cnf(c_0_37,plain,
( empty_carrier(X1)
| meet_commut(X1,X2,X3) = meet_commut(X1,X3,X2)
| ~ meet_commutative(X1)
| ~ meet_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,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_33]) ).
cnf(c_0_39,negated_conjecture,
join(esk1_0,meet_commut(esk1_0,esk3_0,esk2_0),esk2_0) = esk2_0,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
element(meet_commut(esk1_0,esk3_0,esk2_0),the_carrier(esk1_0)),
inference(spm,[status(thm)],[c_0_36,c_0_29]) ).
cnf(c_0_41,negated_conjecture,
( meet_commut(esk1_0,X1,esk3_0) = meet_commut(esk1_0,esk3_0,X1)
| ~ meet_semilatt_str(esk1_0)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_29]),c_0_16])]),c_0_17]) ).
cnf(c_0_42,negated_conjecture,
( below(esk1_0,meet_commut(esk1_0,esk3_0,esk2_0),esk2_0)
| ~ join_semilatt_str(esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_15]),c_0_40])]),c_0_17]) ).
cnf(c_0_43,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_44,negated_conjecture,
( meet_commut(esk1_0,X1,esk3_0) = meet_commut(esk1_0,esk3_0,X1)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_24]),c_0_22])]) ).
cnf(c_0_45,negated_conjecture,
below(esk1_0,meet_commut(esk1_0,esk3_0,esk2_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_22])]) ).
cnf(c_0_46,negated_conjecture,
meet_commut(esk1_0,esk3_0,esk2_0) = meet_commut(esk1_0,esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_44,c_0_15]) ).
cnf(c_0_47,negated_conjecture,
~ below(esk1_0,meet_commut(esk1_0,esk2_0,esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU304+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 09:05:57 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.51 Running first-order model finding
% 0.20/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.yNo0PFL9Q6/E---3.1_941.p
% 6.75/1.47 # Version: 3.1pre001
% 6.75/1.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 6.75/1.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.75/1.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.75/1.47 # Starting new_bool_3 with 300s (1) cores
% 6.75/1.47 # Starting new_bool_1 with 300s (1) cores
% 6.75/1.47 # Starting sh5l with 300s (1) cores
% 6.75/1.47 # new_bool_3 with pid 1049 completed with status 0
% 6.75/1.47 # Result found by new_bool_3
% 6.75/1.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 6.75/1.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.75/1.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.75/1.47 # Starting new_bool_3 with 300s (1) cores
% 6.75/1.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.75/1.47 # Search class: FGHSM-FSLM31-MFFFFFNN
% 6.75/1.47 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 6.75/1.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 6.75/1.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 1053 completed with status 0
% 6.75/1.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 6.75/1.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 6.75/1.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.75/1.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 6.75/1.47 # Starting new_bool_3 with 300s (1) cores
% 6.75/1.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.75/1.47 # Search class: FGHSM-FSLM31-MFFFFFNN
% 6.75/1.47 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 6.75/1.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 6.75/1.47 # Preprocessing time : 0.005 s
% 6.75/1.47 # Presaturation interreduction done
% 6.75/1.47
% 6.75/1.47 # Proof found!
% 6.75/1.47 # SZS status Theorem
% 6.75/1.47 # SZS output start CNFRefutation
% See solution above
% 6.75/1.47 # Parsed axioms : 450
% 6.75/1.47 # Removed by relevancy pruning/SinE : 377
% 6.75/1.47 # Initial clauses : 256
% 6.75/1.47 # Removed in clause preprocessing : 2
% 6.75/1.47 # Initial clauses in saturation : 254
% 6.75/1.47 # Processed clauses : 4313
% 6.75/1.47 # ...of these trivial : 7
% 6.75/1.47 # ...subsumed : 2057
% 6.75/1.47 # ...remaining for further processing : 2249
% 6.75/1.47 # Other redundant clauses eliminated : 105
% 6.75/1.47 # Clauses deleted for lack of memory : 0
% 6.75/1.47 # Backward-subsumed : 25
% 6.75/1.47 # Backward-rewritten : 56
% 6.75/1.47 # Generated clauses : 55594
% 6.75/1.47 # ...of the previous two non-redundant : 54767
% 6.75/1.47 # ...aggressively subsumed : 0
% 6.75/1.47 # Contextual simplify-reflections : 40
% 6.75/1.47 # Paramodulations : 55483
% 6.75/1.47 # Factorizations : 4
% 6.75/1.47 # NegExts : 0
% 6.75/1.47 # Equation resolutions : 107
% 6.75/1.47 # Total rewrite steps : 4921
% 6.75/1.47 # Propositional unsat checks : 0
% 6.75/1.47 # Propositional check models : 0
% 6.75/1.47 # Propositional check unsatisfiable : 0
% 6.75/1.47 # Propositional clauses : 0
% 6.75/1.47 # Propositional clauses after purity: 0
% 6.75/1.47 # Propositional unsat core size : 0
% 6.75/1.47 # Propositional preprocessing time : 0.000
% 6.75/1.47 # Propositional encoding time : 0.000
% 6.75/1.47 # Propositional solver time : 0.000
% 6.75/1.47 # Success case prop preproc time : 0.000
% 6.75/1.47 # Success case prop encoding time : 0.000
% 6.75/1.47 # Success case prop solver time : 0.000
% 6.75/1.47 # Current number of processed clauses : 1891
% 6.75/1.47 # Positive orientable unit clauses : 979
% 6.75/1.47 # Positive unorientable unit clauses: 0
% 6.75/1.47 # Negative unit clauses : 372
% 6.75/1.47 # Non-unit-clauses : 540
% 6.75/1.47 # Current number of unprocessed clauses: 50894
% 6.75/1.47 # ...number of literals in the above : 154672
% 6.75/1.47 # Current number of archived formulas : 0
% 6.75/1.47 # Current number of archived clauses : 313
% 6.75/1.47 # Clause-clause subsumption calls (NU) : 58015
% 6.75/1.47 # Rec. Clause-clause subsumption calls : 14955
% 6.75/1.47 # Non-unit clause-clause subsumptions : 742
% 6.75/1.47 # Unit Clause-clause subsumption calls : 31474
% 6.75/1.47 # Rewrite failures with RHS unbound : 0
% 6.75/1.47 # BW rewrite match attempts : 193625
% 6.75/1.47 # BW rewrite match successes : 35
% 6.75/1.47 # Condensation attempts : 0
% 6.75/1.47 # Condensation successes : 0
% 6.75/1.47 # Termbank termtop insertions : 1258132
% 6.75/1.47
% 6.75/1.47 # -------------------------------------------------
% 6.75/1.47 # User time : 0.886 s
% 6.75/1.47 # System time : 0.033 s
% 6.75/1.47 # Total time : 0.919 s
% 6.75/1.47 # Maximum resident set size: 2900 pages
% 6.75/1.47
% 6.75/1.47 # -------------------------------------------------
% 6.75/1.47 # User time : 0.898 s
% 6.75/1.47 # System time : 0.036 s
% 6.75/1.47 # Total time : 0.934 s
% 6.75/1.47 # Maximum resident set size: 2288 pages
% 6.75/1.47 % E---3.1 exiting
%------------------------------------------------------------------------------