TSTP Solution File: SEU284+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU284+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 675.69s 85.87s
% Output : CNFRefutation 675.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 41 ( 7 unt; 0 def)
% Number of atoms : 228 ( 132 equ)
% Maximal formula atoms : 104 ( 5 avg)
% Number of connectives : 274 ( 87 ~; 137 |; 45 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 5 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 68 ( 14 sgn; 15 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s2_funct_1__e16_22__wellord2__1,lemma,
! [X1] :
( ( ! [X2,X3,X4] :
( ( in(X2,X1)
& X3 = singleton(X2)
& X4 = singleton(X2) )
=> X3 = X4 )
& ! [X2] :
~ ( in(X2,X1)
& ! [X3] : X3 != singleton(X2) ) )
=> ? [X2] :
( relation(X2)
& function(X2)
& relation_dom(X2) = X1
& ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = singleton(X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.vQDnLqJ6Yn/E---3.1_17537.p',s2_funct_1__e16_22__wellord2__1) ).
fof(s3_funct_1__e16_22__wellord2,conjecture,
! [X1] :
? [X2] :
( relation(X2)
& function(X2)
& relation_dom(X2) = X1
& ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = singleton(X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.vQDnLqJ6Yn/E---3.1_17537.p',s3_funct_1__e16_22__wellord2) ).
fof(c_0_2,lemma,
! [X47,X52,X54] :
( ( relation(esk17_1(X47))
| in(esk16_1(X47),X47)
| in(esk13_1(X47),X47) )
& ( function(esk17_1(X47))
| in(esk16_1(X47),X47)
| in(esk13_1(X47),X47) )
& ( relation_dom(esk17_1(X47)) = X47
| in(esk16_1(X47),X47)
| in(esk13_1(X47),X47) )
& ( ~ in(X54,X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| in(esk16_1(X47),X47)
| in(esk13_1(X47),X47) )
& ( relation(esk17_1(X47))
| X52 != singleton(esk16_1(X47))
| in(esk13_1(X47),X47) )
& ( function(esk17_1(X47))
| X52 != singleton(esk16_1(X47))
| in(esk13_1(X47),X47) )
& ( relation_dom(esk17_1(X47)) = X47
| X52 != singleton(esk16_1(X47))
| in(esk13_1(X47),X47) )
& ( ~ in(X54,X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| X52 != singleton(esk16_1(X47))
| in(esk13_1(X47),X47) )
& ( relation(esk17_1(X47))
| in(esk16_1(X47),X47)
| esk14_1(X47) = singleton(esk13_1(X47)) )
& ( function(esk17_1(X47))
| in(esk16_1(X47),X47)
| esk14_1(X47) = singleton(esk13_1(X47)) )
& ( relation_dom(esk17_1(X47)) = X47
| in(esk16_1(X47),X47)
| esk14_1(X47) = singleton(esk13_1(X47)) )
& ( ~ in(X54,X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| in(esk16_1(X47),X47)
| esk14_1(X47) = singleton(esk13_1(X47)) )
& ( relation(esk17_1(X47))
| X52 != singleton(esk16_1(X47))
| esk14_1(X47) = singleton(esk13_1(X47)) )
& ( function(esk17_1(X47))
| X52 != singleton(esk16_1(X47))
| esk14_1(X47) = singleton(esk13_1(X47)) )
& ( relation_dom(esk17_1(X47)) = X47
| X52 != singleton(esk16_1(X47))
| esk14_1(X47) = singleton(esk13_1(X47)) )
& ( ~ in(X54,X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| X52 != singleton(esk16_1(X47))
| esk14_1(X47) = singleton(esk13_1(X47)) )
& ( relation(esk17_1(X47))
| in(esk16_1(X47),X47)
| esk15_1(X47) = singleton(esk13_1(X47)) )
& ( function(esk17_1(X47))
| in(esk16_1(X47),X47)
| esk15_1(X47) = singleton(esk13_1(X47)) )
& ( relation_dom(esk17_1(X47)) = X47
| in(esk16_1(X47),X47)
| esk15_1(X47) = singleton(esk13_1(X47)) )
& ( ~ in(X54,X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| in(esk16_1(X47),X47)
| esk15_1(X47) = singleton(esk13_1(X47)) )
& ( relation(esk17_1(X47))
| X52 != singleton(esk16_1(X47))
| esk15_1(X47) = singleton(esk13_1(X47)) )
& ( function(esk17_1(X47))
| X52 != singleton(esk16_1(X47))
| esk15_1(X47) = singleton(esk13_1(X47)) )
& ( relation_dom(esk17_1(X47)) = X47
| X52 != singleton(esk16_1(X47))
| esk15_1(X47) = singleton(esk13_1(X47)) )
& ( ~ in(X54,X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| X52 != singleton(esk16_1(X47))
| esk15_1(X47) = singleton(esk13_1(X47)) )
& ( relation(esk17_1(X47))
| in(esk16_1(X47),X47)
| esk14_1(X47) != esk15_1(X47) )
& ( function(esk17_1(X47))
| in(esk16_1(X47),X47)
| esk14_1(X47) != esk15_1(X47) )
& ( relation_dom(esk17_1(X47)) = X47
| in(esk16_1(X47),X47)
| esk14_1(X47) != esk15_1(X47) )
& ( ~ in(X54,X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| in(esk16_1(X47),X47)
| esk14_1(X47) != esk15_1(X47) )
& ( relation(esk17_1(X47))
| X52 != singleton(esk16_1(X47))
| esk14_1(X47) != esk15_1(X47) )
& ( function(esk17_1(X47))
| X52 != singleton(esk16_1(X47))
| esk14_1(X47) != esk15_1(X47) )
& ( relation_dom(esk17_1(X47)) = X47
| X52 != singleton(esk16_1(X47))
| esk14_1(X47) != esk15_1(X47) )
& ( ~ in(X54,X47)
| apply(esk17_1(X47),X54) = singleton(X54)
| X52 != singleton(esk16_1(X47))
| esk14_1(X47) != esk15_1(X47) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[s2_funct_1__e16_22__wellord2__1])])])])]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
? [X2] :
( relation(X2)
& function(X2)
& relation_dom(X2) = X1
& ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = singleton(X3) ) ),
inference(assume_negation,[status(cth)],[s3_funct_1__e16_22__wellord2]) ).
cnf(c_0_4,lemma,
( apply(esk17_1(X2),X1) = singleton(X1)
| ~ in(X1,X2)
| X3 != singleton(esk16_1(X2))
| esk14_1(X2) != esk15_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
! [X14] :
( ( in(esk2_1(X14),esk1_0)
| ~ relation(X14)
| ~ function(X14)
| relation_dom(X14) != esk1_0 )
& ( apply(X14,esk2_1(X14)) != singleton(esk2_1(X14))
| ~ relation(X14)
| ~ function(X14)
| relation_dom(X14) != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,lemma,
( relation_dom(esk17_1(X1)) = X1
| X2 != singleton(esk16_1(X1))
| esk14_1(X1) != esk15_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,lemma,
( relation_dom(esk17_1(X1)) = X1
| esk15_1(X1) = singleton(esk13_1(X1))
| X2 != singleton(esk16_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,lemma,
( relation_dom(esk17_1(X1)) = X1
| esk14_1(X1) = singleton(esk13_1(X1))
| X2 != singleton(esk16_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,lemma,
( relation(esk17_1(X1))
| X2 != singleton(esk16_1(X1))
| esk14_1(X1) != esk15_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,lemma,
( relation(esk17_1(X1))
| esk15_1(X1) = singleton(esk13_1(X1))
| X2 != singleton(esk16_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,lemma,
( relation(esk17_1(X1))
| esk14_1(X1) = singleton(esk13_1(X1))
| X2 != singleton(esk16_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,lemma,
( function(esk17_1(X1))
| X2 != singleton(esk16_1(X1))
| esk14_1(X1) != esk15_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,lemma,
( function(esk17_1(X1))
| esk15_1(X1) = singleton(esk13_1(X1))
| X2 != singleton(esk16_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,lemma,
( function(esk17_1(X1))
| esk14_1(X1) = singleton(esk13_1(X1))
| X2 != singleton(esk16_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,lemma,
( apply(esk17_1(X2),X1) = singleton(X1)
| esk14_1(X2) = singleton(esk13_1(X2))
| ~ in(X1,X2)
| X3 != singleton(esk16_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,lemma,
( apply(esk17_1(X1),X2) = singleton(X2)
| esk15_1(X1) != esk14_1(X1)
| ~ in(X2,X1) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( in(esk2_1(X1),esk1_0)
| ~ relation(X1)
| ~ function(X1)
| relation_dom(X1) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,lemma,
( relation_dom(esk17_1(X1)) = X1
| esk15_1(X1) != esk14_1(X1) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_19,lemma,
( esk15_1(X1) = singleton(esk13_1(X1))
| relation_dom(esk17_1(X1)) = X1 ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_20,lemma,
( esk14_1(X1) = singleton(esk13_1(X1))
| relation_dom(esk17_1(X1)) = X1 ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_21,lemma,
( relation(esk17_1(X1))
| esk15_1(X1) != esk14_1(X1) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_22,lemma,
( esk15_1(X1) = singleton(esk13_1(X1))
| relation(esk17_1(X1)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_23,lemma,
( esk14_1(X1) = singleton(esk13_1(X1))
| relation(esk17_1(X1)) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_24,lemma,
( function(esk17_1(X1))
| esk15_1(X1) != esk14_1(X1) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_25,lemma,
( esk15_1(X1) = singleton(esk13_1(X1))
| function(esk17_1(X1)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_26,lemma,
( esk14_1(X1) = singleton(esk13_1(X1))
| function(esk17_1(X1)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_27,lemma,
( apply(esk17_1(X1),X2) = singleton(X2)
| esk14_1(X1) = singleton(esk13_1(X1))
| ~ in(X2,X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_28,negated_conjecture,
( apply(X1,esk2_1(X1)) != singleton(esk2_1(X1))
| ~ relation(X1)
| ~ function(X1)
| relation_dom(X1) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_29,negated_conjecture,
( apply(esk17_1(esk1_0),esk2_1(X1)) = singleton(esk2_1(X1))
| esk15_1(esk1_0) != esk14_1(esk1_0)
| relation_dom(X1) != esk1_0
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_30,lemma,
relation_dom(esk17_1(X1)) = X1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_31,lemma,
relation(esk17_1(X1)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_32,lemma,
function(esk17_1(X1)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( apply(esk17_1(esk1_0),esk2_1(X1)) = singleton(esk2_1(X1))
| esk14_1(esk1_0) = singleton(esk13_1(esk1_0))
| relation_dom(X1) != esk1_0
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_34,lemma,
( apply(esk17_1(X2),X1) = singleton(X1)
| esk15_1(X2) = singleton(esk13_1(X2))
| ~ in(X1,X2)
| X3 != singleton(esk16_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_35,negated_conjecture,
esk15_1(esk1_0) != esk14_1(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
esk14_1(esk1_0) = singleton(esk13_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_33]),c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_37,lemma,
( apply(esk17_1(X1),X2) = singleton(X2)
| esk15_1(X1) = singleton(esk13_1(X1))
| ~ in(X2,X1) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
esk15_1(esk1_0) != singleton(esk13_1(esk1_0)),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( apply(esk17_1(esk1_0),esk2_1(X1)) = singleton(esk2_1(X1))
| relation_dom(X1) != esk1_0
| ~ relation(X1)
| ~ function(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_17]),c_0_38]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_39]),c_0_30]),c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.15 % Problem : SEU284+2 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.16 % Command : run_E %s %d THM
% 0.17/0.37 % Computer : n019.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 2400
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Mon Oct 2 08:33:06 EDT 2023
% 0.17/0.37 % 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.vQDnLqJ6Yn/E---3.1_17537.p
% 675.69/85.87 # Version: 3.1pre001
% 675.69/85.87 # Preprocessing class: FSLSSMSSSSSNFFN.
% 675.69/85.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 675.69/85.87 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 675.69/85.87 # Starting new_bool_3 with 300s (1) cores
% 675.69/85.87 # Starting new_bool_1 with 300s (1) cores
% 675.69/85.87 # Starting sh5l with 300s (1) cores
% 675.69/85.87 # new_bool_3 with pid 17681 completed with status 0
% 675.69/85.87 # Result found by new_bool_3
% 675.69/85.87 # Preprocessing class: FSLSSMSSSSSNFFN.
% 675.69/85.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 675.69/85.87 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 675.69/85.87 # Starting new_bool_3 with 300s (1) cores
% 675.69/85.87 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 675.69/85.87 # Search class: FGHSM-FSLM32-MFFFFFNN
% 675.69/85.87 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 675.69/85.87 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 675.69/85.87 # G-E--_303_C18_F1_URBAN_S0Y with pid 17694 completed with status 7
% 675.69/85.87 # Starting new_bool_3 with 31s (1) cores
% 675.69/85.87 # new_bool_3 with pid 23118 completed with status 7
% 675.69/85.87 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 25s (1) cores
% 675.69/85.87 # U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 23175 completed with status 7
% 675.69/85.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 25s (1) cores
% 675.69/85.87 # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 23182 completed with status 0
% 675.69/85.87 # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 675.69/85.87 # Preprocessing class: FSLSSMSSSSSNFFN.
% 675.69/85.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 675.69/85.87 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 675.69/85.87 # Starting new_bool_3 with 300s (1) cores
% 675.69/85.87 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 675.69/85.87 # Search class: FGHSM-FSLM32-MFFFFFNN
% 675.69/85.87 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 675.69/85.87 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 675.69/85.87 # G-E--_303_C18_F1_URBAN_S0Y with pid 17694 completed with status 7
% 675.69/85.87 # Starting new_bool_3 with 31s (1) cores
% 675.69/85.87 # new_bool_3 with pid 23118 completed with status 7
% 675.69/85.87 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 25s (1) cores
% 675.69/85.87 # U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 23175 completed with status 7
% 675.69/85.87 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 25s (1) cores
% 675.69/85.87 # Preprocessing time : 0.006 s
% 675.69/85.87 # Presaturation interreduction done
% 675.69/85.87
% 675.69/85.87 # Proof found!
% 675.69/85.87 # SZS status Theorem
% 675.69/85.87 # SZS output start CNFRefutation
% See solution above
% 675.69/85.87 # Parsed axioms : 371
% 675.69/85.87 # Removed by relevancy pruning/SinE : 224
% 675.69/85.87 # Initial clauses : 441
% 675.69/85.87 # Removed in clause preprocessing : 2
% 675.69/85.87 # Initial clauses in saturation : 439
% 675.69/85.87 # Processed clauses : 12557
% 675.69/85.87 # ...of these trivial : 50
% 675.69/85.87 # ...subsumed : 9400
% 675.69/85.87 # ...remaining for further processing : 3107
% 675.69/85.87 # Other redundant clauses eliminated : 471
% 675.69/85.87 # Clauses deleted for lack of memory : 0
% 675.69/85.87 # Backward-subsumed : 93
% 675.69/85.87 # Backward-rewritten : 143
% 675.69/85.87 # Generated clauses : 154732
% 675.69/85.87 # ...of the previous two non-redundant : 139807
% 675.69/85.87 # ...aggressively subsumed : 0
% 675.69/85.87 # Contextual simplify-reflections : 168
% 675.69/85.87 # Paramodulations : 154269
% 675.69/85.87 # Factorizations : 18
% 675.69/85.87 # NegExts : 0
% 675.69/85.87 # Equation resolutions : 474
% 675.69/85.87 # Total rewrite steps : 57628
% 675.69/85.87 # Propositional unsat checks : 0
% 675.69/85.87 # Propositional check models : 0
% 675.69/85.87 # Propositional check unsatisfiable : 0
% 675.69/85.87 # Propositional clauses : 0
% 675.69/85.87 # Propositional clauses after purity: 0
% 675.69/85.87 # Propositional unsat core size : 0
% 675.69/85.87 # Propositional preprocessing time : 0.000
% 675.69/85.87 # Propositional encoding time : 0.000
% 675.69/85.87 # Propositional solver time : 0.000
% 675.69/85.87 # Success case prop preproc time : 0.000
% 675.69/85.87 # Success case prop encoding time : 0.000
% 675.69/85.87 # Success case prop solver time : 0.000
% 675.69/85.87 # Current number of processed clauses : 2402
% 675.69/85.87 # Positive orientable unit clauses : 97
% 675.69/85.87 # Positive unorientable unit clauses: 1
% 675.69/85.87 # Negative unit clauses : 93
% 675.69/85.87 # Non-unit-clauses : 2211
% 675.69/85.87 # Current number of unprocessed clauses: 127672
% 675.69/85.87 # ...number of literals in the above : 550805
% 675.69/85.87 # Current number of archived formulas : 0
% 675.69/85.87 # Current number of archived clauses : 618
% 675.69/85.87 # Clause-clause subsumption calls (NU) : 901806
% 675.69/85.87 # Rec. Clause-clause subsumption calls : 412856
% 675.69/85.87 # Non-unit clause-clause subsumptions : 4680
% 675.69/85.87 # Unit Clause-clause subsumption calls : 20408
% 675.69/85.87 # Rewrite failures with RHS unbound : 0
% 675.69/85.87 # BW rewrite match attempts : 108
% 675.69/85.87 # BW rewrite match successes : 76
% 675.69/85.87 # Condensation attempts : 0
% 675.69/85.87 # Condensation successes : 0
% 675.69/85.87 # Termbank termtop insertions : 2638183
% 675.69/85.87
% 675.69/85.87 # -------------------------------------------------
% 675.69/85.87 # User time : 82.706 s
% 675.69/85.87 # System time : 1.559 s
% 675.69/85.87 # Total time : 84.265 s
% 675.69/85.87 # Maximum resident set size: 3316 pages
% 675.69/85.87
% 675.69/85.87 # -------------------------------------------------
% 675.69/85.87 # User time : 82.718 s
% 675.69/85.87 # System time : 1.563 s
% 675.69/85.87 # Total time : 84.281 s
% 675.69/85.87 # Maximum resident set size: 2128 pages
% 675.69/85.87 % E---3.1 exiting
% 675.69/85.87 % E---3.1 exiting
%------------------------------------------------------------------------------