%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC229+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 : art03.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:27:09 EST 2010
% Result : Theorem 1.33s
% Output : Solution 1.33s
% 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/SystemOnTPTP6812/SWC229+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6812/SWC229+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6812/SWC229+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 6908
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:(ssList(X1)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(6, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(7, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(8, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(15, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(21, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(28, axiom,![X1]:(ssList(X1)=>(segmentP(nil,X1)<=>nil=X1)),file('/tmp/SRASS.s.p', ax58)).
% fof(34, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(segmentP(X4,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)))))))|(~(singletonP(X3))&neq(X4,nil))))))),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))|~(segmentP(X4,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)))))))|(~(singletonP(X3))&neq(X4,nil)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(segmentP(X4,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)))))))|(~(singletonP(X3))&neq(X4,nil)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(124, plain,![X1]:(~(ssList(X1))|((~(singletonP(X1))|?[X2]:(ssItem(X2)&cons(X2,nil)=X1))&(![X2]:(~(ssItem(X2))|~(cons(X2,nil)=X1))|singletonP(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(125, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|?[X4]:(ssItem(X4)&cons(X4,nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk5_1(X3))&cons(esk5_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[125])).
% fof(127, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk5_1(X3))&cons(esk5_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[126])).
% fof(128, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk5_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk5_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[127])).
% cnf(129,plain,(cons(esk5_1(X1),nil)=X1|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[128])).
% cnf(130,plain,(ssItem(esk5_1(X1))|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[128])).
% fof(141, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[6])).
% fof(142, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[141])).
% fof(143, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[142])).
% fof(144, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[143])).
% cnf(145,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[144])).
% fof(147, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(148, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[147])).
% fof(149, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[148])).
% cnf(150,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[149])).
% cnf(151,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[8])).
% fof(181, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[15])).
% fof(182, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[181])).
% cnf(183,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[182])).
% fof(209, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[98])).
% fof(210, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[209])).
% cnf(211,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[210])).
% fof(231, plain,![X1]:(~(ssList(X1))|((~(segmentP(nil,X1))|nil=X1)&(~(nil=X1)|segmentP(nil,X1)))),inference(fof_nnf,[status(thm)],[28])).
% fof(232, plain,![X2]:(~(ssList(X2))|((~(segmentP(nil,X2))|nil=X2)&(~(nil=X2)|segmentP(nil,X2)))),inference(variable_rename,[status(thm)],[231])).
% fof(233, plain,![X2]:(((~(segmentP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|segmentP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[232])).
% cnf(235,plain,(nil=X1|~ssList(X1)|~segmentP(nil,X1)),inference(split_conjunct,[status(thm)],[233])).
% fof(259, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[34])).
% fof(260, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[259])).
% cnf(261,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[260])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((((X2=X4&X1=X3)&segmentP(X4,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))))))))&(singletonP(X3)|~(neq(X4,nil)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&(((((X10=X12&X9=X11)&segmentP(X12,X11))&~(nil=X9))&![X13]:(~(ssItem(X13))|![X14]:(~(ssList(X14))|![X15]:((~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=X9))|?[X16]:(ssItem(X16)&(((memberP(X14,X16)&memberP(X15,X16))&leq(X13,X16))&~(leq(X16,X13))))))))&(singletonP(X11)|~(neq(X12,nil)))))))),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)&segmentP(esk51_0,esk50_0))&~(nil=esk48_0))&![X13]:(~(ssItem(X13))|![X14]:(~(ssList(X14))|![X15]:((~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0))|(ssItem(esk52_3(X13,X14,X15))&(((memberP(X14,esk52_3(X13,X14,X15))&memberP(X15,esk52_3(X13,X14,X15)))&leq(X13,esk52_3(X13,X14,X15)))&~(leq(esk52_3(X13,X14,X15),X13))))))))&(singletonP(esk50_0)|~(neq(esk51_0,nil)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X14]:![X15]:((((((((((~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0))|(ssItem(esk52_3(X13,X14,X15))&(((memberP(X14,esk52_3(X13,X14,X15))&memberP(X15,esk52_3(X13,X14,X15)))&leq(X13,esk52_3(X13,X14,X15)))&~(leq(esk52_3(X13,X14,X15),X13)))))|~(ssList(X14)))|~(ssItem(X13)))&(((esk49_0=esk51_0&esk48_0=esk50_0)&segmentP(esk51_0,esk50_0))&~(nil=esk48_0)))&(singletonP(esk50_0)|~(neq(esk51_0,nil))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X13]:![X14]:![X15]:((((((((((ssItem(esk52_3(X13,X14,X15))|(~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0)))|~(ssList(X14)))|~(ssItem(X13)))&((((((memberP(X14,esk52_3(X13,X14,X15))|(~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0)))|~(ssList(X14)))|~(ssItem(X13)))&(((memberP(X15,esk52_3(X13,X14,X15))|(~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0)))|~(ssList(X14)))|~(ssItem(X13))))&(((leq(X13,esk52_3(X13,X14,X15))|(~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0)))|~(ssList(X14)))|~(ssItem(X13))))&(((~(leq(esk52_3(X13,X14,X15),X13))|(~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk48_0)))|~(ssList(X14)))|~(ssItem(X13)))))&(((esk49_0=esk51_0&esk48_0=esk50_0)&segmentP(esk51_0,esk50_0))&~(nil=esk48_0)))&(singletonP(esk50_0)|~(neq(esk51_0,nil))))&ssList(esk51_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(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(singletonP(esk50_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(memberP(X3,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(586,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(588,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,581,theory(equality)])).
% cnf(593,negated_conjecture,(segmentP(esk51_0,esk48_0)),inference(rw,[status(thm)],[579,580,theory(equality)])).
% cnf(595,negated_conjecture,(singletonP(esk48_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[577,580,theory(equality)])).
% cnf(626,negated_conjecture,(singletonP(esk48_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[595,145,theory(equality)])).
% cnf(627,negated_conjecture,(singletonP(esk48_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[626,151,theory(equality)])).
% cnf(628,negated_conjecture,(singletonP(esk48_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[627,588,theory(equality)])).
% cnf(629,negated_conjecture,(singletonP(esk48_0)|esk51_0=nil),inference(cn,[status(thm)],[628,theory(equality)])).
% cnf(1103,negated_conjecture,(~ssItem(esk52_3(X1,X2,nil))|app(app(X2,cons(X1,nil)),nil)!=esk48_0|~ssList(nil)|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[211,584,theory(equality)])).
% cnf(1106,negated_conjecture,(~ssItem(esk52_3(X1,X2,nil))|app(app(X2,cons(X1,nil)),nil)!=esk48_0|$false|~ssList(X2)|~ssItem(X1)),inference(rw,[status(thm)],[1103,151,theory(equality)])).
% cnf(1107,negated_conjecture,(~ssItem(esk52_3(X1,X2,nil))|app(app(X2,cons(X1,nil)),nil)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[1106,theory(equality)])).
% cnf(1686,negated_conjecture,(app(app(X1,cons(X2,nil)),nil)!=esk48_0|~ssList(X1)|~ssItem(X2)|~ssList(nil)),inference(spm,[status(thm)],[1107,586,theory(equality)])).
% cnf(1687,negated_conjecture,(app(app(X1,cons(X2,nil)),nil)!=esk48_0|~ssList(X1)|~ssItem(X2)|$false),inference(rw,[status(thm)],[1686,151,theory(equality)])).
% cnf(1688,negated_conjecture,(app(app(X1,cons(X2,nil)),nil)!=esk48_0|~ssList(X1)|~ssItem(X2)),inference(cn,[status(thm)],[1687,theory(equality)])).
% cnf(1691,negated_conjecture,(app(cons(X1,nil),nil)!=esk48_0|~ssList(nil)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[1688,183,theory(equality)])).
% cnf(1699,negated_conjecture,(app(cons(X1,nil),nil)!=esk48_0|$false|~ssItem(X1)|~ssList(cons(X1,nil))),inference(rw,[status(thm)],[1691,151,theory(equality)])).
% cnf(1700,negated_conjecture,(app(cons(X1,nil),nil)!=esk48_0|~ssItem(X1)|~ssList(cons(X1,nil))),inference(cn,[status(thm)],[1699,theory(equality)])).
% cnf(1707,negated_conjecture,(cons(X1,nil)!=esk48_0|~ssList(cons(X1,nil))|~ssItem(X1)),inference(spm,[status(thm)],[1700,261,theory(equality)])).
% cnf(1756,negated_conjecture,(cons(X1,nil)!=esk48_0|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1707,150,theory(equality)])).
% cnf(1757,negated_conjecture,(cons(X1,nil)!=esk48_0|~ssItem(X1)|$false),inference(rw,[status(thm)],[1756,151,theory(equality)])).
% cnf(1758,negated_conjecture,(cons(X1,nil)!=esk48_0|~ssItem(X1)),inference(cn,[status(thm)],[1757,theory(equality)])).
% cnf(1759,negated_conjecture,(X1!=esk48_0|~ssItem(esk5_1(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[1758,129,theory(equality)])).
% cnf(1761,negated_conjecture,(X1!=esk48_0|~singletonP(X1)|~ssList(X1)),inference(csr,[status(thm)],[1759,130])).
% cnf(1762,negated_conjecture,(esk51_0=nil|~ssList(esk48_0)),inference(spm,[status(thm)],[1761,629,theory(equality)])).
% cnf(1763,negated_conjecture,(esk51_0=nil|$false),inference(rw,[status(thm)],[1762,573,theory(equality)])).
% cnf(1764,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[1763,theory(equality)])).
% cnf(1770,negated_conjecture,(segmentP(nil,esk48_0)),inference(rw,[status(thm)],[593,1764,theory(equality)])).
% cnf(1775,negated_conjecture,(nil=esk48_0|~ssList(esk48_0)),inference(spm,[status(thm)],[235,1770,theory(equality)])).
% cnf(1783,negated_conjecture,(nil=esk48_0|$false),inference(rw,[status(thm)],[1775,573,theory(equality)])).
% cnf(1784,negated_conjecture,(nil=esk48_0),inference(cn,[status(thm)],[1783,theory(equality)])).
% cnf(1785,negated_conjecture,($false),inference(sr,[status(thm)],[1784,578,theory(equality)])).
% cnf(1786,negated_conjecture,($false),1785,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 430
% # ...of these trivial : 2
% # ...subsumed : 11
% # ...remaining for further processing: 417
% # Other redundant clauses eliminated : 82
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 6
% # Generated clauses : 920
% # ...of the previous two non-trivial : 772
% # Contextual simplify-reflections : 8
% # Paramodulations : 821
% # Factorizations : 0
% # Equation resolutions : 99
% # Current number of processed clauses: 205
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 187
% # Current number of unprocessed clauses: 740
% # ...number of literals in the above : 5681
% # Clause-clause subsumption calls (NU) : 1843
% # Rec. Clause-clause subsumption calls : 335
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 236 leaves, 1.41+/-1.212 terms/leaf
% # Paramod-from index: 127 leaves, 1.02+/-0.152 terms/leaf
% # Paramod-into index: 219 leaves, 1.25+/-0.923 terms/leaf
% # -------------------------------------------------
% # User time : 0.102 s
% # System time : 0.007 s
% # Total time : 0.109 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.31 WC
% FINAL PrfWatch: 0.24 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP6812/SWC229+1.tptp
%
%------------------------------------------------------------------------------