TSTP Solution File: SWC228+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC228+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:27:00 EST 2010
% Result : Theorem 5.90s
% Output : Solution 5.90s
% 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/SystemOnTPTP17797/SWC228+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17797/SWC228+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17797/SWC228+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 17896
% 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.94 CPU 4.03 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(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(26, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>app(app(X1,X2),X3)=app(X1,app(X2,X3))))),file('/tmp/SRASS.s.p', ax82)).
% fof(27, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(28, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(41, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>hd(app(X1,X2))=hd(X1)))),file('/tmp/SRASS.s.p', ax85)).
% fof(46, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(55, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(58, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(68, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>cons(hd(X1),tl(X1))=X1)),file('/tmp/SRASS.s.p', ax78)).
% 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)=>((~(app(X3,X9)=X4)|~(strictorderedP(X3)))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X9)&?[X12]:(ssItem(X12)&?[X13]:((ssList(X13)&app(X13,cons(X12,nil))=X3)<(X12,X10))))))))|(~(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)=>((~(app(X3,X9)=X4)|~(strictorderedP(X3)))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X9)&?[X12]:(ssItem(X12)&?[X13]:((ssList(X13)&app(X13,cons(X12,nil))=X3)<(X12,X10))))))))|(~(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)))|~(leq(X5,X8)))|leq(X8,X5)))))))|![X9]:(ssList(X9)=>((~(app(X3,X9)=X4)|~(strictorderedP(X3)))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X9)&?[X12]:(ssItem(X12)&?[X13]:((ssList(X13)&app(X13,cons(X12,nil))=X3)<(X12,X10))))))))|(~(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(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(220, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|app(app(X1,X2),X3)=app(X1,app(X2,X3))))),inference(fof_nnf,[status(thm)],[26])).
% fof(221, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6))))),inference(variable_rename,[status(thm)],[220])).
% fof(222, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[221])).
% cnf(223,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[222])).
% fof(224, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[27])).
% fof(225, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[224])).
% fof(226, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[225])).
% fof(227, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[226])).
% cnf(229,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[227])).
% fof(231, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[28])).
% fof(232, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[231])).
% cnf(233,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[232])).
% fof(349, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|hd(app(X1,X2))=hd(X1)))),inference(fof_nnf,[status(thm)],[41])).
% fof(350, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))),inference(variable_rename,[status(thm)],[349])).
% fof(351, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[350])).
% cnf(352,plain,(hd(app(X1,X2))=hd(X1)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[351])).
% fof(372, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[46])).
% fof(373, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[372])).
% cnf(374,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[373])).
% fof(408, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(frontsegP(X1,X2))|?[X3]:(ssList(X3)&app(X2,X3)=X1))&(![X3]:(~(ssList(X3))|~(app(X2,X3)=X1))|frontsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[55])).
% fof(409, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|?[X6]:(ssList(X6)&app(X5,X6)=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(variable_rename,[status(thm)],[408])).
% fof(410, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk43_2(X4,X5))&app(X5,esk43_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[409])).
% fof(411, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk43_2(X4,X5))&app(X5,esk43_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[410])).
% fof(412, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk43_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk43_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[411])).
% cnf(413,plain,(app(X2,esk43_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[412])).
% cnf(414,plain,(ssList(esk43_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[412])).
% cnf(415,plain,(frontsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X2,X3)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[412])).
% fof(433, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[58])).
% fof(434, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[433])).
% cnf(435,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[434])).
% fof(481, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[68])).
% fof(482, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[481])).
% cnf(483,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[482])).
% 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)&((app(X3,X9)=X4&strictorderedP(X3))&![X10]:(~(ssItem(X10))|![X11]:((~(ssList(X11))|~(app(cons(X10,nil),X11)=X9))|![X12]:(~(ssItem(X12))|![X13]:((~(ssList(X13))|~(app(X13,cons(X12,nil))=X3))|~(lt(X12,X10)))))))))&(nil=X4|~(nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&(((((X15=X17&X14=X16)&~(nil=X14))&![X18]:(~(ssItem(X18))|![X19]:(~(ssList(X19))|![X20]:((~(ssList(X20))|~(app(app(X19,cons(X18,nil)),X20)=X14))|?[X21]:(ssItem(X21)&(((memberP(X19,X21)&memberP(X20,X21))&leq(X18,X21))&~(leq(X21,X18))))))))&?[X22]:(ssList(X22)&((app(X16,X22)=X17&strictorderedP(X16))&![X23]:(~(ssItem(X23))|![X24]:((~(ssList(X24))|~(app(cons(X23,nil),X24)=X22))|![X25]:(~(ssItem(X25))|![X26]:((~(ssList(X26))|~(app(X26,cons(X25,nil))=X16))|~(lt(X25,X23)))))))))&(nil=X17|~(nil=X16))))))),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))&![X18]:(~(ssItem(X18))|![X19]:(~(ssList(X19))|![X20]:((~(ssList(X20))|~(app(app(X19,cons(X18,nil)),X20)=esk48_0))|(ssItem(esk52_3(X18,X19,X20))&(((memberP(X19,esk52_3(X18,X19,X20))&memberP(X20,esk52_3(X18,X19,X20)))&leq(X18,esk52_3(X18,X19,X20)))&~(leq(esk52_3(X18,X19,X20),X18))))))))&(ssList(esk53_0)&((app(esk50_0,esk53_0)=esk51_0&strictorderedP(esk50_0))&![X23]:(~(ssItem(X23))|![X24]:((~(ssList(X24))|~(app(cons(X23,nil),X24)=esk53_0))|![X25]:(~(ssItem(X25))|![X26]:((~(ssList(X26))|~(app(X26,cons(X25,nil))=esk50_0))|~(lt(X25,X23)))))))))&(nil=esk51_0|~(nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X18]:![X19]:![X20]:![X23]:![X24]:![X25]:![X26]:(((((((((((((~(ssList(X26))|~(app(X26,cons(X25,nil))=esk50_0))|~(lt(X25,X23)))|~(ssItem(X25)))|(~(ssList(X24))|~(app(cons(X23,nil),X24)=esk53_0)))|~(ssItem(X23)))&(app(esk50_0,esk53_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk53_0))&(((((~(ssList(X20))|~(app(app(X19,cons(X18,nil)),X20)=esk48_0))|(ssItem(esk52_3(X18,X19,X20))&(((memberP(X19,esk52_3(X18,X19,X20))&memberP(X20,esk52_3(X18,X19,X20)))&leq(X18,esk52_3(X18,X19,X20)))&~(leq(esk52_3(X18,X19,X20),X18)))))|~(ssList(X19)))|~(ssItem(X18)))&((esk49_0=esk51_0&esk48_0=esk50_0)&~(nil=esk48_0))))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X18]:![X19]:![X20]:![X23]:![X24]:![X25]:![X26]:(((((((((((((~(ssList(X26))|~(app(X26,cons(X25,nil))=esk50_0))|~(lt(X25,X23)))|~(ssItem(X25)))|(~(ssList(X24))|~(app(cons(X23,nil),X24)=esk53_0)))|~(ssItem(X23)))&(app(esk50_0,esk53_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk53_0))&(((((ssItem(esk52_3(X18,X19,X20))|(~(ssList(X20))|~(app(app(X19,cons(X18,nil)),X20)=esk48_0)))|~(ssList(X19)))|~(ssItem(X18)))&((((((memberP(X19,esk52_3(X18,X19,X20))|(~(ssList(X20))|~(app(app(X19,cons(X18,nil)),X20)=esk48_0)))|~(ssList(X19)))|~(ssItem(X18)))&(((memberP(X20,esk52_3(X18,X19,X20))|(~(ssList(X20))|~(app(app(X19,cons(X18,nil)),X20)=esk48_0)))|~(ssList(X19)))|~(ssItem(X18))))&(((leq(X18,esk52_3(X18,X19,X20))|(~(ssList(X20))|~(app(app(X19,cons(X18,nil)),X20)=esk48_0)))|~(ssList(X19)))|~(ssItem(X18))))&(((~(leq(esk52_3(X18,X19,X20),X18))|(~(ssList(X20))|~(app(app(X19,cons(X18,nil)),X20)=esk48_0)))|~(ssList(X19)))|~(ssItem(X18)))))&((esk49_0=esk51_0&esk48_0=esk50_0)&~(nil=esk48_0))))&(nil=esk51_0|~(nil=esk50_0)))&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(578,negated_conjecture,(nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(esk49_0=esk51_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(586,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(app(esk50_0,esk53_0)=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(592,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,580,theory(equality)])).
% cnf(600,negated_conjecture,(app(esk48_0,esk53_0)=esk51_0),inference(rw,[status(thm)],[588,579,theory(equality)])).
% cnf(639,negated_conjecture,(nil=esk48_0|esk51_0!=nil|~ssList(esk53_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[229,600,theory(equality)])).
% cnf(641,negated_conjecture,(nil=esk48_0|esk51_0!=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[639,586,theory(equality)])).
% cnf(642,negated_conjecture,(nil=esk48_0|esk51_0!=nil|$false|$false),inference(rw,[status(thm)],[641,573,theory(equality)])).
% cnf(643,negated_conjecture,(nil=esk48_0|esk51_0!=nil),inference(cn,[status(thm)],[642,theory(equality)])).
% cnf(644,negated_conjecture,(esk51_0!=nil),inference(sr,[status(thm)],[643,578,theory(equality)])).
% cnf(760,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0|~ssList(esk53_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[352,600,theory(equality)])).
% cnf(763,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[760,586,theory(equality)])).
% cnf(764,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0|$false|$false),inference(rw,[status(thm)],[763,573,theory(equality)])).
% cnf(765,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0),inference(cn,[status(thm)],[764,theory(equality)])).
% cnf(766,negated_conjecture,(hd(esk51_0)=hd(esk48_0)),inference(sr,[status(thm)],[765,578,theory(equality)])).
% cnf(933,negated_conjecture,(app(esk51_0,X1)=app(esk48_0,app(esk53_0,X1))|~ssList(X1)|~ssList(esk53_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[223,600,theory(equality)])).
% cnf(941,negated_conjecture,(app(esk51_0,X1)=app(esk48_0,app(esk53_0,X1))|~ssList(X1)|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[933,586,theory(equality)])).
% cnf(942,negated_conjecture,(app(esk51_0,X1)=app(esk48_0,app(esk53_0,X1))|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[941,573,theory(equality)])).
% cnf(943,negated_conjecture,(app(esk51_0,X1)=app(esk48_0,app(esk53_0,X1))|~ssList(X1)),inference(cn,[status(thm)],[942,theory(equality)])).
% cnf(955,plain,(hd(X2)=hd(X1)|nil=X1|~ssList(esk43_2(X2,X1))|~ssList(X1)|~frontsegP(X2,X1)|~ssList(X2)),inference(spm,[status(thm)],[352,413,theory(equality)])).
% cnf(1188,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(1191,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)],[1188,135,theory(equality)])).
% cnf(1192,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)],[1191,theory(equality)])).
% cnf(1772,negated_conjecture,(nil=esk51_0|ssItem(hd(esk48_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[374,766,theory(equality)])).
% cnf(1778,negated_conjecture,(nil=esk51_0|ssItem(hd(esk48_0))|$false),inference(rw,[status(thm)],[1772,592,theory(equality)])).
% cnf(1779,negated_conjecture,(nil=esk51_0|ssItem(hd(esk48_0))),inference(cn,[status(thm)],[1778,theory(equality)])).
% cnf(1780,negated_conjecture,(ssItem(hd(esk48_0))),inference(sr,[status(thm)],[1779,644,theory(equality)])).
% cnf(2138,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1192,585,theory(equality)])).
% cnf(2139,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2138,135,theory(equality)])).
% cnf(2140,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2139,theory(equality)])).
% cnf(2171,negated_conjecture,(app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[2140,167,theory(equality)])).
% cnf(2392,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[2171,219,theory(equality)])).
% cnf(2399,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[2392,134,theory(equality)])).
% cnf(2400,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2399,135,theory(equality)])).
% cnf(2401,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2400,theory(equality)])).
% cnf(2479,negated_conjecture,(app(esk48_0,esk53_0)=app(esk51_0,nil)|~ssList(nil)|~ssList(esk53_0)),inference(spm,[status(thm)],[943,233,theory(equality)])).
% cnf(2526,negated_conjecture,(esk51_0=app(esk51_0,nil)|~ssList(nil)|~ssList(esk53_0)),inference(rw,[status(thm)],[2479,600,theory(equality)])).
% cnf(2527,negated_conjecture,(esk51_0=app(esk51_0,nil)|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[2526,135,theory(equality)])).
% cnf(2528,negated_conjecture,(esk51_0=app(esk51_0,nil)|$false|$false),inference(rw,[status(thm)],[2527,586,theory(equality)])).
% cnf(2529,negated_conjecture,(esk51_0=app(esk51_0,nil)),inference(cn,[status(thm)],[2528,theory(equality)])).
% cnf(2542,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|~ssList(nil)|~ssList(esk51_0)|~ssList(X1)),inference(spm,[status(thm)],[415,2529,theory(equality)])).
% cnf(2583,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|$false|~ssList(esk51_0)|~ssList(X1)),inference(rw,[status(thm)],[2542,135,theory(equality)])).
% cnf(2584,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[2583,592,theory(equality)])).
% cnf(2585,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[2584,theory(equality)])).
% cnf(21057,plain,(hd(X2)=hd(X1)|nil=X1|~frontsegP(X2,X1)|~ssList(X1)|~ssList(X2)),inference(csr,[status(thm)],[955,414])).
% cnf(21067,negated_conjecture,(hd(X1)=hd(esk51_0)|nil=esk51_0|~ssList(esk51_0)|~ssList(X1)|esk51_0!=X1),inference(spm,[status(thm)],[21057,2585,theory(equality)])).
% cnf(21086,negated_conjecture,(hd(X1)=hd(esk48_0)|nil=esk51_0|~ssList(esk51_0)|~ssList(X1)|esk51_0!=X1),inference(rw,[status(thm)],[21067,766,theory(equality)])).
% cnf(21087,negated_conjecture,(hd(X1)=hd(esk48_0)|nil=esk51_0|$false|~ssList(X1)|esk51_0!=X1),inference(rw,[status(thm)],[21086,592,theory(equality)])).
% cnf(21088,negated_conjecture,(hd(X1)=hd(esk48_0)|nil=esk51_0|~ssList(X1)|esk51_0!=X1),inference(cn,[status(thm)],[21087,theory(equality)])).
% cnf(21089,negated_conjecture,(hd(X1)=hd(esk48_0)|~ssList(X1)|esk51_0!=X1),inference(sr,[status(thm)],[21088,644,theory(equality)])).
% cnf(30853,negated_conjecture,(cons(hd(X1),tl(esk48_0))=esk48_0|nil=esk48_0|~ssList(esk48_0)|esk51_0!=X1|~ssList(X1)),inference(spm,[status(thm)],[483,21089,theory(equality)])).
% cnf(30938,negated_conjecture,(cons(hd(X1),tl(esk48_0))=esk48_0|nil=esk48_0|$false|esk51_0!=X1|~ssList(X1)),inference(rw,[status(thm)],[30853,573,theory(equality)])).
% cnf(30939,negated_conjecture,(cons(hd(X1),tl(esk48_0))=esk48_0|nil=esk48_0|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[30938,theory(equality)])).
% cnf(30940,negated_conjecture,(cons(hd(X1),tl(esk48_0))=esk48_0|esk51_0!=X1|~ssList(X1)),inference(sr,[status(thm)],[30939,578,theory(equality)])).
% cnf(96934,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|~ssList(esk51_0)),inference(spm,[status(thm)],[30940,766,theory(equality)])).
% cnf(96979,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|$false),inference(rw,[status(thm)],[96934,592,theory(equality)])).
% cnf(96980,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0),inference(cn,[status(thm)],[96979,theory(equality)])).
% cnf(97010,negated_conjecture,(~ssList(tl(esk48_0))|~ssItem(hd(esk48_0))),inference(spm,[status(thm)],[2401,96980,theory(equality)])).
% cnf(97296,negated_conjecture,(~ssList(tl(esk48_0))|$false),inference(rw,[status(thm)],[97010,1780,theory(equality)])).
% cnf(97297,negated_conjecture,(~ssList(tl(esk48_0))),inference(cn,[status(thm)],[97296,theory(equality)])).
% cnf(97750,negated_conjecture,(nil=esk48_0|~ssList(esk48_0)),inference(spm,[status(thm)],[97297,435,theory(equality)])).
% cnf(97751,negated_conjecture,(nil=esk48_0|$false),inference(rw,[status(thm)],[97750,573,theory(equality)])).
% cnf(97752,negated_conjecture,(nil=esk48_0),inference(cn,[status(thm)],[97751,theory(equality)])).
% cnf(97753,negated_conjecture,($false),inference(sr,[status(thm)],[97752,578,theory(equality)])).
% cnf(97754,negated_conjecture,($false),97753,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6830
% # ...of these trivial : 143
% # ...subsumed : 4896
% # ...remaining for further processing: 1791
% # Other redundant clauses eliminated : 952
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 62
% # Backward-rewritten : 18
% # Generated clauses : 44547
% # ...of the previous two non-trivial : 40785
% # Contextual simplify-reflections : 3046
% # Paramodulations : 43448
% # Factorizations : 0
% # Equation resolutions : 1094
% # Current number of processed clauses: 1503
% # Positive orientable unit clauses: 73
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 47
% # Non-unit-clauses : 1383
% # Current number of unprocessed clauses: 33774
% # ...number of literals in the above : 280224
% # Clause-clause subsumption calls (NU) : 149932
% # Rec. Clause-clause subsumption calls : 40539
% # Unit Clause-clause subsumption calls : 815
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 968 leaves, 1.54+/-1.516 terms/leaf
% # Paramod-from index: 488 leaves, 1.04+/-0.240 terms/leaf
% # Paramod-into index: 789 leaves, 1.38+/-1.126 terms/leaf
% # -------------------------------------------------
% # User time : 2.793 s
% # System time : 0.082 s
% # Total time : 2.875 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.60 CPU 4.70 WC
% FINAL PrfWatch: 4.60 CPU 4.70 WC
% SZS output end Solution for /tmp/SystemOnTPTP17797/SWC228+1.tptp
%
%------------------------------------------------------------------------------