TSTP Solution File: SWC248+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC248+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 07:33:44 EST 2010
% Result : Theorem 6.45s
% Output : Solution 6.45s
% 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/SystemOnTPTP14634/SWC248+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14634/SWC248+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14634/SWC248+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 14766
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.93 CPU 4.02 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(20, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(25, 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)))|~(lt(X5,X8)))|leq(X5,X8))))))|![X9]:(ssList(X9)=>![X10]:((((~(ssList(X10))|~(app(app(X9,X3),X10)=X4))|~(totalorderedP(X3)))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(X12,cons(X11,nil))=X9)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(cons(X13,nil),X14)=X3)&leq(X11,X13))))))|?[X15]:(ssItem(X15)&?[X16]:((ssList(X16)&app(cons(X15,nil),X16)=X10)&?[X17]:(ssItem(X17)&?[X18]:((ssList(X18)&app(X18,cons(X17,nil))=X3)&leq(X17,X15))))))))|(~(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)))|~(lt(X5,X8)))|leq(X5,X8))))))|![X9]:(ssList(X9)=>![X10]:((((~(ssList(X10))|~(app(app(X9,X3),X10)=X4))|~(totalorderedP(X3)))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(X12,cons(X11,nil))=X9)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(cons(X13,nil),X14)=X3)&leq(X11,X13))))))|?[X15]:(ssItem(X15)&?[X16]:((ssList(X16)&app(cons(X15,nil),X16)=X10)&?[X17]:(ssItem(X17)&?[X18]:((ssList(X18)&app(X18,cons(X17,nil))=X3)&leq(X17,X15))))))))|(~(nil=X4)&nil=X3)))))),inference(assume_negation,[status(cth)],[96])).
% fof(99, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[20,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)))|~(lt(X5,X8)))|leq(X5,X8))))))|![X9]:(ssList(X9)=>![X10]:((((~(ssList(X10))|~(app(app(X9,X3),X10)=X4))|~(totalorderedP(X3)))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(X12,cons(X11,nil))=X9)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(cons(X13,nil),X14)=X3)&leq(X11,X13))))))|?[X15]:(ssItem(X15)&?[X16]:((ssList(X16)&app(cons(X15,nil),X16)=X10)&?[X17]:(ssItem(X17)&?[X18]:((ssList(X18)&app(X18,cons(X17,nil))=X3)&leq(X17,X15))))))))|(~(nil=X4)&nil=X3)))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(131, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(132, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[132])).
% cnf(134,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[133])).
% cnf(135,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(146, plain,![X1]:(~(ssList(X1))|(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(147, plain,![X4]:(~(ssList(X4))|(nil=X4|?[X5]:(ssList(X5)&?[X6]:(ssItem(X6)&cons(X6,X5)=X4)))),inference(variable_rename,[status(thm)],[146])).
% fof(148, plain,![X4]:(~(ssList(X4))|(nil=X4|(ssList(esk10_1(X4))&(ssItem(esk11_1(X4))&cons(esk11_1(X4),esk10_1(X4))=X4)))),inference(skolemize,[status(esa)],[147])).
% fof(149, plain,![X4]:(((ssList(esk10_1(X4))|nil=X4)|~(ssList(X4)))&(((ssItem(esk11_1(X4))|nil=X4)|~(ssList(X4)))&((cons(esk11_1(X4),esk10_1(X4))=X4|nil=X4)|~(ssList(X4))))),inference(distribute,[status(thm)],[148])).
% cnf(150,plain,(nil=X1|cons(esk11_1(X1),esk10_1(X1))=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[149])).
% cnf(151,plain,(nil=X1|ssItem(esk11_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[149])).
% cnf(152,plain,(nil=X1|ssList(esk10_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[149])).
% fof(165, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[12])).
% fof(166, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[165])).
% cnf(167,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[166])).
% fof(201, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[99])).
% fof(202, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[201])).
% cnf(203,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[202])).
% fof(216, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[25])).
% fof(217, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[216])).
% fof(218, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[217])).
% cnf(219,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[218])).
% 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))<(X5,X8))&~(leq(X5,X8)))))))&?[X9]:(ssList(X9)&?[X10]:((((ssList(X10)&app(app(X9,X3),X10)=X4)&totalorderedP(X3))&![X11]:(~(ssItem(X11))|![X12]:((~(ssList(X12))|~(app(X12,cons(X11,nil))=X9))|![X13]:(~(ssItem(X13))|![X14]:((~(ssList(X14))|~(app(cons(X13,nil),X14)=X3))|~(leq(X11,X13)))))))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=X10))|![X17]:(~(ssItem(X17))|![X18]:((~(ssList(X18))|~(app(X18,cons(X17,nil))=X3))|~(leq(X17,X15)))))))))&(nil=X4|~(nil=X3)))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X19]:(ssList(X19)&?[X20]:(ssList(X20)&?[X21]:(ssList(X21)&?[X22]:((((((ssList(X22)&X20=X22)&X19=X21)&~(nil=X19))&![X23]:(~(ssItem(X23))|![X24]:(~(ssList(X24))|![X25]:((~(ssList(X25))|~(app(app(X24,cons(X23,nil)),X25)=X19))|?[X26]:((((ssItem(X26)&memberP(X24,X26))&memberP(X25,X26))<(X23,X26))&~(leq(X23,X26)))))))&?[X27]:(ssList(X27)&?[X28]:((((ssList(X28)&app(app(X27,X21),X28)=X22)&totalorderedP(X21))&![X29]:(~(ssItem(X29))|![X30]:((~(ssList(X30))|~(app(X30,cons(X29,nil))=X27))|![X31]:(~(ssItem(X31))|![X32]:((~(ssList(X32))|~(app(cons(X31,nil),X32)=X21))|~(leq(X29,X31)))))))&![X33]:(~(ssItem(X33))|![X34]:((~(ssList(X34))|~(app(cons(X33,nil),X34)=X28))|![X35]:(~(ssItem(X35))|![X36]:((~(ssList(X36))|~(app(X36,cons(X35,nil))=X21))|~(leq(X35,X33)))))))))&(nil=X22|~(nil=X21)))))),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))&![X23]:(~(ssItem(X23))|![X24]:(~(ssList(X24))|![X25]:((~(ssList(X25))|~(app(app(X24,cons(X23,nil)),X25)=esk48_0))|((((ssItem(esk52_3(X23,X24,X25))&memberP(X24,esk52_3(X23,X24,X25)))&memberP(X25,esk52_3(X23,X24,X25)))<(X23,esk52_3(X23,X24,X25)))&~(leq(X23,esk52_3(X23,X24,X25))))))))&(ssList(esk53_0)&((((ssList(esk54_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&totalorderedP(esk50_0))&![X29]:(~(ssItem(X29))|![X30]:((~(ssList(X30))|~(app(X30,cons(X29,nil))=esk53_0))|![X31]:(~(ssItem(X31))|![X32]:((~(ssList(X32))|~(app(cons(X31,nil),X32)=esk50_0))|~(leq(X29,X31)))))))&![X33]:(~(ssItem(X33))|![X34]:((~(ssList(X34))|~(app(cons(X33,nil),X34)=esk54_0))|![X35]:(~(ssItem(X35))|![X36]:((~(ssList(X36))|~(app(X36,cons(X35,nil))=esk50_0))|~(leq(X35,X33)))))))))&(nil=esk51_0|~(nil=esk50_0)))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X23]:![X24]:![X25]:![X29]:![X30]:![X31]:![X32]:![X33]:![X34]:![X35]:![X36]:((((((((((((~(ssList(X36))|~(app(X36,cons(X35,nil))=esk50_0))|~(leq(X35,X33)))|~(ssItem(X35)))|(~(ssList(X34))|~(app(cons(X33,nil),X34)=esk54_0)))|~(ssItem(X33)))&((((((~(ssList(X32))|~(app(cons(X31,nil),X32)=esk50_0))|~(leq(X29,X31)))|~(ssItem(X31)))|(~(ssList(X30))|~(app(X30,cons(X29,nil))=esk53_0)))|~(ssItem(X29)))&((ssList(esk54_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&totalorderedP(esk50_0))))&ssList(esk53_0))&(((((~(ssList(X25))|~(app(app(X24,cons(X23,nil)),X25)=esk48_0))|((((ssItem(esk52_3(X23,X24,X25))&memberP(X24,esk52_3(X23,X24,X25)))&memberP(X25,esk52_3(X23,X24,X25)))<(X23,esk52_3(X23,X24,X25)))&~(leq(X23,esk52_3(X23,X24,X25)))))|~(ssList(X24)))|~(ssItem(X23)))&(((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,![X23]:![X24]:![X25]:![X29]:![X30]:![X31]:![X32]:![X33]:![X34]:![X35]:![X36]:((((((((((((~(ssList(X36))|~(app(X36,cons(X35,nil))=esk50_0))|~(leq(X35,X33)))|~(ssItem(X35)))|(~(ssList(X34))|~(app(cons(X33,nil),X34)=esk54_0)))|~(ssItem(X33)))&((((((~(ssList(X32))|~(app(cons(X31,nil),X32)=esk50_0))|~(leq(X29,X31)))|~(ssItem(X31)))|(~(ssList(X30))|~(app(X30,cons(X29,nil))=esk53_0)))|~(ssItem(X29)))&((ssList(esk54_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&totalorderedP(esk50_0))))&ssList(esk53_0))&((((((((ssItem(esk52_3(X23,X24,X25))|(~(ssList(X25))|~(app(app(X24,cons(X23,nil)),X25)=esk48_0)))|~(ssList(X24)))|~(ssItem(X23)))&(((memberP(X24,esk52_3(X23,X24,X25))|(~(ssList(X25))|~(app(app(X24,cons(X23,nil)),X25)=esk48_0)))|~(ssList(X24)))|~(ssItem(X23))))&(((memberP(X25,esk52_3(X23,X24,X25))|(~(ssList(X25))|~(app(app(X24,cons(X23,nil)),X25)=esk48_0)))|~(ssList(X24)))|~(ssItem(X23))))&(((lt(X23,esk52_3(X23,X24,X25))|(~(ssList(X25))|~(app(app(X24,cons(X23,nil)),X25)=esk48_0)))|~(ssList(X24)))|~(ssItem(X23))))&(((~(leq(X23,esk52_3(X23,X24,X25)))|(~(ssList(X25))|~(app(app(X24,cons(X23,nil)),X25)=esk48_0)))|~(ssList(X24)))|~(ssItem(X23))))&(((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(1155,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)],[203,584,theory(equality)])).
% cnf(1158,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)],[1155,135,theory(equality)])).
% cnf(1159,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)],[1158,theory(equality)])).
% cnf(2249,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1159,585,theory(equality)])).
% cnf(2250,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2249,135,theory(equality)])).
% cnf(2251,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2250,theory(equality)])).
% cnf(2254,negated_conjecture,(app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[2251,167,theory(equality)])).
% cnf(2322,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[2254,219,theory(equality)])).
% cnf(2340,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[2322,134,theory(equality)])).
% cnf(2341,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2340,135,theory(equality)])).
% cnf(2342,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2341,theory(equality)])).
% cnf(2344,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(esk10_1(X1))|~ssItem(esk11_1(X1))|~ssList(X1)),inference(spm,[status(thm)],[2342,150,theory(equality)])).
% cnf(114191,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(esk10_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[2344,151])).
% cnf(114192,negated_conjecture,(nil=X1|X1!=esk48_0|~ssList(X1)),inference(csr,[status(thm)],[114191,152])).
% cnf(114196,negated_conjecture,(nil=esk48_0),inference(spm,[status(thm)],[114192,573,theory(equality)])).
% cnf(114275,negated_conjecture,($false),inference(sr,[status(thm)],[114196,577,theory(equality)])).
% cnf(114276,negated_conjecture,($false),114275,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 7767
% # ...of these trivial : 130
% # ...subsumed : 5575
% # ...remaining for further processing: 2062
% # Other redundant clauses eliminated : 1015
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 120
% # Backward-rewritten : 58
% # Generated clauses : 51240
% # ...of the previous two non-trivial : 47438
% # Contextual simplify-reflections : 4383
% # Paramodulations : 50058
% # Factorizations : 0
% # Equation resolutions : 1166
% # Current number of processed clauses: 1666
% # Positive orientable unit clauses: 79
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 49
% # Non-unit-clauses : 1538
% # Current number of unprocessed clauses: 37312
% # ...number of literals in the above : 304908
% # Clause-clause subsumption calls (NU) : 211443
% # Rec. Clause-clause subsumption calls : 78947
% # Unit Clause-clause subsumption calls : 3790
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 24
% # Indexed BW rewrite successes : 24
% # Backwards rewriting index: 1114 leaves, 1.48+/-1.424 terms/leaf
% # Paramod-from index: 561 leaves, 1.04+/-0.319 terms/leaf
% # Paramod-into index: 922 leaves, 1.34+/-1.088 terms/leaf
% # -------------------------------------------------
% # User time : 3.169 s
% # System time : 0.106 s
% # Total time : 3.275 s
% # Maximum resident set size: 0 pages
% PrfWatch: 5.11 CPU 5.22 WC
% FINAL PrfWatch: 5.11 CPU 5.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP14634/SWC248+1.tptp
%
%------------------------------------------------------------------------------