TSTP Solution File: SWC076+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC076+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 : art09.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 06:59:31 EST 2010
% Result : Theorem 1.31s
% Output : Solution 1.31s
% 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/SystemOnTPTP18823/SWC076+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18823/SWC076+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18823/SWC076+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 18919
% 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(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(segmentP(X1,X2)<=>?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1))))),file('/tmp/SRASS.s.p', ax7)).
% 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(17, axiom,![X1]:(ssList(X1)=>segmentP(X1,X1)),file('/tmp/SRASS.s.p', ax55)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|?[X5]:(((ssList(X5)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(((~(app(app(X6,X3),X7)=X4)|~(equalelemsP(X3)))|?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X6)&?[X10]:(ssList(X10)&app(cons(X8,nil),X10)=X3))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X7)&?[X13]:(ssList(X13)&app(X13,cons(X11,nil))=X3)))))))|(~(nil=X4)&nil=X3))|(nil=X2&nil=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)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(((~(app(app(X6,X3),X7)=X4)|~(equalelemsP(X3)))|?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X6)&?[X10]:(ssList(X10)&app(cons(X8,nil),X10)=X3))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X7)&?[X13]:(ssList(X13)&app(X13,cons(X11,nil))=X3)))))))|(~(nil=X4)&nil=X3))|(nil=X2&nil=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)&neq(X5,nil))&segmentP(X2,X5))&segmentP(X1,X5)))|![X6]:(ssList(X6)=>![X7]:(ssList(X7)=>(((~(app(app(X6,X3),X7)=X4)|~(equalelemsP(X3)))|?[X8]:(ssItem(X8)&?[X9]:((ssList(X9)&app(X9,cons(X8,nil))=X6)&?[X10]:(ssList(X10)&app(cons(X8,nil),X10)=X3))))|?[X11]:(ssItem(X11)&?[X12]:((ssList(X12)&app(cons(X11,nil),X12)=X7)&?[X13]:(ssList(X13)&app(X13,cons(X11,nil))=X3)))))))|(~(nil=X4)&nil=X3))|(nil=X2&nil=X1))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(segmentP(X1,X2))|?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&app(app(X3,X2),X4)=X1)))&(![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|~(app(app(X3,X2),X4)=X1)))|segmentP(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&app(app(X7,X6),X8)=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[116])).
% fof(118, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk3_2(X5,X6))&(ssList(esk4_2(X5,X6))&app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk3_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk4_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk3_2(X5,X6),X6),esk4_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[118])).
% cnf(123,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),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(187, plain,![X1]:(~(ssList(X1))|segmentP(X1,X1)),inference(fof_nnf,[status(thm)],[17])).
% fof(188, plain,![X2]:(~(ssList(X2))|segmentP(X2,X2)),inference(variable_rename,[status(thm)],[187])).
% cnf(189,plain,(segmentP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[188])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((((X2=X4&X1=X3)&![X5]:(((~(ssList(X5))|~(neq(X5,nil)))|~(segmentP(X2,X5)))|~(segmentP(X1,X5))))&?[X6]:(ssList(X6)&?[X7]:(ssList(X7)&(((app(app(X6,X3),X7)=X4&equalelemsP(X3))&![X8]:(~(ssItem(X8))|![X9]:((~(ssList(X9))|~(app(X9,cons(X8,nil))=X6))|![X10]:(~(ssList(X10))|~(app(cons(X8,nil),X10)=X3)))))&![X11]:(~(ssItem(X11))|![X12]:((~(ssList(X12))|~(app(cons(X11,nil),X12)=X7))|![X13]:(~(ssList(X13))|~(app(X13,cons(X11,nil))=X3))))))))&(nil=X4|~(nil=X3)))&(~(nil=X2)|~(nil=X1))))))),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))|~(neq(X18,nil)))|~(segmentP(X15,X18)))|~(segmentP(X14,X18))))&?[X19]:(ssList(X19)&?[X20]:(ssList(X20)&(((app(app(X19,X16),X20)=X17&equalelemsP(X16))&![X21]:(~(ssItem(X21))|![X22]:((~(ssList(X22))|~(app(X22,cons(X21,nil))=X19))|![X23]:(~(ssList(X23))|~(app(cons(X21,nil),X23)=X16)))))&![X24]:(~(ssItem(X24))|![X25]:((~(ssList(X25))|~(app(cons(X24,nil),X25)=X20))|![X26]:(~(ssList(X26))|~(app(X26,cons(X24,nil))=X16))))))))&(nil=X17|~(nil=X16)))&(~(nil=X15)|~(nil=X14))))))),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)&![X18]:(((~(ssList(X18))|~(neq(X18,nil)))|~(segmentP(esk49_0,X18)))|~(segmentP(esk48_0,X18))))&(ssList(esk52_0)&(ssList(esk53_0)&(((app(app(esk52_0,esk50_0),esk53_0)=esk51_0&equalelemsP(esk50_0))&![X21]:(~(ssItem(X21))|![X22]:((~(ssList(X22))|~(app(X22,cons(X21,nil))=esk52_0))|![X23]:(~(ssList(X23))|~(app(cons(X21,nil),X23)=esk50_0)))))&![X24]:(~(ssItem(X24))|![X25]:((~(ssList(X25))|~(app(cons(X24,nil),X25)=esk53_0))|![X26]:(~(ssList(X26))|~(app(X26,cons(X24,nil))=esk50_0))))))))&(nil=esk51_0|~(nil=esk50_0)))&(~(nil=esk49_0)|~(nil=esk48_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X18]:![X21]:![X22]:![X23]:![X24]:![X25]:![X26]:(((((((((((((~(ssList(X26))|~(app(X26,cons(X24,nil))=esk50_0))|(~(ssList(X25))|~(app(cons(X24,nil),X25)=esk53_0)))|~(ssItem(X24)))&((((~(ssList(X23))|~(app(cons(X21,nil),X23)=esk50_0))|(~(ssList(X22))|~(app(X22,cons(X21,nil))=esk52_0)))|~(ssItem(X21)))&(app(app(esk52_0,esk50_0),esk53_0)=esk51_0&equalelemsP(esk50_0))))&ssList(esk53_0))&ssList(esk52_0))&((((~(ssList(X18))|~(neq(X18,nil)))|~(segmentP(esk49_0,X18)))|~(segmentP(esk48_0,X18)))&(esk49_0=esk51_0&esk48_0=esk50_0)))&(nil=esk51_0|~(nil=esk50_0)))&(~(nil=esk49_0)|~(nil=esk48_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(573,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(nil=esk51_0|nil!=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(~segmentP(esk48_0,X1)|~segmentP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(app(app(esk52_0,esk50_0),esk53_0)=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(587,negated_conjecture,(esk50_0!=nil|esk49_0!=nil),inference(rw,[status(thm)],[576,578,theory(equality)])).
% cnf(588,negated_conjecture,(esk50_0!=nil|esk51_0!=nil),inference(rw,[status(thm)],[587,579,theory(equality)])).
% cnf(589,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,578,theory(equality)])).
% cnf(590,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,579,theory(equality)])).
% cnf(593,negated_conjecture,(esk50_0!=nil),inference(csr,[status(thm)],[577,588])).
% cnf(597,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk49_0,X1)),inference(rw,[status(thm)],[580,578,theory(equality)])).
% cnf(598,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~segmentP(esk50_0,X1)|~segmentP(esk51_0,X1)),inference(rw,[status(thm)],[597,579,theory(equality)])).
% cnf(600,negated_conjecture,(~segmentP(esk51_0,esk50_0)|~ssList(esk50_0)|~neq(esk50_0,nil)),inference(spm,[status(thm)],[598,189,theory(equality)])).
% cnf(604,negated_conjecture,(~segmentP(esk51_0,esk50_0)|$false|~neq(esk50_0,nil)),inference(rw,[status(thm)],[600,589,theory(equality)])).
% cnf(605,negated_conjecture,(~segmentP(esk51_0,esk50_0)|~neq(esk50_0,nil)),inference(cn,[status(thm)],[604,theory(equality)])).
% cnf(847,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(esk53_0)|~ssList(esk52_0)|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[123,584,theory(equality)])).
% cnf(856,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|~ssList(esk52_0)|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[847,582,theory(equality)])).
% cnf(857,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|$false|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[856,581,theory(equality)])).
% cnf(858,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|$false|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[857,589,theory(equality)])).
% cnf(859,negated_conjecture,(segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[858,theory(equality)])).
% cnf(1816,negated_conjecture,(segmentP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[859,theory(equality)])).
% cnf(1817,negated_conjecture,(segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[1816,590,theory(equality)])).
% cnf(1818,negated_conjecture,(segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[1817,theory(equality)])).
% cnf(1825,negated_conjecture,($false|~neq(esk50_0,nil)),inference(rw,[status(thm)],[605,1818,theory(equality)])).
% cnf(1826,negated_conjecture,(~neq(esk50_0,nil)),inference(cn,[status(thm)],[1825,theory(equality)])).
% cnf(1846,negated_conjecture,(esk50_0=nil|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[1826,140,theory(equality)])).
% cnf(1848,negated_conjecture,(esk50_0=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[1846,146,theory(equality)])).
% cnf(1849,negated_conjecture,(esk50_0=nil|$false|$false),inference(rw,[status(thm)],[1848,589,theory(equality)])).
% cnf(1850,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[1849,theory(equality)])).
% cnf(1851,negated_conjecture,($false),inference(sr,[status(thm)],[1850,593,theory(equality)])).
% cnf(1852,negated_conjecture,($false),1851,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 246
% # ...of these trivial : 2
% # ...subsumed : 7
% # ...remaining for further processing: 237
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 11
% # Generated clauses : 703
% # ...of the previous two non-trivial : 584
% # Contextual simplify-reflections : 3
% # Paramodulations : 610
% # Factorizations : 0
% # Equation resolutions : 93
% # Current number of processed clauses: 219
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 186
% # Current number of unprocessed clauses: 480
% # ...number of literals in the above : 3353
% # Clause-clause subsumption calls (NU) : 916
% # Rec. Clause-clause subsumption calls : 196
% # Unit Clause-clause subsumption calls : 11
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 254 leaves, 1.32+/-1.093 terms/leaf
% # Paramod-from index: 113 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 214 leaves, 1.22+/-0.944 terms/leaf
% # -------------------------------------------------
% # User time : 0.073 s
% # System time : 0.006 s
% # Total time : 0.079 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP18823/SWC076+1.tptp
%
%------------------------------------------------------------------------------