TSTP Solution File: SWC204+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC204+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:22:01 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/SystemOnTPTP25196/SWC204+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25196/SWC204+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25196/SWC204+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 25292
% 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(1, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(2, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(3, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssList(tl(X1)))),file('/tmp/SRASS.s.p', ax24)).
% fof(5, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(24, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>cons(hd(X1),tl(X1))=X1)),file('/tmp/SRASS.s.p', ax78)).
% fof(34, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(cons(X2,X1)=X1))),file('/tmp/SRASS.s.p', ax18)).
% fof(36, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X4=X5))&?[X6]:(((ssList(X6)&tl(X4)=X6)&app(X3,X6)=X5)&neq(nil,X4))))|neq(X1,nil))&(~(neq(X2,nil))|neq(X4,nil)))))))),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))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X4=X5))&?[X6]:(((ssList(X6)&tl(X4)=X6)&app(X3,X6)=X5)&neq(nil,X4))))|neq(X1,nil))&(~(neq(X2,nil))|neq(X4,nil))))))))),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))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X4=X5))&?[X6]:(((ssList(X6)&tl(X4)=X6)&app(X3,X6)=X5)&neq(nil,X4))))|neq(X1,nil))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[1])).
% fof(105, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[104])).
% fof(106, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, 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)],[106])).
% cnf(108,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[107])).
% cnf(110,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[2])).
% fof(111, plain,![X1]:(~(ssList(X1))|(nil=X1|ssList(tl(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(112, plain,![X2]:(~(ssList(X2))|(nil=X2|ssList(tl(X2)))),inference(variable_rename,[status(thm)],[111])).
% cnf(113,plain,(ssList(tl(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[112])).
% fof(118, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[5])).
% fof(119, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[118])).
% cnf(120,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[119])).
% fof(215, plain,![X1]:(~(ssList(X1))|(nil=X1|cons(hd(X1),tl(X1))=X1)),inference(fof_nnf,[status(thm)],[24])).
% fof(216, plain,![X2]:(~(ssList(X2))|(nil=X2|cons(hd(X2),tl(X2))=X2)),inference(variable_rename,[status(thm)],[215])).
% cnf(217,plain,(cons(hd(X1),tl(X1))=X1|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[216])).
% fof(257, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(cons(X2,X1)=X1))),inference(fof_nnf,[status(thm)],[34])).
% fof(258, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(cons(X4,X3)=X3))),inference(variable_rename,[status(thm)],[257])).
% fof(259, plain,![X3]:![X4]:((~(ssItem(X4))|~(cons(X4,X3)=X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[258])).
% cnf(260,plain,(~ssList(X1)|cons(X2,X1)!=X1|~ssItem(X2)),inference(split_conjunct,[status(thm)],[259])).
% fof(267, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[36])).
% fof(268, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[267])).
% cnf(269,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[268])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&![X5]:((~(ssList(X5))|X4=X5)|![X6]:(((~(ssList(X6))|~(tl(X4)=X6))|~(app(X3,X6)=X5))|~(neq(nil,X4)))))&~(neq(X1,nil)))|(neq(X2,nil)&~(neq(X4,nil))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&((X8=X10&X7=X9)&(((neq(X8,nil)&![X11]:((~(ssList(X11))|X10=X11)|![X12]:(((~(ssList(X12))|~(tl(X10)=X12))|~(app(X9,X12)=X11))|~(neq(nil,X10)))))&~(neq(X7,nil)))|(neq(X8,nil)&~(neq(X10,nil))))))))),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)&(((neq(esk49_0,nil)&![X11]:((~(ssList(X11))|esk51_0=X11)|![X12]:(((~(ssList(X12))|~(tl(esk51_0)=X12))|~(app(esk50_0,X12)=X11))|~(neq(nil,esk51_0)))))&~(neq(esk48_0,nil)))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:![X12]:((((((((((((~(ssList(X12))|~(tl(esk51_0)=X12))|~(app(esk50_0,X12)=X11))|~(neq(nil,esk51_0)))|(~(ssList(X11))|esk51_0=X11))&neq(esk49_0,nil))&~(neq(esk48_0,nil)))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X11]:![X12]:(((((((((neq(esk49_0,nil)|((((~(ssList(X12))|~(tl(esk51_0)=X12))|~(app(esk50_0,X12)=X11))|~(neq(nil,esk51_0)))|(~(ssList(X11))|esk51_0=X11)))&(~(neq(esk51_0,nil))|((((~(ssList(X12))|~(tl(esk51_0)=X12))|~(app(esk50_0,X12)=X11))|~(neq(nil,esk51_0)))|(~(ssList(X11))|esk51_0=X11))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil))))&((neq(esk49_0,nil)|~(neq(esk48_0,nil)))&(~(neq(esk51_0,nil))|~(neq(esk48_0,nil)))))&(esk49_0=esk51_0&esk48_0=esk50_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,(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(579,negated_conjecture,(~neq(esk48_0,nil)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk51_0=X1|~ssList(X1)|~neq(nil,esk51_0)|app(esk50_0,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[574,578,theory(equality)])).
% cnf(588,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[582,578,theory(equality)])).
% cnf(589,negated_conjecture,(~neq(esk48_0,nil)|$false),inference(rw,[status(thm)],[579,588,theory(equality)])).
% cnf(590,negated_conjecture,(~neq(esk48_0,nil)),inference(cn,[status(thm)],[589,theory(equality)])).
% cnf(622,negated_conjecture,(esk51_0=X1|tl(esk51_0)!=X2|app(esk48_0,X2)!=X1|~ssList(X2)|~ssList(X1)|~neq(nil,esk51_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[583,577,theory(equality)])).
% cnf(623,negated_conjecture,(esk51_0=X1|tl(esk51_0)!=X2|app(esk48_0,X2)!=X1|~ssList(X2)|~ssList(X1)|~neq(nil,esk51_0)|$false),inference(rw,[status(thm)],[622,588,theory(equality)])).
% cnf(624,negated_conjecture,(esk51_0=X1|tl(esk51_0)!=X2|app(esk48_0,X2)!=X1|~ssList(X2)|~ssList(X1)|~neq(nil,esk51_0)),inference(cn,[status(thm)],[623,theory(equality)])).
% cnf(628,negated_conjecture,(esk48_0=nil|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[590,108,theory(equality)])).
% cnf(630,negated_conjecture,(esk48_0=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[628,110,theory(equality)])).
% cnf(631,negated_conjecture,(esk48_0=nil|$false|$false),inference(rw,[status(thm)],[630,573,theory(equality)])).
% cnf(632,negated_conjecture,(esk48_0=nil),inference(cn,[status(thm)],[631,theory(equality)])).
% cnf(680,plain,(nil=X1|X1!=tl(X1)|~ssItem(hd(X1))|~ssList(tl(X1))|~ssList(X1)),inference(spm,[status(thm)],[260,217,theory(equality)])).
% cnf(1317,negated_conjecture,(esk51_0=X1|app(nil,X2)!=X1|tl(esk51_0)!=X2|~neq(nil,esk51_0)|~ssList(X2)|~ssList(X1)),inference(rw,[status(thm)],[624,632,theory(equality)])).
% cnf(1318,negated_conjecture,(~neq(nil,nil)),inference(rw,[status(thm)],[590,632,theory(equality)])).
% cnf(2081,plain,(nil=X1|tl(X1)!=X1|~ssItem(hd(X1))|~ssList(X1)),inference(csr,[status(thm)],[680,113])).
% cnf(2082,plain,(nil=X1|tl(X1)!=X1|~ssList(X1)),inference(csr,[status(thm)],[2081,269])).
% cnf(2196,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(nil,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)|~ssList(esk51_0)|~ssList(nil)),inference(spm,[status(thm)],[1317,108,theory(equality)])).
% cnf(2198,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(nil,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)|$false|~ssList(nil)),inference(rw,[status(thm)],[2196,585,theory(equality)])).
% cnf(2199,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(nil,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2198,110,theory(equality)])).
% cnf(2200,negated_conjecture,(esk51_0=X1|nil=esk51_0|app(nil,X2)!=X1|tl(esk51_0)!=X2|~ssList(X2)|~ssList(X1)),inference(cn,[status(thm)],[2199,theory(equality)])).
% cnf(2201,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(nil,tl(esk51_0))!=X1|~ssList(tl(esk51_0))|~ssList(X1)),inference(er,[status(thm)],[2200,theory(equality)])).
% cnf(2202,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(nil,tl(esk51_0))!=X1|~ssList(X1)|~ssList(esk51_0)),inference(spm,[status(thm)],[2201,113,theory(equality)])).
% cnf(2203,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(nil,tl(esk51_0))!=X1|~ssList(X1)|$false),inference(rw,[status(thm)],[2202,585,theory(equality)])).
% cnf(2204,negated_conjecture,(esk51_0=nil|esk51_0=X1|app(nil,tl(esk51_0))!=X1|~ssList(X1)),inference(cn,[status(thm)],[2203,theory(equality)])).
% cnf(2205,negated_conjecture,(esk51_0=nil|esk51_0=app(nil,tl(esk51_0))|~ssList(app(nil,tl(esk51_0)))),inference(er,[status(thm)],[2204,theory(equality)])).
% cnf(2207,negated_conjecture,(tl(esk51_0)=esk51_0|esk51_0=nil|~ssList(tl(esk51_0))),inference(spm,[status(thm)],[2205,120,theory(equality)])).
% cnf(2212,negated_conjecture,(tl(esk51_0)=esk51_0|esk51_0=nil|~ssList(esk51_0)),inference(spm,[status(thm)],[2207,113,theory(equality)])).
% cnf(2213,negated_conjecture,(tl(esk51_0)=esk51_0|esk51_0=nil|$false),inference(rw,[status(thm)],[2212,585,theory(equality)])).
% cnf(2214,negated_conjecture,(tl(esk51_0)=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[2213,theory(equality)])).
% cnf(2218,negated_conjecture,(nil=esk51_0|~ssList(esk51_0)),inference(spm,[status(thm)],[2082,2214,theory(equality)])).
% cnf(2231,negated_conjecture,(nil=esk51_0|$false),inference(rw,[status(thm)],[2218,585,theory(equality)])).
% cnf(2232,negated_conjecture,(nil=esk51_0),inference(cn,[status(thm)],[2231,theory(equality)])).
% cnf(2253,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[588,2232,theory(equality)])).
% cnf(2254,negated_conjecture,($false),inference(sr,[status(thm)],[2253,1318,theory(equality)])).
% cnf(2255,negated_conjecture,($false),2254,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 333
% # ...of these trivial : 5
% # ...subsumed : 67
% # ...remaining for further processing: 261
% # Other redundant clauses eliminated : 75
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 22
% # Generated clauses : 861
% # ...of the previous two non-trivial : 694
% # Contextual simplify-reflections : 54
% # Paramodulations : 756
% # Factorizations : 0
% # Equation resolutions : 105
% # Current number of processed clauses: 231
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 207
% # Current number of unprocessed clauses: 487
% # ...number of literals in the above : 3526
% # Clause-clause subsumption calls (NU) : 2119
% # Rec. Clause-clause subsumption calls : 1210
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 245 leaves, 1.36+/-1.119 terms/leaf
% # Paramod-from index: 122 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 219 leaves, 1.22+/-0.935 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.21 CPU 0.28 WC
% FINAL PrfWatch: 0.21 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP25196/SWC204+1.tptp
%
%------------------------------------------------------------------------------