TSTP Solution File: SWC022+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC022+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 : art05.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 06:51:32 EST 2010
% Result : Theorem 9.12s
% Output : Solution 9.12s
% 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/SystemOnTPTP15628/SWC022+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15628/SWC022+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15628/SWC022+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 15724
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.91 CPU 6.02 WC
% PrfWatch: 7.90 CPU 8.02 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% 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(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(10, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(11, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>hd(cons(X2,X1))=X2)),file('/tmp/SRASS.s.p', ax23)).
% fof(14, axiom,![X1]:(ssList(X1)=>frontsegP(X1,X1)),file('/tmp/SRASS.s.p', ax42)).
% fof(16, axiom,![X1]:(ssList(X1)=>frontsegP(X1,nil)),file('/tmp/SRASS.s.p', ax45)).
% fof(19, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(20, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>cons(hd(X1),tl(X1))=X1)),file('/tmp/SRASS.s.p', ax78)).
% fof(23, axiom,![X1]:(ssList(X1)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(24, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(41, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|?[X6]:((ssList(X6)&~(X3=X6))&?[X7]:(((ssItem(X7)&cons(X7,nil)=X6)&hd(X4)=X7)&neq(nil,X4))))&(~(neq(X2,nil))|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))|(((~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|?[X6]:((ssList(X6)&~(X3=X6))&?[X7]:(((ssItem(X7)&cons(X7,nil)=X6)&hd(X4)=X7)&neq(nil,X4))))&(~(neq(X2,nil))|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))|(((~(neq(X2,nil))|?[X5]:(((ssList(X5)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|?[X6]:((ssList(X6)&~(X3=X6))&?[X7]:(((ssItem(X7)&cons(X7,nil)=X6)&hd(X4)=X7)&neq(nil,X4))))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[116])).
% fof(118, 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)],[117])).
% cnf(119,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[118])).
% fof(121, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(122, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[121])).
% fof(123, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[122])).
% cnf(124,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[123])).
% cnf(125,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(143, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(144, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[143])).
% fof(145, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[144])).
% cnf(146,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[145])).
% fof(147, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(148, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[147])).
% cnf(149,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[148])).
% fof(150, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|hd(cons(X2,X1))=X2)),inference(fof_nnf,[status(thm)],[11])).
% fof(151, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|hd(cons(X4,X3))=X4)),inference(variable_rename,[status(thm)],[150])).
% fof(152, plain,![X3]:![X4]:((~(ssItem(X4))|hd(cons(X4,X3))=X4)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[151])).
% cnf(153,plain,(hd(cons(X2,X1))=X2|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[152])).
% fof(162, plain,![X1]:(~(ssList(X1))|frontsegP(X1,X1)),inference(fof_nnf,[status(thm)],[14])).
% fof(163, plain,![X2]:(~(ssList(X2))|frontsegP(X2,X2)),inference(variable_rename,[status(thm)],[162])).
% cnf(164,plain,(frontsegP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[163])).
% fof(172, plain,![X1]:(~(ssList(X1))|frontsegP(X1,nil)),inference(fof_nnf,[status(thm)],[16])).
% fof(173, plain,![X2]:(~(ssList(X2))|frontsegP(X2,nil)),inference(variable_rename,[status(thm)],[172])).
% cnf(174,plain,(frontsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[173])).
% fof(186, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[19])).
% fof(187, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[186])).
% fof(188, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[187])).
% cnf(189,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[188])).
% fof(190, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[20])).
% fof(191, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[190])).
% cnf(192,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[191])).
% fof(201, plain,![X1]:(~(ssList(X1))|((~(singletonP(X1))|?[X2]:(ssItem(X2)&cons(X2,nil)=X1))&(![X2]:(~(ssItem(X2))|~(cons(X2,nil)=X1))|singletonP(X1)))),inference(fof_nnf,[status(thm)],[23])).
% fof(202, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|?[X4]:(ssItem(X4)&cons(X4,nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(variable_rename,[status(thm)],[201])).
% fof(203, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk6_1(X3))&cons(esk6_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[202])).
% fof(204, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk6_1(X3))&cons(esk6_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[203])).
% fof(205, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk6_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk6_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[204])).
% cnf(206,plain,(cons(esk6_1(X1),nil)=X1|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[205])).
% cnf(207,plain,(ssItem(esk6_1(X1))|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[205])).
% cnf(208,plain,(singletonP(X1)|~ssList(X1)|cons(X2,nil)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[205])).
% fof(209, 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)],[24])).
% fof(210, 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)],[209])).
% fof(211, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk7_2(X4,X5))&app(X5,esk7_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[210])).
% fof(212, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk7_2(X4,X5))&app(X5,esk7_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[211])).
% fof(213, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk7_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk7_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[212])).
% cnf(216,plain,(frontsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X2,X3)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[213])).
% fof(288, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[41])).
% fof(289, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[288])).
% cnf(290,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[289])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(frontsegP(X2,X5)))|~(frontsegP(X1,X5))))&![X6]:((~(ssList(X6))|X3=X6)|![X7]:(((~(ssItem(X7))|~(cons(X7,nil)=X6))|~(hd(X4)=X7))|~(neq(nil,X4)))))|(neq(X2,nil)&~(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)&(((neq(X9,nil)&![X12]:(((~(ssList(X12))|~(neq(X12,nil)))|~(frontsegP(X9,X12)))|~(frontsegP(X8,X12))))&![X13]:((~(ssList(X13))|X10=X13)|![X14]:(((~(ssItem(X14))|~(cons(X14,nil)=X13))|~(hd(X11)=X14))|~(neq(nil,X11)))))|(neq(X9,nil)&~(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)&(((neq(esk49_0,nil)&![X12]:(((~(ssList(X12))|~(neq(X12,nil)))|~(frontsegP(esk49_0,X12)))|~(frontsegP(esk48_0,X12))))&![X13]:((~(ssList(X13))|esk50_0=X13)|![X14]:(((~(ssItem(X14))|~(cons(X14,nil)=X13))|~(hd(esk51_0)=X14))|~(neq(nil,esk51_0)))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X12]:![X13]:![X14]:(((((((((((~(ssItem(X14))|~(cons(X14,nil)=X13))|~(hd(esk51_0)=X14))|~(neq(nil,esk51_0)))|(~(ssList(X13))|esk50_0=X13))&((((~(ssList(X12))|~(neq(X12,nil)))|~(frontsegP(esk49_0,X12)))|~(frontsegP(esk48_0,X12)))&neq(esk49_0,nil)))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X12]:![X13]:![X14]:((((((((neq(esk49_0,nil)|((((~(ssItem(X14))|~(cons(X14,nil)=X13))|~(hd(esk51_0)=X14))|~(neq(nil,esk51_0)))|(~(ssList(X13))|esk50_0=X13)))&(~(neq(esk51_0,nil))|((((~(ssItem(X14))|~(cons(X14,nil)=X13))|~(hd(esk51_0)=X14))|~(neq(nil,esk51_0)))|(~(ssList(X13))|esk50_0=X13))))&(((neq(esk49_0,nil)|(((~(ssList(X12))|~(neq(X12,nil)))|~(frontsegP(esk49_0,X12)))|~(frontsegP(esk48_0,X12))))&(~(neq(esk51_0,nil))|(((~(ssList(X12))|~(neq(X12,nil)))|~(frontsegP(esk49_0,X12)))|~(frontsegP(esk48_0,X12)))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil)))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(~frontsegP(esk48_0,X1)|~frontsegP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk50_0=X1|~ssList(X1)|~neq(nil,esk51_0)|hd(esk51_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,578,theory(equality)])).
% cnf(588,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[580,578,theory(equality)])).
% cnf(595,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~frontsegP(esk48_0,X1)|~frontsegP(esk51_0,X1)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,578,theory(equality)])).
% cnf(596,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~frontsegP(esk48_0,X1)|~frontsegP(esk51_0,X1)|$false),inference(rw,[status(thm)],[595,588,theory(equality)])).
% cnf(597,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~frontsegP(esk48_0,X1)|~frontsegP(esk51_0,X1)),inference(cn,[status(thm)],[596,theory(equality)])).
% cnf(598,negated_conjecture,(~frontsegP(esk51_0,nil)|~ssList(nil)|~neq(nil,nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[597,174,theory(equality)])).
% cnf(599,negated_conjecture,(~frontsegP(esk51_0,esk48_0)|~ssList(esk48_0)|~neq(esk48_0,nil)),inference(spm,[status(thm)],[597,164,theory(equality)])).
% cnf(600,negated_conjecture,(~frontsegP(esk51_0,nil)|$false|~neq(nil,nil)|~ssList(esk48_0)),inference(rw,[status(thm)],[598,125,theory(equality)])).
% cnf(601,negated_conjecture,(~frontsegP(esk51_0,nil)|$false|~neq(nil,nil)|$false),inference(rw,[status(thm)],[600,573,theory(equality)])).
% cnf(602,negated_conjecture,(~frontsegP(esk51_0,nil)|~neq(nil,nil)),inference(cn,[status(thm)],[601,theory(equality)])).
% cnf(603,negated_conjecture,(~frontsegP(esk51_0,esk48_0)|$false|~neq(esk48_0,nil)),inference(rw,[status(thm)],[599,573,theory(equality)])).
% cnf(604,negated_conjecture,(~frontsegP(esk51_0,esk48_0)|~neq(esk48_0,nil)),inference(cn,[status(thm)],[603,theory(equality)])).
% cnf(632,plain,(singletonP(cons(X1,nil))|~ssList(cons(X1,nil))|~ssItem(X1)),inference(er,[status(thm)],[208,theory(equality)])).
% cnf(636,plain,(hd(X1)=esk6_1(X1)|~ssList(nil)|~ssItem(esk6_1(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[153,206,theory(equality)])).
% cnf(651,plain,(hd(X1)=esk6_1(X1)|$false|~ssItem(esk6_1(X1))|~singletonP(X1)|~ssList(X1)),inference(rw,[status(thm)],[636,125,theory(equality)])).
% cnf(652,plain,(hd(X1)=esk6_1(X1)|~ssItem(esk6_1(X1))|~singletonP(X1)|~ssList(X1)),inference(cn,[status(thm)],[651,theory(equality)])).
% cnf(654,negated_conjecture,(esk48_0=X1|hd(esk51_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk51_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[583,577,theory(equality)])).
% cnf(655,negated_conjecture,(esk48_0=X1|hd(esk51_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk51_0)|$false),inference(rw,[status(thm)],[654,588,theory(equality)])).
% cnf(656,negated_conjecture,(esk48_0=X1|hd(esk51_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk51_0)),inference(cn,[status(thm)],[655,theory(equality)])).
% cnf(670,negated_conjecture,(esk48_0=X1|nil=esk51_0|cons(X2,nil)!=X1|hd(esk51_0)!=X2|~ssList(X1)|~ssItem(X2)|~ssList(esk51_0)|~ssList(nil)),inference(spm,[status(thm)],[656,119,theory(equality)])).
% cnf(671,negated_conjecture,(esk48_0=X1|nil=esk51_0|cons(X2,nil)!=X1|hd(esk51_0)!=X2|~ssList(X1)|~ssItem(X2)|$false|~ssList(nil)),inference(rw,[status(thm)],[670,585,theory(equality)])).
% cnf(672,negated_conjecture,(esk48_0=X1|nil=esk51_0|cons(X2,nil)!=X1|hd(esk51_0)!=X2|~ssList(X1)|~ssItem(X2)|$false|$false),inference(rw,[status(thm)],[671,125,theory(equality)])).
% cnf(673,negated_conjecture,(esk48_0=X1|nil=esk51_0|cons(X2,nil)!=X1|hd(esk51_0)!=X2|~ssList(X1)|~ssItem(X2)),inference(cn,[status(thm)],[672,theory(equality)])).
% cnf(722,plain,(frontsegP(X1,cons(X2,nil))|cons(X2,X3)!=X1|~ssList(X3)|~ssList(cons(X2,nil))|~ssList(X1)|~ssItem(X2)),inference(spm,[status(thm)],[216,189,theory(equality)])).
% cnf(1333,negated_conjecture,(~neq(nil,nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[602,174,theory(equality)])).
% cnf(1334,negated_conjecture,(~neq(nil,nil)|$false),inference(rw,[status(thm)],[1333,585,theory(equality)])).
% cnf(1335,negated_conjecture,(~neq(nil,nil)),inference(cn,[status(thm)],[1334,theory(equality)])).
% cnf(1603,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[632,124,theory(equality)])).
% cnf(1604,plain,(singletonP(cons(X1,nil))|~ssItem(X1)|$false),inference(rw,[status(thm)],[1603,125,theory(equality)])).
% cnf(1605,plain,(singletonP(cons(X1,nil))|~ssItem(X1)),inference(cn,[status(thm)],[1604,theory(equality)])).
% cnf(1745,plain,(esk6_1(X1)=hd(X1)|~singletonP(X1)|~ssList(X1)),inference(csr,[status(thm)],[652,207])).
% cnf(1746,plain,(ssItem(hd(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[207,1745,theory(equality)])).
% cnf(1747,plain,(cons(hd(X1),nil)=X1|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[206,1745,theory(equality)])).
% cnf(1754,plain,(ssItem(hd(cons(X1,nil)))|~ssList(cons(X1,nil))|~ssItem(X1)),inference(spm,[status(thm)],[1746,1605,theory(equality)])).
% cnf(1756,plain,(ssItem(hd(cons(X1,nil)))|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1754,124,theory(equality)])).
% cnf(1757,plain,(ssItem(hd(cons(X1,nil)))|~ssItem(X1)|$false),inference(rw,[status(thm)],[1756,125,theory(equality)])).
% cnf(1758,plain,(ssItem(hd(cons(X1,nil)))|~ssItem(X1)),inference(cn,[status(thm)],[1757,theory(equality)])).
% cnf(1763,plain,(cons(hd(cons(X1,nil)),nil)=cons(X1,nil)|~ssList(cons(X1,nil))|~ssItem(X1)),inference(spm,[status(thm)],[1747,1605,theory(equality)])).
% cnf(1765,plain,(cons(hd(cons(X1,nil)),nil)=cons(X1,nil)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1763,124,theory(equality)])).
% cnf(1766,plain,(cons(hd(cons(X1,nil)),nil)=cons(X1,nil)|~ssItem(X1)|$false),inference(rw,[status(thm)],[1765,125,theory(equality)])).
% cnf(1767,plain,(cons(hd(cons(X1,nil)),nil)=cons(X1,nil)|~ssItem(X1)),inference(cn,[status(thm)],[1766,theory(equality)])).
% cnf(1770,plain,(ssList(cons(X1,nil))|~ssList(nil)|~ssItem(hd(cons(X1,nil)))|~ssItem(X1)),inference(spm,[status(thm)],[124,1767,theory(equality)])).
% cnf(1811,plain,(ssList(cons(X1,nil))|$false|~ssItem(hd(cons(X1,nil)))|~ssItem(X1)),inference(rw,[status(thm)],[1770,125,theory(equality)])).
% cnf(1812,plain,(ssList(cons(X1,nil))|~ssItem(hd(cons(X1,nil)))|~ssItem(X1)),inference(cn,[status(thm)],[1811,theory(equality)])).
% cnf(1866,plain,(ssList(cons(X1,nil))|~ssItem(X1)),inference(csr,[status(thm)],[1812,1758])).
% cnf(2135,negated_conjecture,(esk51_0=nil|esk48_0=X1|cons(hd(esk51_0),nil)!=X1|~ssList(X1)|~ssItem(hd(esk51_0))),inference(er,[status(thm)],[673,theory(equality)])).
% cnf(2136,negated_conjecture,(esk51_0=nil|esk48_0=X1|cons(hd(esk51_0),nil)!=X1|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[2135,149,theory(equality)])).
% cnf(2137,negated_conjecture,(esk51_0=nil|esk48_0=X1|cons(hd(esk51_0),nil)!=X1|~ssList(X1)|$false),inference(rw,[status(thm)],[2136,585,theory(equality)])).
% cnf(2138,negated_conjecture,(esk51_0=nil|esk48_0=X1|cons(hd(esk51_0),nil)!=X1|~ssList(X1)),inference(cn,[status(thm)],[2137,theory(equality)])).
% cnf(2139,negated_conjecture,(esk51_0=nil|esk48_0=cons(hd(esk51_0),nil)|~ssList(cons(hd(esk51_0),nil))),inference(er,[status(thm)],[2138,theory(equality)])).
% cnf(2140,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|~ssList(nil)|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[2139,124,theory(equality)])).
% cnf(2142,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|$false|~ssItem(hd(esk51_0))),inference(rw,[status(thm)],[2140,125,theory(equality)])).
% cnf(2143,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|~ssItem(hd(esk51_0))),inference(cn,[status(thm)],[2142,theory(equality)])).
% cnf(2144,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2143,149,theory(equality)])).
% cnf(2145,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil|$false),inference(rw,[status(thm)],[2144,585,theory(equality)])).
% cnf(2146,negated_conjecture,(cons(hd(esk51_0),nil)=esk48_0|esk51_0=nil),inference(cn,[status(thm)],[2145,theory(equality)])).
% cnf(2150,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|~ssList(nil)|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[153,2146,theory(equality)])).
% cnf(2183,negated_conjecture,(ssItem(hd(esk48_0))|esk51_0=nil|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[1758,2146,theory(equality)])).
% cnf(2186,negated_conjecture,(cons(hd(esk48_0),nil)=esk48_0|esk51_0=nil|~ssItem(hd(esk51_0))),inference(spm,[status(thm)],[1767,2146,theory(equality)])).
% cnf(2199,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|$false|~ssItem(hd(esk51_0))),inference(rw,[status(thm)],[2150,125,theory(equality)])).
% cnf(2200,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|~ssItem(hd(esk51_0))),inference(cn,[status(thm)],[2199,theory(equality)])).
% cnf(2250,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2200,149,theory(equality)])).
% cnf(2251,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil|$false),inference(rw,[status(thm)],[2250,585,theory(equality)])).
% cnf(2252,negated_conjecture,(hd(esk48_0)=hd(esk51_0)|esk51_0=nil),inference(cn,[status(thm)],[2251,theory(equality)])).
% cnf(2305,negated_conjecture,(esk51_0=nil|ssItem(hd(esk48_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[2183,149,theory(equality)])).
% cnf(2307,negated_conjecture,(esk51_0=nil|ssItem(hd(esk48_0))|$false),inference(rw,[status(thm)],[2305,585,theory(equality)])).
% cnf(2308,negated_conjecture,(esk51_0=nil|ssItem(hd(esk48_0))),inference(cn,[status(thm)],[2307,theory(equality)])).
% cnf(2309,negated_conjecture,(esk51_0=nil|ssItem(hd(esk51_0))),inference(spm,[status(thm)],[2308,2252,theory(equality)])).
% cnf(2310,negated_conjecture,(cons(hd(esk48_0),nil)=esk48_0|esk51_0=nil),inference(csr,[status(thm)],[2186,2309])).
% cnf(2311,negated_conjecture,(esk51_0=nil|esk48_0!=nil|~ssList(nil)|~ssItem(hd(esk48_0))),inference(spm,[status(thm)],[146,2310,theory(equality)])).
% cnf(2355,negated_conjecture,(esk51_0=nil|esk48_0!=nil|$false|~ssItem(hd(esk48_0))),inference(rw,[status(thm)],[2311,125,theory(equality)])).
% cnf(2356,negated_conjecture,(esk51_0=nil|esk48_0!=nil|~ssItem(hd(esk48_0))),inference(cn,[status(thm)],[2355,theory(equality)])).
% cnf(2508,negated_conjecture,(esk51_0=nil|esk48_0!=nil),inference(csr,[status(thm)],[2356,2308])).
% cnf(3671,plain,(frontsegP(X1,cons(X2,nil))|cons(X2,X3)!=X1|~ssList(X1)|~ssList(X3)|~ssItem(X2)),inference(csr,[status(thm)],[722,1866])).
% cnf(3679,plain,(frontsegP(X1,cons(hd(X2),nil))|nil=X2|X2!=X1|~ssList(tl(X2))|~ssList(X1)|~ssItem(hd(X2))|~ssList(X2)),inference(spm,[status(thm)],[3671,192,theory(equality)])).
% cnf(3692,plain,(frontsegP(X1,cons(hd(X1),nil))|nil=X1|~ssList(tl(X1))|~ssList(X1)|~ssItem(hd(X1))),inference(er,[status(thm)],[3679,theory(equality)])).
% cnf(161261,plain,(nil=X1|frontsegP(X1,cons(hd(X1),nil))|~ssList(tl(X1))|~ssList(X1)),inference(csr,[status(thm)],[3692,149])).
% cnf(161262,plain,(nil=X1|frontsegP(X1,cons(hd(X1),nil))|~ssList(X1)),inference(csr,[status(thm)],[161261,290])).
% cnf(161404,negated_conjecture,(nil=esk51_0|frontsegP(esk51_0,esk48_0)|~ssList(esk51_0)),inference(spm,[status(thm)],[161262,2146,theory(equality)])).
% cnf(161522,negated_conjecture,(nil=esk51_0|frontsegP(esk51_0,esk48_0)|$false),inference(rw,[status(thm)],[161404,585,theory(equality)])).
% cnf(161523,negated_conjecture,(nil=esk51_0|frontsegP(esk51_0,esk48_0)),inference(cn,[status(thm)],[161522,theory(equality)])).
% cnf(161542,negated_conjecture,(esk51_0=nil|~neq(esk48_0,nil)),inference(spm,[status(thm)],[604,161523,theory(equality)])).
% cnf(161562,negated_conjecture,(esk51_0=nil|esk48_0=nil|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[161542,119,theory(equality)])).
% cnf(161563,negated_conjecture,(esk51_0=nil|esk48_0=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[161562,125,theory(equality)])).
% cnf(161564,negated_conjecture,(esk51_0=nil|esk48_0=nil|$false|$false),inference(rw,[status(thm)],[161563,573,theory(equality)])).
% cnf(161565,negated_conjecture,(esk51_0=nil|esk48_0=nil),inference(cn,[status(thm)],[161564,theory(equality)])).
% cnf(161566,negated_conjecture,(esk51_0=nil),inference(csr,[status(thm)],[161565,2508])).
% cnf(162886,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[588,161566,theory(equality)])).
% cnf(162887,negated_conjecture,($false),inference(sr,[status(thm)],[162886,1335,theory(equality)])).
% cnf(162888,negated_conjecture,($false),162887,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11201
% # ...of these trivial : 5
% # ...subsumed : 9528
% # ...remaining for further processing: 1668
% # Other redundant clauses eliminated : 860
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 23
% # Backward-rewritten : 850
% # Generated clauses : 80871
% # ...of the previous two non-trivial : 78676
% # Contextual simplify-reflections : 7253
% # Paramodulations : 79732
% # Factorizations : 0
% # Equation resolutions : 1139
% # Current number of processed clauses: 789
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 765
% # Current number of unprocessed clauses: 19275
% # ...number of literals in the above : 174207
% # Clause-clause subsumption calls (NU) : 461458
% # Rec. Clause-clause subsumption calls : 243189
% # Unit Clause-clause subsumption calls : 57
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 626 leaves, 1.69+/-1.612 terms/leaf
% # Paramod-from index: 231 leaves, 1.05+/-0.267 terms/leaf
% # Paramod-into index: 410 leaves, 1.53+/-1.433 terms/leaf
% # -------------------------------------------------
% # User time : 4.974 s
% # System time : 0.119 s
% # Total time : 5.093 s
% # Maximum resident set size: 0 pages
% PrfWatch: 7.98 CPU 8.12 WC
% FINAL PrfWatch: 7.98 CPU 8.12 WC
% SZS output end Solution for /tmp/SystemOnTPTP15628/SWC022+1.tptp
%
%------------------------------------------------------------------------------