TSTP Solution File: SWC100+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC100+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 : art01.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:03:38 EST 2010
% Result : Theorem 1.50s
% Output : Solution 1.50s
% 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/SystemOnTPTP31867/SWC100+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31867/SWC100+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31867/SWC100+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 31963
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(7, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(30, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% 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))))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&frontsegP(X2,X1))))))))),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))))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&frontsegP(X2,X1)))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![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))))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|(neq(X1,nil)&frontsegP(X2,X1)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, 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)],[3])).
% fof(116, 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)],[115])).
% fof(117, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk3_2(X4,X5))&app(X5,esk3_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[116])).
% fof(118, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk3_2(X4,X5))&app(X5,esk3_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk3_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk3_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[118])).
% cnf(122,plain,(frontsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X2,X3)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[119])).
% fof(136, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[5])).
% fof(137, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[136])).
% fof(138, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[137])).
% fof(139, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[138])).
% cnf(140,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[139])).
% cnf(146,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[7])).
% fof(237, 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)],[30])).
% fof(238, 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)],[237])).
% fof(239, 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)],[238])).
% fof(240, 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)],[239])).
% cnf(242,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[240])).
% 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)))))))))&(nil=X4|~(nil=X3)))&((nil=X2&~(nil=X1))|(neq(X2,nil)&(~(neq(X1,nil))|~(frontsegP(X2,X1)))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&((((X11=X13&X10=X12)&?[X14]:(ssList(X14)&((app(X12,X14)=X13&strictorderedP(X12))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=X14))|![X17]:(~(ssItem(X17))|![X18]:((~(ssList(X18))|~(app(X18,cons(X17,nil))=X12))|~(lt(X17,X15)))))))))&(nil=X13|~(nil=X12)))&((nil=X11&~(nil=X10))|(neq(X11,nil)&(~(neq(X10,nil))|~(frontsegP(X11,X10)))))))))),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))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0))|![X17]:(~(ssItem(X17))|![X18]:((~(ssList(X18))|~(app(X18,cons(X17,nil))=esk50_0))|~(lt(X17,X15)))))))))&(nil=esk51_0|~(nil=esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&(~(neq(esk48_0,nil))|~(frontsegP(esk49_0,esk48_0)))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:![X18]:((((((((((((((~(ssList(X18))|~(app(X18,cons(X17,nil))=esk50_0))|~(lt(X17,X15)))|~(ssItem(X17)))|(~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0)))|~(ssItem(X15)))&(app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk51_0|~(nil=esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&(~(neq(esk48_0,nil))|~(frontsegP(esk49_0,esk48_0))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X15]:![X16]:![X17]:![X18]:((((((((((((((~(ssList(X18))|~(app(X18,cons(X17,nil))=esk50_0))|~(lt(X17,X15)))|~(ssItem(X17)))|(~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0)))|~(ssItem(X15)))&(app(esk50_0,esk52_0)=esk51_0&strictorderedP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk51_0|~(nil=esk50_0)))&(((neq(esk49_0,nil)|nil=esk49_0)&((~(neq(esk48_0,nil))|~(frontsegP(esk49_0,esk48_0)))|nil=esk49_0))&((neq(esk49_0,nil)|~(nil=esk48_0))&((~(neq(esk48_0,nil))|~(frontsegP(esk49_0,esk48_0)))|~(nil=esk48_0)))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(nil!=esk48_0|~frontsegP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(nil=esk49_0|~frontsegP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(nil=esk51_0|nil!=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(app(esk50_0,esk52_0)=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(esk49_0=nil|esk50_0!=nil),inference(rw,[status(thm)],[581,583,theory(equality)])).
% cnf(592,negated_conjecture,(esk49_0=nil|esk48_0!=nil),inference(rw,[status(thm)],[591,582,theory(equality)])).
% cnf(593,negated_conjecture,(app(esk48_0,esk52_0)=esk51_0),inference(rw,[status(thm)],[586,582,theory(equality)])).
% cnf(594,negated_conjecture,(app(esk48_0,esk52_0)=esk49_0),inference(rw,[status(thm)],[593,583,theory(equality)])).
% cnf(624,negated_conjecture,(nil=esk48_0|esk49_0!=nil|~ssList(esk52_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[242,594,theory(equality)])).
% cnf(626,negated_conjecture,(nil=esk48_0|esk49_0!=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[624,584,theory(equality)])).
% cnf(627,negated_conjecture,(nil=esk48_0|esk49_0!=nil|$false|$false),inference(rw,[status(thm)],[626,573,theory(equality)])).
% cnf(628,negated_conjecture,(nil=esk48_0|esk49_0!=nil),inference(cn,[status(thm)],[627,theory(equality)])).
% cnf(689,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|~ssList(esk52_0)|~ssList(esk48_0)|~ssList(X1)),inference(spm,[status(thm)],[122,594,theory(equality)])).
% cnf(693,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|$false|~ssList(esk48_0)|~ssList(X1)),inference(rw,[status(thm)],[689,584,theory(equality)])).
% cnf(694,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[693,573,theory(equality)])).
% cnf(695,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[694,theory(equality)])).
% cnf(1848,negated_conjecture,(frontsegP(esk49_0,esk48_0)|~ssList(esk49_0)),inference(er,[status(thm)],[695,theory(equality)])).
% cnf(1849,negated_conjecture,(frontsegP(esk49_0,esk48_0)|$false),inference(rw,[status(thm)],[1848,574,theory(equality)])).
% cnf(1850,negated_conjecture,(frontsegP(esk49_0,esk48_0)),inference(cn,[status(thm)],[1849,theory(equality)])).
% cnf(1856,negated_conjecture,(esk48_0!=nil|$false|~neq(esk48_0,nil)),inference(rw,[status(thm)],[577,1850,theory(equality)])).
% cnf(1857,negated_conjecture,(esk48_0!=nil|~neq(esk48_0,nil)),inference(cn,[status(thm)],[1856,theory(equality)])).
% cnf(1858,negated_conjecture,(esk49_0=nil|$false|~neq(esk48_0,nil)),inference(rw,[status(thm)],[579,1850,theory(equality)])).
% cnf(1859,negated_conjecture,(esk49_0=nil|~neq(esk48_0,nil)),inference(cn,[status(thm)],[1858,theory(equality)])).
% cnf(1876,negated_conjecture,(esk49_0=nil|esk48_0=nil|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[1859,140,theory(equality)])).
% cnf(1877,negated_conjecture,(esk49_0=nil|esk48_0=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[1876,146,theory(equality)])).
% cnf(1878,negated_conjecture,(esk49_0=nil|esk48_0=nil|$false|$false),inference(rw,[status(thm)],[1877,573,theory(equality)])).
% cnf(1879,negated_conjecture,(esk49_0=nil|esk48_0=nil),inference(cn,[status(thm)],[1878,theory(equality)])).
% cnf(1880,negated_conjecture,(esk49_0=nil),inference(csr,[status(thm)],[1879,592])).
% cnf(1895,negated_conjecture,(esk48_0=nil|$false),inference(rw,[status(thm)],[628,1880,theory(equality)])).
% cnf(1896,negated_conjecture,(esk48_0=nil),inference(cn,[status(thm)],[1895,theory(equality)])).
% cnf(1898,negated_conjecture,(neq(nil,nil)|esk48_0!=nil),inference(rw,[status(thm)],[578,1880,theory(equality)])).
% cnf(1908,negated_conjecture,($false|~neq(esk48_0,nil)),inference(rw,[status(thm)],[1857,1896,theory(equality)])).
% cnf(1909,negated_conjecture,($false|~neq(nil,nil)),inference(rw,[status(thm)],[1908,1896,theory(equality)])).
% cnf(1910,negated_conjecture,(~neq(nil,nil)),inference(cn,[status(thm)],[1909,theory(equality)])).
% cnf(1927,negated_conjecture,(neq(nil,nil)|$false),inference(rw,[status(thm)],[1898,1896,theory(equality)])).
% cnf(1928,negated_conjecture,(neq(nil,nil)),inference(cn,[status(thm)],[1927,theory(equality)])).
% cnf(1929,negated_conjecture,($false),inference(sr,[status(thm)],[1928,1910,theory(equality)])).
% cnf(1930,negated_conjecture,($false),1929,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 270
% # ...of these trivial : 6
% # ...subsumed : 13
% # ...remaining for further processing: 251
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 40
% # Generated clauses : 709
% # ...of the previous two non-trivial : 610
% # Contextual simplify-reflections : 5
% # Paramodulations : 615
% # Factorizations : 0
% # Equation resolutions : 94
% # Current number of processed clauses: 203
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 177
% # Current number of unprocessed clauses: 448
% # ...number of literals in the above : 3203
% # Clause-clause subsumption calls (NU) : 1005
% # Rec. Clause-clause subsumption calls : 261
% # Unit Clause-clause subsumption calls : 25
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 234 leaves, 1.35+/-1.134 terms/leaf
% # Paramod-from index: 107 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 198 leaves, 1.24+/-0.979 terms/leaf
% # -------------------------------------------------
% # User time : 0.078 s
% # System time : 0.004 s
% # Total time : 0.082 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.28 WC
% FINAL PrfWatch: 0.23 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP31867/SWC100+1.tptp
%
%------------------------------------------------------------------------------