TSTP Solution File: SWC305+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC305+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 : art04.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:44:34 EST 2010
% Result : Theorem 1.33s
% Output : Solution 1.33s
% 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/SystemOnTPTP17129/SWC305+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17129/SWC305+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17129/SWC305+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 17225
% 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(5, axiom,![X1]:(ssList(X1)=>(strictorderedP(X1)<=>![X2]:(ssItem(X2)=>![X3]:(ssItem(X3)=>![X4]:(ssList(X4)=>![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1=>lt(X2,X3))))))))),file('/tmp/SRASS.s.p', ax12)).
% fof(7, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(8, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(13, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(16, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)=>~(lt(X2,X1))))),file('/tmp/SRASS.s.p', ax33)).
% fof(35, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(36, 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(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(frontsegP(X4,X3)))|~(strictorderedP(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&strictorderedP(X5)))|![X6]:(ssItem(X6)=>![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(app(app(X8,cons(X6,nil)),X9),cons(X7,nil)),X10)=X1)|~(lt(X7,X6))))))))))))),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))|~(frontsegP(X4,X3)))|~(strictorderedP(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&strictorderedP(X5)))|![X6]:(ssItem(X6)=>![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(app(app(X8,cons(X6,nil)),X9),cons(X7,nil)),X10)=X1)|~(lt(X7,X6)))))))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(lt(X1,X2)=>~(lt(X2,X1))))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(frontsegP(X4,X3)))|~(strictorderedP(X3)))|?[X5]:((((ssList(X5)&neq(X3,X5))&frontsegP(X4,X5))&segmentP(X5,X3))&strictorderedP(X5)))|![X6]:(ssItem(X6)=>![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>![X9]:(ssList(X9)=>![X10]:(ssList(X10)=>(~(app(app(app(app(X8,cons(X6,nil)),X9),cons(X7,nil)),X10)=X1)|~(lt(X7,X6)))))))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(132, plain,![X1]:(~(ssList(X1))|((~(strictorderedP(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssItem(X3))|![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|(~(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1)|lt(X2,X3))))))))&(?[X2]:(ssItem(X2)&?[X3]:(ssItem(X3)&?[X4]:(ssList(X4)&?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&(app(app(X4,cons(X2,X5)),cons(X3,X6))=X1&~(lt(X2,X3))))))))|strictorderedP(X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(133, plain,![X7]:(~(ssList(X7))|((~(strictorderedP(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssItem(X9))|![X10]:(~(ssList(X10))|![X11]:(~(ssList(X11))|![X12]:(~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|lt(X8,X9))))))))&(?[X13]:(ssItem(X13)&?[X14]:(ssItem(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&(app(app(X15,cons(X13,X16)),cons(X14,X17))=X7&~(lt(X13,X14))))))))|strictorderedP(X7)))),inference(variable_rename,[status(thm)],[132])).
% fof(134, plain,![X7]:(~(ssList(X7))|((~(strictorderedP(X7))|![X8]:(~(ssItem(X8))|![X9]:(~(ssItem(X9))|![X10]:(~(ssList(X10))|![X11]:(~(ssList(X11))|![X12]:(~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|lt(X8,X9))))))))&((ssItem(esk6_1(X7))&(ssItem(esk7_1(X7))&(ssList(esk8_1(X7))&(ssList(esk9_1(X7))&(ssList(esk10_1(X7))&(app(app(esk8_1(X7),cons(esk6_1(X7),esk9_1(X7))),cons(esk7_1(X7),esk10_1(X7)))=X7&~(lt(esk6_1(X7),esk7_1(X7)))))))))|strictorderedP(X7)))),inference(skolemize,[status(esa)],[133])).
% fof(135, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|lt(X8,X9)))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(strictorderedP(X7)))&((ssItem(esk6_1(X7))&(ssItem(esk7_1(X7))&(ssList(esk8_1(X7))&(ssList(esk9_1(X7))&(ssList(esk10_1(X7))&(app(app(esk8_1(X7),cons(esk6_1(X7),esk9_1(X7))),cons(esk7_1(X7),esk10_1(X7)))=X7&~(lt(esk6_1(X7),esk7_1(X7)))))))))|strictorderedP(X7)))|~(ssList(X7))),inference(shift_quantors,[status(thm)],[134])).
% fof(136, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((((~(ssList(X12))|(~(app(app(X10,cons(X8,X11)),cons(X9,X12))=X7)|lt(X8,X9)))|~(ssList(X11)))|~(ssList(X10)))|~(ssItem(X9)))|~(ssItem(X8)))|~(strictorderedP(X7)))|~(ssList(X7)))&(((ssItem(esk6_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssItem(esk7_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk8_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk9_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk10_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((app(app(esk8_1(X7),cons(esk6_1(X7),esk9_1(X7))),cons(esk7_1(X7),esk10_1(X7)))=X7|strictorderedP(X7))|~(ssList(X7)))&((~(lt(esk6_1(X7),esk7_1(X7)))|strictorderedP(X7))|~(ssList(X7)))))))))),inference(distribute,[status(thm)],[135])).
% cnf(144,plain,(lt(X2,X3)|~ssList(X1)|~strictorderedP(X1)|~ssItem(X2)|~ssItem(X3)|~ssList(X4)|~ssList(X5)|app(app(X4,cons(X2,X5)),cons(X3,X6))!=X1|~ssList(X6)),inference(split_conjunct,[status(thm)],[136])).
% fof(151, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(152, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[151])).
% fof(153, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[152])).
% cnf(154,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[153])).
% cnf(155,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[8])).
% fof(177, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[13])).
% fof(178, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[177])).
% fof(179, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[178])).
% cnf(180,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[179])).
% fof(188, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|(~(lt(X1,X2))|~(lt(X2,X1))))),inference(fof_nnf,[status(thm)],[98])).
% fof(189, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))),inference(variable_rename,[status(thm)],[188])).
% fof(190, plain,![X3]:![X4]:((~(ssItem(X4))|(~(lt(X3,X4))|~(lt(X4,X3))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[189])).
% cnf(191,plain,(~ssItem(X1)|~lt(X2,X1)|~lt(X1,X2)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[190])).
% fof(261, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[35])).
% fof(262, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[261])).
% fof(263, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[262])).
% cnf(264,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[263])).
% fof(265, 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)],[36])).
% fof(266, 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)],[265])).
% fof(267, 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)],[266])).
% cnf(268,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[267])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((((X2=X4&X1=X3)&frontsegP(X4,X3))&strictorderedP(X3))&![X5]:((((~(ssList(X5))|~(neq(X3,X5)))|~(frontsegP(X4,X5)))|~(segmentP(X5,X3)))|~(strictorderedP(X5))))&?[X6]:(ssItem(X6)&?[X7]:(ssItem(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&(app(app(app(app(X8,cons(X6,nil)),X9),cons(X7,nil)),X10)=X1<(X7,X6)))))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&(((((X12=X14&X11=X13)&frontsegP(X14,X13))&strictorderedP(X13))&![X15]:((((~(ssList(X15))|~(neq(X13,X15)))|~(frontsegP(X14,X15)))|~(segmentP(X15,X13)))|~(strictorderedP(X15))))&?[X16]:(ssItem(X16)&?[X17]:(ssItem(X17)&?[X18]:(ssList(X18)&?[X19]:(ssList(X19)&?[X20]:(ssList(X20)&(app(app(app(app(X18,cons(X16,nil)),X19),cons(X17,nil)),X20)=X11<(X17,X16)))))))))))),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)&frontsegP(esk51_0,esk50_0))&strictorderedP(esk50_0))&![X15]:((((~(ssList(X15))|~(neq(esk50_0,X15)))|~(frontsegP(esk51_0,X15)))|~(segmentP(X15,esk50_0)))|~(strictorderedP(X15))))&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&(ssList(esk55_0)&(ssList(esk56_0)&(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk48_0<(esk53_0,esk52_0)))))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:((((((((((~(ssList(X15))|~(neq(esk50_0,X15)))|~(frontsegP(esk51_0,X15)))|~(segmentP(X15,esk50_0)))|~(strictorderedP(X15)))&(((esk49_0=esk51_0&esk48_0=esk50_0)&frontsegP(esk51_0,esk50_0))&strictorderedP(esk50_0)))&(ssItem(esk52_0)&(ssItem(esk53_0)&(ssList(esk54_0)&(ssList(esk55_0)&(ssList(esk56_0)&(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk48_0<(esk53_0,esk52_0))))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(lt(esk53_0,esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(ssList(esk56_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssList(esk55_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssList(esk54_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(ssItem(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(strictorderedP(esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(588,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,585,theory(equality)])).
% cnf(592,negated_conjecture,(app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0)=esk50_0),inference(rw,[status(thm)],[577,585,theory(equality)])).
% cnf(634,negated_conjecture,(~lt(esk52_0,esk53_0)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[191,576,theory(equality)])).
% cnf(635,negated_conjecture,(~lt(esk52_0,esk53_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[634,581,theory(equality)])).
% cnf(636,negated_conjecture,(~lt(esk52_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[635,582,theory(equality)])).
% cnf(637,negated_conjecture,(~lt(esk52_0,esk53_0)),inference(cn,[status(thm)],[636,theory(equality)])).
% cnf(944,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(esk55_0)|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(spm,[status(thm)],[592,268,theory(equality)])).
% cnf(955,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssList(cons(esk52_0,nil))|~ssList(esk54_0)),inference(rw,[status(thm)],[944,579,theory(equality)])).
% cnf(956,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[955,580,theory(equality)])).
% cnf(957,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[956,theory(equality)])).
% cnf(1679,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[957,154,theory(equality)])).
% cnf(1680,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1679,155,theory(equality)])).
% cnf(1681,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1680,582,theory(equality)])).
% cnf(1682,negated_conjecture,(app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0),inference(cn,[status(thm)],[1681,theory(equality)])).
% cnf(1700,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1682,264,theory(equality)])).
% cnf(1740,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1700,579,theory(equality)])).
% cnf(1741,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0|$false|$false),inference(rw,[status(thm)],[1740,582,theory(equality)])).
% cnf(1742,negated_conjecture,(app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0)=esk50_0),inference(cn,[status(thm)],[1741,theory(equality)])).
% cnf(1759,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|~ssList(esk56_0)|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(spm,[status(thm)],[268,1742,theory(equality)])).
% cnf(1791,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|$false|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(rw,[status(thm)],[1759,578,theory(equality)])).
% cnf(1792,negated_conjecture,(esk50_0=app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))|~ssList(cons(esk53_0,nil))|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(cn,[status(thm)],[1791,theory(equality)])).
% cnf(2564,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1792,154,theory(equality)])).
% cnf(2565,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2564,155,theory(equality)])).
% cnf(2566,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))|$false|$false),inference(rw,[status(thm)],[2565,581,theory(equality)])).
% cnf(2567,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk54_0,cons(esk52_0,esk55_0)))),inference(cn,[status(thm)],[2566,theory(equality)])).
% cnf(2568,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk52_0,esk55_0))|~ssList(esk54_0)),inference(spm,[status(thm)],[2567,180,theory(equality)])).
% cnf(2569,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk52_0,esk55_0))|$false),inference(rw,[status(thm)],[2568,580,theory(equality)])).
% cnf(2570,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk52_0,esk55_0))),inference(cn,[status(thm)],[2569,theory(equality)])).
% cnf(2571,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(esk55_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2570,154,theory(equality)])).
% cnf(2572,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2571,579,theory(equality)])).
% cnf(2573,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2572,582,theory(equality)])).
% cnf(2574,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0))=esk50_0),inference(cn,[status(thm)],[2573,theory(equality)])).
% cnf(2592,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0|~ssList(esk56_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2574,264,theory(equality)])).
% cnf(2605,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2592,578,theory(equality)])).
% cnf(2606,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2605,581,theory(equality)])).
% cnf(2607,negated_conjecture,(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0))=esk50_0),inference(cn,[status(thm)],[2606,theory(equality)])).
% cnf(2630,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(esk56_0)|~ssList(esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[144,2607,theory(equality)])).
% cnf(2659,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|~ssList(esk55_0)|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2630,578,theory(equality)])).
% cnf(2660,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|~ssList(esk54_0)|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2659,579,theory(equality)])).
% cnf(2661,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|~ssItem(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[2660,580,theory(equality)])).
% cnf(2662,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2661,581,theory(equality)])).
% cnf(2663,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2662,582,theory(equality)])).
% cnf(2664,negated_conjecture,(lt(esk52_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(X1)),inference(cn,[status(thm)],[2663,theory(equality)])).
% cnf(2665,negated_conjecture,(esk50_0!=X1|~strictorderedP(X1)|~ssList(X1)),inference(sr,[status(thm)],[2664,637,theory(equality)])).
% cnf(2775,negated_conjecture,(~strictorderedP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[2665,theory(equality)])).
% cnf(2776,negated_conjecture,($false|~ssList(esk50_0)),inference(rw,[status(thm)],[2775,583,theory(equality)])).
% cnf(2777,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2776,588,theory(equality)])).
% cnf(2778,negated_conjecture,($false),inference(cn,[status(thm)],[2777,theory(equality)])).
% cnf(2779,negated_conjecture,($false),2778,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 310
% # ...of these trivial : 2
% # ...subsumed : 7
% # ...remaining for further processing: 301
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 18
% # Generated clauses : 986
% # ...of the previous two non-trivial : 838
% # Contextual simplify-reflections : 2
% # Paramodulations : 894
% # Factorizations : 0
% # Equation resolutions : 92
% # Current number of processed clauses: 273
% # Positive orientable unit clauses: 53
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 215
% # Current number of unprocessed clauses: 711
% # ...number of literals in the above : 4364
% # Clause-clause subsumption calls (NU) : 1750
% # Rec. Clause-clause subsumption calls : 1000
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 34
% # Indexed BW rewrite successes : 11
% # Backwards rewriting index: 315 leaves, 1.33+/-1.068 terms/leaf
% # Paramod-from index: 129 leaves, 1.05+/-0.380 terms/leaf
% # Paramod-into index: 267 leaves, 1.22+/-0.929 terms/leaf
% # -------------------------------------------------
% # User time : 0.092 s
% # System time : 0.007 s
% # Total time : 0.099 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.32 WC
% FINAL PrfWatch: 0.24 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP17129/SWC305+1.tptp
%
%------------------------------------------------------------------------------