TSTP Solution File: SWC330+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC330+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:50:08 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/SystemOnTPTP11298/SWC330+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11298/SWC330+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11298/SWC330+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 11394
% 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(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(10, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(24, axiom,![X1]:(ssList(X1)=>(segmentP(nil,X1)<=>nil=X1)),file('/tmp/SRASS.s.p', ax58)).
% fof(25, axiom,![X1]:(ssItem(X1)=>equalelemsP(cons(X1,nil))),file('/tmp/SRASS.s.p', ax73)).
% fof(26, axiom,equalelemsP(nil),file('/tmp/SRASS.s.p', ax74)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:((((~(ssList(X4))|~(X2=X4))|~(X1=X3))|(![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:((((~(ssList(X7))|~(cons(X5,nil)=X3))|~(app(app(X6,X3),X7)=X4))|?[X8]:((ssItem(X8)&memberP(X6,X8))<(X5,X8)))|?[X9]:((ssItem(X9)&memberP(X7,X9))<(X9,X5)))))&(~(nil=X4)|~(nil=X3))))|(segmentP(X2,X1)&equalelemsP(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]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:((((~(ssList(X7))|~(cons(X5,nil)=X3))|~(app(app(X6,X3),X7)=X4))|?[X8]:((ssItem(X8)&memberP(X6,X8))<(X5,X8)))|?[X9]:((ssItem(X9)&memberP(X7,X9))<(X9,X5)))))&(~(nil=X4)|~(nil=X3))))|(segmentP(X2,X1)&equalelemsP(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]:(ssItem(X5)=>![X6]:(ssList(X6)=>![X7]:((((~(ssList(X7))|~(cons(X5,nil)=X3))|~(app(app(X6,X3),X7)=X4))|?[X8]:((ssItem(X8)&memberP(X6,X8))<(X5,X8)))|?[X9]:((ssItem(X9)&memberP(X7,X9))<(X9,X5)))))&(~(nil=X4)|~(nil=X3))))|(segmentP(X2,X1)&equalelemsP(X1))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(118, 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(119, 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)],[118])).
% fof(120, plain,![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|((~(segmentP(X5,X6))|(ssList(esk5_2(X5,X6))&(ssList(esk6_2(X5,X6))&app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6))=X5)))&(![X9]:(~(ssList(X9))|![X10]:(~(ssList(X10))|~(app(app(X9,X6),X10)=X5)))|segmentP(X5,X6))))),inference(skolemize,[status(esa)],[119])).
% fof(121, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))&(~(segmentP(X5,X6))|(ssList(esk5_2(X5,X6))&(ssList(esk6_2(X5,X6))&app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6))=X5))))|~(ssList(X6)))|~(ssList(X5))),inference(shift_quantors,[status(thm)],[120])).
% fof(122, plain,![X5]:![X6]:![X9]:![X10]:((((((~(ssList(X10))|~(app(app(X9,X6),X10)=X5))|~(ssList(X9)))|segmentP(X5,X6))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk5_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&((((ssList(esk6_2(X5,X6))|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))&(((app(app(esk5_2(X5,X6),X6),esk6_2(X5,X6))=X5|~(segmentP(X5,X6)))|~(ssList(X6)))|~(ssList(X5)))))),inference(distribute,[status(thm)],[121])).
% cnf(126,plain,(segmentP(X1,X2)|~ssList(X1)|~ssList(X2)|~ssList(X3)|app(app(X3,X2),X4)!=X1|~ssList(X4)),inference(split_conjunct,[status(thm)],[122])).
% cnf(143,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% fof(161, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(162, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[161])).
% fof(163, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[162])).
% cnf(164,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[163])).
% fof(219, plain,![X1]:(~(ssList(X1))|((~(segmentP(nil,X1))|nil=X1)&(~(nil=X1)|segmentP(nil,X1)))),inference(fof_nnf,[status(thm)],[24])).
% fof(220, plain,![X2]:(~(ssList(X2))|((~(segmentP(nil,X2))|nil=X2)&(~(nil=X2)|segmentP(nil,X2)))),inference(variable_rename,[status(thm)],[219])).
% fof(221, plain,![X2]:(((~(segmentP(nil,X2))|nil=X2)|~(ssList(X2)))&((~(nil=X2)|segmentP(nil,X2))|~(ssList(X2)))),inference(distribute,[status(thm)],[220])).
% cnf(222,plain,(segmentP(nil,X1)|~ssList(X1)|nil!=X1),inference(split_conjunct,[status(thm)],[221])).
% fof(224, plain,![X1]:(~(ssItem(X1))|equalelemsP(cons(X1,nil))),inference(fof_nnf,[status(thm)],[25])).
% fof(225, plain,![X2]:(~(ssItem(X2))|equalelemsP(cons(X2,nil))),inference(variable_rename,[status(thm)],[224])).
% cnf(226,plain,(equalelemsP(cons(X1,nil))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[225])).
% cnf(227,plain,(equalelemsP(nil)),inference(split_conjunct,[status(thm)],[26])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:((((ssList(X4)&X2=X4)&X1=X3)&(?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((((ssList(X7)&cons(X5,nil)=X3)&app(app(X6,X3),X7)=X4)&![X8]:((~(ssItem(X8))|~(memberP(X6,X8)))|~(lt(X5,X8))))&![X9]:((~(ssItem(X9))|~(memberP(X7,X9)))|~(lt(X9,X5))))))|(nil=X4&nil=X3)))&(~(segmentP(X2,X1))|~(equalelemsP(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]:(ssItem(X14)&?[X15]:(ssList(X15)&?[X16]:((((ssList(X16)&cons(X14,nil)=X12)&app(app(X15,X12),X16)=X13)&![X17]:((~(ssItem(X17))|~(memberP(X15,X17)))|~(lt(X14,X17))))&![X18]:((~(ssItem(X18))|~(memberP(X16,X18)))|~(lt(X18,X14))))))|(nil=X13&nil=X12)))&(~(segmentP(X11,X10))|~(equalelemsP(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)&((ssItem(esk52_0)&(ssList(esk53_0)&((((ssList(esk54_0)&cons(esk52_0,nil)=esk50_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&![X17]:((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17))))&![X18]:((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0))))))|(nil=esk51_0&nil=esk50_0)))&(~(segmentP(esk49_0,esk48_0))|~(equalelemsP(esk48_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X17]:![X18]:(((((((((((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0)))&(((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17)))&((ssList(esk54_0)&cons(esk52_0,nil)=esk50_0)&app(app(esk53_0,esk50_0),esk54_0)=esk51_0)))&ssList(esk53_0))&ssItem(esk52_0))|(nil=esk51_0&nil=esk50_0))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0))&(~(segmentP(esk49_0,esk48_0))|~(equalelemsP(esk48_0))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X17]:![X18]:((((((((((nil=esk51_0|((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0))))&(nil=esk50_0|((~(ssItem(X18))|~(memberP(esk54_0,X18)))|~(lt(X18,esk52_0)))))&(((nil=esk51_0|((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17))))&(nil=esk50_0|((~(ssItem(X17))|~(memberP(esk53_0,X17)))|~(lt(esk52_0,X17)))))&((((nil=esk51_0|ssList(esk54_0))&(nil=esk50_0|ssList(esk54_0)))&((nil=esk51_0|cons(esk52_0,nil)=esk50_0)&(nil=esk50_0|cons(esk52_0,nil)=esk50_0)))&((nil=esk51_0|app(app(esk53_0,esk50_0),esk54_0)=esk51_0)&(nil=esk50_0|app(app(esk53_0,esk50_0),esk54_0)=esk51_0)))))&((nil=esk51_0|ssList(esk53_0))&(nil=esk50_0|ssList(esk53_0))))&((nil=esk51_0|ssItem(esk52_0))&(nil=esk50_0|ssItem(esk52_0))))&((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0))&(~(segmentP(esk49_0,esk48_0))|~(equalelemsP(esk48_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(576,negated_conjecture,(~equalelemsP(esk48_0)|~segmentP(esk49_0,esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(ssItem(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssItem(esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(ssList(esk53_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(app(app(esk53_0,esk50_0),esk54_0)=esk51_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(ssList(esk54_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(594,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[573,577,theory(equality)])).
% cnf(595,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,578,theory(equality)])).
% cnf(598,negated_conjecture,(~equalelemsP(esk50_0)|~segmentP(esk49_0,esk48_0)),inference(rw,[status(thm)],[576,577,theory(equality)])).
% cnf(599,negated_conjecture,(~equalelemsP(esk50_0)|~segmentP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[598,578,theory(equality)]),577,theory(equality)])).
% cnf(600,negated_conjecture,(equalelemsP(esk50_0)|esk50_0=nil|~ssItem(esk52_0)),inference(spm,[status(thm)],[226,586,theory(equality)])).
% cnf(602,plain,(segmentP(nil,nil)|~ssList(nil)),inference(er,[status(thm)],[222,theory(equality)])).
% cnf(603,plain,(segmentP(nil,nil)|$false),inference(rw,[status(thm)],[602,143,theory(equality)])).
% cnf(604,plain,(segmentP(nil,nil)),inference(cn,[status(thm)],[603,theory(equality)])).
% cnf(606,negated_conjecture,(esk51_0=nil|esk50_0!=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[164,587,theory(equality)])).
% cnf(609,negated_conjecture,(esk51_0=nil|esk50_0!=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[606,143,theory(equality)])).
% cnf(610,negated_conjecture,(esk51_0=nil|esk50_0!=nil|~ssItem(esk52_0)),inference(cn,[status(thm)],[609,theory(equality)])).
% cnf(918,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk51_0!=X1|~ssList(esk54_0)|~ssList(esk53_0)|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[126,584,theory(equality)])).
% cnf(926,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk51_0!=X1|~ssList(esk54_0)|~ssList(esk53_0)|$false|~ssList(X1)),inference(rw,[status(thm)],[918,594,theory(equality)])).
% cnf(927,negated_conjecture,(segmentP(X1,esk50_0)|esk50_0=nil|esk51_0!=X1|~ssList(esk54_0)|~ssList(esk53_0)|~ssList(X1)),inference(cn,[status(thm)],[926,theory(equality)])).
% cnf(1546,negated_conjecture,(esk51_0=nil|esk50_0!=nil),inference(csr,[status(thm)],[610,581])).
% cnf(1548,negated_conjecture,(esk50_0=nil|equalelemsP(esk50_0)),inference(csr,[status(thm)],[600,580])).
% cnf(1549,negated_conjecture,(esk50_0=nil|~segmentP(esk51_0,esk50_0)),inference(spm,[status(thm)],[599,1548,theory(equality)])).
% cnf(2181,negated_conjecture,(esk50_0=nil|segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(esk54_0)|~ssList(X1)),inference(csr,[status(thm)],[927,582])).
% cnf(2182,negated_conjecture,(esk50_0=nil|segmentP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(csr,[status(thm)],[2181,588])).
% cnf(2183,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[2182,theory(equality)])).
% cnf(2184,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[2183,595,theory(equality)])).
% cnf(2185,negated_conjecture,(esk50_0=nil|segmentP(esk51_0,esk50_0)),inference(cn,[status(thm)],[2184,theory(equality)])).
% cnf(2186,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[2185,1549])).
% cnf(2239,negated_conjecture,(esk51_0=nil|$false),inference(rw,[status(thm)],[1546,2186,theory(equality)])).
% cnf(2240,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[2239,theory(equality)])).
% cnf(2247,negated_conjecture,($false|~segmentP(esk51_0,esk50_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[599,2186,theory(equality)]),227,theory(equality)])).
% cnf(2248,negated_conjecture,($false|~segmentP(esk51_0,nil)),inference(rw,[status(thm)],[2247,2186,theory(equality)])).
% cnf(2249,negated_conjecture,(~segmentP(esk51_0,nil)),inference(cn,[status(thm)],[2248,theory(equality)])).
% cnf(2273,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2249,2240,theory(equality)]),604,theory(equality)])).
% cnf(2274,negated_conjecture,($false),inference(cn,[status(thm)],[2273,theory(equality)])).
% cnf(2275,negated_conjecture,($false),2274,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 299
% # ...of these trivial : 2
% # ...subsumed : 26
% # ...remaining for further processing: 271
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 64
% # Generated clauses : 880
% # ...of the previous two non-trivial : 752
% # Contextual simplify-reflections : 55
% # Paramodulations : 787
% # Factorizations : 0
% # Equation resolutions : 93
% # Current number of processed clauses: 198
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 174
% # Current number of unprocessed clauses: 442
% # ...number of literals in the above : 3172
% # Clause-clause subsumption calls (NU) : 1282
% # Rec. Clause-clause subsumption calls : 411
% # Unit Clause-clause subsumption calls : 44
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 229 leaves, 1.35+/-1.145 terms/leaf
% # Paramod-from index: 105 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 194 leaves, 1.24+/-0.989 terms/leaf
% # -------------------------------------------------
% # User time : 0.084 s
% # System time : 0.006 s
% # Total time : 0.090 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.30 WC
% FINAL PrfWatch: 0.22 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP11298/SWC330+1.tptp
%
%------------------------------------------------------------------------------