TSTP Solution File: SWC305+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC305+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:28:57 EDT 2024
% Result : Theorem 0.21s 0.56s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 20 unt; 0 def)
% Number of atoms : 200 ( 30 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 236 ( 83 ~; 82 |; 30 &)
% ( 1 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn 55 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(app(app(X8,cons(X6,nil)),X9),cons(X7,nil)),X10) != X1
| ~ lt(X7,X6) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.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/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax33) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(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
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(app(app(X8,cons(X6,nil)),X9),cons(X7,nil)),X10) != X1
| ~ lt(X7,X6) ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_9,negated_conjecture,
! [X15] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& frontsegP(esk4_0,esk3_0)
& strictorderedP(esk3_0)
& ( ~ ssList(X15)
| ~ neq(esk3_0,X15)
| ~ frontsegP(esk4_0,X15)
| ~ segmentP(X15,esk3_0)
| ~ strictorderedP(X15) )
& 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(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
cnf(c_0_10,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_9]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X98,X99,X100] :
( ~ ssList(X98)
| ~ ssList(X99)
| ~ ssList(X100)
| app(app(X98,X99),X100) = app(X98,app(X99,X100)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_13,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_10,c_0_11]) ).
cnf(c_0_14,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X108,X109] :
( ~ ssList(X108)
| ~ ssItem(X109)
| ssList(cons(X109,X108)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_18,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_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_19,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_22,plain,
! [X96,X97] :
( ~ ssList(X96)
| ~ ssItem(X97)
| cons(X97,X96) = app(cons(X97,nil),X96) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_23,negated_conjecture,
app(app(app(esk7_0,app(cons(esk5_0,nil),esk8_0)),cons(esk6_0,nil)),esk9_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,negated_conjecture,
app(app(app(esk7_0,cons(esk5_0,esk8_0)),cons(esk6_0,nil)),esk9_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,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)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_26])]) ).
cnf(c_0_28,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_29,plain,
! [X74,X75] :
( ~ ssList(X74)
| ~ ssList(X75)
| ssList(app(X74,X75)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_30,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))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_19]),c_0_20]),c_0_28])]) ).
cnf(c_0_31,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_32,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_33,plain,
! [X32,X33,X34,X35,X36,X37] :
( ( ~ strictorderedP(X32)
| ~ ssItem(X33)
| ~ ssItem(X34)
| ~ ssList(X35)
| ~ ssList(X36)
| ~ ssList(X37)
| app(app(X35,cons(X33,X36)),cons(X34,X37)) != X32
| lt(X33,X34)
| ~ ssList(X32) )
& ( ssItem(esk15_1(X32))
| strictorderedP(X32)
| ~ ssList(X32) )
& ( ssItem(esk16_1(X32))
| strictorderedP(X32)
| ~ ssList(X32) )
& ( ssList(esk17_1(X32))
| strictorderedP(X32)
| ~ ssList(X32) )
& ( ssList(esk18_1(X32))
| strictorderedP(X32)
| ~ ssList(X32) )
& ( ssList(esk19_1(X32))
| strictorderedP(X32)
| ~ ssList(X32) )
& ( app(app(esk17_1(X32),cons(esk15_1(X32),esk18_1(X32))),cons(esk16_1(X32),esk19_1(X32))) = X32
| strictorderedP(X32)
| ~ ssList(X32) )
& ( ~ lt(esk15_1(X32),esk16_1(X32))
| strictorderedP(X32)
| ~ ssList(X32) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax12])])])])])]) ).
cnf(c_0_34,negated_conjecture,
( app(app(esk7_0,cons(esk5_0,esk8_0)),app(cons(esk6_0,nil),esk9_0)) = esk3_0
| ~ ssList(cons(esk5_0,esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16])]) ).
fof(c_0_35,plain,
! [X43,X44] :
( ~ ssItem(X43)
| ~ ssItem(X44)
| ~ lt(X43,X44)
| ~ lt(X44,X43) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])]) ).
cnf(c_0_36,plain,
( lt(X2,X3)
| ~ strictorderedP(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_33]) ).
cnf(c_0_37,negated_conjecture,
app(app(esk7_0,cons(esk5_0,esk8_0)),app(cons(esk6_0,nil),esk9_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_19]),c_0_15]),c_0_21])]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_39,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
lt(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,plain,
( lt(X1,X2)
| ~ strictorderedP(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_36]) ).
cnf(c_0_42,negated_conjecture,
app(app(esk7_0,cons(esk5_0,esk8_0)),cons(esk6_0,esk9_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_24]),c_0_26]),c_0_28])]) ).
cnf(c_0_43,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_38,c_0_11]) ).
cnf(c_0_45,negated_conjecture,
~ lt(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_28]),c_0_21])]) ).
cnf(c_0_46,negated_conjecture,
$false,
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_41,c_0_42]),c_0_43]),c_0_44]),c_0_26]),c_0_15]),c_0_16]),c_0_28]),c_0_21])]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC305+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n003.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 03:13:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/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/benchmark/theBenchmark.p
% 0.21/0.56 # Version: 3.1.0
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # Starting sh5l with 300s (1) cores
% 0.21/0.56 # sh5l with pid 8127 completed with status 0
% 0.21/0.56 # Result found by sh5l
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # Starting sh5l with 300s (1) cores
% 0.21/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.21/0.56 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.21/0.56 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 8130 completed with status 0
% 0.21/0.56 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # Starting sh5l with 300s (1) cores
% 0.21/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.56 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.21/0.56 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.21/0.56 # Preprocessing time : 0.002 s
% 0.21/0.56 # Presaturation interreduction done
% 0.21/0.56
% 0.21/0.56 # Proof found!
% 0.21/0.56 # SZS status Theorem
% 0.21/0.56 # SZS output start CNFRefutation
% See solution above
% 0.21/0.56 # Parsed axioms : 96
% 0.21/0.56 # Removed by relevancy pruning/SinE : 12
% 0.21/0.56 # Initial clauses : 172
% 0.21/0.56 # Removed in clause preprocessing : 2
% 0.21/0.56 # Initial clauses in saturation : 170
% 0.21/0.56 # Processed clauses : 828
% 0.21/0.56 # ...of these trivial : 28
% 0.21/0.56 # ...subsumed : 149
% 0.21/0.56 # ...remaining for further processing : 651
% 0.21/0.56 # Other redundant clauses eliminated : 57
% 0.21/0.56 # Clauses deleted for lack of memory : 0
% 0.21/0.56 # Backward-subsumed : 67
% 0.21/0.56 # Backward-rewritten : 38
% 0.21/0.56 # Generated clauses : 1857
% 0.21/0.56 # ...of the previous two non-redundant : 1547
% 0.21/0.56 # ...aggressively subsumed : 0
% 0.21/0.56 # Contextual simplify-reflections : 56
% 0.21/0.56 # Paramodulations : 1796
% 0.21/0.56 # Factorizations : 0
% 0.21/0.56 # NegExts : 0
% 0.21/0.56 # Equation resolutions : 62
% 0.21/0.56 # Disequality decompositions : 0
% 0.21/0.56 # Total rewrite steps : 1746
% 0.21/0.56 # ...of those cached : 1679
% 0.21/0.56 # Propositional unsat checks : 0
% 0.21/0.56 # Propositional check models : 0
% 0.21/0.56 # Propositional check unsatisfiable : 0
% 0.21/0.56 # Propositional clauses : 0
% 0.21/0.56 # Propositional clauses after purity: 0
% 0.21/0.56 # Propositional unsat core size : 0
% 0.21/0.56 # Propositional preprocessing time : 0.000
% 0.21/0.56 # Propositional encoding time : 0.000
% 0.21/0.56 # Propositional solver time : 0.000
% 0.21/0.56 # Success case prop preproc time : 0.000
% 0.21/0.56 # Success case prop encoding time : 0.000
% 0.21/0.56 # Success case prop solver time : 0.000
% 0.21/0.56 # Current number of processed clauses : 364
% 0.21/0.56 # Positive orientable unit clauses : 77
% 0.21/0.56 # Positive unorientable unit clauses: 0
% 0.21/0.56 # Negative unit clauses : 4
% 0.21/0.56 # Non-unit-clauses : 283
% 0.21/0.56 # Current number of unprocessed clauses: 990
% 0.21/0.56 # ...number of literals in the above : 5408
% 0.21/0.56 # Current number of archived formulas : 0
% 0.21/0.56 # Current number of archived clauses : 269
% 0.21/0.56 # Clause-clause subsumption calls (NU) : 29997
% 0.21/0.56 # Rec. Clause-clause subsumption calls : 13397
% 0.21/0.56 # Non-unit clause-clause subsumptions : 271
% 0.21/0.56 # Unit Clause-clause subsumption calls : 1724
% 0.21/0.56 # Rewrite failures with RHS unbound : 0
% 0.21/0.56 # BW rewrite match attempts : 41
% 0.21/0.56 # BW rewrite match successes : 21
% 0.21/0.56 # Condensation attempts : 0
% 0.21/0.56 # Condensation successes : 0
% 0.21/0.56 # Termbank termtop insertions : 52047
% 0.21/0.56 # Search garbage collected termcells : 3771
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.060 s
% 0.21/0.56 # System time : 0.005 s
% 0.21/0.56 # Total time : 0.065 s
% 0.21/0.56 # Maximum resident set size: 2384 pages
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.063 s
% 0.21/0.56 # System time : 0.007 s
% 0.21/0.56 # Total time : 0.070 s
% 0.21/0.56 # Maximum resident set size: 1828 pages
% 0.21/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------