TSTP Solution File: SWC065+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC065+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 : Sat May 4 09:40:40 EDT 2024
% Result : Theorem 0.95s 0.63s
% Output : CNFRefutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 13 unt; 0 def)
% Number of atoms : 218 ( 72 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 280 ( 109 ~; 104 |; 41 &)
% ( 4 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn 38 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y3W23Groxh/E---3.1_5484.p',ax7) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X9] :
( ssList(X9)
& neq(X9,nil)
& segmentP(X2,X9)
& segmentP(X1,X9) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y3W23Groxh/E---3.1_5484.p',co1) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.Y3W23Groxh/E---3.1_5484.p',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y3W23Groxh/E---3.1_5484.p',ax26) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.Y3W23Groxh/E---3.1_5484.p',ax55) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.Y3W23Groxh/E---3.1_5484.p',ax17) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y3W23Groxh/E---3.1_5484.p',ax15) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Y3W23Groxh/E---3.1_5484.p',ax83) ).
fof(c_0_8,plain,
! [X19,X20,X23,X24] :
( ( ssList(esk6_2(X19,X20))
| ~ segmentP(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) )
& ( ssList(esk7_2(X19,X20))
| ~ segmentP(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) )
& ( app(app(esk6_2(X19,X20),X20),esk7_2(X19,X20)) = X19
| ~ segmentP(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) )
& ( ~ ssList(X23)
| ~ ssList(X24)
| app(app(X23,X20),X24) != X19
| segmentP(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) ) ),
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)],[ax7])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ equalelemsP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssList(X8)
& app(X8,cons(X6,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X9] :
( ssList(X9)
& neq(X9,nil)
& segmentP(X2,X9)
& segmentP(X1,X9) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_10,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X46] :
( ~ ssList(X46)
| app(nil,X46) = X46 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_12,plain,
! [X60,X61] :
( ~ ssList(X60)
| ~ ssList(X61)
| ssList(app(X60,X61)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_13,negated_conjecture,
! [X15,X16,X17,X18] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& equalelemsP(esk3_0)
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(cons(X15,nil),X16) != esk5_0
| ~ ssList(X17)
| app(X17,cons(X15,nil)) != esk3_0 )
& ( nil = esk4_0
| nil != esk3_0 )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X18)
| ~ neq(X18,nil)
| ~ segmentP(esk2_0,X18)
| ~ segmentP(esk1_0,X18)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X18)
| ~ neq(X18,nil)
| ~ segmentP(esk2_0,X18)
| ~ segmentP(esk1_0,X18)
| nil != esk1_0 ) ),
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)],[c_0_9])])])])])]) ).
fof(c_0_14,plain,
! [X30] :
( ~ ssList(X30)
| segmentP(X30,X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_15,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_18,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
( nil = esk2_0
| ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_26,negated_conjecture,
app(esk1_0,esk5_0) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_28,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_29,plain,
! [X49,X50] :
( ( nil = X50
| nil != app(X49,X50)
| ~ ssList(X50)
| ~ ssList(X49) )
& ( nil = X49
| nil != app(X49,X50)
| ~ ssList(X50)
| ~ ssList(X49) )
& ( nil != X50
| nil != X49
| nil = app(X49,X50)
| ~ ssList(X50)
| ~ ssList(X49) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_30,negated_conjecture,
( esk2_0 = nil
| ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_31,negated_conjecture,
segmentP(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]),c_0_27])]) ).
fof(c_0_32,plain,
! [X39,X40] :
( ( ~ neq(X39,X40)
| X39 != X40
| ~ ssList(X40)
| ~ ssList(X39) )
& ( X39 = X40
| neq(X39,X40)
| ~ ssList(X40)
| ~ ssList(X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])])]) ).
cnf(c_0_33,negated_conjecture,
( nil = esk4_0
| nil != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk1_0,X1)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( esk2_0 = nil
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_37,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( esk2_0 = nil
| esk1_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_21]),c_0_20]) ).
cnf(c_0_39,negated_conjecture,
( esk1_0 != nil
| ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_23]),c_0_24])]) ).
cnf(c_0_40,negated_conjecture,
( esk1_0 = nil
| esk2_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_26]),c_0_27]),c_0_24])]) ).
cnf(c_0_41,negated_conjecture,
esk2_0 = nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_17]),c_0_24])]),c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( esk1_0 != nil
| ~ neq(esk1_0,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_31])]) ).
cnf(c_0_43,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_45,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_43])]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_41]),c_0_43])]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC065+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n010.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 15:28:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.52 Running first-order model finding
% 0.20/0.52 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.Y3W23Groxh/E---3.1_5484.p
% 0.95/0.63 # Version: 3.1.0
% 0.95/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.95/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.95/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.95/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.95/0.63 # Starting sh5l with 300s (1) cores
% 0.95/0.63 # sh5l with pid 5601 completed with status 0
% 0.95/0.63 # Result found by sh5l
% 0.95/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.95/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.95/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.95/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.95/0.63 # Starting sh5l with 300s (1) cores
% 0.95/0.63 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.95/0.63 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.95/0.63 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.95/0.63 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.95/0.63 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 5604 completed with status 0
% 0.95/0.63 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 0.95/0.63 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.95/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.95/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.95/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.95/0.63 # Starting sh5l with 300s (1) cores
% 0.95/0.63 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.95/0.63 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.95/0.63 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.95/0.63 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 0.95/0.63 # Preprocessing time : 0.003 s
% 0.95/0.63 # Presaturation interreduction done
% 0.95/0.63
% 0.95/0.63 # Proof found!
% 0.95/0.63 # SZS status Theorem
% 0.95/0.63 # SZS output start CNFRefutation
% See solution above
% 0.95/0.63 # Parsed axioms : 96
% 0.95/0.63 # Removed by relevancy pruning/SinE : 9
% 0.95/0.63 # Initial clauses : 180
% 0.95/0.63 # Removed in clause preprocessing : 2
% 0.95/0.63 # Initial clauses in saturation : 178
% 0.95/0.63 # Processed clauses : 851
% 0.95/0.63 # ...of these trivial : 20
% 0.95/0.63 # ...subsumed : 174
% 0.95/0.63 # ...remaining for further processing : 656
% 0.95/0.63 # Other redundant clauses eliminated : 62
% 0.95/0.63 # Clauses deleted for lack of memory : 0
% 0.95/0.63 # Backward-subsumed : 42
% 0.95/0.63 # Backward-rewritten : 189
% 0.95/0.63 # Generated clauses : 2124
% 0.95/0.63 # ...of the previous two non-redundant : 1756
% 0.95/0.63 # ...aggressively subsumed : 0
% 0.95/0.63 # Contextual simplify-reflections : 58
% 0.95/0.63 # Paramodulations : 2058
% 0.95/0.63 # Factorizations : 0
% 0.95/0.63 # NegExts : 0
% 0.95/0.63 # Equation resolutions : 67
% 0.95/0.63 # Disequality decompositions : 0
% 0.95/0.63 # Total rewrite steps : 2368
% 0.95/0.63 # ...of those cached : 2296
% 0.95/0.63 # Propositional unsat checks : 0
% 0.95/0.63 # Propositional check models : 0
% 0.95/0.63 # Propositional check unsatisfiable : 0
% 0.95/0.63 # Propositional clauses : 0
% 0.95/0.63 # Propositional clauses after purity: 0
% 0.95/0.63 # Propositional unsat core size : 0
% 0.95/0.63 # Propositional preprocessing time : 0.000
% 0.95/0.63 # Propositional encoding time : 0.000
% 0.95/0.63 # Propositional solver time : 0.000
% 0.95/0.63 # Success case prop preproc time : 0.000
% 0.95/0.63 # Success case prop encoding time : 0.000
% 0.95/0.63 # Success case prop solver time : 0.000
% 0.95/0.63 # Current number of processed clauses : 234
% 0.95/0.63 # Positive orientable unit clauses : 30
% 0.95/0.63 # Positive unorientable unit clauses: 0
% 0.95/0.63 # Negative unit clauses : 2
% 0.95/0.63 # Non-unit-clauses : 202
% 0.95/0.63 # Current number of unprocessed clauses: 1138
% 0.95/0.63 # ...number of literals in the above : 6270
% 0.95/0.63 # Current number of archived formulas : 0
% 0.95/0.63 # Current number of archived clauses : 403
% 0.95/0.63 # Clause-clause subsumption calls (NU) : 20887
% 0.95/0.63 # Rec. Clause-clause subsumption calls : 6735
% 0.95/0.63 # Non-unit clause-clause subsumptions : 273
% 0.95/0.63 # Unit Clause-clause subsumption calls : 349
% 0.95/0.63 # Rewrite failures with RHS unbound : 0
% 0.95/0.63 # BW rewrite match attempts : 22
% 0.95/0.63 # BW rewrite match successes : 22
% 0.95/0.63 # Condensation attempts : 0
% 0.95/0.63 # Condensation successes : 0
% 0.95/0.63 # Termbank termtop insertions : 53838
% 0.95/0.63 # Search garbage collected termcells : 3906
% 0.95/0.63
% 0.95/0.63 # -------------------------------------------------
% 0.95/0.63 # User time : 0.092 s
% 0.95/0.63 # System time : 0.006 s
% 0.95/0.63 # Total time : 0.098 s
% 0.95/0.63 # Maximum resident set size: 2436 pages
% 0.95/0.63
% 0.95/0.63 # -------------------------------------------------
% 0.95/0.63 # User time : 0.098 s
% 0.95/0.63 # System time : 0.007 s
% 0.95/0.63 # Total time : 0.106 s
% 0.95/0.63 # Maximum resident set size: 1816 pages
% 0.95/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------