TSTP Solution File: SWC241+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC241+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:32:58 EST 2010
% Result : Theorem 2.44s
% Output : Solution 2.44s
% 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/SystemOnTPTP13936/SWC241+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13936/SWC241+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13936/SWC241+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 14068
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(4, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(11, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(19, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(22, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(23, 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(24, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(25, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(38, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>hd(app(X1,X2))=hd(X1)))),file('/tmp/SRASS.s.p', ax85)).
% fof(39, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>tl(app(X1,X2))=app(tl(X1),X2)))),file('/tmp/SRASS.s.p', ax86)).
% fof(43, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(57, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(67, 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))))))|(~(nil=X3)&![X9]:(ssItem(X9)=>![X10]:(ssList(X10)=>![X11]:((~(ssList(X11))|~(app(app(X10,cons(X9,nil)),X11)=X3))|?[X12]:((((ssItem(X12)&~(leq(X12,X9)))&memberP(X10,X12))&memberP(X11,X12))&leq(X9,X12)))))))))),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))))))|(~(nil=X3)&![X9]:(ssItem(X9)=>![X10]:(ssList(X10)=>![X11]:((~(ssList(X11))|~(app(app(X10,cons(X9,nil)),X11)=X3))|?[X12]:((((ssItem(X12)&~(leq(X12,X9)))&memberP(X10,X12))&memberP(X11,X12))&leq(X9,X12))))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(99, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[19,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))))))|(~(nil=X3)&![X9]:(ssItem(X9)=>![X10]:(ssList(X10)=>![X11]:((~(ssList(X11))|~(app(app(X10,cons(X9,nil)),X11)=X3))|?[X12]:((((ssItem(X12)&~(leq(X12,X9)))&memberP(X10,X12))&memberP(X11,X12))&leq(X9,X12))))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(118, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(119, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[118])).
% fof(120, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[119])).
% cnf(121,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[120])).
% cnf(122,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[4])).
% fof(144, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(145, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[144])).
% fof(146, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[145])).
% cnf(147,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[146])).
% fof(152, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[11])).
% fof(153, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[152])).
% cnf(154,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[153])).
% fof(188, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[99])).
% fof(189, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[188])).
% cnf(190,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[189])).
% fof(199, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[22])).
% fof(200, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[199])).
% fof(201, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[200])).
% cnf(202,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[201])).
% fof(203, 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)],[23])).
% fof(204, 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)],[203])).
% fof(205, 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)],[204])).
% cnf(206,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[205])).
% fof(207, 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)],[24])).
% fof(208, 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)],[207])).
% fof(209, 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)],[208])).
% fof(210, 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)],[209])).
% cnf(212,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[210])).
% fof(214, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[25])).
% fof(215, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[214])).
% cnf(216,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[215])).
% fof(336, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|hd(app(X1,X2))=hd(X1)))),inference(fof_nnf,[status(thm)],[38])).
% fof(337, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))),inference(variable_rename,[status(thm)],[336])).
% fof(338, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[337])).
% cnf(339,plain,(hd(app(X1,X2))=hd(X1)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[338])).
% fof(340, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|tl(app(X1,X2))=app(tl(X1),X2)))),inference(fof_nnf,[status(thm)],[39])).
% fof(341, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))),inference(variable_rename,[status(thm)],[340])).
% fof(342, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|tl(app(X3,X4))=app(tl(X3),X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[341])).
% cnf(343,plain,(tl(app(X1,X2))=app(tl(X1),X2)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[342])).
% fof(359, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[43])).
% fof(360, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[359])).
% cnf(361,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[360])).
% fof(432, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[57])).
% fof(433, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[432])).
% cnf(434,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[433])).
% fof(480, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[67])).
% fof(481, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[480])).
% cnf(482,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[481])).
% 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)))))))&(nil=X3|?[X9]:(ssItem(X9)&?[X10]:(ssList(X10)&?[X11]:((ssList(X11)&app(app(X10,cons(X9,nil)),X11)=X3)&![X12]:((((~(ssItem(X12))|leq(X12,X9))|~(memberP(X10,X12)))|~(memberP(X11,X12)))|~(leq(X9,X12))))))))))),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)))))))&(nil=X15|?[X21]:(ssItem(X21)&?[X22]:(ssList(X22)&?[X23]:((ssList(X23)&app(app(X22,cons(X21,nil)),X23)=X15)&![X24]:((((~(ssItem(X24))|leq(X24,X21))|~(memberP(X22,X24)))|~(memberP(X23,X24)))|~(leq(X21,X24))))))))))),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))))))))&(nil=esk50_0|(ssItem(esk53_0)&(ssList(esk54_0)&((ssList(esk55_0)&app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk50_0)&![X24]:((((~(ssItem(X24))|leq(X24,esk53_0))|~(memberP(esk54_0,X24)))|~(memberP(esk55_0,X24)))|~(leq(esk53_0,X24))))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X17]:![X18]:![X19]:![X24]:((((((((((((~(ssItem(X24))|leq(X24,esk53_0))|~(memberP(esk54_0,X24)))|~(memberP(esk55_0,X24)))|~(leq(esk53_0,X24)))&(ssList(esk55_0)&app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk50_0))&ssList(esk54_0))&ssItem(esk53_0))|nil=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))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X17]:![X18]:![X19]:![X24]:((((((((((((~(ssItem(X24))|leq(X24,esk53_0))|~(memberP(esk54_0,X24)))|~(memberP(esk55_0,X24)))|~(leq(esk53_0,X24)))|nil=esk50_0)&((ssList(esk55_0)|nil=esk50_0)&(app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk50_0|nil=esk50_0)))&(ssList(esk54_0)|nil=esk50_0))&(ssItem(esk53_0)|nil=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))))&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(576,negated_conjecture,(nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,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(584,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(585,negated_conjecture,(nil=esk50_0|ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(nil=esk50_0|ssList(esk54_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(nil=esk50_0|app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(nil=esk50_0|ssList(esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(597,negated_conjecture,(esk48_0=nil|ssItem(esk53_0)),inference(rw,[status(thm)],[585,577,theory(equality)])).
% cnf(598,negated_conjecture,(ssItem(esk53_0)),inference(sr,[status(thm)],[597,576,theory(equality)])).
% cnf(599,negated_conjecture,(esk48_0=nil|ssList(esk54_0)),inference(rw,[status(thm)],[586,577,theory(equality)])).
% cnf(600,negated_conjecture,(ssList(esk54_0)),inference(sr,[status(thm)],[599,576,theory(equality)])).
% cnf(601,negated_conjecture,(esk48_0=nil|ssList(esk55_0)),inference(rw,[status(thm)],[588,577,theory(equality)])).
% cnf(602,negated_conjecture,(ssList(esk55_0)),inference(sr,[status(thm)],[601,576,theory(equality)])).
% cnf(603,negated_conjecture,(esk48_0=nil|app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk50_0),inference(rw,[status(thm)],[587,577,theory(equality)])).
% cnf(604,negated_conjecture,(esk48_0=nil|app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk48_0),inference(rw,[status(thm)],[603,577,theory(equality)])).
% cnf(605,negated_conjecture,(app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk48_0),inference(sr,[status(thm)],[604,576,theory(equality)])).
% cnf(760,plain,(cons(hd(X1),tl(app(X1,X2)))=app(X1,X2)|nil=app(X1,X2)|nil=X1|~ssList(app(X1,X2))|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[482,339,theory(equality)])).
% cnf(862,plain,(nil=app(X1,X2)|ssList(app(tl(X1),X2))|nil=X1|~ssList(app(X1,X2))|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[434,343,theory(equality)])).
% cnf(900,plain,(app(X1,app(X2,nil))=app(X1,X2)|~ssList(app(X1,X2))|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[216,206,theory(equality)])).
% cnf(921,negated_conjecture,(app(esk48_0,X1)=app(app(esk54_0,cons(esk53_0,nil)),app(esk55_0,X1))|~ssList(X1)|~ssList(esk55_0)|~ssList(app(esk54_0,cons(esk53_0,nil)))),inference(spm,[status(thm)],[206,605,theory(equality)])).
% cnf(926,plain,(app(X1,app(X2,nil))=app(X1,X2)|~ssList(app(X1,X2))|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[900,122,theory(equality)])).
% cnf(927,plain,(app(X1,app(X2,nil))=app(X1,X2)|~ssList(app(X1,X2))|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[926,theory(equality)])).
% cnf(933,negated_conjecture,(app(esk48_0,X1)=app(app(esk54_0,cons(esk53_0,nil)),app(esk55_0,X1))|~ssList(X1)|$false|~ssList(app(esk54_0,cons(esk53_0,nil)))),inference(rw,[status(thm)],[921,602,theory(equality)])).
% cnf(934,negated_conjecture,(app(esk48_0,X1)=app(app(esk54_0,cons(esk53_0,nil)),app(esk55_0,X1))|~ssList(X1)|~ssList(app(esk54_0,cons(esk53_0,nil)))),inference(cn,[status(thm)],[933,theory(equality)])).
% cnf(1176,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)],[190,583,theory(equality)])).
% cnf(1181,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)],[1176,122,theory(equality)])).
% cnf(1182,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)],[1181,theory(equality)])).
% cnf(2384,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1182,584,theory(equality)])).
% cnf(2385,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2384,122,theory(equality)])).
% cnf(2386,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2385,theory(equality)])).
% cnf(2389,negated_conjecture,(app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[2386,154,theory(equality)])).
% cnf(2554,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[2389,202,theory(equality)])).
% cnf(2793,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[2554,121,theory(equality)])).
% cnf(2794,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2793,122,theory(equality)])).
% cnf(2795,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2794,theory(equality)])).
% cnf(5824,plain,(cons(hd(X1),tl(app(X1,X2)))=app(X1,X2)|app(X1,X2)=nil|nil=X1|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[760,147])).
% cnf(5825,plain,(cons(hd(X1),tl(app(X1,X2)))=app(X1,X2)|nil=X1|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[5824,212])).
% cnf(8005,plain,(app(X1,X2)=nil|nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[862,147])).
% cnf(8006,plain,(nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[8005,212])).
% cnf(10919,plain,(app(X1,app(X2,nil))=app(X1,X2)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[927,147])).
% cnf(15584,negated_conjecture,(app(esk48_0,nil)=app(app(esk54_0,cons(esk53_0,nil)),esk55_0)|~ssList(esk55_0)|~ssList(app(esk54_0,cons(esk53_0,nil)))|~ssList(nil)),inference(spm,[status(thm)],[10919,934,theory(equality)])).
% cnf(15618,negated_conjecture,(app(esk48_0,nil)=esk48_0|~ssList(esk55_0)|~ssList(app(esk54_0,cons(esk53_0,nil)))|~ssList(nil)),inference(rw,[status(thm)],[15584,605,theory(equality)])).
% cnf(15619,negated_conjecture,(app(esk48_0,nil)=esk48_0|$false|~ssList(app(esk54_0,cons(esk53_0,nil)))|~ssList(nil)),inference(rw,[status(thm)],[15618,602,theory(equality)])).
% cnf(15620,negated_conjecture,(app(esk48_0,nil)=esk48_0|$false|~ssList(app(esk54_0,cons(esk53_0,nil)))|$false),inference(rw,[status(thm)],[15619,122,theory(equality)])).
% cnf(15621,negated_conjecture,(app(esk48_0,nil)=esk48_0|~ssList(app(esk54_0,cons(esk53_0,nil)))),inference(cn,[status(thm)],[15620,theory(equality)])).
% cnf(15895,negated_conjecture,(app(esk48_0,nil)=esk48_0|~ssList(cons(esk53_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[15621,147,theory(equality)])).
% cnf(15901,negated_conjecture,(app(esk48_0,nil)=esk48_0|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[15895,600,theory(equality)])).
% cnf(15902,negated_conjecture,(app(esk48_0,nil)=esk48_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[15901,theory(equality)])).
% cnf(16189,negated_conjecture,(tl(esk48_0)=app(tl(esk48_0),nil)|nil=esk48_0|~ssList(nil)|~ssList(esk48_0)|~ssList(cons(esk53_0,nil))),inference(spm,[status(thm)],[343,15902,theory(equality)])).
% cnf(16199,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|nil=esk48_0|~ssList(nil)|~ssList(esk48_0)|~ssList(cons(esk53_0,nil))),inference(spm,[status(thm)],[5825,15902,theory(equality)])).
% cnf(16264,negated_conjecture,(tl(esk48_0)=app(tl(esk48_0),nil)|nil=esk48_0|$false|~ssList(esk48_0)|~ssList(cons(esk53_0,nil))),inference(rw,[status(thm)],[16189,122,theory(equality)])).
% cnf(16265,negated_conjecture,(tl(esk48_0)=app(tl(esk48_0),nil)|nil=esk48_0|$false|$false|~ssList(cons(esk53_0,nil))),inference(rw,[status(thm)],[16264,573,theory(equality)])).
% cnf(16266,negated_conjecture,(tl(esk48_0)=app(tl(esk48_0),nil)|nil=esk48_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[16265,theory(equality)])).
% cnf(16267,negated_conjecture,(app(tl(esk48_0),nil)=tl(esk48_0)|~ssList(cons(esk53_0,nil))),inference(sr,[status(thm)],[16266,576,theory(equality)])).
% cnf(16295,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|nil=esk48_0|$false|~ssList(esk48_0)|~ssList(cons(esk53_0,nil))),inference(rw,[status(thm)],[16199,122,theory(equality)])).
% cnf(16296,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|nil=esk48_0|$false|$false|~ssList(cons(esk53_0,nil))),inference(rw,[status(thm)],[16295,573,theory(equality)])).
% cnf(16297,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|nil=esk48_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[16296,theory(equality)])).
% cnf(16298,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|~ssList(cons(esk53_0,nil))),inference(sr,[status(thm)],[16297,576,theory(equality)])).
% cnf(18992,negated_conjecture,(nil=esk48_0|ssList(tl(esk48_0))|~ssList(nil)|~ssList(esk48_0)|~ssList(cons(esk53_0,nil))),inference(spm,[status(thm)],[8006,16267,theory(equality)])).
% cnf(19109,negated_conjecture,(nil=esk48_0|ssList(tl(esk48_0))|$false|~ssList(esk48_0)|~ssList(cons(esk53_0,nil))),inference(rw,[status(thm)],[18992,122,theory(equality)])).
% cnf(19110,negated_conjecture,(nil=esk48_0|ssList(tl(esk48_0))|$false|$false|~ssList(cons(esk53_0,nil))),inference(rw,[status(thm)],[19109,573,theory(equality)])).
% cnf(19111,negated_conjecture,(nil=esk48_0|ssList(tl(esk48_0))|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[19110,theory(equality)])).
% cnf(19112,negated_conjecture,(ssList(tl(esk48_0))|~ssList(cons(esk53_0,nil))),inference(sr,[status(thm)],[19111,576,theory(equality)])).
% cnf(22987,negated_conjecture,(~ssList(tl(esk48_0))|~ssItem(hd(esk48_0))|~ssList(cons(esk53_0,nil))),inference(spm,[status(thm)],[2795,16298,theory(equality)])).
% cnf(23187,negated_conjecture,(~ssList(cons(esk53_0,nil))|~ssItem(hd(esk48_0))),inference(csr,[status(thm)],[22987,19112])).
% cnf(23188,negated_conjecture,(nil=esk48_0|~ssList(cons(esk53_0,nil))|~ssList(esk48_0)),inference(spm,[status(thm)],[23187,361,theory(equality)])).
% cnf(23191,negated_conjecture,(nil=esk48_0|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[23188,573,theory(equality)])).
% cnf(23192,negated_conjecture,(nil=esk48_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[23191,theory(equality)])).
% cnf(23193,negated_conjecture,(~ssList(cons(esk53_0,nil))),inference(sr,[status(thm)],[23192,576,theory(equality)])).
% cnf(23195,negated_conjecture,(~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[23193,121,theory(equality)])).
% cnf(23199,negated_conjecture,($false|~ssItem(esk53_0)),inference(rw,[status(thm)],[23195,122,theory(equality)])).
% cnf(23200,negated_conjecture,($false|$false),inference(rw,[status(thm)],[23199,598,theory(equality)])).
% cnf(23201,negated_conjecture,($false),inference(cn,[status(thm)],[23200,theory(equality)])).
% cnf(23202,negated_conjecture,($false),23201,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2252
% # ...of these trivial : 30
% # ...subsumed : 1301
% # ...remaining for further processing: 921
% # Other redundant clauses eliminated : 203
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 56
% # Backward-rewritten : 12
% # Generated clauses : 11374
% # ...of the previous two non-trivial : 10432
% # Contextual simplify-reflections : 1082
% # Paramodulations : 11107
% # Factorizations : 0
% # Equation resolutions : 258
% # Current number of processed clauses: 642
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 609
% # Current number of unprocessed clauses: 8188
% # ...number of literals in the above : 61081
% # Clause-clause subsumption calls (NU) : 26132
% # Rec. Clause-clause subsumption calls : 10847
% # Unit Clause-clause subsumption calls : 490
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 500 leaves, 1.41+/-1.261 terms/leaf
% # Paramod-from index: 272 leaves, 1.04+/-0.268 terms/leaf
% # Paramod-into index: 461 leaves, 1.28+/-0.993 terms/leaf
% # -------------------------------------------------
% # User time : 0.649 s
% # System time : 0.023 s
% # Total time : 0.672 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.11 CPU 1.19 WC
% FINAL PrfWatch: 1.11 CPU 1.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP13936/SWC241+1.tptp
%
%------------------------------------------------------------------------------