TSTP Solution File: SWC176+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC176+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 07:16:55 EST 2010
% Result : Theorem 1.35s
% Output : Solution 1.35s
% 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/SystemOnTPTP31482/SWC176+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31482/SWC176+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31482/SWC176+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 31578
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax1)).
% fof(3, 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(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(20, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(21, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>app(app(X1,X2),X3)=app(X1,app(X2,X3))))),file('/tmp/SRASS.s.p', ax82)).
% fof(24, axiom,![X1]:(ssItem(X1)=>~(lt(X1,X1))),file('/tmp/SRASS.s.p', ax90)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|![X5]:(ssList(X5)=>![X6]:((((~(ssList(X6))|~(app(app(X5,X3),X6)=X4))|~(strictorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)<(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)<(X13,X11))))))))|![X15]:(ssItem(X15)=>![X16]:((~(ssItem(X16))|![X17]:(ssList(X17)=>![X18]:(ssList(X18)=>~(app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18)=X1))))|neq(X15,X16))))|(~(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))|![X5]:(ssList(X5)=>![X6]:((((~(ssList(X6))|~(app(app(X5,X3),X6)=X4))|~(strictorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)<(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)<(X13,X11))))))))|![X15]:(ssItem(X15)=>![X16]:((~(ssItem(X16))|![X17]:(ssList(X17)=>![X18]:(ssList(X18)=>~(app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18)=X1))))|neq(X15,X16))))|(~(nil=X4)&nil=X3)))))),inference(assume_negation,[status(cth)],[96])).
% fof(99, plain,![X1]:(ssItem(X1)=>~(lt(X1,X1))),inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|![X5]:(ssList(X5)=>![X6]:((((~(ssList(X6))|~(app(app(X5,X3),X6)=X4))|~(strictorderedP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssItem(X9)&?[X10]:((ssList(X10)&app(cons(X9,nil),X10)=X3)<(X7,X9))))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X6)&?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(X14,cons(X13,nil))=X3)<(X13,X11))))))))|![X15]:(ssItem(X15)=>![X16]:((~(ssItem(X16))|![X17]:(ssList(X17)=>![X18]:(ssList(X18)=>~(app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18)=X1))))|neq(X15,X16))))|(~(nil=X4)&nil=X3)))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(105, plain,![X3]:(~(ssItem(X3))|![X4]:(~(ssItem(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,![X3]:![X4]:((~(ssItem(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssItem(X3))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssItem(X4)))|~(ssItem(X3)))&(((X3=X4|neq(X3,X4))|~(ssItem(X4)))|~(ssItem(X3)))),inference(distribute,[status(thm)],[106])).
% cnf(108,plain,(neq(X1,X2)|X1=X2|~ssItem(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[107])).
% fof(115, 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)],[3])).
% fof(116, 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)],[115])).
% fof(117, 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(esk3_1(X7))&(ssItem(esk4_1(X7))&(ssList(esk5_1(X7))&(ssList(esk6_1(X7))&(ssList(esk7_1(X7))&(app(app(esk5_1(X7),cons(esk3_1(X7),esk6_1(X7))),cons(esk4_1(X7),esk7_1(X7)))=X7&~(lt(esk3_1(X7),esk4_1(X7)))))))))|strictorderedP(X7)))),inference(skolemize,[status(esa)],[116])).
% fof(118, 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(esk3_1(X7))&(ssItem(esk4_1(X7))&(ssList(esk5_1(X7))&(ssList(esk6_1(X7))&(ssList(esk7_1(X7))&(app(app(esk5_1(X7),cons(esk3_1(X7),esk6_1(X7))),cons(esk4_1(X7),esk7_1(X7)))=X7&~(lt(esk3_1(X7),esk4_1(X7)))))))))|strictorderedP(X7)))|~(ssList(X7))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, 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(esk3_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssItem(esk4_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk5_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk6_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((ssList(esk7_1(X7))|strictorderedP(X7))|~(ssList(X7)))&(((app(app(esk5_1(X7),cons(esk3_1(X7),esk6_1(X7))),cons(esk4_1(X7),esk7_1(X7)))=X7|strictorderedP(X7))|~(ssList(X7)))&((~(lt(esk3_1(X7),esk4_1(X7)))|strictorderedP(X7))|~(ssList(X7)))))))))),inference(distribute,[status(thm)],[118])).
% cnf(127,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)],[119])).
% fof(134, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(135, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[134])).
% fof(136, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[135])).
% cnf(137,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[136])).
% cnf(138,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% fof(160, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(161, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[160])).
% fof(162, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[161])).
% cnf(163,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[162])).
% fof(191, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[20])).
% fof(192, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[191])).
% fof(193, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[192])).
% cnf(194,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[193])).
% fof(195, 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)],[21])).
% fof(196, 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)],[195])).
% fof(197, 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)],[196])).
% cnf(198,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[197])).
% fof(209, plain,![X1]:(~(ssItem(X1))|~(lt(X1,X1))),inference(fof_nnf,[status(thm)],[99])).
% fof(210, plain,![X2]:(~(ssItem(X2))|~(lt(X2,X2))),inference(variable_rename,[status(thm)],[209])).
% cnf(211,plain,(~lt(X1,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[210])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(((((ssList(X4)&X2=X4)&X1=X3)&?[X5]:(ssList(X5)&?[X6]:((((ssList(X6)&app(app(X5,X3),X6)=X4)&strictorderedP(X3))&![X7]:(~(ssItem(X7))|![X8]:((~(ssList(X8))|~(app(X8,cons(X7,nil))=X5))|![X9]:(~(ssItem(X9))|![X10]:((~(ssList(X10))|~(app(cons(X9,nil),X10)=X3))|~(lt(X7,X9)))))))&![X11]:(~(ssItem(X11))|![X12]:((~(ssList(X12))|~(app(cons(X11,nil),X12)=X6))|![X13]:(~(ssItem(X13))|![X14]:((~(ssList(X14))|~(app(X14,cons(X13,nil))=X3))|~(lt(X13,X11)))))))))&?[X15]:(ssItem(X15)&?[X16]:((ssItem(X16)&?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18)=X1)))&~(neq(X15,X16)))))&(nil=X4|~(nil=X3)))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X19]:(ssList(X19)&?[X20]:(ssList(X20)&?[X21]:(ssList(X21)&?[X22]:(((((ssList(X22)&X20=X22)&X19=X21)&?[X23]:(ssList(X23)&?[X24]:((((ssList(X24)&app(app(X23,X21),X24)=X22)&strictorderedP(X21))&![X25]:(~(ssItem(X25))|![X26]:((~(ssList(X26))|~(app(X26,cons(X25,nil))=X23))|![X27]:(~(ssItem(X27))|![X28]:((~(ssList(X28))|~(app(cons(X27,nil),X28)=X21))|~(lt(X25,X27)))))))&![X29]:(~(ssItem(X29))|![X30]:((~(ssList(X30))|~(app(cons(X29,nil),X30)=X24))|![X31]:(~(ssItem(X31))|![X32]:((~(ssList(X32))|~(app(X32,cons(X31,nil))=X21))|~(lt(X31,X29)))))))))&?[X33]:(ssItem(X33)&?[X34]:((ssItem(X34)&?[X35]:(ssList(X35)&?[X36]:(ssList(X36)&app(app(app(X35,cons(X33,nil)),cons(X34,nil)),X36)=X19)))&~(neq(X33,X34)))))&(nil=X22|~(nil=X21)))))),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)&(ssList(esk52_0)&((((ssList(esk53_0)&app(app(esk52_0,esk50_0),esk53_0)=esk51_0)&strictorderedP(esk50_0))&![X25]:(~(ssItem(X25))|![X26]:((~(ssList(X26))|~(app(X26,cons(X25,nil))=esk52_0))|![X27]:(~(ssItem(X27))|![X28]:((~(ssList(X28))|~(app(cons(X27,nil),X28)=esk50_0))|~(lt(X25,X27)))))))&![X29]:(~(ssItem(X29))|![X30]:((~(ssList(X30))|~(app(cons(X29,nil),X30)=esk53_0))|![X31]:(~(ssItem(X31))|![X32]:((~(ssList(X32))|~(app(X32,cons(X31,nil))=esk50_0))|~(lt(X31,X29)))))))))&(ssItem(esk54_0)&((ssItem(esk55_0)&(ssList(esk56_0)&(ssList(esk57_0)&app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0)=esk48_0)))&~(neq(esk54_0,esk55_0)))))&(nil=esk51_0|~(nil=esk50_0)))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X25]:![X26]:![X27]:![X28]:![X29]:![X30]:![X31]:![X32]:(((((((((((((~(ssList(X32))|~(app(X32,cons(X31,nil))=esk50_0))|~(lt(X31,X29)))|~(ssItem(X31)))|(~(ssList(X30))|~(app(cons(X29,nil),X30)=esk53_0)))|~(ssItem(X29)))&((((((~(ssList(X28))|~(app(cons(X27,nil),X28)=esk50_0))|~(lt(X25,X27)))|~(ssItem(X27)))|(~(ssList(X26))|~(app(X26,cons(X25,nil))=esk52_0)))|~(ssItem(X25)))&((ssList(esk53_0)&app(app(esk52_0,esk50_0),esk53_0)=esk51_0)&strictorderedP(esk50_0))))&ssList(esk52_0))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0))&(ssItem(esk54_0)&((ssItem(esk55_0)&(ssList(esk56_0)&(ssList(esk57_0)&app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0)=esk48_0)))&~(neq(esk54_0,esk55_0)))))&(nil=esk51_0|~(nil=esk50_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,(~neq(esk54_0,esk55_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0)=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(ssList(esk57_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssList(esk56_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssItem(esk55_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssItem(esk54_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(586,negated_conjecture,(strictorderedP(esk50_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(591,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,582,theory(equality)])).
% cnf(595,negated_conjecture,(app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0)=esk50_0),inference(rw,[status(thm)],[577,582,theory(equality)])).
% cnf(679,negated_conjecture,(esk54_0=esk55_0|~ssItem(esk55_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[576,108,theory(equality)])).
% cnf(680,negated_conjecture,(esk54_0=esk55_0|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[679,580,theory(equality)])).
% cnf(681,negated_conjecture,(esk54_0=esk55_0|$false|$false),inference(rw,[status(thm)],[680,581,theory(equality)])).
% cnf(682,negated_conjecture,(esk54_0=esk55_0),inference(cn,[status(thm)],[681,theory(equality)])).
% cnf(1427,negated_conjecture,(app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk54_0,nil)),esk57_0)=esk50_0),inference(rw,[status(thm)],[595,682,theory(equality)])).
% cnf(1665,negated_conjecture,(esk50_0=app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))|~ssList(esk57_0)|~ssList(cons(esk54_0,nil))|~ssList(app(esk56_0,cons(esk54_0,nil)))),inference(spm,[status(thm)],[198,1427,theory(equality)])).
% cnf(1697,negated_conjecture,(esk50_0=app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))|$false|~ssList(cons(esk54_0,nil))|~ssList(app(esk56_0,cons(esk54_0,nil)))),inference(rw,[status(thm)],[1665,578,theory(equality)])).
% cnf(1698,negated_conjecture,(esk50_0=app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))|~ssList(cons(esk54_0,nil))|~ssList(app(esk56_0,cons(esk54_0,nil)))),inference(cn,[status(thm)],[1697,theory(equality)])).
% cnf(2771,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(app(esk56_0,cons(esk54_0,nil)))|~ssList(nil)|~ssItem(esk54_0)),inference(spm,[status(thm)],[1698,137,theory(equality)])).
% cnf(2772,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(app(esk56_0,cons(esk54_0,nil)))|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[2771,138,theory(equality)])).
% cnf(2773,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(app(esk56_0,cons(esk54_0,nil)))|$false|$false),inference(rw,[status(thm)],[2772,581,theory(equality)])).
% cnf(2774,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(app(esk56_0,cons(esk54_0,nil)))),inference(cn,[status(thm)],[2773,theory(equality)])).
% cnf(2775,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(cons(esk54_0,nil))|~ssList(esk56_0)),inference(spm,[status(thm)],[2774,163,theory(equality)])).
% cnf(2776,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(cons(esk54_0,nil))|$false),inference(rw,[status(thm)],[2775,579,theory(equality)])).
% cnf(2777,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(cons(esk54_0,nil))),inference(cn,[status(thm)],[2776,theory(equality)])).
% cnf(2778,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))=esk50_0|~ssList(nil)|~ssItem(esk54_0)),inference(spm,[status(thm)],[2777,137,theory(equality)])).
% cnf(2779,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))=esk50_0|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[2778,138,theory(equality)])).
% cnf(2780,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2779,581,theory(equality)])).
% cnf(2781,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0))=esk50_0),inference(cn,[status(thm)],[2780,theory(equality)])).
% cnf(2799,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),cons(esk54_0,esk57_0))=esk50_0|~ssList(esk57_0)|~ssItem(esk54_0)),inference(spm,[status(thm)],[2781,194,theory(equality)])).
% cnf(2812,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),cons(esk54_0,esk57_0))=esk50_0|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[2799,578,theory(equality)])).
% cnf(2813,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),cons(esk54_0,esk57_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2812,581,theory(equality)])).
% cnf(2814,negated_conjecture,(app(app(esk56_0,cons(esk54_0,nil)),cons(esk54_0,esk57_0))=esk50_0),inference(cn,[status(thm)],[2813,theory(equality)])).
% cnf(2837,negated_conjecture,(lt(esk54_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(esk57_0)|~ssList(nil)|~ssList(esk56_0)|~ssList(X1)|~ssItem(esk54_0)),inference(spm,[status(thm)],[127,2814,theory(equality)])).
% cnf(2866,negated_conjecture,(lt(esk54_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|$false|~ssList(nil)|~ssList(esk56_0)|~ssList(X1)|~ssItem(esk54_0)),inference(rw,[status(thm)],[2837,578,theory(equality)])).
% cnf(2867,negated_conjecture,(lt(esk54_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|~ssList(esk56_0)|~ssList(X1)|~ssItem(esk54_0)),inference(rw,[status(thm)],[2866,138,theory(equality)])).
% cnf(2868,negated_conjecture,(lt(esk54_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|~ssItem(esk54_0)),inference(rw,[status(thm)],[2867,579,theory(equality)])).
% cnf(2869,negated_conjecture,(lt(esk54_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[2868,581,theory(equality)])).
% cnf(2870,negated_conjecture,(lt(esk54_0,esk54_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(X1)),inference(cn,[status(thm)],[2869,theory(equality)])).
% cnf(3184,negated_conjecture,(lt(esk54_0,esk54_0)|~strictorderedP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[2870,theory(equality)])).
% cnf(3185,negated_conjecture,(lt(esk54_0,esk54_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[3184,586,theory(equality)])).
% cnf(3186,negated_conjecture,(lt(esk54_0,esk54_0)|$false|$false),inference(rw,[status(thm)],[3185,591,theory(equality)])).
% cnf(3187,negated_conjecture,(lt(esk54_0,esk54_0)),inference(cn,[status(thm)],[3186,theory(equality)])).
% cnf(3188,negated_conjecture,(~ssItem(esk54_0)),inference(spm,[status(thm)],[211,3187,theory(equality)])).
% cnf(3194,negated_conjecture,($false),inference(rw,[status(thm)],[3188,581,theory(equality)])).
% cnf(3195,negated_conjecture,($false),inference(cn,[status(thm)],[3194,theory(equality)])).
% cnf(3196,negated_conjecture,($false),3195,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 332
% # ...of these trivial : 5
% # ...subsumed : 9
% # ...remaining for further processing: 318
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 30
% # Generated clauses : 1130
% # ...of the previous two non-trivial : 969
% # Contextual simplify-reflections : 4
% # Paramodulations : 1036
% # Factorizations : 0
% # Equation resolutions : 94
% # Current number of processed clauses: 281
% # Positive orientable unit clauses: 52
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 226
% # Current number of unprocessed clauses: 765
% # ...number of literals in the above : 4706
% # Clause-clause subsumption calls (NU) : 2331
% # Rec. Clause-clause subsumption calls : 1426
% # Unit Clause-clause subsumption calls : 41
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 41
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 304 leaves, 1.36+/-1.115 terms/leaf
% # Paramod-from index: 127 leaves, 1.06+/-0.392 terms/leaf
% # Paramod-into index: 258 leaves, 1.24+/-0.937 terms/leaf
% # -------------------------------------------------
% # User time : 0.097 s
% # System time : 0.008 s
% # Total time : 0.105 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.34 WC
% FINAL PrfWatch: 0.25 CPU 0.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP31482/SWC176+1.tptp
%
%------------------------------------------------------------------------------