TSTP Solution File: SWC225+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC225+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 07:26:26 EST 2010
% Result : Theorem 6.95s
% Output : Solution 6.95s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP17279/SWC225+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17279/SWC225+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17279/SWC225+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 17375
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.02 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.93 CPU 4.03 WC
% PrfWatch: 5.54 CPU 6.04 WC
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(8, axiom,![X1]:(ssList(X1)=>(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax20)).
% fof(12, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(18, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(23, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:((((~(ssItem(X8))|~(memberP(X6,X8)))|~(memberP(X7,X8)))|~(leq(X5,X8)))|leq(X8,X5))))))|![X9]:(ssList(X9)=>![X10]:((((~(ssList(X10))|~(app(app(X9,X3),X10)=X4))|~(equalelemsP(X3)))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(X12,cons(X11,nil))=X9)&?[X13]:(ssList(X13)&app(cons(X11,nil),X13)=X3))))|?[X14]:(ssItem(X14)&?[X15]:((ssList(X15)&app(cons(X14,nil),X15)=X10)&?[X16]:(ssList(X16)&app(X16,cons(X14,nil))=X3))))))|(~(nil=X4)&nil=X3))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:((((~(ssItem(X8))|~(memberP(X6,X8)))|~(memberP(X7,X8)))|~(leq(X5,X8)))|leq(X8,X5))))))|![X9]:(ssList(X9)=>![X10]:((((~(ssList(X10))|~(app(app(X9,X3),X10)=X4))|~(equalelemsP(X3)))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(X12,cons(X11,nil))=X9)&?[X13]:(ssList(X13)&app(cons(X11,nil),X13)=X3))))|?[X14]:(ssItem(X14)&?[X15]:((ssList(X15)&app(cons(X14,nil),X15)=X10)&?[X16]:(ssList(X16)&app(X16,cons(X14,nil))=X3))))))|(~(nil=X4)&nil=X3)))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:((((~(ssItem(X8))|~(memberP(X6,X8)))|~(memberP(X7,X8)))|~(leq(X5,X8)))|leq(X8,X5))))))|![X9]:(ssList(X9)=>![X10]:((((~(ssList(X10))|~(app(app(X9,X3),X10)=X4))|~(equalelemsP(X3)))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(X12,cons(X11,nil))=X9)&?[X13]:(ssList(X13)&app(cons(X11,nil),X13)=X3))))|?[X14]:(ssItem(X14)&?[X15]:((ssList(X15)&app(cons(X14,nil),X15)=X10)&?[X16]:(ssList(X16)&app(X16,cons(X14,nil))=X3))))))|(~(nil=X4)&nil=X3)))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(130, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(131, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[131])).
% cnf(133,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[132])).
% cnf(134,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(145, plain,![X1]:(~(ssList(X1))|(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(146, plain,![X4]:(~(ssList(X4))|(nil=X4|?[X5]:(ssList(X5)&?[X6]:(ssItem(X6)&cons(X6,X5)=X4)))),inference(variable_rename,[status(thm)],[145])).
% fof(147, plain,![X4]:(~(ssList(X4))|(nil=X4|(ssList(esk9_1(X4))&(ssItem(esk10_1(X4))&cons(esk10_1(X4),esk9_1(X4))=X4)))),inference(skolemize,[status(esa)],[146])).
% fof(148, plain,![X4]:(((ssList(esk9_1(X4))|nil=X4)|~(ssList(X4)))&(((ssItem(esk10_1(X4))|nil=X4)|~(ssList(X4)))&((cons(esk10_1(X4),esk9_1(X4))=X4|nil=X4)|~(ssList(X4))))),inference(distribute,[status(thm)],[147])).
% cnf(149,plain,(nil=X1|cons(esk10_1(X1),esk9_1(X1))=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[148])).
% cnf(150,plain,(nil=X1|ssItem(esk10_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[148])).
% cnf(151,plain,(nil=X1|ssList(esk9_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[148])).
% fof(164, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[12])).
% fof(165, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[164])).
% cnf(166,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[165])).
% fof(192, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[98])).
% fof(193, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[192])).
% cnf(194,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[193])).
% fof(207, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[23])).
% fof(208, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[207])).
% fof(209, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[208])).
% cnf(210,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[209])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:((((((ssList(X4)&X2=X4)&X1=X3)&~(nil=X1))&![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X6,cons(X5,nil)),X7)=X1))|?[X8]:((((ssItem(X8)&memberP(X6,X8))&memberP(X7,X8))&leq(X5,X8))&~(leq(X8,X5)))))))&?[X9]:(ssList(X9)&?[X10]:((((ssList(X10)&app(app(X9,X3),X10)=X4)&equalelemsP(X3))&![X11]:(~(ssItem(X11))|![X12]:((~(ssList(X12))|~(app(X12,cons(X11,nil))=X9))|![X13]:(~(ssList(X13))|~(app(cons(X11,nil),X13)=X3)))))&![X14]:(~(ssItem(X14))|![X15]:((~(ssList(X15))|~(app(cons(X14,nil),X15)=X10))|![X16]:(~(ssList(X16))|~(app(X16,cons(X14,nil))=X3)))))))&(nil=X4|~(nil=X3)))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&?[X19]:(ssList(X19)&?[X20]:((((((ssList(X20)&X18=X20)&X17=X19)&~(nil=X17))&![X21]:(~(ssItem(X21))|![X22]:(~(ssList(X22))|![X23]:((~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=X17))|?[X24]:((((ssItem(X24)&memberP(X22,X24))&memberP(X23,X24))&leq(X21,X24))&~(leq(X24,X21)))))))&?[X25]:(ssList(X25)&?[X26]:((((ssList(X26)&app(app(X25,X19),X26)=X20)&equalelemsP(X19))&![X27]:(~(ssItem(X27))|![X28]:((~(ssList(X28))|~(app(X28,cons(X27,nil))=X25))|![X29]:(~(ssList(X29))|~(app(cons(X27,nil),X29)=X19)))))&![X30]:(~(ssItem(X30))|![X31]:((~(ssList(X31))|~(app(cons(X30,nil),X31)=X26))|![X32]:(~(ssList(X32))|~(app(X32,cons(X30,nil))=X19)))))))&(nil=X20|~(nil=X19)))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&((((((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&~(nil=esk48_0))&![X21]:(~(ssItem(X21))|![X22]:(~(ssList(X22))|![X23]:((~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=esk48_0))|((((ssItem(esk52_3(X21,X22,X23))&memberP(X22,esk52_3(X21,X22,X23)))&memberP(X23,esk52_3(X21,X22,X23)))&leq(X21,esk52_3(X21,X22,X23)))&~(leq(esk52_3(X21,X22,X23),X21)))))))&(ssList(esk53_0)&((((ssList(esk54_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&equalelemsP(esk50_0))&![X27]:(~(ssItem(X27))|![X28]:((~(ssList(X28))|~(app(X28,cons(X27,nil))=esk53_0))|![X29]:(~(ssList(X29))|~(app(cons(X27,nil),X29)=esk50_0)))))&![X30]:(~(ssItem(X30))|![X31]:((~(ssList(X31))|~(app(cons(X30,nil),X31)=esk54_0))|![X32]:(~(ssList(X32))|~(app(X32,cons(X30,nil))=esk50_0)))))))&(nil=esk51_0|~(nil=esk50_0)))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X21]:![X22]:![X23]:![X27]:![X28]:![X29]:![X30]:![X31]:![X32]:((((((((((~(ssList(X32))|~(app(X32,cons(X30,nil))=esk50_0))|(~(ssList(X31))|~(app(cons(X30,nil),X31)=esk54_0)))|~(ssItem(X30)))&((((~(ssList(X29))|~(app(cons(X27,nil),X29)=esk50_0))|(~(ssList(X28))|~(app(X28,cons(X27,nil))=esk53_0)))|~(ssItem(X27)))&((ssList(esk54_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&equalelemsP(esk50_0))))&ssList(esk53_0))&(((((~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=esk48_0))|((((ssItem(esk52_3(X21,X22,X23))&memberP(X22,esk52_3(X21,X22,X23)))&memberP(X23,esk52_3(X21,X22,X23)))&leq(X21,esk52_3(X21,X22,X23)))&~(leq(esk52_3(X21,X22,X23),X21))))|~(ssList(X22)))|~(ssItem(X21)))&(((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&~(nil=esk48_0))))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X21]:![X22]:![X23]:![X27]:![X28]:![X29]:![X30]:![X31]:![X32]:((((((((((~(ssList(X32))|~(app(X32,cons(X30,nil))=esk50_0))|(~(ssList(X31))|~(app(cons(X30,nil),X31)=esk54_0)))|~(ssItem(X30)))&((((~(ssList(X29))|~(app(cons(X27,nil),X29)=esk50_0))|(~(ssList(X28))|~(app(X28,cons(X27,nil))=esk53_0)))|~(ssItem(X27)))&((ssList(esk54_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&equalelemsP(esk50_0))))&ssList(esk53_0))&((((((((ssItem(esk52_3(X21,X22,X23))|(~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=esk48_0)))|~(ssList(X22)))|~(ssItem(X21)))&(((memberP(X22,esk52_3(X21,X22,X23))|(~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=esk48_0)))|~(ssList(X22)))|~(ssItem(X21))))&(((memberP(X23,esk52_3(X21,X22,X23))|(~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=esk48_0)))|~(ssList(X22)))|~(ssItem(X21))))&(((leq(X21,esk52_3(X21,X22,X23))|(~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=esk48_0)))|~(ssList(X22)))|~(ssItem(X21))))&(((~(leq(esk52_3(X21,X22,X23),X21))|(~(ssList(X23))|~(app(app(X22,cons(X21,nil)),X23)=esk48_0)))|~(ssList(X22)))|~(ssItem(X21))))&(((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&~(nil=esk48_0))))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(memberP(X2,esk52_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk52_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[572])).
% cnf(1158,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssList(nil)|~ssItem(X1)),inference(spm,[status(thm)],[194,584,theory(equality)])).
% cnf(1161,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|$false|~ssItem(X1)),inference(rw,[status(thm)],[1158,134,theory(equality)])).
% cnf(1162,negated_conjecture,(~ssItem(esk52_3(X1,nil,X2))|app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[1161,theory(equality)])).
% cnf(2250,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1162,585,theory(equality)])).
% cnf(2251,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2250,134,theory(equality)])).
% cnf(2252,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2251,theory(equality)])).
% cnf(2255,negated_conjecture,(app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[2252,166,theory(equality)])).
% cnf(2334,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[2255,210,theory(equality)])).
% cnf(2341,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[2334,133,theory(equality)])).
% cnf(2342,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2341,134,theory(equality)])).
% cnf(2343,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2342,theory(equality)])).
% cnf(2345,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(esk9_1(X1))|~ssItem(esk10_1(X1))|~ssList(X1)),inference(spm,[status(thm)],[2343,149,theory(equality)])).
% cnf(119173,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(esk9_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[2345,150])).
% cnf(119174,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(X1)),inference(csr,[status(thm)],[119173,151])).
% cnf(119178,negated_conjecture,(nil=esk48_0),inference(spm,[status(thm)],[119174,573,theory(equality)])).
% cnf(119251,negated_conjecture,($false),inference(sr,[status(thm)],[119178,577,theory(equality)])).
% cnf(119252,negated_conjecture,($false),119251,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 7677
% # ...of these trivial : 146
% # ...subsumed : 5455
% # ...remaining for further processing: 2076
% # Other redundant clauses eliminated : 1017
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 139
% # Backward-rewritten : 50
% # Generated clauses : 52883
% # ...of the previous two non-trivial : 48829
% # Contextual simplify-reflections : 4129
% # Paramodulations : 51700
% # Factorizations : 0
% # Equation resolutions : 1167
% # Current number of processed clauses: 1669
% # Positive orientable unit clauses: 75
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 46
% # Non-unit-clauses : 1548
% # Current number of unprocessed clauses: 38899
% # ...number of literals in the above : 317163
% # Clause-clause subsumption calls (NU) : 186579
% # Rec. Clause-clause subsumption calls : 68938
% # Unit Clause-clause subsumption calls : 3234
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 26
% # Indexed BW rewrite successes : 26
% # Backwards rewriting index: 1109 leaves, 1.49+/-1.448 terms/leaf
% # Paramod-from index: 551 leaves, 1.04+/-0.283 terms/leaf
% # Paramod-into index: 909 leaves, 1.34+/-1.090 terms/leaf
% # -------------------------------------------------
% # User time : 3.461 s
% # System time : 0.121 s
% # Total time : 3.582 s
% # Maximum resident set size: 0 pages
% PrfWatch: 5.67 CPU 6.17 WC
% FINAL PrfWatch: 5.67 CPU 6.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP17279/SWC225+1.tptp
%
%------------------------------------------------------------------------------