TSTP Solution File: SEU284+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU284+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:18 EDT 2023
% Result : Timeout 0.39s 300.11s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 44 ( 8 unt; 0 def)
% Number of atoms : 225 ( 131 equ)
% Maximal formula atoms : 104 ( 5 avg)
% Number of connectives : 257 ( 76 ~; 131 |; 45 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 4 avg)
% Maximal term depth : 4 ( 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 : 63 ( 12 sgn; 15 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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.UQfPV8MOOb/E---3.1_16724.p',s3_funct_1__e16_22__wellord2) ).
fof(s2_funct_1__e16_22__wellord2__1,axiom,
! [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.UQfPV8MOOb/E---3.1_16724.p',s2_funct_1__e16_22__wellord2__1) ).
fof(c_0_2,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]) ).
fof(c_0_3,plain,
! [X8,X13,X15] :
( ( relation(esk7_1(X8))
| in(esk6_1(X8),X8)
| in(esk3_1(X8),X8) )
& ( function(esk7_1(X8))
| in(esk6_1(X8),X8)
| in(esk3_1(X8),X8) )
& ( relation_dom(esk7_1(X8)) = X8
| in(esk6_1(X8),X8)
| in(esk3_1(X8),X8) )
& ( ~ in(X15,X8)
| apply(esk7_1(X8),X15) = singleton(X15)
| in(esk6_1(X8),X8)
| in(esk3_1(X8),X8) )
& ( relation(esk7_1(X8))
| X13 != singleton(esk6_1(X8))
| in(esk3_1(X8),X8) )
& ( function(esk7_1(X8))
| X13 != singleton(esk6_1(X8))
| in(esk3_1(X8),X8) )
& ( relation_dom(esk7_1(X8)) = X8
| X13 != singleton(esk6_1(X8))
| in(esk3_1(X8),X8) )
& ( ~ in(X15,X8)
| apply(esk7_1(X8),X15) = singleton(X15)
| X13 != singleton(esk6_1(X8))
| in(esk3_1(X8),X8) )
& ( relation(esk7_1(X8))
| in(esk6_1(X8),X8)
| esk4_1(X8) = singleton(esk3_1(X8)) )
& ( function(esk7_1(X8))
| in(esk6_1(X8),X8)
| esk4_1(X8) = singleton(esk3_1(X8)) )
& ( relation_dom(esk7_1(X8)) = X8
| in(esk6_1(X8),X8)
| esk4_1(X8) = singleton(esk3_1(X8)) )
& ( ~ in(X15,X8)
| apply(esk7_1(X8),X15) = singleton(X15)
| in(esk6_1(X8),X8)
| esk4_1(X8) = singleton(esk3_1(X8)) )
& ( relation(esk7_1(X8))
| X13 != singleton(esk6_1(X8))
| esk4_1(X8) = singleton(esk3_1(X8)) )
& ( function(esk7_1(X8))
| X13 != singleton(esk6_1(X8))
| esk4_1(X8) = singleton(esk3_1(X8)) )
& ( relation_dom(esk7_1(X8)) = X8
| X13 != singleton(esk6_1(X8))
| esk4_1(X8) = singleton(esk3_1(X8)) )
& ( ~ in(X15,X8)
| apply(esk7_1(X8),X15) = singleton(X15)
| X13 != singleton(esk6_1(X8))
| esk4_1(X8) = singleton(esk3_1(X8)) )
& ( relation(esk7_1(X8))
| in(esk6_1(X8),X8)
| esk5_1(X8) = singleton(esk3_1(X8)) )
& ( function(esk7_1(X8))
| in(esk6_1(X8),X8)
| esk5_1(X8) = singleton(esk3_1(X8)) )
& ( relation_dom(esk7_1(X8)) = X8
| in(esk6_1(X8),X8)
| esk5_1(X8) = singleton(esk3_1(X8)) )
& ( ~ in(X15,X8)
| apply(esk7_1(X8),X15) = singleton(X15)
| in(esk6_1(X8),X8)
| esk5_1(X8) = singleton(esk3_1(X8)) )
& ( relation(esk7_1(X8))
| X13 != singleton(esk6_1(X8))
| esk5_1(X8) = singleton(esk3_1(X8)) )
& ( function(esk7_1(X8))
| X13 != singleton(esk6_1(X8))
| esk5_1(X8) = singleton(esk3_1(X8)) )
& ( relation_dom(esk7_1(X8)) = X8
| X13 != singleton(esk6_1(X8))
| esk5_1(X8) = singleton(esk3_1(X8)) )
& ( ~ in(X15,X8)
| apply(esk7_1(X8),X15) = singleton(X15)
| X13 != singleton(esk6_1(X8))
| esk5_1(X8) = singleton(esk3_1(X8)) )
& ( relation(esk7_1(X8))
| in(esk6_1(X8),X8)
| esk4_1(X8) != esk5_1(X8) )
& ( function(esk7_1(X8))
| in(esk6_1(X8),X8)
| esk4_1(X8) != esk5_1(X8) )
& ( relation_dom(esk7_1(X8)) = X8
| in(esk6_1(X8),X8)
| esk4_1(X8) != esk5_1(X8) )
& ( ~ in(X15,X8)
| apply(esk7_1(X8),X15) = singleton(X15)
| in(esk6_1(X8),X8)
| esk4_1(X8) != esk5_1(X8) )
& ( relation(esk7_1(X8))
| X13 != singleton(esk6_1(X8))
| esk4_1(X8) != esk5_1(X8) )
& ( function(esk7_1(X8))
| X13 != singleton(esk6_1(X8))
| esk4_1(X8) != esk5_1(X8) )
& ( relation_dom(esk7_1(X8)) = X8
| X13 != singleton(esk6_1(X8))
| esk4_1(X8) != esk5_1(X8) )
& ( ~ in(X15,X8)
| apply(esk7_1(X8),X15) = singleton(X15)
| X13 != singleton(esk6_1(X8))
| esk4_1(X8) != esk5_1(X8) ) ),
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_4,negated_conjecture,
! [X6] :
( ( in(esk2_1(X6),esk1_0)
| ~ relation(X6)
| ~ function(X6)
| relation_dom(X6) != esk1_0 )
& ( apply(X6,esk2_1(X6)) != singleton(esk2_1(X6))
| ~ relation(X6)
| ~ function(X6)
| relation_dom(X6) != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
cnf(c_0_5,plain,
( relation_dom(esk7_1(X1)) = X1
| esk5_1(X1) = singleton(esk3_1(X1))
| X2 != singleton(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( relation(esk7_1(X1))
| esk5_1(X1) = singleton(esk3_1(X1))
| X2 != singleton(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( function(esk7_1(X1))
| esk5_1(X1) = singleton(esk3_1(X1))
| X2 != singleton(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,plain,
( relation_dom(esk7_1(X1)) = X1
| esk4_1(X1) = singleton(esk3_1(X1))
| X2 != singleton(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
( relation(esk7_1(X1))
| esk4_1(X1) = singleton(esk3_1(X1))
| X2 != singleton(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,plain,
( function(esk7_1(X1))
| esk4_1(X1) = singleton(esk3_1(X1))
| X2 != singleton(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,plain,
( apply(esk7_1(X2),X1) = singleton(X1)
| esk5_1(X2) = singleton(esk3_1(X2))
| ~ in(X1,X2)
| X3 != singleton(esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( in(esk2_1(X1),esk1_0)
| ~ relation(X1)
| ~ function(X1)
| relation_dom(X1) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,plain,
( esk5_1(X1) = singleton(esk3_1(X1))
| relation_dom(esk7_1(X1)) = X1 ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( esk5_1(X1) = singleton(esk3_1(X1))
| relation(esk7_1(X1)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( esk5_1(X1) = singleton(esk3_1(X1))
| function(esk7_1(X1)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( apply(esk7_1(X2),X1) = singleton(X1)
| esk4_1(X2) = singleton(esk3_1(X2))
| ~ in(X1,X2)
| X3 != singleton(esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,plain,
( esk4_1(X1) = singleton(esk3_1(X1))
| relation_dom(esk7_1(X1)) = X1 ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( esk4_1(X1) = singleton(esk3_1(X1))
| relation(esk7_1(X1)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( esk4_1(X1) = singleton(esk3_1(X1))
| function(esk7_1(X1)) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( apply(esk7_1(X1),X2) = singleton(X2)
| esk5_1(X1) = singleton(esk3_1(X1))
| ~ in(X2,X1) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
( esk5_1(esk1_0) = singleton(esk3_1(esk1_0))
| in(esk2_1(esk7_1(esk1_0)),esk1_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]),c_0_14]),c_0_15]) ).
cnf(c_0_22,plain,
( apply(esk7_1(X1),X2) = singleton(X2)
| esk4_1(X1) = singleton(esk3_1(X1))
| ~ in(X2,X1) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( esk4_1(esk1_0) = singleton(esk3_1(esk1_0))
| in(esk2_1(esk7_1(esk1_0)),esk1_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17])]),c_0_18]),c_0_19]) ).
cnf(c_0_24,plain,
( relation_dom(esk7_1(X1)) = X1
| X2 != singleton(esk6_1(X1))
| esk4_1(X1) != esk5_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_25,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_4]) ).
cnf(c_0_26,negated_conjecture,
( apply(esk7_1(esk1_0),esk2_1(esk7_1(esk1_0))) = singleton(esk2_1(esk7_1(esk1_0)))
| esk5_1(esk1_0) = singleton(esk3_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( apply(esk7_1(esk1_0),esk2_1(esk7_1(esk1_0))) = singleton(esk2_1(esk7_1(esk1_0)))
| esk4_1(esk1_0) = singleton(esk3_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( function(esk7_1(X1))
| X2 != singleton(esk6_1(X1))
| esk4_1(X1) != esk5_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_29,plain,
( relation(esk7_1(X1))
| X2 != singleton(esk6_1(X1))
| esk4_1(X1) != esk5_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_30,plain,
( apply(esk7_1(X2),X1) = singleton(X1)
| ~ in(X1,X2)
| X3 != singleton(esk6_1(X2))
| esk4_1(X2) != esk5_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_31,plain,
( relation_dom(esk7_1(X1)) = X1
| esk5_1(X1) != esk4_1(X1) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
esk5_1(esk1_0) = singleton(esk3_1(esk1_0)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_14]),c_0_15]),c_0_13]) ).
cnf(c_0_33,negated_conjecture,
esk4_1(esk1_0) = singleton(esk3_1(esk1_0)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_27]),c_0_18]),c_0_19]),c_0_17]) ).
cnf(c_0_34,plain,
( function(esk7_1(X1))
| esk5_1(X1) != esk4_1(X1) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( relation(esk7_1(X1))
| esk5_1(X1) != esk4_1(X1) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( apply(esk7_1(X1),X2) = singleton(X2)
| esk5_1(X1) != esk4_1(X1)
| ~ in(X2,X1) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
relation_dom(esk7_1(esk1_0)) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_38,negated_conjecture,
function(esk7_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_32]),c_0_33])]) ).
cnf(c_0_39,negated_conjecture,
relation(esk7_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_33])]) ).
cnf(c_0_40,negated_conjecture,
( apply(esk7_1(esk1_0),X1) = singleton(X1)
| ~ in(X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_32]),c_0_33])]) ).
cnf(c_0_41,negated_conjecture,
in(esk2_1(esk7_1(esk1_0)),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_37]),c_0_38]),c_0_39])]) ).
cnf(c_0_42,negated_conjecture,
apply(esk7_1(esk1_0),esk2_1(esk7_1(esk1_0))) = singleton(esk2_1(esk7_1(esk1_0))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,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_25,c_0_42]),c_0_37]),c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU284+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n004.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % 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 09:04:15 EDT 2023
% 0.11/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.UQfPV8MOOb/E---3.1_16724.p
% 0.39/300.11 # Version: 3.1pre001
% 0.39/300.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/300.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/300.11 # Starting new_bool_3 with 300s (1) cores
% 0.39/300.11 # Starting new_bool_1 with 300s (1) cores
% 0.39/300.11 # Starting sh5l with 300s (1) cores
% 0.39/300.11 # new_bool_3 with pid 16883 completed with status 0
% 0.39/300.11 # Result found by new_bool_3
% 0.39/300.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/300.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/300.11 # Starting new_bool_3 with 300s (1) cores
% 0.39/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/300.11 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.39/300.11 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.39/300.11 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.39/300.11 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 16890 completed with status 0
% 0.39/300.11 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.39/300.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/300.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/300.11 # Starting new_bool_3 with 300s (1) cores
% 0.39/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/300.11 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.39/300.11 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.39/300.11 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.39/300.11 # Preprocessing time : 0.002 s
% 0.39/300.11 # Presaturation interreduction done
% 0.39/300.11
% 0.39/300.11 # Proof found!
% 0.39/300.11 # SZS status Theorem
% 0.39/300.11 # SZS output start CNFRefutation
% See solution above
% 0.39/300.11 # Parsed axioms : 27
% 0.39/300.11 # Removed by relevancy pruning/SinE : 13
% 0.39/300.11 # Initial clauses : 50
% 0.39/300.11 # Removed in clause preprocessing : 0
% 0.39/300.11 # Initial clauses in saturation : 50
% 0.39/300.11 # Processed clauses : 302
% 0.39/300.11 # ...of these trivial : 9
% 0.39/300.11 # ...subsumed : 131
% 0.39/300.11 # ...remaining for further processing : 162
% 0.39/300.11 # Other redundant clauses eliminated : 42
% 0.39/300.11 # Clauses deleted for lack of memory : 0
% 0.39/300.11 # Backward-subsumed : 4
% 0.39/300.11 # Backward-rewritten : 24
% 0.39/300.11 # Generated clauses : 637
% 0.39/300.11 # ...of the previous two non-redundant : 547
% 0.39/300.11 # ...aggressively subsumed : 0
% 0.39/300.11 # Contextual simplify-reflections : 22
% 0.39/300.11 # Paramodulations : 595
% 0.39/300.11 # Factorizations : 0
% 0.39/300.11 # NegExts : 0
% 0.39/300.11 # Equation resolutions : 42
% 0.39/300.11 # Total rewrite steps : 158
% 0.39/300.11 # Propositional unsat checks : 0
% 0.39/300.11 # Propositional check models : 0
% 0.39/300.11 # Propositional check unsatisfiable : 0
% 0.39/300.11 # Propositional clauses : 0
% 0.39/300.11 # Propositional clauses after purity: 0
% 0.39/300.11 # Propositional unsat core size : 0
% 0.39/300.11 # Propositional preprocessing time : 0.000
% 0.39/300.11 # Propositional encoding time : 0.000
% 0.39/300.11 # Propositional solver time : 0.000
% 0.39/300.11 # Success case prop preproc time : 0.000
% 0.39/300.11 # Success case prop encoding time : 0.000
% 0.39/300.11 # Success case prop solver time : 0.000
% 0.39/300.11 # Current number of processed clauses : 84
% 0.39/300.11 # Positive orientable unit clauses : 18
% 0.39/300.11 # Positive unorientable unit clauses: 0
% 0.39/300.11 # Negative unit clauses : 6
% 0.39/300.11 # Non-unit-clauses : 60
% 0.39/300.11 # Current number of unprocessed clauses: 318
% 0.39/300.11 # ...number of literals in the above : 1345
% 0.39/300.11 # Current number of archived formulas : 0
% 0.39/300.11 # Current number of archived clauses : 62
% 0.39/300.11 # Clause-clause subsumption calls (NU) : 882
% 0.39/300.11 # Rec. Clause-clause subsumption calls : 663
% 0.39/300.11 # Non-unit clause-clause subsumptions : 138
% 0.39/300.11 # Unit Clause-clause subsumption calls : 128
% 0.39/300.11 # Rewrite failures with RHS unbound : 0
% 0.39/300.11 # BW rewrite match attempts : 5
% 0.39/300.11 # BW rewrite match successes : 5
% 0.39/300.11 # Condensation attempts : 0
% 0.39/300.11 # Condensation successes : 0
% 0.39/300.11 # Termbank termtop insertions : 9106
% 0.39/300.11
% 0.39/300.11 # -------------------------------------------------
% 0.39/300.11 # User time : 0.018 s
% 0.39/300.11 # System time : 0.002 s
% 0.39/300.11 # Total time : 0.020 s
% 0.39/300.11 # Maximum resident set size: 1876 pages
% 0.39/300.11
% 0.39/300.11 # -------------------------------------------------
% 0.39/300.11 # User time : 0.018 s
% 0.39/300.11 # System time : 0.005 s
% 0.39/300.11 # Total time : 0.023 s
% 0.39/300.11 # Maximum resident set size: 1692 pages
% 0.39/300.11 % E---3.1 exiting
%------------------------------------------------------------------------------