TSTP Solution File: SWC175+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC175+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 : art06.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:48 EST 2010
% Result : Theorem 1.34s
% Output : Solution 1.34s
% 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/SystemOnTPTP21274/SWC175+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21274/SWC175+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21274/SWC175+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 21370
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|![X10]:(ssItem(X10)=>![X11]:(ssItem(X11)=>(![X12]:(ssList(X12)=>![X13]:(ssList(X13)=>~(app(app(app(X12,cons(X10,nil)),cons(X11,nil)),X13)=X1)))|neq(X10,X11)))))|(~(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)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|![X10]:(ssItem(X10)=>![X11]:(ssItem(X11)=>(![X12]:(ssList(X12)=>![X13]:(ssList(X13)=>~(app(app(app(X12,cons(X10,nil)),cons(X11,nil)),X13)=X1)))|neq(X10,X11)))))|(~(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)=>((~(app(X3,X5)=X4)|~(strictorderedP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X3)<(X8,X6))))))))|![X10]:(ssItem(X10)=>![X11]:(ssItem(X11)=>(![X12]:(ssList(X12)=>![X13]:(ssList(X13)=>~(app(app(app(X12,cons(X10,nil)),cons(X11,nil)),X13)=X1)))|neq(X10,X11)))))|(~(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)&((app(X3,X5)=X4&strictorderedP(X3))&![X6]:(~(ssItem(X6))|![X7]:((~(ssList(X7))|~(app(cons(X6,nil),X7)=X5))|![X8]:(~(ssItem(X8))|![X9]:((~(ssList(X9))|~(app(X9,cons(X8,nil))=X3))|~(lt(X8,X6)))))))))&?[X10]:(ssItem(X10)&?[X11]:(ssItem(X11)&(?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&app(app(app(X12,cons(X10,nil)),cons(X11,nil)),X13)=X1))&~(neq(X10,X11))))))&(nil=X4|~(nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&?[X17]:(ssList(X17)&((((X15=X17&X14=X16)&?[X18]:(ssList(X18)&((app(X16,X18)=X17&strictorderedP(X16))&![X19]:(~(ssItem(X19))|![X20]:((~(ssList(X20))|~(app(cons(X19,nil),X20)=X18))|![X21]:(~(ssItem(X21))|![X22]:((~(ssList(X22))|~(app(X22,cons(X21,nil))=X16))|~(lt(X21,X19)))))))))&?[X23]:(ssItem(X23)&?[X24]:(ssItem(X24)&(?[X25]:(ssList(X25)&?[X26]:(ssList(X26)&app(app(app(X25,cons(X23,nil)),cons(X24,nil)),X26)=X14))&~(neq(X23,X24))))))&(nil=X17|~(nil=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)&(ssList(esk52_0)&((app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0))&![X19]:(~(ssItem(X19))|![X20]:((~(ssList(X20))|~(app(cons(X19,nil),X20)=esk52_0))|![X21]:(~(ssItem(X21))|![X22]:((~(ssList(X22))|~(app(X22,cons(X21,nil))=esk50_0))|~(lt(X21,X19)))))))))&(ssItem(esk53_0)&(ssItem(esk54_0)&((ssList(esk55_0)&(ssList(esk56_0)&app(app(app(esk55_0,cons(esk53_0,nil)),cons(esk54_0,nil)),esk56_0)=esk48_0))&~(neq(esk53_0,esk54_0))))))&(nil=esk51_0|~(nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X19]:![X20]:![X21]:![X22]:((((((((((((((~(ssList(X22))|~(app(X22,cons(X21,nil))=esk50_0))|~(lt(X21,X19)))|~(ssItem(X21)))|(~(ssList(X20))|~(app(cons(X19,nil),X20)=esk52_0)))|~(ssItem(X19)))&(app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(ssItem(esk53_0)&(ssItem(esk54_0)&((ssList(esk55_0)&(ssList(esk56_0)&app(app(app(esk55_0,cons(esk53_0,nil)),cons(esk54_0,nil)),esk56_0)=esk48_0))&~(neq(esk53_0,esk54_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])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(~neq(esk53_0,esk54_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(app(app(app(esk55_0,cons(esk53_0,nil)),cons(esk54_0,nil)),esk56_0)=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(ssList(esk56_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssList(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,(ssItem(esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,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(589,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,583,theory(equality)])).
% cnf(593,negated_conjecture,(app(app(app(esk55_0,cons(esk53_0,nil)),cons(esk54_0,nil)),esk56_0)=esk50_0),inference(rw,[status(thm)],[578,583,theory(equality)])).
% cnf(680,negated_conjecture,(esk53_0=esk54_0|~ssItem(esk54_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[577,108,theory(equality)])).
% cnf(681,negated_conjecture,(esk53_0=esk54_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[680,581,theory(equality)])).
% cnf(682,negated_conjecture,(esk53_0=esk54_0|$false|$false),inference(rw,[status(thm)],[681,582,theory(equality)])).
% cnf(683,negated_conjecture,(esk53_0=esk54_0),inference(cn,[status(thm)],[682,theory(equality)])).
% cnf(1422,negated_conjecture,(app(app(app(esk55_0,cons(esk53_0,nil)),cons(esk53_0,nil)),esk56_0)=esk50_0),inference(rw,[status(thm)],[593,683,theory(equality)])).
% cnf(1617,negated_conjecture,(esk50_0=app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))|~ssList(esk56_0)|~ssList(cons(esk53_0,nil))|~ssList(app(esk55_0,cons(esk53_0,nil)))),inference(spm,[status(thm)],[198,1422,theory(equality)])).
% cnf(1649,negated_conjecture,(esk50_0=app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))|$false|~ssList(cons(esk53_0,nil))|~ssList(app(esk55_0,cons(esk53_0,nil)))),inference(rw,[status(thm)],[1617,579,theory(equality)])).
% cnf(1650,negated_conjecture,(esk50_0=app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))|~ssList(cons(esk53_0,nil))|~ssList(app(esk55_0,cons(esk53_0,nil)))),inference(cn,[status(thm)],[1649,theory(equality)])).
% cnf(2723,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk55_0,cons(esk53_0,nil)))|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[1650,137,theory(equality)])).
% cnf(2724,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk55_0,cons(esk53_0,nil)))|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2723,138,theory(equality)])).
% cnf(2725,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk55_0,cons(esk53_0,nil)))|$false|$false),inference(rw,[status(thm)],[2724,582,theory(equality)])).
% cnf(2726,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(app(esk55_0,cons(esk53_0,nil)))),inference(cn,[status(thm)],[2725,theory(equality)])).
% cnf(2727,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk53_0,nil))|~ssList(esk55_0)),inference(spm,[status(thm)],[2726,163,theory(equality)])).
% cnf(2728,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk53_0,nil))|$false),inference(rw,[status(thm)],[2727,580,theory(equality)])).
% cnf(2729,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(cons(esk53_0,nil))),inference(cn,[status(thm)],[2728,theory(equality)])).
% cnf(2730,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))=esk50_0|~ssList(nil)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2729,137,theory(equality)])).
% cnf(2731,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2730,138,theory(equality)])).
% cnf(2732,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2731,582,theory(equality)])).
% cnf(2733,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_0))=esk50_0),inference(cn,[status(thm)],[2732,theory(equality)])).
% cnf(2751,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),cons(esk53_0,esk56_0))=esk50_0|~ssList(esk56_0)|~ssItem(esk53_0)),inference(spm,[status(thm)],[2733,194,theory(equality)])).
% cnf(2764,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),cons(esk53_0,esk56_0))=esk50_0|$false|~ssItem(esk53_0)),inference(rw,[status(thm)],[2751,579,theory(equality)])).
% cnf(2765,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),cons(esk53_0,esk56_0))=esk50_0|$false|$false),inference(rw,[status(thm)],[2764,582,theory(equality)])).
% cnf(2766,negated_conjecture,(app(app(esk55_0,cons(esk53_0,nil)),cons(esk53_0,esk56_0))=esk50_0),inference(cn,[status(thm)],[2765,theory(equality)])).
% cnf(2789,negated_conjecture,(lt(esk53_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(esk56_0)|~ssList(nil)|~ssList(esk55_0)|~ssList(X1)|~ssItem(esk53_0)),inference(spm,[status(thm)],[127,2766,theory(equality)])).
% cnf(2818,negated_conjecture,(lt(esk53_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|~ssList(nil)|~ssList(esk55_0)|~ssList(X1)|~ssItem(esk53_0)),inference(rw,[status(thm)],[2789,579,theory(equality)])).
% cnf(2819,negated_conjecture,(lt(esk53_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|~ssList(esk55_0)|~ssList(X1)|~ssItem(esk53_0)),inference(rw,[status(thm)],[2818,138,theory(equality)])).
% cnf(2820,negated_conjecture,(lt(esk53_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|~ssItem(esk53_0)),inference(rw,[status(thm)],[2819,580,theory(equality)])).
% cnf(2821,negated_conjecture,(lt(esk53_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|$false|$false|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[2820,582,theory(equality)])).
% cnf(2822,negated_conjecture,(lt(esk53_0,esk53_0)|esk50_0!=X1|~strictorderedP(X1)|~ssList(X1)),inference(cn,[status(thm)],[2821,theory(equality)])).
% cnf(3154,negated_conjecture,(lt(esk53_0,esk53_0)|~strictorderedP(esk50_0)|~ssList(esk50_0)),inference(er,[status(thm)],[2822,theory(equality)])).
% cnf(3155,negated_conjecture,(lt(esk53_0,esk53_0)|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[3154,586,theory(equality)])).
% cnf(3156,negated_conjecture,(lt(esk53_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[3155,589,theory(equality)])).
% cnf(3157,negated_conjecture,(lt(esk53_0,esk53_0)),inference(cn,[status(thm)],[3156,theory(equality)])).
% cnf(3158,negated_conjecture,(~ssItem(esk53_0)),inference(spm,[status(thm)],[211,3157,theory(equality)])).
% cnf(3164,negated_conjecture,($false),inference(rw,[status(thm)],[3158,582,theory(equality)])).
% cnf(3165,negated_conjecture,($false),inference(cn,[status(thm)],[3164,theory(equality)])).
% cnf(3166,negated_conjecture,($false),3165,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 328
% # ...of these trivial : 5
% # ...subsumed : 8
% # ...remaining for further processing: 315
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 30
% # Generated clauses : 1115
% # ...of the previous two non-trivial : 955
% # Contextual simplify-reflections : 4
% # Paramodulations : 1021
% # Factorizations : 0
% # Equation resolutions : 94
% # Current number of processed clauses: 278
% # Positive orientable unit clauses: 50
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 225
% # Current number of unprocessed clauses: 753
% # ...number of literals in the above : 4633
% # Clause-clause subsumption calls (NU) : 2384
% # Rec. Clause-clause subsumption calls : 1529
% # Unit Clause-clause subsumption calls : 36
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 41
% # Indexed BW rewrite successes : 19
% # Backwards rewriting index: 299 leaves, 1.36+/-1.123 terms/leaf
% # Paramod-from index: 127 leaves, 1.06+/-0.392 terms/leaf
% # Paramod-into index: 256 leaves, 1.24+/-0.941 terms/leaf
% # -------------------------------------------------
% # User time : 0.101 s
% # System time : 0.005 s
% # Total time : 0.106 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.33 WC
% FINAL PrfWatch: 0.24 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP21274/SWC175+1.tptp
%
%------------------------------------------------------------------------------