TSTP Solution File: SWC417+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SWC417+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 08:05:56 EST 2010

% Result   : Theorem 1.30s
% Output   : Solution 1.30s
% 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/SystemOnTPTP23183/SWC417+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP23183/SWC417+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23183/SWC417+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 23279
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(12, axiom,![X1]:(ssList(X1)=>app(nil,X1)=X1),file('/tmp/SRASS.s.p', ax28)).
% fof(18, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(app(X7,cons(X5,nil)),X6)=X1))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>(~(app(cons(X8,nil),X9)=X4)|~(app(X9,cons(X8,nil))=X3)))))&(~(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]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(app(X7,cons(X5,nil)),X6)=X1))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>(~(app(cons(X8,nil),X9)=X4)|~(app(X9,cons(X8,nil))=X3)))))&(~(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]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(app(X7,cons(X5,nil)),X6)=X1))))|![X8]:(ssItem(X8)=>![X9]:(ssList(X9)=>(~(app(cons(X8,nil),X9)=X4)|~(app(X9,cons(X8,nil))=X3)))))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(121, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(122, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[121])).
% fof(123, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[122])).
% cnf(124,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[123])).
% cnf(125,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(155, plain,![X1]:(~(ssList(X1))|app(nil,X1)=X1),inference(fof_nnf,[status(thm)],[12])).
% fof(156, plain,![X2]:(~(ssList(X2))|app(nil,X2)=X2),inference(variable_rename,[status(thm)],[155])).
% cnf(157,plain,(app(nil,X1)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[156])).
% fof(181, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[18])).
% fof(182, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[181])).
% cnf(183,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[182])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X6,cons(X5,nil)),X7)=X2))|~(app(app(X7,cons(X5,nil)),X6)=X1)))))&?[X8]:(ssItem(X8)&?[X9]:(ssList(X9)&(app(cons(X8,nil),X9)=X4&app(X9,cons(X8,nil))=X3))))|(neq(X2,nil)&~(neq(X4,nil))))))))),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)&(((neq(X11,nil)&![X14]:(~(ssItem(X14))|![X15]:(~(ssList(X15))|![X16]:((~(ssList(X16))|~(app(app(X15,cons(X14,nil)),X16)=X11))|~(app(app(X16,cons(X14,nil)),X15)=X10)))))&?[X17]:(ssItem(X17)&?[X18]:(ssList(X18)&(app(cons(X17,nil),X18)=X13&app(X18,cons(X17,nil))=X12))))|(neq(X11,nil)&~(neq(X13,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)&![X14]:(~(ssItem(X14))|![X15]:(~(ssList(X15))|![X16]:((~(ssList(X16))|~(app(app(X15,cons(X14,nil)),X16)=esk49_0))|~(app(app(X16,cons(X14,nil)),X15)=esk48_0)))))&(ssItem(esk52_0)&(ssList(esk53_0)&(app(cons(esk52_0,nil),esk53_0)=esk51_0&app(esk53_0,cons(esk52_0,nil))=esk50_0))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X14]:![X15]:![X16]:((((((((((((~(ssList(X16))|~(app(app(X15,cons(X14,nil)),X16)=esk49_0))|~(app(app(X16,cons(X14,nil)),X15)=esk48_0))|~(ssList(X15)))|~(ssItem(X14)))&neq(esk49_0,nil))&(ssItem(esk52_0)&(ssList(esk53_0)&(app(cons(esk52_0,nil),esk53_0)=esk51_0&app(esk53_0,cons(esk52_0,nil))=esk50_0))))|(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,![X14]:![X15]:![X16]:(((((((((neq(esk49_0,nil)|((((~(ssList(X16))|~(app(app(X15,cons(X14,nil)),X16)=esk49_0))|~(app(app(X16,cons(X14,nil)),X15)=esk48_0))|~(ssList(X15)))|~(ssItem(X14))))&(~(neq(esk51_0,nil))|((((~(ssList(X16))|~(app(app(X15,cons(X14,nil)),X16)=esk49_0))|~(app(app(X16,cons(X14,nil)),X15)=esk48_0))|~(ssList(X15)))|~(ssItem(X14)))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil))))&(((neq(esk49_0,nil)|ssItem(esk52_0))&(~(neq(esk51_0,nil))|ssItem(esk52_0)))&(((neq(esk49_0,nil)|ssList(esk53_0))&(~(neq(esk51_0,nil))|ssList(esk53_0)))&(((neq(esk49_0,nil)|app(cons(esk52_0,nil),esk53_0)=esk51_0)&(~(neq(esk51_0,nil))|app(cons(esk52_0,nil),esk53_0)=esk51_0))&((neq(esk49_0,nil)|app(esk53_0,cons(esk52_0,nil))=esk50_0)&(~(neq(esk51_0,nil))|app(esk53_0,cons(esk52_0,nil))=esk50_0))))))&(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(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,(app(esk53_0,cons(esk52_0,nil))=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk53_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(~ssItem(X1)|~ssList(X2)|app(app(X3,cons(X1,nil)),X2)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssList(X3)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(593,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[585,578,theory(equality)]),588,theory(equality)])).
% cnf(594,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(595,negated_conjecture,(ssList(esk53_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,578,theory(equality)]),588,theory(equality)])).
% cnf(596,negated_conjecture,(ssList(esk53_0)),inference(cn,[status(thm)],[595,theory(equality)])).
% cnf(606,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[579,577,theory(equality)])).
% cnf(607,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk48_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[606,578,theory(equality)]),588,theory(equality)])).
% cnf(608,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk48_0),inference(cn,[status(thm)],[607,theory(equality)])).
% cnf(609,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk49_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,578,theory(equality)])).
% cnf(610,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk49_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[609,578,theory(equality)]),588,theory(equality)])).
% cnf(611,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk49_0),inference(cn,[status(thm)],[610,theory(equality)])).
% cnf(796,negated_conjecture,(app(app(X3,cons(X1,nil)),X2)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssItem(X1)|~ssList(X3)|~ssList(X2)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[589,578,theory(equality)]),588,theory(equality)])).
% cnf(797,negated_conjecture,(app(app(X3,cons(X1,nil)),X2)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssItem(X1)|~ssList(X3)|~ssList(X2)),inference(cn,[status(thm)],[796,theory(equality)])).
% cnf(799,negated_conjecture,(app(esk48_0,X1)!=esk48_0|app(app(X1,cons(esk52_0,nil)),esk53_0)!=esk49_0|~ssList(esk53_0)|~ssList(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[797,608,theory(equality)])).
% cnf(803,negated_conjecture,(app(esk48_0,X1)!=esk48_0|app(app(X1,cons(esk52_0,nil)),esk53_0)!=esk49_0|$false|~ssList(X1)|~ssItem(esk52_0)),inference(rw,[status(thm)],[799,596,theory(equality)])).
% cnf(804,negated_conjecture,(app(esk48_0,X1)!=esk48_0|app(app(X1,cons(esk52_0,nil)),esk53_0)!=esk49_0|$false|~ssList(X1)|$false),inference(rw,[status(thm)],[803,594,theory(equality)])).
% cnf(805,negated_conjecture,(app(esk48_0,X1)!=esk48_0|app(app(X1,cons(esk52_0,nil)),esk53_0)!=esk49_0|~ssList(X1)),inference(cn,[status(thm)],[804,theory(equality)])).
% cnf(2192,negated_conjecture,(app(app(nil,cons(esk52_0,nil)),esk53_0)!=esk49_0|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[805,183,theory(equality)])).
% cnf(2193,negated_conjecture,(app(app(nil,cons(esk52_0,nil)),esk53_0)!=esk49_0|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[2192,125,theory(equality)])).
% cnf(2194,negated_conjecture,(app(app(nil,cons(esk52_0,nil)),esk53_0)!=esk49_0|$false|$false),inference(rw,[status(thm)],[2193,573,theory(equality)])).
% cnf(2195,negated_conjecture,(app(app(nil,cons(esk52_0,nil)),esk53_0)!=esk49_0),inference(cn,[status(thm)],[2194,theory(equality)])).
% cnf(2196,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)!=esk49_0|~ssList(cons(esk52_0,nil))),inference(spm,[status(thm)],[2195,157,theory(equality)])).
% cnf(2198,negated_conjecture,($false|~ssList(cons(esk52_0,nil))),inference(rw,[status(thm)],[2196,611,theory(equality)])).
% cnf(2199,negated_conjecture,(~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[2198,theory(equality)])).
% cnf(2204,negated_conjecture,(~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2199,124,theory(equality)])).
% cnf(2205,negated_conjecture,($false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2204,125,theory(equality)])).
% cnf(2206,negated_conjecture,($false|$false),inference(rw,[status(thm)],[2205,594,theory(equality)])).
% cnf(2207,negated_conjecture,($false),inference(cn,[status(thm)],[2206,theory(equality)])).
% cnf(2208,negated_conjecture,($false),2207,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 265
% # ...of these trivial                : 10
% # ...subsumed                        : 15
% # ...remaining for further processing: 240
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 1
% # Backward-rewritten                 : 13
% # Generated clauses                  : 790
% # ...of the previous two non-trivial : 659
% # Contextual simplify-reflections    : 2
% # Paramodulations                    : 699
% # Factorizations                     : 0
% # Equation resolutions               : 91
% # Current number of processed clauses: 220
% #    Positive orientable unit clauses: 31
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 6
% #    Non-unit-clauses                : 183
% # Current number of unprocessed clauses: 513
% # ...number of literals in the above : 3534
% # Clause-clause subsumption calls (NU) : 886
% # Rec. Clause-clause subsumption calls : 190
% # Unit Clause-clause subsumption calls : 19
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 6
% # Indexed BW rewrite successes       : 6
% # Backwards rewriting index:   259 leaves,   1.32+/-1.084 terms/leaf
% # Paramod-from index:          116 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:          220 leaves,   1.21+/-0.932 terms/leaf
% # -------------------------------------------------
% # User time              : 0.079 s
% # System time            : 0.005 s
% # Total time             : 0.084 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.29 WC
% FINAL PrfWatch: 0.21 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP23183/SWC417+1.tptp
% 
%------------------------------------------------------------------------------