TSTP Solution File: SWC224+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC224+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 : art02.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:26:20 EST 2010
% Result : Theorem 5.61s
% Output : Solution 5.61s
% 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/SystemOnTPTP2091/SWC224+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2091/SWC224+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2091/SWC224+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 2259
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.91 CPU 4.01 WC
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(12, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(18, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(23, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(24, 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(25, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(26, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(32, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(~(nil=X1)=>hd(app(X1,X2))=hd(X1)))),file('/tmp/SRASS.s.p', ax85)).
% fof(37, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(48, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(51, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(63, 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)))|leq(X8,X5)))))))|![X9]:(ssList(X9)=>((~(app(X3,X9)=X4)|~(equalelemsP(X3)))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X9)&?[X12]:(ssList(X12)&app(X12,cons(X10,nil))=X3))))))|(~(nil=X4)&nil=X3)))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|nil=X1)|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X1)&![X8]:(ssItem(X8)=>(((~(memberP(X6,X8))|~(memberP(X7,X8)))|~(leq(X5,X8)))|leq(X8,X5)))))))|![X9]:(ssList(X9)=>((~(app(X3,X9)=X4)|~(equalelemsP(X3)))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X9)&?[X12]:(ssList(X12)&app(X12,cons(X10,nil))=X3))))))|(~(nil=X4)&nil=X3))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[18,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)))|leq(X8,X5)))))))|![X9]:(ssList(X9)=>((~(app(X3,X9)=X4)|~(equalelemsP(X3)))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X9)&?[X12]:(ssList(X12)&app(X12,cons(X10,nil))=X3))))))|(~(nil=X4)&nil=X3))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(130, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(131, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[130])).
% fof(132, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[131])).
% cnf(133,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[132])).
% cnf(134,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(164, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[12])).
% fof(165, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[164])).
% cnf(166,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[165])).
% fof(192, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[98])).
% fof(193, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[192])).
% cnf(194,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[193])).
% fof(207, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[23])).
% fof(208, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[207])).
% fof(209, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[208])).
% cnf(210,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[209])).
% fof(211, 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)],[24])).
% fof(212, 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)],[211])).
% fof(213, 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)],[212])).
% cnf(214,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[213])).
% fof(215, 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)],[25])).
% fof(216, 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)],[215])).
% fof(217, 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)],[216])).
% fof(218, 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)],[217])).
% cnf(220,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[218])).
% fof(222, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[26])).
% fof(223, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[222])).
% cnf(224,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[223])).
% fof(287, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|(nil=X1|hd(app(X1,X2))=hd(X1)))),inference(fof_nnf,[status(thm)],[32])).
% fof(288, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))),inference(variable_rename,[status(thm)],[287])).
% fof(289, plain,![X3]:![X4]:((~(ssList(X4))|(nil=X3|hd(app(X3,X4))=hd(X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[288])).
% cnf(290,plain,(hd(app(X1,X2))=hd(X1)|nil=X1|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[289])).
% fof(310, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[37])).
% fof(311, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[310])).
% cnf(312,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[311])).
% fof(357, 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)],[48])).
% fof(358, 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)],[357])).
% fof(359, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk33_2(X4,X5))&app(X5,esk33_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[358])).
% fof(360, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk33_2(X4,X5))&app(X5,esk33_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[359])).
% fof(361, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk33_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk33_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[360])).
% cnf(362,plain,(app(X2,esk33_2(X1,X2))=X1|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[361])).
% cnf(363,plain,(ssList(esk33_2(X1,X2))|~ssList(X1)|~ssList(X2)|~frontsegP(X1,X2)),inference(split_conjunct,[status(thm)],[361])).
% cnf(364,plain,(frontsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X2,X3)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[361])).
% fof(382, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[51])).
% fof(383, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[382])).
% cnf(384,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[383])).
% fof(455, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[63])).
% fof(456, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[455])).
% cnf(457,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[456])).
% 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))&~(leq(X8,X5))))))))&?[X9]:(ssList(X9)&((app(X3,X9)=X4&equalelemsP(X3))&![X10]:(~(ssItem(X10))|![X11]:((~(ssList(X11))|~(app(cons(X10,nil),X11)=X9))|![X12]:(~(ssList(X12))|~(app(X12,cons(X10,nil))=X3)))))))&(nil=X4|~(nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&(((((X14=X16&X13=X15)&~(nil=X13))&![X17]:(~(ssItem(X17))|![X18]:(~(ssList(X18))|![X19]:((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=X13))|?[X20]:(ssItem(X20)&(((memberP(X18,X20)&memberP(X19,X20))&leq(X17,X20))&~(leq(X20,X17))))))))&?[X21]:(ssList(X21)&((app(X15,X21)=X16&equalelemsP(X15))&![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(cons(X22,nil),X23)=X21))|![X24]:(~(ssList(X24))|~(app(X24,cons(X22,nil))=X15)))))))&(nil=X16|~(nil=X15))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&(((((esk49_0=esk51_0&esk48_0=esk50_0)&~(nil=esk48_0))&![X17]:(~(ssItem(X17))|![X18]:(~(ssList(X18))|![X19]:((~(ssList(X19))|~(app(app(X18,cons(X17,nil)),X19)=esk48_0))|(ssItem(esk52_3(X17,X18,X19))&(((memberP(X18,esk52_3(X17,X18,X19))&memberP(X19,esk52_3(X17,X18,X19)))&leq(X17,esk52_3(X17,X18,X19)))&~(leq(esk52_3(X17,X18,X19),X17))))))))&(ssList(esk53_0)&((app(esk50_0,esk53_0)=esk51_0&equalelemsP(esk50_0))&![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(cons(X22,nil),X23)=esk53_0))|![X24]:(~(ssList(X24))|~(app(X24,cons(X22,nil))=esk50_0)))))))&(nil=esk51_0|~(nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X17]:![X18]:![X19]:![X22]:![X23]:![X24]:(((((((((((~(ssList(X24))|~(app(X24,cons(X22,nil))=esk50_0))|(~(ssList(X23))|~(app(cons(X22,nil),X23)=esk53_0)))|~(ssItem(X22)))&(app(esk50_0,esk53_0)=esk51_0&equalelemsP(esk50_0)))&ssList(esk53_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)))&~(leq(esk52_3(X17,X18,X19),X17)))))|~(ssList(X18)))|~(ssItem(X17)))&((esk49_0=esk51_0&esk48_0=esk50_0)&~(nil=esk48_0))))&(nil=esk51_0|~(nil=esk50_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]:![X22]:![X23]:![X24]:(((((((((((~(ssList(X24))|~(app(X24,cons(X22,nil))=esk50_0))|(~(ssList(X23))|~(app(cons(X22,nil),X23)=esk53_0)))|~(ssItem(X22)))&(app(esk50_0,esk53_0)=esk51_0&equalelemsP(esk50_0)))&ssList(esk53_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))))&(((~(leq(esk52_3(X17,X18,X19),X17))|(~(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))))&(nil=esk51_0|~(nil=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(578,negated_conjecture,(nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(memberP(X2,esk52_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk52_3(X1,X2,X3))|~ssItem(X1)|~ssList(X2)|app(app(X2,cons(X1,nil)),X3)!=esk48_0|~ssList(X3)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(app(esk50_0,esk53_0)=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(592,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,580,theory(equality)])).
% cnf(600,negated_conjecture,(app(esk48_0,esk53_0)=esk51_0),inference(rw,[status(thm)],[588,579,theory(equality)])).
% cnf(639,negated_conjecture,(nil=esk48_0|esk51_0!=nil|~ssList(esk53_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[220,600,theory(equality)])).
% cnf(641,negated_conjecture,(nil=esk48_0|esk51_0!=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[639,586,theory(equality)])).
% cnf(642,negated_conjecture,(nil=esk48_0|esk51_0!=nil|$false|$false),inference(rw,[status(thm)],[641,573,theory(equality)])).
% cnf(643,negated_conjecture,(nil=esk48_0|esk51_0!=nil),inference(cn,[status(thm)],[642,theory(equality)])).
% cnf(644,negated_conjecture,(esk51_0!=nil),inference(sr,[status(thm)],[643,578,theory(equality)])).
% cnf(756,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0|~ssList(esk53_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[290,600,theory(equality)])).
% cnf(759,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[756,586,theory(equality)])).
% cnf(760,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0|$false|$false),inference(rw,[status(thm)],[759,573,theory(equality)])).
% cnf(761,negated_conjecture,(hd(esk51_0)=hd(esk48_0)|nil=esk48_0),inference(cn,[status(thm)],[760,theory(equality)])).
% cnf(762,negated_conjecture,(hd(esk51_0)=hd(esk48_0)),inference(sr,[status(thm)],[761,578,theory(equality)])).
% cnf(932,negated_conjecture,(app(esk51_0,X1)=app(esk48_0,app(esk53_0,X1))|~ssList(X1)|~ssList(esk53_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[214,600,theory(equality)])).
% cnf(940,negated_conjecture,(app(esk51_0,X1)=app(esk48_0,app(esk53_0,X1))|~ssList(X1)|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[932,586,theory(equality)])).
% cnf(941,negated_conjecture,(app(esk51_0,X1)=app(esk48_0,app(esk53_0,X1))|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[940,573,theory(equality)])).
% cnf(942,negated_conjecture,(app(esk51_0,X1)=app(esk48_0,app(esk53_0,X1))|~ssList(X1)),inference(cn,[status(thm)],[941,theory(equality)])).
% cnf(954,plain,(hd(X2)=hd(X1)|nil=X1|~ssList(esk33_2(X2,X1))|~ssList(X1)|~frontsegP(X2,X1)|~ssList(X2)),inference(spm,[status(thm)],[290,362,theory(equality)])).
% cnf(1146,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)],[194,584,theory(equality)])).
% cnf(1149,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)],[1146,134,theory(equality)])).
% cnf(1150,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)],[1149,theory(equality)])).
% cnf(1772,negated_conjecture,(nil=esk51_0|ssItem(hd(esk48_0))|~ssList(esk51_0)),inference(spm,[status(thm)],[312,762,theory(equality)])).
% cnf(1778,negated_conjecture,(nil=esk51_0|ssItem(hd(esk48_0))|$false),inference(rw,[status(thm)],[1772,592,theory(equality)])).
% cnf(1779,negated_conjecture,(nil=esk51_0|ssItem(hd(esk48_0))),inference(cn,[status(thm)],[1778,theory(equality)])).
% cnf(1780,negated_conjecture,(ssItem(hd(esk48_0))),inference(sr,[status(thm)],[1779,644,theory(equality)])).
% cnf(2136,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[1150,585,theory(equality)])).
% cnf(2137,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2136,134,theory(equality)])).
% cnf(2138,negated_conjecture,(app(app(nil,cons(X1,nil)),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2137,theory(equality)])).
% cnf(2169,negated_conjecture,(app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(cons(X1,nil))),inference(spm,[status(thm)],[2138,166,theory(equality)])).
% cnf(2390,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(cons(X1,nil))|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[2169,210,theory(equality)])).
% cnf(2397,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|~ssList(nil)),inference(spm,[status(thm)],[2390,133,theory(equality)])).
% cnf(2398,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)|$false),inference(rw,[status(thm)],[2397,134,theory(equality)])).
% cnf(2399,negated_conjecture,(cons(X1,X2)!=esk48_0|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[2398,theory(equality)])).
% cnf(2477,negated_conjecture,(app(esk48_0,esk53_0)=app(esk51_0,nil)|~ssList(nil)|~ssList(esk53_0)),inference(spm,[status(thm)],[942,224,theory(equality)])).
% cnf(2524,negated_conjecture,(esk51_0=app(esk51_0,nil)|~ssList(nil)|~ssList(esk53_0)),inference(rw,[status(thm)],[2477,600,theory(equality)])).
% cnf(2525,negated_conjecture,(esk51_0=app(esk51_0,nil)|$false|~ssList(esk53_0)),inference(rw,[status(thm)],[2524,134,theory(equality)])).
% cnf(2526,negated_conjecture,(esk51_0=app(esk51_0,nil)|$false|$false),inference(rw,[status(thm)],[2525,586,theory(equality)])).
% cnf(2527,negated_conjecture,(esk51_0=app(esk51_0,nil)),inference(cn,[status(thm)],[2526,theory(equality)])).
% cnf(2540,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|~ssList(nil)|~ssList(esk51_0)|~ssList(X1)),inference(spm,[status(thm)],[364,2527,theory(equality)])).
% cnf(2581,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|$false|~ssList(esk51_0)|~ssList(X1)),inference(rw,[status(thm)],[2540,134,theory(equality)])).
% cnf(2582,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[2581,592,theory(equality)])).
% cnf(2583,negated_conjecture,(frontsegP(X1,esk51_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[2582,theory(equality)])).
% cnf(20910,plain,(hd(X2)=hd(X1)|nil=X1|~frontsegP(X2,X1)|~ssList(X1)|~ssList(X2)),inference(csr,[status(thm)],[954,363])).
% cnf(20920,negated_conjecture,(hd(X1)=hd(esk51_0)|nil=esk51_0|~ssList(esk51_0)|~ssList(X1)|esk51_0!=X1),inference(spm,[status(thm)],[20910,2583,theory(equality)])).
% cnf(20939,negated_conjecture,(hd(X1)=hd(esk48_0)|nil=esk51_0|~ssList(esk51_0)|~ssList(X1)|esk51_0!=X1),inference(rw,[status(thm)],[20920,762,theory(equality)])).
% cnf(20940,negated_conjecture,(hd(X1)=hd(esk48_0)|nil=esk51_0|$false|~ssList(X1)|esk51_0!=X1),inference(rw,[status(thm)],[20939,592,theory(equality)])).
% cnf(20941,negated_conjecture,(hd(X1)=hd(esk48_0)|nil=esk51_0|~ssList(X1)|esk51_0!=X1),inference(cn,[status(thm)],[20940,theory(equality)])).
% cnf(20942,negated_conjecture,(hd(X1)=hd(esk48_0)|~ssList(X1)|esk51_0!=X1),inference(sr,[status(thm)],[20941,644,theory(equality)])).
% cnf(31033,negated_conjecture,(cons(hd(X1),tl(esk48_0))=esk48_0|nil=esk48_0|~ssList(esk48_0)|esk51_0!=X1|~ssList(X1)),inference(spm,[status(thm)],[457,20942,theory(equality)])).
% cnf(31110,negated_conjecture,(cons(hd(X1),tl(esk48_0))=esk48_0|nil=esk48_0|$false|esk51_0!=X1|~ssList(X1)),inference(rw,[status(thm)],[31033,573,theory(equality)])).
% cnf(31111,negated_conjecture,(cons(hd(X1),tl(esk48_0))=esk48_0|nil=esk48_0|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[31110,theory(equality)])).
% cnf(31112,negated_conjecture,(cons(hd(X1),tl(esk48_0))=esk48_0|esk51_0!=X1|~ssList(X1)),inference(sr,[status(thm)],[31111,578,theory(equality)])).
% cnf(96189,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|~ssList(esk51_0)),inference(spm,[status(thm)],[31112,762,theory(equality)])).
% cnf(96228,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0|$false),inference(rw,[status(thm)],[96189,592,theory(equality)])).
% cnf(96229,negated_conjecture,(cons(hd(esk48_0),tl(esk48_0))=esk48_0),inference(cn,[status(thm)],[96228,theory(equality)])).
% cnf(96259,negated_conjecture,(~ssList(tl(esk48_0))|~ssItem(hd(esk48_0))),inference(spm,[status(thm)],[2399,96229,theory(equality)])).
% cnf(96539,negated_conjecture,(~ssList(tl(esk48_0))|$false),inference(rw,[status(thm)],[96259,1780,theory(equality)])).
% cnf(96540,negated_conjecture,(~ssList(tl(esk48_0))),inference(cn,[status(thm)],[96539,theory(equality)])).
% cnf(96976,negated_conjecture,(nil=esk48_0|~ssList(esk48_0)),inference(spm,[status(thm)],[96540,384,theory(equality)])).
% cnf(96977,negated_conjecture,(nil=esk48_0|$false),inference(rw,[status(thm)],[96976,573,theory(equality)])).
% cnf(96978,negated_conjecture,(nil=esk48_0),inference(cn,[status(thm)],[96977,theory(equality)])).
% cnf(96979,negated_conjecture,($false),inference(sr,[status(thm)],[96978,578,theory(equality)])).
% cnf(96980,negated_conjecture,($false),96979,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6731
% # ...of these trivial : 143
% # ...subsumed : 4827
% # ...remaining for further processing: 1761
% # Other redundant clauses eliminated : 953
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 62
% # Backward-rewritten : 12
% # Generated clauses : 44117
% # ...of the previous two non-trivial : 40358
% # Contextual simplify-reflections : 2899
% # Paramodulations : 43015
% # Factorizations : 0
% # Equation resolutions : 1098
% # Current number of processed clauses: 1479
% # Positive orientable unit clauses: 69
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 50
% # Non-unit-clauses : 1360
% # Current number of unprocessed clauses: 33580
% # ...number of literals in the above : 277336
% # Clause-clause subsumption calls (NU) : 147199
% # Rec. Clause-clause subsumption calls : 39165
% # Unit Clause-clause subsumption calls : 776
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 957 leaves, 1.54+/-1.506 terms/leaf
% # Paramod-from index: 481 leaves, 1.04+/-0.242 terms/leaf
% # Paramod-into index: 777 leaves, 1.38+/-1.129 terms/leaf
% # -------------------------------------------------
% # User time : 2.695 s
% # System time : 0.100 s
% # Total time : 2.795 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.50 CPU 4.61 WC
% FINAL PrfWatch: 4.50 CPU 4.61 WC
% SZS output end Solution for /tmp/SystemOnTPTP2091/SWC224+1.tptp
%
%------------------------------------------------------------------------------