TSTP Solution File: SWC245+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC245+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 : art04.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:28:39 EST 2010
% Result : Theorem 5.74s
% Output : Solution 5.74s
% 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/SystemOnTPTP7884/SWC245+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7884/SWC245+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7884/SWC245+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 7980
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.92 CPU 4.01 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(40, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>hd(app(X1,X2))=hd(X1)))),file('/tmp/SRASS.s.p', ax85)).
% fof(45, 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)))|~(lt(X5,X8)))|leq(X5,X8))))))|![X9]:(((~(ssList(X9))|~(app(X3,X9)=X4))|~(equalelemsP(X3)))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X9)&?[X12]:(ssList(X12)&app(X12,cons(X10,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)))|~(lt(X5,X8)))|leq(X5,X8))))))|![X9]:(((~(ssList(X9))|~(app(X3,X9)=X4))|~(equalelemsP(X3)))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X9)&?[X12]:(ssList(X12)&app(X12,cons(X10,nil))=X3)))))|(~(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))|~(app(X3,X9)=X4))|~(equalelemsP(X3)))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X9)&?[X12]:(ssList(X12)&app(X12,cons(X10,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(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(200, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[99])).
% fof(201, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[200])).
% cnf(202,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[201])).
% fof(215, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[25])).
% fof(216, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[215])).
% fof(217, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[216])).
% cnf(218,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[217])).
% fof(219, 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(220, 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)],[219])).
% fof(221, 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)],[220])).
% cnf(222,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[221])).
% fof(223, 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(224, 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)],[223])).
% fof(225, 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)],[224])).
% fof(226, 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)],[225])).
% cnf(228,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[226])).
% fof(230, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[28])).
% fof(231, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[230])).
% cnf(232,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[231])).
% fof(340, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|hd(app(X1,X2))=hd(X1)))),inference(fof_nnf,[status(thm)],[40])).
% fof(341, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))),inference(variable_rename,[status(thm)],[340])).
% fof(342, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[341])).
% cnf(343,plain,(hd(app(X1,X2))=hd(X1)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[342])).
% fof(363, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[45])).
% fof(364, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[363])).
% cnf(365,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[364])).
% 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))<(X5,X8))&~(leq(X5,X8)))))))&?[X9]:(((ssList(X9)&app(X3,X9)=X4)&equalelemsP(X3))&![X10]:(~(ssItem(X10))|![X11]:((~(ssList(X11))|~(app(cons(X10,nil),X11)=X9))|![X12]:(~(ssList(X12))|~(app(X12,cons(X10,nil))=X3))))))&(nil=X4|~(nil=X3)))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:((((((ssList(X16)&X14=X16)&X13=X15)&~(nil=X13))&![X17]:(~(ssItem(X17))|![X18]:(~(ssList(X18))|![X19]:((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=X13))|?[X20]:((((ssItem(X20)&memberP(X18,X20))&memberP(X19,X20))<(X17,X20))&~(leq(X17,X20)))))))&?[X21]:(((ssList(X21)&app(X15,X21)=X16)&equalelemsP(X15))&![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(cons(X22,nil),X23)=X21))|![X24]:(~(ssList(X24))|~(app(X24,cons(X22,nil))=X15))))))&(nil=X16|~(nil=X15)))))),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))&![X17]:(~(ssItem(X17))|![X18]:(~(ssList(X18))|![X19]:((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0))|((((ssItem(esk52_3(X17,X18,X19))&memberP(X18,esk52_3(X17,X18,X19)))&memberP(X19,esk52_3(X17,X18,X19)))<(X17,esk52_3(X17,X18,X19)))&~(leq(X17,esk52_3(X17,X18,X19))))))))&(((ssList(esk53_0)&app(esk50_0,esk53_0)=esk51_0)&equalelemsP(esk50_0))&![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(cons(X22,nil),X23)=esk53_0))|![X24]:(~(ssList(X24))|~(app(X24,cons(X22,nil))=esk50_0))))))&(nil=esk51_0|~(nil=esk50_0)))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X17]:![X18]:![X19]:![X22]:![X23]:![X24]:(((((((((~(ssList(X24))|~(app(X24,cons(X22,nil))=esk50_0))|(~(ssList(X23))|~(app(cons(X22,nil),X23)=esk53_0)))|~(ssItem(X22)))&((ssList(esk53_0)&app(esk50_0,esk53_0)=esk51_0)&equalelemsP(esk50_0)))&(((((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0))|((((ssItem(esk52_3(X17,X18,X19))&memberP(X18,esk52_3(X17,X18,X19)))&memberP(X19,esk52_3(X17,X18,X19)))<(X17,esk52_3(X17,X18,X19)))&~(leq(X17,esk52_3(X17,X18,X19)))))|~(ssList(X18)))|~(ssItem(X17)))&(((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,![X17]:![X18]:![X19]:![X22]:![X23]:![X24]:(((((((((~(ssList(X24))|~(app(X24,cons(X22,nil))=esk50_0))|(~(ssList(X23))|~(app(cons(X22,nil),X23)=esk53_0)))|~(ssItem(X22)))&((ssList(esk53_0)&app(esk50_0,esk53_0)=esk51_0)&equalelemsP(esk50_0)))&((((((((ssItem(esk52_3(X17,X18,X19))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0)))|~(ssList(X18)))|~(ssItem(X17)))&(((memberP(X18,esk52_3(X17,X18,X19))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0)))|~(ssList(X18)))|~(ssItem(X17))))&(((memberP(X19,esk52_3(X17,X18,X19))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0)))|~(ssList(X18)))|~(ssItem(X17))))&(((lt(X17,esk52_3(X17,X18,X19))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0)))|~(ssList(X18)))|~(ssItem(X17))))&(((~(leq(X17,esk52_3(X17,X18,X19)))|(~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0)))|~(ssList(X18)))|~(ssItem(X17))))&(((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(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,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(587,negated_conjecture,(app(esk50_0,esk53_0)=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(592,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,579,theory(equality)])).
% cnf(600,negated_conjecture,(app(esk48_0,esk53_0)=esk51_0),inference(rw,[status(thm)],[587,578,theory(equality)])).
% cnf(639,negated_conjecture,(nil=esk48_0|esk51_0!=nil|~ssList(esk53_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[228,600,theory(equality)])).
% cnf(641,negated_conjecture,(nil=esk48_0|esk51_0!=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[639,588,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,577,theory(equality)])).
% cnf(758,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0|~ssList(esk53_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[343,600,theory(equality)])).
% cnf(761,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[758,588,theory(equality)])).
% cnf(762,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0|$false|$false),inference(rw,[status(thm)],[761,573,theory(equality)])).
% cnf(763,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0),inference(cn,[status(thm)],[762,theory(equality)])).
% cnf(764,negated_conjecture,(hd(esk51_0)=hd(esk48_0)),inference(sr,[status(thm)],[763,577,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)],[222,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,588,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)],[343,413,theory(equality)])).
% cnf(1187,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)],[202,584,theory(equality)])).
% cnf(1190,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)],[1187,134,theory(equality)])).
% cnf(1191,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)],[1190,theory(equality)])).
% cnf(1771,negated_conjecture,(nil=esk51_0|ssItem(hd(esk48_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[365,764,theory(equality)])).
% cnf(1777,negated_conjecture,(nil=esk51_0|ssItem(hd(esk48_0))|$false),inference(rw,[status(thm)],[1771,592,theory(equality)])).
% cnf(1778,negated_conjecture,(nil=esk51_0|ssItem(hd(esk48_0))),inference(cn,[status(thm)],[1777,theory(equality)])).
% cnf(1779,negated_conjecture,(ssItem(hd(esk48_0))),inference(sr,[status(thm)],[1778,644,theory(equality)])).
% cnf(2135,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1191,585,theory(equality)])).
% cnf(2136,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2135,134,theory(equality)])).
% cnf(2137,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2136,theory(equality)])).
% cnf(2168,negated_conjecture,(app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[2137,166,theory(equality)])).
% cnf(2389,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[2168,218,theory(equality)])).
% cnf(2396,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[2389,133,theory(equality)])).
% cnf(2397,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2396,134,theory(equality)])).
% cnf(2398,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2397,theory(equality)])).
% cnf(2476,negated_conjecture,(app(esk48_0,esk53_0)=app(esk51_0,nil)|~ssList(nil)|~ssList(esk53_0)),inference(spm,[status(thm)],[943,232,theory(equality)])).
% cnf(2523,negated_conjecture,(esk51_0=app(esk51_0,nil)|~ssList(nil)|~ssList(esk53_0)),inference(rw,[status(thm)],[2476,600,theory(equality)])).
% cnf(2524,negated_conjecture,(esk51_0=app(esk51_0,nil)|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[2523,134,theory(equality)])).
% cnf(2525,negated_conjecture,(esk51_0=app(esk51_0,nil)|$false|$false),inference(rw,[status(thm)],[2524,588,theory(equality)])).
% cnf(2526,negated_conjecture,(esk51_0=app(esk51_0,nil)),inference(cn,[status(thm)],[2525,theory(equality)])).
% cnf(2539,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|~ssList(nil)|~ssList(esk51_0)|~ssList(X1)),inference(spm,[status(thm)],[415,2526,theory(equality)])).
% cnf(2580,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|$false|~ssList(esk51_0)|~ssList(X1)),inference(rw,[status(thm)],[2539,134,theory(equality)])).
% cnf(2581,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[2580,592,theory(equality)])).
% cnf(2582,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[2581,theory(equality)])).
% cnf(21148,plain,(hd(X2)=hd(X1)|nil=X1|~frontsegP(X2,X1)|~ssList(X1)|~ssList(X2)),inference(csr,[status(thm)],[955,414])).
% cnf(21158,negated_conjecture,(hd(X1)=hd(esk51_0)|nil=esk51_0|~ssList(esk51_0)|~ssList(X1)|esk51_0!=X1),inference(spm,[status(thm)],[21148,2582,theory(equality)])).
% cnf(21177,negated_conjecture,(hd(X1)=hd(esk48_0)|nil=esk51_0|~ssList(esk51_0)|~ssList(X1)|esk51_0!=X1),inference(rw,[status(thm)],[21158,764,theory(equality)])).
% cnf(21178,negated_conjecture,(hd(X1)=hd(esk48_0)|nil=esk51_0|$false|~ssList(X1)|esk51_0!=X1),inference(rw,[status(thm)],[21177,592,theory(equality)])).
% cnf(21179,negated_conjecture,(hd(X1)=hd(esk48_0)|nil=esk51_0|~ssList(X1)|esk51_0!=X1),inference(cn,[status(thm)],[21178,theory(equality)])).
% cnf(21180,negated_conjecture,(hd(X1)=hd(esk48_0)|~ssList(X1)|esk51_0!=X1),inference(sr,[status(thm)],[21179,644,theory(equality)])).
% cnf(32402,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,21180,theory(equality)])).
% cnf(32489,negated_conjecture,(cons(hd(X1),tl(esk48_0))=esk48_0|nil=esk48_0|$false|esk51_0!=X1|~ssList(X1)),inference(rw,[status(thm)],[32402,573,theory(equality)])).
% cnf(32490,negated_conjecture,(cons(hd(X1),tl(esk48_0))=esk48_0|nil=esk48_0|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[32489,theory(equality)])).
% cnf(32491,negated_conjecture,(cons(hd(X1),tl(esk48_0))=esk48_0|esk51_0!=X1|~ssList(X1)),inference(sr,[status(thm)],[32490,577,theory(equality)])).
% cnf(96941,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|~ssList(esk51_0)),inference(spm,[status(thm)],[32491,764,theory(equality)])).
% cnf(96980,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|$false),inference(rw,[status(thm)],[96941,592,theory(equality)])).
% cnf(96981,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0),inference(cn,[status(thm)],[96980,theory(equality)])).
% cnf(97024,negated_conjecture,(~ssList(tl(esk48_0))|~ssItem(hd(esk48_0))),inference(spm,[status(thm)],[2398,96981,theory(equality)])).
% cnf(97309,negated_conjecture,(~ssList(tl(esk48_0))|$false),inference(rw,[status(thm)],[97024,1779,theory(equality)])).
% cnf(97310,negated_conjecture,(~ssList(tl(esk48_0))),inference(cn,[status(thm)],[97309,theory(equality)])).
% cnf(97756,negated_conjecture,(nil=esk48_0|~ssList(esk48_0)),inference(spm,[status(thm)],[97310,435,theory(equality)])).
% cnf(97757,negated_conjecture,(nil=esk48_0|$false),inference(rw,[status(thm)],[97756,573,theory(equality)])).
% cnf(97758,negated_conjecture,(nil=esk48_0),inference(cn,[status(thm)],[97757,theory(equality)])).
% cnf(97759,negated_conjecture,($false),inference(sr,[status(thm)],[97758,577,theory(equality)])).
% cnf(97760,negated_conjecture,($false),97759,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6812
% # ...of these trivial : 146
% # ...subsumed : 4890
% # ...remaining for further processing: 1776
% # Other redundant clauses eliminated : 952
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 65
% # Backward-rewritten : 13
% # Generated clauses : 44356
% # ...of the previous two non-trivial : 40564
% # Contextual simplify-reflections : 2980
% # Paramodulations : 43257
% # Factorizations : 0
% # Equation resolutions : 1094
% # Current number of processed clauses: 1490
% # Positive orientable unit clauses: 69
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 52
% # Non-unit-clauses : 1369
% # Current number of unprocessed clauses: 33711
% # ...number of literals in the above : 278946
% # Clause-clause subsumption calls (NU) : 150559
% # Rec. Clause-clause subsumption calls : 40511
% # Unit Clause-clause subsumption calls : 861
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 958 leaves, 1.53+/-1.464 terms/leaf
% # Paramod-from index: 483 leaves, 1.04+/-0.220 terms/leaf
% # Paramod-into index: 774 leaves, 1.38+/-1.132 terms/leaf
% # -------------------------------------------------
% # User time : 2.750 s
% # System time : 0.101 s
% # Total time : 2.851 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.62 CPU 4.73 WC
% FINAL PrfWatch: 4.62 CPU 4.73 WC
% SZS output end Solution for /tmp/SystemOnTPTP7884/SWC245+1.tptp
%
%------------------------------------------------------------------------------