TSTP Solution File: SWC410-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC410-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:26:32 EDT 2024
% Result : Unsatisfiable 3.49s 0.95s
% Output : CNFRefutation 3.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 40
% Syntax : Number of clauses : 168 ( 38 unt; 40 nHn; 151 RR)
% Number of literals : 529 ( 150 equ; 346 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 244 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_12,negated_conjecture,
( sk4 = X1
| ~ neq(sk4,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk3) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk3) != X4
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_10,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(co1_8,negated_conjecture,
memberP(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause139,axiom,
( memberP(cons(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause139) ).
cnf(clause170,axiom,
( X1 = X3
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause170) ).
cnf(clause161,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause158,axiom,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause158) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk1,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause117,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause117) ).
cnf(co1_11,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(c_0_40,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_41,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_42,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_43,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_44,negated_conjecture,
( sk4 = X1
| ~ neq(sk4,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk3) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk3) != X4
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_45,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_46,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_40 ).
cnf(c_0_47,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_41 ).
cnf(c_0_48,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_42 ).
cnf(c_0_49,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_43 ).
cnf(c_0_50,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_51,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_52,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_53,negated_conjecture,
( sk4 = X1
| ~ neq(sk4,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk3) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk3) != X4
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
c_0_44 ).
cnf(c_0_54,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_55,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_56,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_45 ).
cnf(c_0_57,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_58,plain,
( nil = X1
| tl(X1) != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49]) ).
cnf(c_0_59,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_50 ).
cnf(c_0_60,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_51 ).
cnf(c_0_61,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_52 ).
cnf(c_0_62,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_63,negated_conjecture,
( sk4 = X1
| tl(sk3) != X2
| hd(sk3) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk3)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[c_0_53]) ).
cnf(c_0_64,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_65,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_66,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_67,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_54 ).
cnf(c_0_68,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_55 ).
cnf(c_0_69,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_70,axiom,
ssList(nil),
clause8 ).
cnf(c_0_71,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_72,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_57 ).
cnf(c_0_73,plain,
( nil = X1
| app(tl(X1),X2) != app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61]) ).
cnf(c_0_74,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_62 ).
cnf(c_0_75,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_76,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| ~ neq(nil,sk3)
| ~ neq(sk4,nil)
| ~ ssItem(hd(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_63])])])]),c_0_60]) ).
cnf(c_0_77,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_64 ).
cnf(c_0_78,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_79,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_80,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_81,negated_conjecture,
( nil = sk3
| nil != sk4 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_82,plain,
( tl(X1) = nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70])]) ).
cnf(c_0_83,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_70])]) ).
cnf(c_0_84,plain,
( nil = X1
| tl(X1) != app(X1,nil)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_70])]),c_0_48]) ).
cnf(c_0_85,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_75 ).
cnf(c_0_86,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_87,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ neq(sk4,nil)
| ~ ssItem(hd(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_70]),c_0_78])]) ).
cnf(c_0_88,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_89,negated_conjecture,
( nil = sk3
| nil != sk4 ),
c_0_81 ).
cnf(c_0_90,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_91,plain,
( tl(cons(X1,nil)) = nil
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_92,plain,
( app(cons(X1,X2),nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_67]),c_0_72]),c_0_85]) ).
cnf(c_0_93,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_86 ).
cnf(c_0_94,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssItem(hd(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_77]),c_0_88]),c_0_70])]),c_0_89]) ).
cnf(c_0_95,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_90 ).
cnf(c_0_96,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_97,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_98,negated_conjecture,
memberP(sk2,sk5),
co1_8 ).
cnf(c_0_99,plain,
( tl(cons(X1,nil)) = nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_72]),c_0_70])]) ).
cnf(c_0_100,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_70])]) ).
cnf(c_0_101,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_49]),c_0_78])]) ).
cnf(c_0_102,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_95]) ).
cnf(c_0_103,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_96 ).
cnf(c_0_104,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
c_0_97 ).
cnf(c_0_105,negated_conjecture,
memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_98,c_0_80]) ).
cnf(c_0_106,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_107,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_99]),c_0_100]) ).
cnf(c_0_108,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_48]),c_0_78])]) ).
cnf(c_0_109,plain,
( ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_110,negated_conjecture,
app(skaf42(sk4,sk5),cons(sk5,skaf43(sk5,sk4))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]),c_0_88])]) ).
cnf(c_0_111,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_112,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_113,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_72]),c_0_70])]) ).
cnf(c_0_114,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_115,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_72]),c_0_70])]) ).
cnf(c_0_116,plain,
( memberP(cons(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause139]) ).
cnf(c_0_117,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk4,cons(sk5,X2)))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_106]),c_0_111]),c_0_112])]) ).
cnf(c_0_118,plain,
( ssList(cons(X1,nil))
| ~ ssItem(hd(cons(X1,nil)))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_113]),c_0_70])]) ).
cnf(c_0_119,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_114 ).
cnf(c_0_120,plain,
( cons(hd(app(X1,X2)),app(tl(X1),X2)) = app(X1,X2)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_59]),c_0_60]),c_0_61]) ).
cnf(c_0_121,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_49]),c_0_78])]) ).
cnf(c_0_122,plain,
( memberP(cons(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2) ),
c_0_116 ).
cnf(c_0_123,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_60]),c_0_88])]) ).
cnf(c_0_124,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_70])]) ).
cnf(c_0_125,negated_conjecture,
( cons(hd(app(sk3,cons(hd(sk3),nil))),sk4) = app(sk3,cons(hd(sk3),nil))
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_78])]) ).
cnf(c_0_126,plain,
( X1 = X3
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause170]) ).
cnf(c_0_127,plain,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause161]) ).
cnf(c_0_128,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_129,plain,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause158]) ).
cnf(c_0_130,negated_conjecture,
( memberP(cons(X1,sk4),sk5)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_105]),c_0_106]),c_0_88])]) ).
cnf(c_0_131,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_70]),c_0_106])]) ).
cnf(c_0_132,negated_conjecture,
( cons(hd(app(sk3,cons(hd(sk3),nil))),sk4) = app(sk3,cons(hd(sk3),nil))
| sk3 = nil
| ~ ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_72]),c_0_70])]) ).
cnf(c_0_133,negated_conjecture,
~ memberP(sk1,sk5),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_134,plain,
( X1 = X3
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
c_0_126 ).
cnf(c_0_135,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_136,plain,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
c_0_127 ).
cnf(c_0_137,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_128 ).
cnf(c_0_138,plain,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
c_0_129 ).
cnf(c_0_139,negated_conjecture,
memberP(cons(X1,sk4),sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_130,c_0_131])]) ).
cnf(c_0_140,negated_conjecture,
( cons(hd(app(sk3,cons(hd(sk3),nil))),sk4) = app(sk3,cons(hd(sk3),nil))
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_49]),c_0_78])]) ).
cnf(c_0_141,negated_conjecture,
~ memberP(sk1,sk5),
c_0_133 ).
cnf(c_0_142,plain,
( skaf44(cons(X1,X2)) = X1
| ~ singletonP(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_68]),c_0_69]),c_0_70])])]),c_0_72]) ).
cnf(c_0_143,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_135 ).
cnf(c_0_144,plain,
( skaf44(X1) = X2
| ~ memberP(X1,X2)
| ~ singletonP(X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_68]),c_0_69]),c_0_70])]),c_0_137]) ).
cnf(c_0_145,plain,
( memberP(X1,X2)
| memberP(X3,X2)
| ~ memberP(app(X1,X3),X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_131])]) ).
cnf(c_0_146,negated_conjecture,
( sk3 = nil
| memberP(app(sk3,cons(hd(sk3),nil)),sk5) ),
inference(spm,[status(thm)],[c_0_139,c_0_140]) ).
cnf(c_0_147,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_131])]) ).
cnf(c_0_148,negated_conjecture,
~ memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_141,c_0_66]) ).
cnf(c_0_149,plain,
( skaf44(cons(X1,nil)) = X1
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_83]),c_0_70])]) ).
cnf(c_0_150,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause117]) ).
cnf(c_0_151,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_152,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_143]) ).
cnf(c_0_153,plain,
( skaf44(X1) = X2
| ~ memberP(X1,X2)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_144,c_0_131])]) ).
cnf(c_0_154,negated_conjecture,
( sk3 = nil
| memberP(cons(hd(sk3),nil),sk5) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_147]),c_0_78])]),c_0_148]) ).
cnf(c_0_155,plain,
skaf44(cons(X1,nil)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_149,c_0_131])]) ).
cnf(c_0_156,plain,
singletonP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_131])]) ).
cnf(c_0_157,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_150 ).
cnf(c_0_158,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
c_0_151 ).
cnf(c_0_159,plain,
( nil = X1
| memberP(X1,hd(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_47]),c_0_48]),c_0_49]) ).
cnf(c_0_160,negated_conjecture,
( hd(sk3) = sk5
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_154]),c_0_155]),c_0_156]),c_0_147])]) ).
cnf(c_0_161,plain,
( ~ neq(X1,X1)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_157]) ).
cnf(c_0_162,negated_conjecture,
( sk4 = nil
| neq(sk3,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_158,c_0_77]),c_0_88]),c_0_70])]) ).
cnf(c_0_163,negated_conjecture,
sk3 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_78])]),c_0_148]) ).
cnf(c_0_164,plain,
~ neq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_161,c_0_131])]) ).
cnf(c_0_165,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_162,c_0_163]),c_0_164]) ).
cnf(c_0_166,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_137,c_0_131])]) ).
cnf(c_0_167,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_165]),c_0_166]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC410-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n007.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 : Sun May 19 02:39:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 3.49/0.95 # Version: 3.1.0
% 3.49/0.95 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.49/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.49/0.95 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.49/0.95 # Starting new_bool_3 with 300s (1) cores
% 3.49/0.95 # Starting new_bool_1 with 300s (1) cores
% 3.49/0.95 # Starting sh5l with 300s (1) cores
% 3.49/0.95 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 9821 completed with status 0
% 3.49/0.95 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.49/0.95 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.49/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.49/0.95 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.49/0.95 # No SInE strategy applied
% 3.49/0.95 # Search class: FGHSM-FSLM21-MFFFFFNN
% 3.49/0.95 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 3.49/0.95 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 3.49/0.95 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.49/0.95 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 3.49/0.95 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 3.49/0.95 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 3.49/0.95 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 9827 completed with status 0
% 3.49/0.95 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 3.49/0.95 # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.49/0.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.49/0.95 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.49/0.95 # No SInE strategy applied
% 3.49/0.95 # Search class: FGHSM-FSLM21-MFFFFFNN
% 3.49/0.95 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 3.49/0.95 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 3.49/0.95 # Preprocessing time : 0.003 s
% 3.49/0.95 # Presaturation interreduction done
% 3.49/0.95
% 3.49/0.95 # Proof found!
% 3.49/0.95 # SZS status Unsatisfiable
% 3.49/0.95 # SZS output start CNFRefutation
% See solution above
% 3.49/0.95 # Parsed axioms : 197
% 3.49/0.95 # Removed by relevancy pruning/SinE : 0
% 3.49/0.95 # Initial clauses : 197
% 3.49/0.95 # Removed in clause preprocessing : 0
% 3.49/0.95 # Initial clauses in saturation : 197
% 3.49/0.95 # Processed clauses : 4212
% 3.49/0.95 # ...of these trivial : 28
% 3.49/0.95 # ...subsumed : 2676
% 3.49/0.95 # ...remaining for further processing : 1508
% 3.49/0.95 # Other redundant clauses eliminated : 268
% 3.49/0.95 # Clauses deleted for lack of memory : 0
% 3.49/0.95 # Backward-subsumed : 274
% 3.49/0.95 # Backward-rewritten : 599
% 3.49/0.95 # Generated clauses : 19421
% 3.49/0.95 # ...of the previous two non-redundant : 18336
% 3.49/0.95 # ...aggressively subsumed : 0
% 3.49/0.95 # Contextual simplify-reflections : 386
% 3.49/0.95 # Paramodulations : 19146
% 3.49/0.95 # Factorizations : 0
% 3.49/0.95 # NegExts : 0
% 3.49/0.95 # Equation resolutions : 279
% 3.49/0.95 # Disequality decompositions : 0
% 3.49/0.95 # Total rewrite steps : 14453
% 3.49/0.95 # ...of those cached : 14112
% 3.49/0.95 # Propositional unsat checks : 0
% 3.49/0.95 # Propositional check models : 0
% 3.49/0.95 # Propositional check unsatisfiable : 0
% 3.49/0.95 # Propositional clauses : 0
% 3.49/0.95 # Propositional clauses after purity: 0
% 3.49/0.95 # Propositional unsat core size : 0
% 3.49/0.95 # Propositional preprocessing time : 0.000
% 3.49/0.95 # Propositional encoding time : 0.000
% 3.49/0.95 # Propositional solver time : 0.000
% 3.49/0.95 # Success case prop preproc time : 0.000
% 3.49/0.95 # Success case prop encoding time : 0.000
% 3.49/0.95 # Success case prop solver time : 0.000
% 3.49/0.95 # Current number of processed clauses : 422
% 3.49/0.95 # Positive orientable unit clauses : 66
% 3.49/0.95 # Positive unorientable unit clauses: 0
% 3.49/0.95 # Negative unit clauses : 12
% 3.49/0.95 # Non-unit-clauses : 344
% 3.49/0.95 # Current number of unprocessed clauses: 14290
% 3.49/0.95 # ...number of literals in the above : 83496
% 3.49/0.95 # Current number of archived formulas : 0
% 3.49/0.95 # Current number of archived clauses : 1062
% 3.49/0.95 # Clause-clause subsumption calls (NU) : 169759
% 3.49/0.95 # Rec. Clause-clause subsumption calls : 58521
% 3.49/0.95 # Non-unit clause-clause subsumptions : 2960
% 3.49/0.95 # Unit Clause-clause subsumption calls : 1911
% 3.49/0.95 # Rewrite failures with RHS unbound : 0
% 3.49/0.95 # BW rewrite match attempts : 49
% 3.49/0.95 # BW rewrite match successes : 39
% 3.49/0.95 # Condensation attempts : 0
% 3.49/0.95 # Condensation successes : 0
% 3.49/0.95 # Termbank termtop insertions : 380411
% 3.49/0.95 # Search garbage collected termcells : 556
% 3.49/0.95
% 3.49/0.95 # -------------------------------------------------
% 3.49/0.95 # User time : 0.417 s
% 3.49/0.95 # System time : 0.020 s
% 3.49/0.95 # Total time : 0.437 s
% 3.49/0.95 # Maximum resident set size: 2140 pages
% 3.49/0.95
% 3.49/0.95 # -------------------------------------------------
% 3.49/0.95 # User time : 2.111 s
% 3.49/0.95 # System time : 0.097 s
% 3.49/0.95 # Total time : 2.208 s
% 3.49/0.95 # Maximum resident set size: 1876 pages
% 3.49/0.95 % E---3.1 exiting
% 3.49/0.95 % E exiting
%------------------------------------------------------------------------------