TSTP Solution File: GRP774+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP774+1 : TPTP v8.1.2. Released v4.1.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 17:50:37 EDT 2023
% Result : Theorem 51.73s 7.11s
% Output : CNFRefutation 51.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 52 ( 35 unt; 0 def)
% Number of atoms : 82 ( 49 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 53 ( 23 ~; 20 |; 7 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos02,axiom,
! [X3] : product(X3,X3) = X3,
file('/export/starexec/sandbox/tmp/tmp.sX9NRvwABz/E---3.1_4677.p',sos02) ).
fof(sos01,axiom,
! [X1,X2,X3] : product(product(X3,X2),X1) = product(X3,product(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.sX9NRvwABz/E---3.1_4677.p',sos01) ).
fof(goals,conjecture,
! [X6,X7,X8,X9] :
( ( d(X6,X7)
& d(X8,X9) )
=> d(product(X6,X8),product(X7,X9)) ),
file('/export/starexec/sandbox/tmp/tmp.sX9NRvwABz/E---3.1_4677.p',goals) ).
fof(sos03,axiom,
! [X4,X5] :
( d(X4,X5)
<=> ( product(X4,product(X5,X4)) = X4
& product(X5,product(X4,X5)) = X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.sX9NRvwABz/E---3.1_4677.p',sos03) ).
fof(c_0_4,plain,
! [X19] : product(X19,X19) = X19,
inference(variable_rename,[status(thm)],[sos02]) ).
fof(c_0_5,plain,
! [X16,X17,X18] : product(product(X18,X17),X16) = product(X18,product(X17,X16)),
inference(variable_rename,[status(thm)],[sos01]) ).
fof(c_0_6,negated_conjecture,
~ ! [X6,X7,X8,X9] :
( ( d(X6,X7)
& d(X8,X9) )
=> d(product(X6,X8),product(X7,X9)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X14,X15] :
( ( product(X14,product(X15,X14)) = X14
| ~ d(X14,X15) )
& ( product(X15,product(X14,X15)) = X15
| ~ d(X14,X15) )
& ( product(X14,product(X15,X14)) != X14
| product(X15,product(X14,X15)) != X15
| d(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos03])])]) ).
cnf(c_0_8,plain,
product(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
product(product(X1,X2),X3) = product(X1,product(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
( d(esk1_0,esk2_0)
& d(esk3_0,esk4_0)
& ~ d(product(esk1_0,esk3_0),product(esk2_0,esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
( d(X1,X2)
| product(X1,product(X2,X1)) != X1
| product(X2,product(X1,X2)) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
product(X1,product(X2,product(X1,X2))) = product(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( product(X1,product(X2,X1)) = X1
| ~ d(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
d(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( product(X1,product(X2,X1)) = X1
| ~ d(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( d(product(X1,X2),X3)
| product(X1,product(X2,product(X3,product(X1,X2)))) != product(X1,X2)
| product(X3,product(X1,product(X2,X3))) != X3 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_9]) ).
cnf(c_0_17,plain,
product(X1,product(X1,X2)) = product(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_18,plain,
product(X1,product(X2,product(X1,product(X2,X3)))) = product(X1,product(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_9]),c_0_9]),c_0_9]) ).
cnf(c_0_19,negated_conjecture,
product(esk1_0,product(esk2_0,esk1_0)) = esk1_0,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
product(X1,product(X2,product(X3,product(X1,product(X2,X3))))) = product(X1,product(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_9]),c_0_9]) ).
cnf(c_0_21,negated_conjecture,
d(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
product(esk2_0,product(esk1_0,esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_23,plain,
( d(product(X1,X2),X2)
| product(X2,product(X1,X2)) != X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_8]),c_0_17]),c_0_12])]) ).
cnf(c_0_24,plain,
( d(product(X1,X2),product(X3,product(X2,X3)))
| product(X3,product(X2,product(X3,product(X1,product(X2,X3))))) != product(X3,product(X2,X3))
| product(X1,product(X2,product(X3,product(X1,X2)))) != product(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_18]) ).
cnf(c_0_25,negated_conjecture,
product(esk1_0,product(esk2_0,product(esk1_0,X1))) = product(esk1_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_19]),c_0_9]) ).
cnf(c_0_26,plain,
product(X1,product(X2,product(X3,product(X1,product(X2,product(X3,X4)))))) = product(X1,product(X2,product(X3,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_20]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_9]) ).
cnf(c_0_27,negated_conjecture,
product(esk3_0,product(esk4_0,esk3_0)) = esk3_0,
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
product(esk2_0,product(esk1_0,product(esk2_0,X1))) = product(esk2_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_22]),c_0_9]) ).
cnf(c_0_29,negated_conjecture,
product(esk4_0,product(esk3_0,esk4_0)) = esk4_0,
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_30,plain,
( d(product(X1,product(X2,X3)),X3)
| product(X3,product(X1,product(X2,X3))) != X3 ),
inference(spm,[status(thm)],[c_0_23,c_0_9]) ).
cnf(c_0_31,negated_conjecture,
( d(product(esk1_0,X1),product(X2,product(esk2_0,product(esk1_0,product(X1,X2)))))
| product(esk1_0,product(X1,product(X2,product(esk1_0,X1)))) != product(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_9]),c_0_9]),c_0_9]),c_0_9]),c_0_25]),c_0_9]),c_0_9]),c_0_20]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_25])]) ).
cnf(c_0_32,negated_conjecture,
product(X1,product(esk3_0,product(esk4_0,product(X1,esk3_0)))) = product(X1,esk3_0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( d(product(esk2_0,X1),product(X2,product(esk1_0,product(esk2_0,product(X1,X2)))))
| product(esk2_0,product(X1,product(X2,product(esk2_0,X1)))) != product(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_28]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_28]),c_0_9]),c_0_9]),c_0_20]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_28])]) ).
cnf(c_0_34,negated_conjecture,
product(X1,product(esk4_0,product(esk3_0,product(X1,esk4_0)))) = product(X1,esk4_0),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_35,plain,
( d(product(X1,product(X2,product(X3,X4))),X4)
| product(X4,product(X1,product(X2,product(X3,X4)))) != X4 ),
inference(spm,[status(thm)],[c_0_30,c_0_9]) ).
cnf(c_0_36,negated_conjecture,
d(product(esk1_0,esk3_0),product(esk4_0,product(esk2_0,product(esk1_0,product(esk3_0,esk4_0))))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
d(product(esk2_0,esk4_0),product(esk3_0,product(esk1_0,product(esk2_0,product(esk4_0,esk3_0))))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( d(product(X1,product(X2,product(X3,product(X4,X5)))),product(X4,product(X3,product(X4,X5))))
| product(X4,product(X3,product(X4,product(X5,product(X1,product(X2,product(X3,product(X4,X5)))))))) != product(X4,product(X3,product(X4,X5))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_18]),c_0_9]),c_0_9]),c_0_9]) ).
cnf(c_0_39,negated_conjecture,
product(esk1_0,product(esk3_0,product(esk4_0,product(esk2_0,product(esk1_0,esk3_0))))) = product(esk1_0,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_36]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_32]),c_0_9]) ).
cnf(c_0_40,negated_conjecture,
product(esk2_0,product(esk4_0,product(esk3_0,product(esk1_0,product(esk2_0,esk4_0))))) = product(esk2_0,esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_37]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_34]),c_0_9]) ).
cnf(c_0_41,plain,
product(X1,product(X2,product(X3,product(X4,product(X1,product(X2,product(X3,X4))))))) = product(X1,product(X2,product(X3,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_20]),c_0_9]),c_0_9]) ).
cnf(c_0_42,negated_conjecture,
d(product(esk1_0,esk3_0),product(esk2_0,product(esk4_0,product(esk2_0,product(esk1_0,esk3_0))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_8])]) ).
cnf(c_0_43,negated_conjecture,
d(product(esk2_0,esk4_0),product(esk1_0,product(esk3_0,product(esk1_0,product(esk2_0,esk4_0))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_40]),c_0_8])]) ).
cnf(c_0_44,plain,
product(X1,product(X2,product(X3,product(X4,product(X1,product(X2,product(X3,product(X4,X5)))))))) = product(X1,product(X2,product(X3,product(X4,X5)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_41]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_9]) ).
cnf(c_0_45,negated_conjecture,
product(esk1_0,product(esk3_0,product(esk2_0,product(esk4_0,product(esk2_0,product(esk1_0,esk3_0)))))) = product(esk1_0,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_42]),c_0_9]),c_0_9]),c_0_9]),c_0_8]),c_0_9]) ).
cnf(c_0_46,negated_conjecture,
product(esk2_0,product(esk4_0,product(esk1_0,product(esk3_0,product(esk1_0,product(esk2_0,esk4_0)))))) = product(esk2_0,esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_43]),c_0_9]),c_0_9]),c_0_9]),c_0_8]),c_0_9]) ).
cnf(c_0_47,plain,
( d(product(X1,X2),product(X3,X4))
| product(X1,product(X2,product(X3,product(X4,product(X1,X2))))) != product(X1,X2)
| product(X3,product(X4,product(X1,product(X2,product(X3,X4))))) != product(X3,X4) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_9]),c_0_9]) ).
cnf(c_0_48,negated_conjecture,
product(esk1_0,product(esk3_0,product(esk2_0,product(esk4_0,product(esk1_0,esk3_0))))) = product(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
product(esk2_0,product(esk4_0,product(esk1_0,product(esk3_0,product(esk2_0,esk4_0))))) = product(esk2_0,esk4_0),
inference(spm,[status(thm)],[c_0_44,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
~ d(product(esk1_0,esk3_0),product(esk2_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : GRP774+1 : TPTP v8.1.2. Released v4.1.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n015.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 : Tue Oct 3 02:28:16 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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.sX9NRvwABz/E---3.1_4677.p
% 51.73/7.11 # Version: 3.1pre001
% 51.73/7.11 # Preprocessing class: FSSSSMSSSSSNFFN.
% 51.73/7.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.73/7.11 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 51.73/7.11 # Starting new_bool_3 with 300s (1) cores
% 51.73/7.11 # Starting new_bool_1 with 300s (1) cores
% 51.73/7.11 # Starting sh5l with 300s (1) cores
% 51.73/7.11 # new_bool_3 with pid 4800 completed with status 0
% 51.73/7.11 # Result found by new_bool_3
% 51.73/7.11 # Preprocessing class: FSSSSMSSSSSNFFN.
% 51.73/7.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.73/7.11 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 51.73/7.11 # Starting new_bool_3 with 300s (1) cores
% 51.73/7.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 51.73/7.11 # Search class: FHUSS-FFSF22-SFFFFFNN
% 51.73/7.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 51.73/7.11 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 51.73/7.11 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 4827 completed with status 0
% 51.73/7.11 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 51.73/7.11 # Preprocessing class: FSSSSMSSSSSNFFN.
% 51.73/7.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.73/7.11 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 51.73/7.11 # Starting new_bool_3 with 300s (1) cores
% 51.73/7.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 51.73/7.11 # Search class: FHUSS-FFSF22-SFFFFFNN
% 51.73/7.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 51.73/7.11 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 51.73/7.11 # Preprocessing time : 0.001 s
% 51.73/7.11 # Presaturation interreduction done
% 51.73/7.11
% 51.73/7.11 # Proof found!
% 51.73/7.11 # SZS status Theorem
% 51.73/7.11 # SZS output start CNFRefutation
% See solution above
% 51.73/7.11 # Parsed axioms : 4
% 51.73/7.11 # Removed by relevancy pruning/SinE : 0
% 51.73/7.11 # Initial clauses : 8
% 51.73/7.11 # Removed in clause preprocessing : 0
% 51.73/7.11 # Initial clauses in saturation : 8
% 51.73/7.11 # Processed clauses : 14688
% 51.73/7.11 # ...of these trivial : 4747
% 51.73/7.11 # ...subsumed : 5819
% 51.73/7.11 # ...remaining for further processing : 4122
% 51.73/7.11 # Other redundant clauses eliminated : 0
% 51.73/7.11 # Clauses deleted for lack of memory : 0
% 51.73/7.11 # Backward-subsumed : 21
% 51.73/7.11 # Backward-rewritten : 348
% 51.73/7.11 # Generated clauses : 232772
% 51.73/7.11 # ...of the previous two non-redundant : 158538
% 51.73/7.11 # ...aggressively subsumed : 0
% 51.73/7.11 # Contextual simplify-reflections : 0
% 51.73/7.11 # Paramodulations : 232772
% 51.73/7.11 # Factorizations : 0
% 51.73/7.11 # NegExts : 0
% 51.73/7.11 # Equation resolutions : 0
% 51.73/7.11 # Total rewrite steps : 2032350
% 51.73/7.11 # Propositional unsat checks : 0
% 51.73/7.11 # Propositional check models : 0
% 51.73/7.11 # Propositional check unsatisfiable : 0
% 51.73/7.11 # Propositional clauses : 0
% 51.73/7.11 # Propositional clauses after purity: 0
% 51.73/7.11 # Propositional unsat core size : 0
% 51.73/7.11 # Propositional preprocessing time : 0.000
% 51.73/7.11 # Propositional encoding time : 0.000
% 51.73/7.11 # Propositional solver time : 0.000
% 51.73/7.11 # Success case prop preproc time : 0.000
% 51.73/7.11 # Success case prop encoding time : 0.000
% 51.73/7.11 # Success case prop solver time : 0.000
% 51.73/7.11 # Current number of processed clauses : 3745
% 51.73/7.11 # Positive orientable unit clauses : 2831
% 51.73/7.11 # Positive unorientable unit clauses: 0
% 51.73/7.11 # Negative unit clauses : 2
% 51.73/7.11 # Non-unit-clauses : 912
% 51.73/7.11 # Current number of unprocessed clauses: 141947
% 51.73/7.11 # ...number of literals in the above : 217934
% 51.73/7.11 # Current number of archived formulas : 0
% 51.73/7.11 # Current number of archived clauses : 377
% 51.73/7.11 # Clause-clause subsumption calls (NU) : 229557
% 51.73/7.11 # Rec. Clause-clause subsumption calls : 229557
% 51.73/7.11 # Non-unit clause-clause subsumptions : 5840
% 51.73/7.11 # Unit Clause-clause subsumption calls : 23453
% 51.73/7.11 # Rewrite failures with RHS unbound : 0
% 51.73/7.11 # BW rewrite match attempts : 177601
% 51.73/7.11 # BW rewrite match successes : 229
% 51.73/7.11 # Condensation attempts : 0
% 51.73/7.11 # Condensation successes : 0
% 51.73/7.11 # Termbank termtop insertions : 10841332
% 51.73/7.11
% 51.73/7.11 # -------------------------------------------------
% 51.73/7.11 # User time : 6.348 s
% 51.73/7.11 # System time : 0.238 s
% 51.73/7.11 # Total time : 6.586 s
% 51.73/7.11 # Maximum resident set size: 1768 pages
% 51.73/7.11
% 51.73/7.11 # -------------------------------------------------
% 51.73/7.11 # User time : 6.350 s
% 51.73/7.11 # System time : 0.239 s
% 51.73/7.11 # Total time : 6.589 s
% 51.73/7.11 # Maximum resident set size: 1672 pages
% 51.73/7.11 % E---3.1 exiting
%------------------------------------------------------------------------------