TSTP Solution File: SWC397+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC397+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 08:02:48 EST 2010
% Result : Theorem 4.42s
% Output : Solution 4.42s
% 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/SystemOnTPTP10251/SWC397+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10251/SWC397+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10251/SWC397+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 10347
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.95 CPU 2.02 WC
% # Preprocessing time : 0.032 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)=>(memberP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(X3,cons(X2,X4))=X1))))),file('/tmp/SRASS.s.p', ax3)).
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(11, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(12, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssItem(X3)=>cons(X3,app(X2,X1))=app(cons(X3,X2),X1)))),file('/tmp/SRASS.s.p', ax27)).
% fof(13, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(14, axiom,![X1]:(ssItem(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(memberP(app(X2,X3),X1)<=>(memberP(X2,X1)|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax36)).
% fof(15, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>![X3]:(ssList(X3)=>(memberP(cons(X2,X3),X1)<=>(X1=X2|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax37)).
% fof(17, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(app(X3,X2)=app(X1,X2)=>X3=X1)))),file('/tmp/SRASS.s.p', ax79)).
% fof(18, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>(app(X2,X3)=app(X2,X1)=>X3=X1)))),file('/tmp/SRASS.s.p', ax80)).
% fof(19, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(40, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5))))|(~(nil=X3)&nil=X4))|(![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>(~(app(cons(X6,nil),X7)=X3)|~(app(X7,cons(X6,nil))=X4))))&neq(X4,nil))))))),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))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5))))|(~(nil=X3)&nil=X4))|(![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>(~(app(cons(X6,nil),X7)=X3)|~(app(X7,cons(X6,nil))=X4))))&neq(X4,nil)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssItem(X5)=>(~(memberP(X1,X5))|memberP(X2,X5))))|(~(nil=X3)&nil=X4))|(![X6]:(ssItem(X6)=>![X7]:(ssList(X7)=>(~(app(cons(X6,nil),X7)=X3)|~(app(X7,cons(X6,nil))=X4))))&neq(X4,nil)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|((~(memberP(X1,X2))|?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(X3,cons(X2,X4))=X1)))&(![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|~(app(X3,cons(X2,X4))=X1)))|memberP(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssItem(X6))|((~(memberP(X5,X6))|?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&app(X7,cons(X6,X8))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(X9,cons(X6,X10))=X5)))|memberP(X5,X6))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssItem(X6))|((~(memberP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(esk3_2(X5,X6),cons(X6,esk4_2(X5,X6)))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(X9,cons(X6,X10))=X5)))|memberP(X5,X6))))),inference(skolemize,[status(esa)],[116])).
% fof(118, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(X9,cons(X6,X10))=X5))|~(ssList(X9)))|memberP(X5,X6))&(~(memberP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(esk3_2(X5,X6),cons(X6,esk4_2(X5,X6)))=X5))))|~(ssItem(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(X9,cons(X6,X10))=X5))|~(ssList(X9)))|memberP(X5,X6))|~(ssItem(X6)))|~(ssList(X5)))&((((ssList(esk3_2(X5,X6))|~(memberP(X5,X6)))|~(ssItem(X6)))|~(ssList(X5)))&((((ssList(esk4_2(X5,X6))|~(memberP(X5,X6)))|~(ssItem(X6)))|~(ssList(X5)))&(((app(esk3_2(X5,X6),cons(X6,esk4_2(X5,X6)))=X5|~(memberP(X5,X6)))|~(ssItem(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[118])).
% cnf(123,plain,(memberP(X1,X2)|~ssList(X1)|~ssItem(X2)|~ssList(X3)|app(X3,cons(X2,X4))!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[119])).
% fof(124, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[4])).
% fof(125, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[125])).
% fof(127, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[126])).
% cnf(128,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[127])).
% fof(130, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% 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)],[6])).
% fof(156, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(157, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[156])).
% fof(158, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[157])).
% cnf(159,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[158])).
% fof(160, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssItem(X3))|cons(X3,app(X2,X1))=app(cons(X3,X2),X1)))),inference(fof_nnf,[status(thm)],[12])).
% fof(161, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssItem(X6))|cons(X6,app(X5,X4))=app(cons(X6,X5),X4)))),inference(variable_rename,[status(thm)],[160])).
% fof(162, plain,![X4]:![X5]:![X6]:(((~(ssItem(X6))|cons(X6,app(X5,X4))=app(cons(X6,X5),X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[161])).
% cnf(163,plain,(cons(X3,app(X2,X1))=app(cons(X3,X2),X1)|~ssList(X1)|~ssList(X2)|~ssItem(X3)),inference(split_conjunct,[status(thm)],[162])).
% fof(164, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[13])).
% 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(167, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|((~(memberP(app(X2,X3),X1))|(memberP(X2,X1)|memberP(X3,X1)))&((~(memberP(X2,X1))&~(memberP(X3,X1)))|memberP(app(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[14])).
% fof(168, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[167])).
% fof(169, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))&((~(memberP(X5,X4))&~(memberP(X6,X4)))|memberP(app(X5,X6),X4))))|~(ssList(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[168])).
% fof(170, plain,![X4]:![X5]:![X6]:(((((~(memberP(app(X5,X6),X4))|(memberP(X5,X4)|memberP(X6,X4)))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&(((((~(memberP(X5,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(app(X5,X6),X4))|~(ssList(X6)))|~(ssList(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[169])).
% cnf(172,plain,(memberP(app(X2,X3),X1)|~ssItem(X1)|~ssList(X2)|~ssList(X3)|~memberP(X2,X1)),inference(split_conjunct,[status(thm)],[170])).
% fof(174, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssList(X3))|((~(memberP(cons(X2,X3),X1))|(X1=X2|memberP(X3,X1)))&((~(X1=X2)&~(memberP(X3,X1)))|memberP(cons(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[15])).
% fof(175, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[174])).
% fof(176, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4))))|~(ssItem(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[175])).
% fof(177, plain,![X4]:![X5]:![X6]:(((((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&(((((~(X4=X5)|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[176])).
% cnf(180,plain,(memberP(X3,X1)|X1=X2|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|~memberP(cons(X2,X3),X1)),inference(split_conjunct,[status(thm)],[177])).
% fof(184, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(app(X3,X2)=app(X1,X2))|X3=X1)))),inference(fof_nnf,[status(thm)],[17])).
% fof(185, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4)))),inference(variable_rename,[status(thm)],[184])).
% fof(186, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(app(X6,X5)=app(X4,X5))|X6=X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[185])).
% cnf(187,plain,(X3=X1|~ssList(X1)|~ssList(X2)|app(X3,X2)!=app(X1,X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[186])).
% fof(188, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|(~(app(X2,X3)=app(X2,X1))|X3=X1)))),inference(fof_nnf,[status(thm)],[18])).
% fof(189, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(X5,X6)=app(X5,X4))|X6=X4)))),inference(variable_rename,[status(thm)],[188])).
% fof(190, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|(~(app(X5,X6)=app(X5,X4))|X6=X4))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[189])).
% cnf(191,plain,(X3=X1|~ssList(X1)|~ssList(X2)|app(X2,X3)!=app(X2,X1)|~ssList(X3)),inference(split_conjunct,[status(thm)],[190])).
% fof(192, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[19])).
% fof(193, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[192])).
% fof(194, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[193])).
% cnf(195,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[194])).
% fof(296, 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)],[40])).
% fof(297, 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)],[296])).
% fof(298, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk18_2(X4,X5))&app(X5,esk18_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[297])).
% fof(299, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk18_2(X4,X5))&app(X5,esk18_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[298])).
% fof(300, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk18_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk18_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[299])).
% cnf(301,plain,(app(X2,esk18_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[300])).
% cnf(302,plain,(ssList(esk18_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[300])).
% cnf(303,plain,(frontsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X2,X3)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[300])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&?[X5]:(ssItem(X5)&(memberP(X1,X5)&~(memberP(X2,X5)))))&(nil=X3|~(nil=X4)))&(?[X6]:(ssItem(X6)&?[X7]:(ssList(X7)&(app(cons(X6,nil),X7)=X3&app(X7,cons(X6,nil))=X4)))|~(neq(X4,nil)))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&((((X9=X11&X8=X10)&?[X12]:(ssItem(X12)&(memberP(X8,X12)&~(memberP(X9,X12)))))&(nil=X10|~(nil=X11)))&(?[X13]:(ssItem(X13)&?[X14]:(ssList(X14)&(app(cons(X13,nil),X14)=X10&app(X14,cons(X13,nil))=X11)))|~(neq(X11,nil)))))))),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)&(ssItem(esk52_0)&(memberP(esk48_0,esk52_0)&~(memberP(esk49_0,esk52_0)))))&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk53_0)&(ssList(esk54_0)&(app(cons(esk53_0,nil),esk54_0)=esk50_0&app(esk54_0,cons(esk53_0,nil))=esk51_0)))|~(neq(esk51_0,nil)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((esk49_0=esk51_0&esk48_0=esk50_0)&(ssItem(esk52_0)&(memberP(esk48_0,esk52_0)&~(memberP(esk49_0,esk52_0)))))&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk53_0)|~(neq(esk51_0,nil)))&((ssList(esk54_0)|~(neq(esk51_0,nil)))&((app(cons(esk53_0,nil),esk54_0)=esk50_0|~(neq(esk51_0,nil)))&(app(esk54_0,cons(esk53_0,nil))=esk51_0|~(neq(esk51_0,nil))))))))))),inference(distribute,[status(thm)],[570])).
% cnf(572,negated_conjecture,(app(esk54_0,cons(esk53_0,nil))=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(573,negated_conjecture,(app(cons(esk53_0,nil),esk54_0)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(574,negated_conjecture,(ssList(esk54_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(575,negated_conjecture,(ssItem(esk53_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(nil=esk50_0|nil!=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(~memberP(esk49_0,esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(memberP(esk48_0,esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(586,negated_conjecture,(~memberP(esk51_0,esk52_0)),inference(rw,[status(thm)],[577,581,theory(equality)])).
% cnf(587,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[585,580,theory(equality)])).
% cnf(588,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[584,581,theory(equality)])).
% cnf(591,negated_conjecture,(memberP(esk50_0,esk52_0)),inference(rw,[status(thm)],[578,580,theory(equality)])).
% cnf(659,negated_conjecture,(ssItem(esk53_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[575,128,theory(equality)])).
% cnf(660,negated_conjecture,(ssList(esk54_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[574,128,theory(equality)])).
% cnf(661,negated_conjecture,(app(esk54_0,cons(esk53_0,nil))=esk51_0|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[572,128,theory(equality)])).
% cnf(662,negated_conjecture,(app(cons(esk53_0,nil),esk54_0)=esk50_0|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[573,128,theory(equality)])).
% cnf(663,negated_conjecture,(ssItem(esk53_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[659,134,theory(equality)])).
% cnf(664,negated_conjecture,(ssItem(esk53_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[663,588,theory(equality)])).
% cnf(665,negated_conjecture,(ssItem(esk53_0)|esk51_0=nil),inference(cn,[status(thm)],[664,theory(equality)])).
% cnf(666,negated_conjecture,(ssList(esk54_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[660,134,theory(equality)])).
% cnf(667,negated_conjecture,(ssList(esk54_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[666,588,theory(equality)])).
% cnf(668,negated_conjecture,(ssList(esk54_0)|esk51_0=nil),inference(cn,[status(thm)],[667,theory(equality)])).
% cnf(669,negated_conjecture,(app(esk54_0,cons(esk53_0,nil))=esk51_0|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[661,134,theory(equality)])).
% cnf(670,negated_conjecture,(app(esk54_0,cons(esk53_0,nil))=esk51_0|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[669,588,theory(equality)])).
% cnf(671,negated_conjecture,(app(esk54_0,cons(esk53_0,nil))=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[670,theory(equality)])).
% cnf(672,negated_conjecture,(app(cons(esk53_0,nil),esk54_0)=esk50_0|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[662,134,theory(equality)])).
% cnf(673,negated_conjecture,(app(cons(esk53_0,nil),esk54_0)=esk50_0|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[672,588,theory(equality)])).
% cnf(674,negated_conjecture,(app(cons(esk53_0,nil),esk54_0)=esk50_0|esk51_0=nil),inference(cn,[status(thm)],[673,theory(equality)])).
% cnf(728,negated_conjecture,(memberP(app(esk50_0,X1),esk52_0)|~ssList(X1)|~ssList(esk50_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[172,591,theory(equality)])).
% cnf(729,negated_conjecture,(memberP(app(esk50_0,X1),esk52_0)|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[728,587,theory(equality)])).
% cnf(730,negated_conjecture,(memberP(app(esk50_0,X1),esk52_0)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[729,579,theory(equality)])).
% cnf(731,negated_conjecture,(memberP(app(esk50_0,X1),esk52_0)|~ssList(X1)),inference(cn,[status(thm)],[730,theory(equality)])).
% cnf(749,plain,(X1=nil|app(X1,X2)!=X2|~ssList(nil)|~ssList(X2)|~ssList(X1)),inference(spm,[status(thm)],[187,166,theory(equality)])).
% cnf(755,plain,(X1=nil|app(X1,X2)!=X2|$false|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[749,134,theory(equality)])).
% cnf(756,plain,(X1=nil|app(X1,X2)!=X2|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[755,theory(equality)])).
% cnf(763,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)|~ssList(app(X1,X2))),inference(er,[status(thm)],[303,theory(equality)])).
% cnf(1351,negated_conjecture,(X1=cons(esk53_0,nil)|esk51_0=nil|app(esk54_0,X1)!=esk51_0|~ssList(cons(esk53_0,nil))|~ssList(esk54_0)|~ssList(X1)),inference(spm,[status(thm)],[191,671,theory(equality)])).
% cnf(1357,negated_conjecture,(memberP(X1,esk53_0)|esk51_0=nil|esk51_0!=X1|~ssList(nil)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)),inference(spm,[status(thm)],[123,671,theory(equality)])).
% cnf(1364,negated_conjecture,(memberP(X1,esk53_0)|esk51_0=nil|esk51_0!=X1|$false|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)),inference(rw,[status(thm)],[1357,134,theory(equality)])).
% cnf(1365,negated_conjecture,(memberP(X1,esk53_0)|esk51_0=nil|esk51_0!=X1|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)),inference(cn,[status(thm)],[1364,theory(equality)])).
% cnf(1391,negated_conjecture,(esk50_0=cons(esk53_0,esk54_0)|esk51_0=nil|~ssList(esk54_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[195,674,theory(equality)])).
% cnf(1411,negated_conjecture,(cons(esk53_0,esk54_0)=esk50_0|esk51_0=nil|~ssList(esk54_0)),inference(csr,[status(thm)],[1391,665])).
% cnf(1412,negated_conjecture,(cons(esk53_0,esk54_0)=esk50_0|esk51_0=nil),inference(csr,[status(thm)],[1411,668])).
% cnf(1422,negated_conjecture,(app(esk50_0,X1)=cons(esk53_0,app(esk54_0,X1))|esk51_0=nil|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)),inference(spm,[status(thm)],[163,1412,theory(equality)])).
% cnf(2483,negated_conjecture,(esk51_0=nil|memberP(X1,esk53_0)|esk51_0!=X1|~ssList(esk54_0)|~ssList(X1)),inference(csr,[status(thm)],[1365,665])).
% cnf(2484,negated_conjecture,(esk51_0=nil|memberP(X1,esk53_0)|esk51_0!=X1|~ssList(X1)),inference(csr,[status(thm)],[2483,668])).
% cnf(2485,negated_conjecture,(esk51_0=nil|memberP(esk51_0,esk53_0)|~ssList(esk51_0)),inference(er,[status(thm)],[2484,theory(equality)])).
% cnf(2486,negated_conjecture,(esk51_0=nil|memberP(esk51_0,esk53_0)|$false),inference(rw,[status(thm)],[2485,588,theory(equality)])).
% cnf(2487,negated_conjecture,(esk51_0=nil|memberP(esk51_0,esk53_0)),inference(cn,[status(thm)],[2486,theory(equality)])).
% cnf(2577,negated_conjecture,(X1=cons(esk53_0,nil)|esk51_0=nil|app(esk54_0,X1)!=esk51_0|~ssList(cons(esk53_0,nil))|~ssList(X1)),inference(csr,[status(thm)],[1351,668])).
% cnf(2578,negated_conjecture,(X1=cons(esk53_0,nil)|esk51_0=nil|app(esk54_0,X1)!=esk51_0|~ssList(X1)|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2577,133,theory(equality)])).
% cnf(2579,negated_conjecture,(X1=cons(esk53_0,nil)|esk51_0=nil|app(esk54_0,X1)!=esk51_0|~ssList(X1)|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2578,134,theory(equality)])).
% cnf(2580,negated_conjecture,(X1=cons(esk53_0,nil)|esk51_0=nil|app(esk54_0,X1)!=esk51_0|~ssList(X1)|~ssItem(esk53_0)),inference(cn,[status(thm)],[2579,theory(equality)])).
% cnf(2581,negated_conjecture,(X1=cons(esk53_0,nil)|esk51_0=nil|app(esk54_0,X1)!=esk51_0|~ssList(X1)),inference(csr,[status(thm)],[2580,665])).
% cnf(5280,plain,(frontsegP(app(X1,X2),X1)|~ssList(X2)|~ssList(X1)),inference(csr,[status(thm)],[763,159])).
% cnf(5286,negated_conjecture,(frontsegP(esk51_0,esk54_0)|esk51_0=nil|~ssList(cons(esk53_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[5280,671,theory(equality)])).
% cnf(5343,negated_conjecture,(esk51_0=nil|frontsegP(esk51_0,esk54_0)|~ssList(cons(esk53_0,nil))),inference(csr,[status(thm)],[5286,668])).
% cnf(5344,negated_conjecture,(esk51_0=nil|frontsegP(esk51_0,esk54_0)|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[5343,133,theory(equality)])).
% cnf(5347,negated_conjecture,(esk51_0=nil|frontsegP(esk51_0,esk54_0)|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[5344,134,theory(equality)])).
% cnf(5348,negated_conjecture,(esk51_0=nil|frontsegP(esk51_0,esk54_0)|~ssItem(esk53_0)),inference(cn,[status(thm)],[5347,theory(equality)])).
% cnf(5367,negated_conjecture,(esk51_0=nil|frontsegP(esk51_0,esk54_0)),inference(csr,[status(thm)],[5348,665])).
% cnf(5368,negated_conjecture,(ssList(esk18_2(esk51_0,esk54_0))|esk51_0=nil|~ssList(esk54_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[302,5367,theory(equality)])).
% cnf(5370,negated_conjecture,(app(esk54_0,esk18_2(esk51_0,esk54_0))=esk51_0|esk51_0=nil|~ssList(esk54_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[301,5367,theory(equality)])).
% cnf(5373,negated_conjecture,(ssList(esk18_2(esk51_0,esk54_0))|esk51_0=nil|~ssList(esk54_0)|$false),inference(rw,[status(thm)],[5368,588,theory(equality)])).
% cnf(5374,negated_conjecture,(ssList(esk18_2(esk51_0,esk54_0))|esk51_0=nil|~ssList(esk54_0)),inference(cn,[status(thm)],[5373,theory(equality)])).
% cnf(5377,negated_conjecture,(app(esk54_0,esk18_2(esk51_0,esk54_0))=esk51_0|esk51_0=nil|~ssList(esk54_0)|$false),inference(rw,[status(thm)],[5370,588,theory(equality)])).
% cnf(5378,negated_conjecture,(app(esk54_0,esk18_2(esk51_0,esk54_0))=esk51_0|esk51_0=nil|~ssList(esk54_0)),inference(cn,[status(thm)],[5377,theory(equality)])).
% cnf(5384,negated_conjecture,(esk51_0=nil|ssList(esk18_2(esk51_0,esk54_0))),inference(csr,[status(thm)],[5374,668])).
% cnf(5420,negated_conjecture,(app(esk54_0,esk18_2(esk51_0,esk54_0))=esk51_0|esk51_0=nil),inference(csr,[status(thm)],[5378,668])).
% cnf(5440,negated_conjecture,(esk18_2(esk51_0,esk54_0)=cons(esk53_0,nil)|esk51_0=nil|~ssList(esk18_2(esk51_0,esk54_0))),inference(spm,[status(thm)],[2581,5420,theory(equality)])).
% cnf(5502,negated_conjecture,(esk18_2(esk51_0,esk54_0)=cons(esk53_0,nil)|esk51_0=nil),inference(csr,[status(thm)],[5440,5384])).
% cnf(5504,negated_conjecture,(esk51_0=nil|ssList(cons(esk53_0,nil))),inference(spm,[status(thm)],[5384,5502,theory(equality)])).
% cnf(59538,negated_conjecture,(cons(esk53_0,app(esk54_0,X1))=app(esk50_0,X1)|esk51_0=nil|~ssList(esk54_0)|~ssList(X1)),inference(csr,[status(thm)],[1422,665])).
% cnf(59539,negated_conjecture,(cons(esk53_0,app(esk54_0,X1))=app(esk50_0,X1)|esk51_0=nil|~ssList(X1)),inference(csr,[status(thm)],[59538,668])).
% cnf(59771,negated_conjecture,(cons(esk53_0,esk51_0)=app(esk50_0,cons(esk53_0,nil))|esk51_0=nil|~ssList(cons(esk53_0,nil))),inference(spm,[status(thm)],[59539,671,theory(equality)])).
% cnf(59826,negated_conjecture,(app(esk50_0,cons(esk53_0,nil))=cons(esk53_0,esk51_0)|esk51_0=nil),inference(csr,[status(thm)],[59771,5504])).
% cnf(59833,negated_conjecture,(esk50_0=nil|esk51_0=nil|cons(esk53_0,esk51_0)!=cons(esk53_0,nil)|~ssList(cons(esk53_0,nil))|~ssList(esk50_0)),inference(spm,[status(thm)],[756,59826,theory(equality)])).
% cnf(59978,negated_conjecture,(memberP(cons(esk53_0,esk51_0),esk52_0)|esk51_0=nil|~ssList(cons(esk53_0,nil))),inference(spm,[status(thm)],[731,59826,theory(equality)])).
% cnf(59994,negated_conjecture,(esk50_0=nil|esk51_0=nil|cons(esk53_0,esk51_0)!=cons(esk53_0,nil)|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[59833,587,theory(equality)])).
% cnf(59995,negated_conjecture,(esk50_0=nil|esk51_0=nil|cons(esk53_0,esk51_0)!=cons(esk53_0,nil)|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[59994,theory(equality)])).
% cnf(60360,negated_conjecture,(esk50_0=nil|esk51_0=nil|cons(esk53_0,esk51_0)!=cons(esk53_0,nil)),inference(csr,[status(thm)],[59995,5504])).
% cnf(60361,negated_conjecture,(esk50_0=nil|cons(esk53_0,esk51_0)!=cons(esk53_0,nil)),inference(csr,[status(thm)],[60360,576])).
% cnf(60365,negated_conjecture,(esk51_0=nil|memberP(cons(esk53_0,esk51_0),esk52_0)),inference(csr,[status(thm)],[59978,5504])).
% cnf(60375,negated_conjecture,(esk52_0=esk53_0|memberP(esk51_0,esk52_0)|esk51_0=nil|~ssList(esk51_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[180,60365,theory(equality)])).
% cnf(60394,negated_conjecture,(esk52_0=esk53_0|memberP(esk51_0,esk52_0)|esk51_0=nil|$false|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[60375,588,theory(equality)])).
% cnf(60395,negated_conjecture,(esk52_0=esk53_0|memberP(esk51_0,esk52_0)|esk51_0=nil|$false|~ssItem(esk53_0)|$false),inference(rw,[status(thm)],[60394,579,theory(equality)])).
% cnf(60396,negated_conjecture,(esk52_0=esk53_0|memberP(esk51_0,esk52_0)|esk51_0=nil|~ssItem(esk53_0)),inference(cn,[status(thm)],[60395,theory(equality)])).
% cnf(60397,negated_conjecture,(esk53_0=esk52_0|esk51_0=nil|~ssItem(esk53_0)),inference(sr,[status(thm)],[60396,586,theory(equality)])).
% cnf(60398,negated_conjecture,(esk53_0=esk52_0|esk51_0=nil),inference(csr,[status(thm)],[60397,665])).
% cnf(60417,negated_conjecture,(esk51_0=nil|memberP(esk51_0,esk52_0)),inference(spm,[status(thm)],[2487,60398,theory(equality)])).
% cnf(60558,negated_conjecture,(esk51_0=nil),inference(sr,[status(thm)],[60417,586,theory(equality)])).
% cnf(60585,negated_conjecture,(esk50_0=nil|$false),inference(rw,[status(thm)],[60361,60558,theory(equality)])).
% cnf(60586,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[60585,theory(equality)])).
% cnf(61271,negated_conjecture,(~memberP(nil,esk52_0)),inference(rw,[status(thm)],[586,60558,theory(equality)])).
% cnf(61634,negated_conjecture,(memberP(nil,esk52_0)),inference(rw,[status(thm)],[591,60586,theory(equality)])).
% cnf(61641,negated_conjecture,($false),inference(sr,[status(thm)],[61634,61271,theory(equality)])).
% cnf(61642,negated_conjecture,($false),61641,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5125
% # ...of these trivial : 17
% # ...subsumed : 3677
% # ...remaining for further processing: 1431
% # Other redundant clauses eliminated : 767
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 129
% # Backward-rewritten : 725
% # Generated clauses : 30056
% # ...of the previous two non-trivial : 27812
% # Contextual simplify-reflections : 4636
% # Paramodulations : 29116
% # Factorizations : 0
% # Equation resolutions : 940
% # Current number of processed clauses: 570
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 544
% # Current number of unprocessed clauses: 6634
% # ...number of literals in the above : 59992
% # Clause-clause subsumption calls (NU) : 309883
% # Rec. Clause-clause subsumption calls : 134243
% # Unit Clause-clause subsumption calls : 1860
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 25
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 528 leaves, 1.60+/-1.340 terms/leaf
% # Paramod-from index: 187 leaves, 1.01+/-0.073 terms/leaf
% # Paramod-into index: 338 leaves, 1.45+/-1.287 terms/leaf
% # -------------------------------------------------
% # User time : 1.918 s
% # System time : 0.061 s
% # Total time : 1.979 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.14 CPU 3.31 WC
% FINAL PrfWatch: 3.14 CPU 3.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP10251/SWC397+1.tptp
%
%------------------------------------------------------------------------------