TSTP Solution File: SWC191+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC191+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:24:16 EDT 2024
% Result : Theorem 0.17s 0.52s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 19 unt; 0 def)
% Number of atoms : 180 ( 45 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 208 ( 72 ~; 75 |; 28 &)
% ( 1 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 9 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 47 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ equalelemsP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& equalelemsP(X5) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(X8,cons(X6,nil)),cons(X7,nil)),X9) != X1
| X6 = X7 ) ) ) ) ) ) ) ) ) ),
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(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax14,axiom,
! [X1] :
( ssList(X1)
=> ( equalelemsP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,cons(X2,cons(X3,X5))) = X1
=> X2 = X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax14) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ equalelemsP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& equalelemsP(X5) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(X8,cons(X6,nil)),cons(X7,nil)),X9) != X1
| X6 = X7 ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_8,negated_conjecture,
! [X14] :
( 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)
& equalelemsP(esk3_0)
& ( ~ ssList(X14)
| ~ neq(esk3_0,X14)
| ~ frontsegP(esk4_0,X14)
| ~ segmentP(X14,esk3_0)
| ~ equalelemsP(X14) )
& ssItem(esk5_0)
& ssItem(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& app(app(app(esk7_0,cons(esk5_0,nil)),cons(esk6_0,nil)),esk8_0) = esk1_0
& esk5_0 != esk6_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_7])])])])]) ).
cnf(c_0_9,negated_conjecture,
app(app(app(esk7_0,cons(esk5_0,nil)),cons(esk6_0,nil)),esk8_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X57,X58,X59] :
( ~ ssList(X57)
| ~ ssList(X58)
| ~ ssList(X59)
| app(app(X57,X58),X59) = app(X57,app(X58,X59)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_12,negated_conjecture,
app(app(app(esk7_0,cons(esk5_0,nil)),cons(esk6_0,nil)),esk8_0) = esk3_0,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X67,X68] :
( ~ ssList(X67)
| ~ ssItem(X68)
| ssList(cons(X68,X67)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_16,negated_conjecture,
( app(app(esk7_0,app(cons(esk5_0,nil),cons(esk6_0,nil))),esk8_0) = esk3_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_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_19,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
( app(app(esk7_0,app(cons(esk5_0,nil),cons(esk6_0,nil))),esk8_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_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_22,plain,
! [X55,X56] :
( ~ ssList(X55)
| ~ ssItem(X56)
| cons(X56,X55) = app(cons(X56,nil),X55) ),
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(esk7_0,app(cons(esk5_0,nil),cons(esk6_0,nil))),esk8_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_18]),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(esk7_0,cons(esk5_0,cons(esk6_0,nil))),esk8_0) = esk3_0
| ~ ssList(cons(esk6_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
app(app(esk7_0,cons(esk5_0,cons(esk6_0,nil))),esk8_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
( app(esk7_0,app(cons(esk5_0,cons(esk6_0,nil)),esk8_0)) = esk3_0
| ~ ssList(cons(esk5_0,cons(esk6_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_26]),c_0_27]),c_0_14])]) ).
cnf(c_0_29,negated_conjecture,
( app(esk7_0,app(cons(esk5_0,cons(esk6_0,nil)),esk8_0)) = esk3_0
| ~ ssList(cons(esk6_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_17]),c_0_21])]) ).
fof(c_0_30,plain,
! [X35,X36,X37] :
( ~ ssList(X35)
| ~ ssList(X36)
| ~ ssItem(X37)
| cons(X37,app(X36,X35)) = app(cons(X37,X36),X35) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_31,negated_conjecture,
app(esk7_0,app(cons(esk5_0,cons(esk6_0,nil)),esk8_0)) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_32,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_33,plain,
! [X96,X97,X98,X99,X100] :
( ( ~ equalelemsP(X96)
| ~ ssItem(X97)
| ~ ssItem(X98)
| ~ ssList(X99)
| ~ ssList(X100)
| app(X99,cons(X97,cons(X98,X100))) != X96
| X97 = X98
| ~ ssList(X96) )
& ( ssItem(esk17_1(X96))
| equalelemsP(X96)
| ~ ssList(X96) )
& ( ssItem(esk18_1(X96))
| equalelemsP(X96)
| ~ ssList(X96) )
& ( ssList(esk19_1(X96))
| equalelemsP(X96)
| ~ ssList(X96) )
& ( ssList(esk20_1(X96))
| equalelemsP(X96)
| ~ ssList(X96) )
& ( app(esk19_1(X96),cons(esk17_1(X96),cons(esk18_1(X96),esk20_1(X96)))) = X96
| equalelemsP(X96)
| ~ ssList(X96) )
& ( esk17_1(X96) != esk18_1(X96)
| equalelemsP(X96)
| ~ ssList(X96) ) ),
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)],[ax14])])])])])]) ).
cnf(c_0_34,negated_conjecture,
( app(esk7_0,cons(esk5_0,app(cons(esk6_0,nil),esk8_0))) = esk3_0
| ~ ssList(cons(esk6_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_21])]) ).
cnf(c_0_35,plain,
( X2 = X3
| ~ equalelemsP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(X4,cons(X2,cons(X3,X5))) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,negated_conjecture,
app(esk7_0,cons(esk5_0,app(cons(esk6_0,nil),esk8_0))) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_37,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_38,plain,
( X1 = X2
| ~ equalelemsP(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
app(esk7_0,cons(esk5_0,cons(esk6_0,esk8_0))) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_24]),c_0_27]),c_0_19])]) ).
cnf(c_0_40,negated_conjecture,
equalelemsP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_37,c_0_10]) ).
cnf(c_0_42,negated_conjecture,
esk5_0 != esk6_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_43,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(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]),c_0_27]),c_0_14]),c_0_19]),c_0_21])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC191+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 03:18:53 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.17/0.52 # Version: 3.1.0
% 0.17/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.52 # Starting sh5l with 300s (1) cores
% 0.17/0.52 # sh5l with pid 11834 completed with status 0
% 0.17/0.52 # Result found by sh5l
% 0.17/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.52 # Starting sh5l with 300s (1) cores
% 0.17/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.52 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.17/0.52 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.52 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.17/0.52 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 11837 completed with status 0
% 0.17/0.52 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.17/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.52 # Starting sh5l with 300s (1) cores
% 0.17/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.52 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.17/0.52 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.52 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.17/0.52 # Preprocessing time : 0.003 s
% 0.17/0.52 # Presaturation interreduction done
% 0.17/0.52
% 0.17/0.52 # Proof found!
% 0.17/0.52 # SZS status Theorem
% 0.17/0.52 # SZS output start CNFRefutation
% See solution above
% 0.17/0.52 # Parsed axioms : 96
% 0.17/0.52 # Removed by relevancy pruning/SinE : 9
% 0.17/0.52 # Initial clauses : 180
% 0.17/0.52 # Removed in clause preprocessing : 2
% 0.17/0.52 # Initial clauses in saturation : 178
% 0.17/0.52 # Processed clauses : 509
% 0.17/0.52 # ...of these trivial : 2
% 0.17/0.52 # ...subsumed : 30
% 0.17/0.52 # ...remaining for further processing : 477
% 0.17/0.52 # Other redundant clauses eliminated : 46
% 0.17/0.52 # Clauses deleted for lack of memory : 0
% 0.17/0.52 # Backward-subsumed : 21
% 0.17/0.52 # Backward-rewritten : 22
% 0.17/0.52 # Generated clauses : 892
% 0.17/0.52 # ...of the previous two non-redundant : 774
% 0.17/0.52 # ...aggressively subsumed : 0
% 0.17/0.52 # Contextual simplify-reflections : 11
% 0.17/0.52 # Paramodulations : 842
% 0.17/0.52 # Factorizations : 0
% 0.17/0.52 # NegExts : 0
% 0.17/0.52 # Equation resolutions : 51
% 0.17/0.52 # Disequality decompositions : 0
% 0.17/0.52 # Total rewrite steps : 640
% 0.17/0.52 # ...of those cached : 602
% 0.17/0.52 # Propositional unsat checks : 0
% 0.17/0.52 # Propositional check models : 0
% 0.17/0.52 # Propositional check unsatisfiable : 0
% 0.17/0.52 # Propositional clauses : 0
% 0.17/0.52 # Propositional clauses after purity: 0
% 0.17/0.52 # Propositional unsat core size : 0
% 0.17/0.52 # Propositional preprocessing time : 0.000
% 0.17/0.52 # Propositional encoding time : 0.000
% 0.17/0.52 # Propositional solver time : 0.000
% 0.17/0.52 # Success case prop preproc time : 0.000
% 0.17/0.52 # Success case prop encoding time : 0.000
% 0.17/0.52 # Success case prop solver time : 0.000
% 0.17/0.52 # Current number of processed clauses : 243
% 0.17/0.52 # Positive orientable unit clauses : 49
% 0.17/0.52 # Positive unorientable unit clauses: 0
% 0.17/0.52 # Negative unit clauses : 3
% 0.17/0.52 # Non-unit-clauses : 191
% 0.17/0.52 # Current number of unprocessed clauses: 588
% 0.17/0.52 # ...number of literals in the above : 3492
% 0.17/0.52 # Current number of archived formulas : 0
% 0.17/0.52 # Current number of archived clauses : 215
% 0.17/0.52 # Clause-clause subsumption calls (NU) : 16553
% 0.17/0.52 # Rec. Clause-clause subsumption calls : 4936
% 0.17/0.52 # Non-unit clause-clause subsumptions : 61
% 0.17/0.52 # Unit Clause-clause subsumption calls : 173
% 0.17/0.52 # Rewrite failures with RHS unbound : 0
% 0.17/0.52 # BW rewrite match attempts : 13
% 0.17/0.52 # BW rewrite match successes : 11
% 0.17/0.52 # Condensation attempts : 0
% 0.17/0.52 # Condensation successes : 0
% 0.17/0.52 # Termbank termtop insertions : 35097
% 0.17/0.52 # Search garbage collected termcells : 3866
% 0.17/0.52
% 0.17/0.52 # -------------------------------------------------
% 0.17/0.52 # User time : 0.050 s
% 0.17/0.52 # System time : 0.008 s
% 0.17/0.52 # Total time : 0.058 s
% 0.17/0.52 # Maximum resident set size: 2424 pages
% 0.17/0.52
% 0.17/0.52 # -------------------------------------------------
% 0.17/0.52 # User time : 0.052 s
% 0.17/0.52 # System time : 0.011 s
% 0.17/0.52 # Total time : 0.062 s
% 0.17/0.52 # Maximum resident set size: 1824 pages
% 0.17/0.52 % E---3.1 exiting
% 0.17/0.52 % E exiting
%------------------------------------------------------------------------------