TSTP Solution File: SWC232+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC232+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 07:27:18 EST 2010
% Result : Theorem 2.31s
% Output : Solution 2.31s
% 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/SystemOnTPTP7071/SWC232+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7071/SWC232+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7071/SWC232+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 7167
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 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)))|~(leq(X5,X8)))|lt(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(X9,X12)))&memberP(X10,X12))&memberP(X11,X12))<(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)))|~(leq(X5,X8)))|lt(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(X9,X12)))&memberP(X10,X12))&memberP(X11,X12))<(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)))|~(leq(X5,X8)))|lt(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(X9,X12)))&memberP(X10,X12))&memberP(X11,X12))<(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))&leq(X5,X8))&~(lt(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(X9,X12))|~(memberP(X10,X12)))|~(memberP(X11,X12)))|~(lt(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))&leq(X17,X20))&~(lt(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(X21,X24))|~(memberP(X22,X24)))|~(memberP(X23,X24)))|~(lt(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)))&leq(X17,esk52_3(X17,X18,X19)))&~(lt(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(esk53_0,X24))|~(memberP(esk54_0,X24)))|~(memberP(esk55_0,X24)))|~(lt(esk53_0,X24))))))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X17]:![X18]:![X19]:![X24]:((((((((((((((~(ssItem(X24))|leq(esk53_0,X24))|~(memberP(esk54_0,X24)))|~(memberP(esk55_0,X24)))|~(lt(esk53_0,X24)))&app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk50_0)&ssList(esk55_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)))&leq(X17,esk52_3(X17,X18,X19)))&~(lt(X17,esk52_3(X17,X18,X19))))))|~(ssList(X18)))|~(ssItem(X17)))&((esk49_0=esk51_0&esk48_0=esk50_0)&~(nil=esk48_0))))&ssList(esk51_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(esk53_0,X24))|~(memberP(esk54_0,X24)))|~(memberP(esk55_0,X24)))|~(lt(esk53_0,X24)))|nil=esk50_0)&(app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk50_0|nil=esk50_0))&(ssList(esk55_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))))&(((leq(X17,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)))))&((esk49_0=esk51_0&esk48_0=esk50_0)&~(nil=esk48_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(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(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|ssList(esk55_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(nil=esk50_0|app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(597,negated_conjecture,(esk48_0=nil|ssItem(esk53_0)),inference(rw,[status(thm)],[585,578,theory(equality)])).
% cnf(598,negated_conjecture,(ssItem(esk53_0)),inference(sr,[status(thm)],[597,577,theory(equality)])).
% cnf(599,negated_conjecture,(esk48_0=nil|ssList(esk54_0)),inference(rw,[status(thm)],[586,578,theory(equality)])).
% cnf(600,negated_conjecture,(ssList(esk54_0)),inference(sr,[status(thm)],[599,577,theory(equality)])).
% cnf(601,negated_conjecture,(esk48_0=nil|ssList(esk55_0)),inference(rw,[status(thm)],[587,578,theory(equality)])).
% cnf(602,negated_conjecture,(ssList(esk55_0)),inference(sr,[status(thm)],[601,577,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)],[588,578,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,578,theory(equality)])).
% cnf(605,negated_conjecture,(app(app(esk54_0,cons(esk53_0,nil)),esk55_0)=esk48_0),inference(sr,[status(thm)],[604,577,theory(equality)])).
% cnf(761,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(863,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(901,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(922,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(927,plain,(app(X1,app(X2,nil))=app(X1,X2)|~ssList(app(X1,X2))|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[901,122,theory(equality)])).
% cnf(928,plain,(app(X1,app(X2,nil))=app(X1,X2)|~ssList(app(X1,X2))|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[927,theory(equality)])).
% cnf(934,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)],[922,602,theory(equality)])).
% cnf(935,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)],[934,theory(equality)])).
% cnf(1177,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(1182,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)],[1177,122,theory(equality)])).
% cnf(1183,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)],[1182,theory(equality)])).
% cnf(2385,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1183,584,theory(equality)])).
% cnf(2386,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2385,122,theory(equality)])).
% cnf(2387,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2386,theory(equality)])).
% cnf(2390,negated_conjecture,(app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[2387,154,theory(equality)])).
% cnf(2555,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[2390,202,theory(equality)])).
% cnf(2794,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[2555,121,theory(equality)])).
% cnf(2795,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2794,122,theory(equality)])).
% cnf(2796,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2795,theory(equality)])).
% cnf(6001,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)],[761,147])).
% cnf(6002,plain,(cons(hd(X1),tl(app(X1,X2)))=app(X1,X2)|nil=X1|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[6001,212])).
% cnf(8068,plain,(app(X1,X2)=nil|nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[863,147])).
% cnf(8069,plain,(nil=X1|ssList(app(tl(X1),X2))|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[8068,212])).
% cnf(11010,plain,(app(X1,app(X2,nil))=app(X1,X2)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[928,147])).
% cnf(15691,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)],[11010,935,theory(equality)])).
% cnf(15725,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)],[15691,605,theory(equality)])).
% cnf(15726,negated_conjecture,(app(esk48_0,nil)=esk48_0|$false|~ssList(app(esk54_0,cons(esk53_0,nil)))|~ssList(nil)),inference(rw,[status(thm)],[15725,602,theory(equality)])).
% cnf(15727,negated_conjecture,(app(esk48_0,nil)=esk48_0|$false|~ssList(app(esk54_0,cons(esk53_0,nil)))|$false),inference(rw,[status(thm)],[15726,122,theory(equality)])).
% cnf(15728,negated_conjecture,(app(esk48_0,nil)=esk48_0|~ssList(app(esk54_0,cons(esk53_0,nil)))),inference(cn,[status(thm)],[15727,theory(equality)])).
% cnf(16002,negated_conjecture,(app(esk48_0,nil)=esk48_0|~ssList(cons(esk53_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[15728,147,theory(equality)])).
% cnf(16008,negated_conjecture,(app(esk48_0,nil)=esk48_0|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[16002,600,theory(equality)])).
% cnf(16009,negated_conjecture,(app(esk48_0,nil)=esk48_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[16008,theory(equality)])).
% cnf(16013,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,16009,theory(equality)])).
% cnf(16023,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)],[6002,16009,theory(equality)])).
% cnf(16087,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)],[16013,122,theory(equality)])).
% cnf(16088,negated_conjecture,(tl(esk48_0)=app(tl(esk48_0),nil)|nil=esk48_0|$false|$false|~ssList(cons(esk53_0,nil))),inference(rw,[status(thm)],[16087,573,theory(equality)])).
% cnf(16089,negated_conjecture,(tl(esk48_0)=app(tl(esk48_0),nil)|nil=esk48_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[16088,theory(equality)])).
% cnf(16090,negated_conjecture,(app(tl(esk48_0),nil)=tl(esk48_0)|~ssList(cons(esk53_0,nil))),inference(sr,[status(thm)],[16089,577,theory(equality)])).
% cnf(16118,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)],[16023,122,theory(equality)])).
% cnf(16119,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)],[16118,573,theory(equality)])).
% cnf(16120,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|nil=esk48_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[16119,theory(equality)])).
% cnf(16121,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|~ssList(cons(esk53_0,nil))),inference(sr,[status(thm)],[16120,577,theory(equality)])).
% cnf(19087,negated_conjecture,(nil=esk48_0|ssList(tl(esk48_0))|~ssList(nil)|~ssList(esk48_0)|~ssList(cons(esk53_0,nil))),inference(spm,[status(thm)],[8069,16090,theory(equality)])).
% cnf(19204,negated_conjecture,(nil=esk48_0|ssList(tl(esk48_0))|$false|~ssList(esk48_0)|~ssList(cons(esk53_0,nil))),inference(rw,[status(thm)],[19087,122,theory(equality)])).
% cnf(19205,negated_conjecture,(nil=esk48_0|ssList(tl(esk48_0))|$false|$false|~ssList(cons(esk53_0,nil))),inference(rw,[status(thm)],[19204,573,theory(equality)])).
% cnf(19206,negated_conjecture,(nil=esk48_0|ssList(tl(esk48_0))|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[19205,theory(equality)])).
% cnf(19207,negated_conjecture,(ssList(tl(esk48_0))|~ssList(cons(esk53_0,nil))),inference(sr,[status(thm)],[19206,577,theory(equality)])).
% cnf(23227,negated_conjecture,(~ssList(tl(esk48_0))|~ssItem(hd(esk48_0))|~ssList(cons(esk53_0,nil))),inference(spm,[status(thm)],[2796,16121,theory(equality)])).
% cnf(23310,negated_conjecture,(~ssList(cons(esk53_0,nil))|~ssItem(hd(esk48_0))),inference(csr,[status(thm)],[23227,19207])).
% cnf(23311,negated_conjecture,(nil=esk48_0|~ssList(cons(esk53_0,nil))|~ssList(esk48_0)),inference(spm,[status(thm)],[23310,361,theory(equality)])).
% cnf(23314,negated_conjecture,(nil=esk48_0|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[23311,573,theory(equality)])).
% cnf(23315,negated_conjecture,(nil=esk48_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[23314,theory(equality)])).
% cnf(23316,negated_conjecture,(~ssList(cons(esk53_0,nil))),inference(sr,[status(thm)],[23315,577,theory(equality)])).
% cnf(23318,negated_conjecture,(~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[23316,121,theory(equality)])).
% cnf(23322,negated_conjecture,($false|~ssItem(esk53_0)),inference(rw,[status(thm)],[23318,122,theory(equality)])).
% cnf(23323,negated_conjecture,($false|$false),inference(rw,[status(thm)],[23322,598,theory(equality)])).
% cnf(23324,negated_conjecture,($false),inference(cn,[status(thm)],[23323,theory(equality)])).
% cnf(23325,negated_conjecture,($false),23324,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2270
% # ...of these trivial : 31
% # ...subsumed : 1311
% # ...remaining for further processing: 928
% # Other redundant clauses eliminated : 203
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 57
% # Backward-rewritten : 13
% # Generated clauses : 11428
% # ...of the previous two non-trivial : 10477
% # Contextual simplify-reflections : 1088
% # Paramodulations : 11161
% # Factorizations : 0
% # Equation resolutions : 258
% # Current number of processed clauses: 647
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 614
% # Current number of unprocessed clauses: 8208
% # ...number of literals in the above : 61203
% # Clause-clause subsumption calls (NU) : 26300
% # Rec. Clause-clause subsumption calls : 10937
% # Unit Clause-clause subsumption calls : 493
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 501 leaves, 1.41+/-1.260 terms/leaf
% # Paramod-from index: 274 leaves, 1.05+/-0.273 terms/leaf
% # Paramod-into index: 462 leaves, 1.28+/-0.997 terms/leaf
% # -------------------------------------------------
% # User time : 0.708 s
% # System time : 0.016 s
% # Total time : 0.724 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.19 CPU 1.29 WC
% FINAL PrfWatch: 1.19 CPU 1.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP7071/SWC232+1.tptp
%
%------------------------------------------------------------------------------