TSTP Solution File: SWC302+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC302+1 : TPTP v8.1.2. Released v2.4.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:42:28 EDT 2023
% Result : Theorem 0.74s 0.55s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 17 unt; 0 def)
% Number of atoms : 206 ( 26 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 253 ( 98 ~; 92 |; 22 &)
% ( 1 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn; 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ lt(X6,X5) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.VZqasDgO1L/E---3.1_3478.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.VZqasDgO1L/E---3.1_3478.p',ax82) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.VZqasDgO1L/E---3.1_3478.p',ax81) ).
fof(ax90,axiom,
! [X1] :
( ssItem(X1)
=> ~ lt(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.VZqasDgO1L/E---3.1_3478.p',ax90) ).
fof(ax91,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ( ( leq(X1,X2)
& lt(X2,X3) )
=> lt(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.VZqasDgO1L/E---3.1_3478.p',ax91) ).
fof(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.VZqasDgO1L/E---3.1_3478.p',ax11) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.VZqasDgO1L/E---3.1_3478.p',ax26) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.VZqasDgO1L/E---3.1_3478.p',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.VZqasDgO1L/E---3.1_3478.p',ax17) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ~ totalorderedP(X3)
| ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1
| ~ lt(X6,X5) ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& segmentP(esk4_0,esk3_0)
& totalorderedP(esk3_0)
& ssItem(esk5_0)
& ssItem(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0
& lt(esk6_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
cnf(c_0_11,negated_conjecture,
app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X46,X47,X48] :
( ~ ssList(X46)
| ~ ssList(X47)
| ~ ssList(X48)
| app(app(X46,X47),X48) = app(X46,app(X47,X48)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_14,negated_conjecture,
app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk3_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X44,X45] :
( ~ ssList(X44)
| ~ ssItem(X45)
| cons(X45,X44) = app(cons(X45,nil),X44) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_19,negated_conjecture,
( app(app(app(esk7_0,app(cons(esk5_0,nil),esk8_0)),cons(esk6_0,nil)),esk9_0) = esk3_0
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[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_20,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_22,plain,
! [X1] :
( ssItem(X1)
=> ~ lt(X1,X1) ),
inference(fof_simplification,[status(thm)],[ax90]) ).
fof(c_0_23,plain,
! [X25,X26,X27] :
( ~ ssItem(X25)
| ~ ssItem(X26)
| ~ ssItem(X27)
| ~ leq(X25,X26)
| ~ lt(X26,X27)
| lt(X25,X27) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax91])])]) ).
fof(c_0_24,plain,
! [X67,X68,X69,X70,X71,X72] :
( ( ~ totalorderedP(X67)
| ~ ssItem(X68)
| ~ ssItem(X69)
| ~ ssList(X70)
| ~ ssList(X71)
| ~ ssList(X72)
| app(app(X70,cons(X68,X71)),cons(X69,X72)) != X67
| leq(X68,X69)
| ~ ssList(X67) )
& ( ssItem(esk14_1(X67))
| totalorderedP(X67)
| ~ ssList(X67) )
& ( ssItem(esk15_1(X67))
| totalorderedP(X67)
| ~ ssList(X67) )
& ( ssList(esk16_1(X67))
| totalorderedP(X67)
| ~ ssList(X67) )
& ( ssList(esk17_1(X67))
| totalorderedP(X67)
| ~ ssList(X67) )
& ( ssList(esk18_1(X67))
| totalorderedP(X67)
| ~ ssList(X67) )
& ( app(app(esk16_1(X67),cons(esk14_1(X67),esk17_1(X67))),cons(esk15_1(X67),esk18_1(X67))) = X67
| totalorderedP(X67)
| ~ ssList(X67) )
& ( ~ leq(esk14_1(X67),esk15_1(X67))
| totalorderedP(X67)
| ~ ssList(X67) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax11])])])])]) ).
cnf(c_0_25,negated_conjecture,
( app(app(app(esk7_0,cons(esk5_0,esk8_0)),cons(esk6_0,nil)),esk9_0) = esk3_0
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_27,plain,
! [X24] :
( ~ ssItem(X24)
| ~ lt(X24,X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])]) ).
cnf(c_0_28,plain,
( lt(X1,X3)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ leq(X1,X2)
| ~ lt(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,negated_conjecture,
lt(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
( leq(X2,X3)
| ~ totalorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( app(app(esk7_0,cons(esk5_0,esk8_0)),app(cons(esk6_0,nil),esk9_0)) = esk3_0
| ~ ssList(app(esk7_0,cons(esk5_0,esk8_0)))
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_25]),c_0_26])]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,plain,
( ~ ssItem(X1)
| ~ lt(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( lt(X1,esk5_0)
| ~ leq(X1,esk6_0)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]),c_0_30])]) ).
cnf(c_0_36,plain,
( leq(X1,X2)
| ~ totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( app(app(esk7_0,cons(esk5_0,esk8_0)),cons(esk6_0,esk9_0)) = esk3_0
| ~ ssList(app(esk7_0,cons(esk5_0,esk8_0)))
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_20]),c_0_26]),c_0_30])]) ).
cnf(c_0_38,negated_conjecture,
totalorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_33,c_0_12]) ).
cnf(c_0_40,negated_conjecture,
~ leq(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_21])]) ).
fof(c_0_41,plain,
! [X32,X33] :
( ~ ssList(X32)
| ~ ssList(X33)
| ssList(app(X32,X33)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssList(app(esk7_0,cons(esk5_0,esk8_0)))
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil)) ),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39]),c_0_26]),c_0_16]),c_0_17]),c_0_30]),c_0_21])]),c_0_40]) ).
cnf(c_0_43,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_44,plain,
! [X52,X53] :
( ~ ssList(X52)
| ~ ssItem(X53)
| ssList(cons(X53,X52)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(cons(esk5_0,esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_17])]) ).
cnf(c_0_46,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_47,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| ~ ssList(cons(esk5_0,esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_30])]) ).
cnf(c_0_49,negated_conjecture,
~ ssList(cons(esk5_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_46]),c_0_16]),c_0_21])]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_46]),c_0_47]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC302+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.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.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 02:06:31 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.VZqasDgO1L/E---3.1_3478.p
% 0.74/0.55 # Version: 3.1pre001
% 0.74/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.74/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.74/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.74/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.74/0.55 # Starting sh5l with 300s (1) cores
% 0.74/0.55 # new_bool_3 with pid 3556 completed with status 0
% 0.74/0.55 # Result found by new_bool_3
% 0.74/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.74/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.74/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.74/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.74/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.74/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.74/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.74/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3559 completed with status 0
% 0.74/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.74/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.74/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.74/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.74/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.74/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.74/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.74/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.74/0.55 # Preprocessing time : 0.003 s
% 0.74/0.55 # Presaturation interreduction done
% 0.74/0.55
% 0.74/0.55 # Proof found!
% 0.74/0.55 # SZS status Theorem
% 0.74/0.55 # SZS output start CNFRefutation
% See solution above
% 0.74/0.55 # Parsed axioms : 96
% 0.74/0.55 # Removed by relevancy pruning/SinE : 49
% 0.74/0.55 # Initial clauses : 87
% 0.74/0.55 # Removed in clause preprocessing : 1
% 0.74/0.55 # Initial clauses in saturation : 86
% 0.74/0.55 # Processed clauses : 460
% 0.74/0.55 # ...of these trivial : 2
% 0.74/0.55 # ...subsumed : 72
% 0.74/0.55 # ...remaining for further processing : 386
% 0.74/0.55 # Other redundant clauses eliminated : 13
% 0.74/0.55 # Clauses deleted for lack of memory : 0
% 0.74/0.55 # Backward-subsumed : 51
% 0.74/0.55 # Backward-rewritten : 2
% 0.74/0.55 # Generated clauses : 2111
% 0.74/0.55 # ...of the previous two non-redundant : 2011
% 0.74/0.55 # ...aggressively subsumed : 0
% 0.74/0.55 # Contextual simplify-reflections : 36
% 0.74/0.55 # Paramodulations : 2085
% 0.74/0.55 # Factorizations : 0
% 0.74/0.55 # NegExts : 0
% 0.74/0.55 # Equation resolutions : 17
% 0.74/0.55 # Total rewrite steps : 459
% 0.74/0.55 # Propositional unsat checks : 0
% 0.74/0.55 # Propositional check models : 0
% 0.74/0.55 # Propositional check unsatisfiable : 0
% 0.74/0.55 # Propositional clauses : 0
% 0.74/0.55 # Propositional clauses after purity: 0
% 0.74/0.55 # Propositional unsat core size : 0
% 0.74/0.55 # Propositional preprocessing time : 0.000
% 0.74/0.55 # Propositional encoding time : 0.000
% 0.74/0.55 # Propositional solver time : 0.000
% 0.74/0.55 # Success case prop preproc time : 0.000
% 0.74/0.55 # Success case prop encoding time : 0.000
% 0.74/0.55 # Success case prop solver time : 0.000
% 0.74/0.55 # Current number of processed clauses : 236
% 0.74/0.55 # Positive orientable unit clauses : 30
% 0.74/0.55 # Positive unorientable unit clauses: 0
% 0.74/0.55 # Negative unit clauses : 10
% 0.74/0.55 # Non-unit-clauses : 196
% 0.74/0.55 # Current number of unprocessed clauses: 1697
% 0.74/0.55 # ...number of literals in the above : 6935
% 0.74/0.55 # Current number of archived formulas : 0
% 0.74/0.55 # Current number of archived clauses : 144
% 0.74/0.55 # Clause-clause subsumption calls (NU) : 9062
% 0.74/0.55 # Rec. Clause-clause subsumption calls : 4461
% 0.74/0.55 # Non-unit clause-clause subsumptions : 128
% 0.74/0.55 # Unit Clause-clause subsumption calls : 687
% 0.74/0.55 # Rewrite failures with RHS unbound : 0
% 0.74/0.55 # BW rewrite match attempts : 2
% 0.74/0.55 # BW rewrite match successes : 2
% 0.74/0.55 # Condensation attempts : 0
% 0.74/0.55 # Condensation successes : 0
% 0.74/0.55 # Termbank termtop insertions : 40099
% 0.74/0.55
% 0.74/0.55 # -------------------------------------------------
% 0.74/0.55 # User time : 0.054 s
% 0.74/0.55 # System time : 0.008 s
% 0.74/0.55 # Total time : 0.061 s
% 0.74/0.55 # Maximum resident set size: 2088 pages
% 0.74/0.55
% 0.74/0.55 # -------------------------------------------------
% 0.74/0.55 # User time : 0.056 s
% 0.74/0.55 # System time : 0.011 s
% 0.74/0.55 # Total time : 0.067 s
% 0.74/0.55 # Maximum resident set size: 1804 pages
% 0.74/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------