%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC024+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 06:51:49 EST 2010
% Result : Theorem 1.48s
% Output : Solution 1.48s
% 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/SystemOnTPTP23667/SWC024+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23667/SWC024+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23667/SWC024+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 23763
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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)=>(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(17, axiom,![X1]:(ssList(X1)=>frontsegP(X1,X1)),file('/tmp/SRASS.s.p', ax42)).
% fof(20, axiom,![X1]:(ssList(X1)=>frontsegP(X1,nil)),file('/tmp/SRASS.s.p', ax45)).
% 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)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|![X6]:(ssList(X6)=>((~(app(X3,X6)=X4)|~(equalelemsP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(cons(X7,nil),X8)=X6)&?[X9]:(ssList(X9)&app(X9,cons(X7,nil))=X3))))))|(~(nil=X4)&nil=X3)))))),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)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|![X6]:(ssList(X6)=>((~(app(X3,X6)=X4)|~(equalelemsP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(cons(X7,nil),X8)=X6)&?[X9]:(ssList(X9)&app(X9,cons(X7,nil))=X3))))))|(~(nil=X4)&nil=X3))))))),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)&neq(X5,nil))&frontsegP(X2,X5))&frontsegP(X1,X5)))|![X6]:(ssList(X6)=>((~(app(X3,X6)=X4)|~(equalelemsP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(cons(X7,nil),X8)=X6)&?[X9]:(ssList(X9)&app(X9,cons(X7,nil))=X3))))))|(~(nil=X4)&nil=X3))))))),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(135, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[5])).
% fof(136, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[135])).
% fof(137, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[136])).
% fof(138, 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)],[137])).
% cnf(139,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[138])).
% cnf(145,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[7])).
% fof(186, plain,![X1]:(~(ssList(X1))|frontsegP(X1,X1)),inference(fof_nnf,[status(thm)],[17])).
% fof(187, plain,![X2]:(~(ssList(X2))|frontsegP(X2,X2)),inference(variable_rename,[status(thm)],[186])).
% cnf(188,plain,(frontsegP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[187])).
% fof(200, plain,![X1]:(~(ssList(X1))|frontsegP(X1,nil)),inference(fof_nnf,[status(thm)],[20])).
% fof(201, plain,![X2]:(~(ssList(X2))|frontsegP(X2,nil)),inference(variable_rename,[status(thm)],[200])).
% cnf(202,plain,(frontsegP(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[201])).
% 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))|~(neq(X5,nil)))|~(frontsegP(X2,X5)))|~(frontsegP(X1,X5))))&?[X6]:(ssList(X6)&((app(X3,X6)=X4&equalelemsP(X3))&![X7]:(~(ssItem(X7))|![X8]:((~(ssList(X8))|~(app(cons(X7,nil),X8)=X6))|![X9]:(~(ssList(X9))|~(app(X9,cons(X7,nil))=X3)))))))&(nil=X4|~(nil=X3))))))),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]:(((~(ssList(X14))|~(neq(X14,nil)))|~(frontsegP(X11,X14)))|~(frontsegP(X10,X14))))&?[X15]:(ssList(X15)&((app(X12,X15)=X13&equalelemsP(X12))&![X16]:(~(ssItem(X16))|![X17]:((~(ssList(X17))|~(app(cons(X16,nil),X17)=X15))|![X18]:(~(ssList(X18))|~(app(X18,cons(X16,nil))=X12)))))))&(nil=X13|~(nil=X12))))))),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]:(((~(ssList(X14))|~(neq(X14,nil)))|~(frontsegP(esk49_0,X14)))|~(frontsegP(esk48_0,X14))))&(ssList(esk52_0)&((app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0))&![X16]:(~(ssItem(X16))|![X17]:((~(ssList(X17))|~(app(cons(X16,nil),X17)=esk52_0))|![X18]:(~(ssList(X18))|~(app(X18,cons(X16,nil))=esk50_0)))))))&(nil=esk51_0|~(nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X14]:![X16]:![X17]:![X18]:(((((((((((~(ssList(X18))|~(app(X18,cons(X16,nil))=esk50_0))|(~(ssList(X17))|~(app(cons(X16,nil),X17)=esk52_0)))|~(ssItem(X16)))&(app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0)))&ssList(esk52_0))&((((~(ssList(X14))|~(neq(X14,nil)))|~(frontsegP(esk49_0,X14)))|~(frontsegP(esk48_0,X14)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil))))&(nil=esk51_0|~(nil=esk50_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=esk51_0|nil!=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(neq(esk49_0,nil)),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,(~frontsegP(esk48_0,X1)|~frontsegP(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(583,negated_conjecture,(app(esk50_0,esk52_0)=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,578,theory(equality)])).
% cnf(586,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,579,theory(equality)])).
% cnf(589,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[577,579,theory(equality)])).
% cnf(593,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~frontsegP(esk50_0,X1)|~frontsegP(esk49_0,X1)),inference(rw,[status(thm)],[580,578,theory(equality)])).
% cnf(594,negated_conjecture,(~ssList(X1)|~neq(X1,nil)|~frontsegP(esk50_0,X1)|~frontsegP(esk51_0,X1)),inference(rw,[status(thm)],[593,579,theory(equality)])).
% cnf(595,negated_conjecture,(~frontsegP(esk51_0,nil)|~ssList(nil)|~neq(nil,nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[594,202,theory(equality)])).
% cnf(596,negated_conjecture,(~frontsegP(esk51_0,esk50_0)|~ssList(esk50_0)|~neq(esk50_0,nil)),inference(spm,[status(thm)],[594,188,theory(equality)])).
% cnf(597,negated_conjecture,(~frontsegP(esk51_0,nil)|$false|~neq(nil,nil)|~ssList(esk50_0)),inference(rw,[status(thm)],[595,145,theory(equality)])).
% cnf(598,negated_conjecture,(~frontsegP(esk51_0,nil)|$false|~neq(nil,nil)|$false),inference(rw,[status(thm)],[597,585,theory(equality)])).
% cnf(599,negated_conjecture,(~frontsegP(esk51_0,nil)|~neq(nil,nil)),inference(cn,[status(thm)],[598,theory(equality)])).
% cnf(600,negated_conjecture,(~frontsegP(esk51_0,esk50_0)|$false|~neq(esk50_0,nil)),inference(rw,[status(thm)],[596,585,theory(equality)])).
% cnf(601,negated_conjecture,(~frontsegP(esk51_0,esk50_0)|~neq(esk50_0,nil)),inference(cn,[status(thm)],[600,theory(equality)])).
% cnf(697,negated_conjecture,(frontsegP(X1,esk50_0)|esk51_0!=X1|~ssList(esk52_0)|~ssList(esk50_0)|~ssList(X1)),inference(spm,[status(thm)],[122,583,theory(equality)])).
% cnf(701,negated_conjecture,(frontsegP(X1,esk50_0)|esk51_0!=X1|$false|~ssList(esk50_0)|~ssList(X1)),inference(rw,[status(thm)],[697,581,theory(equality)])).
% cnf(702,negated_conjecture,(frontsegP(X1,esk50_0)|esk51_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[701,585,theory(equality)])).
% cnf(703,negated_conjecture,(frontsegP(X1,esk50_0)|esk51_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[702,theory(equality)])).
% cnf(1382,negated_conjecture,(~neq(nil,nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[599,202,theory(equality)])).
% cnf(1383,negated_conjecture,(~neq(nil,nil)|$false),inference(rw,[status(thm)],[1382,586,theory(equality)])).
% cnf(1384,negated_conjecture,(~neq(nil,nil)),inference(cn,[status(thm)],[1383,theory(equality)])).
% cnf(1850,negated_conjecture,(frontsegP(esk51_0,esk50_0)|~ssList(esk51_0)),inference(er,[status(thm)],[703,theory(equality)])).
% cnf(1851,negated_conjecture,(frontsegP(esk51_0,esk50_0)|$false),inference(rw,[status(thm)],[1850,586,theory(equality)])).
% cnf(1852,negated_conjecture,(frontsegP(esk51_0,esk50_0)),inference(cn,[status(thm)],[1851,theory(equality)])).
% cnf(1858,negated_conjecture,($false|~neq(esk50_0,nil)),inference(rw,[status(thm)],[601,1852,theory(equality)])).
% cnf(1859,negated_conjecture,(~neq(esk50_0,nil)),inference(cn,[status(thm)],[1858,theory(equality)])).
% cnf(1876,negated_conjecture,(esk50_0=nil|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[1859,139,theory(equality)])).
% cnf(1877,negated_conjecture,(esk50_0=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[1876,145,theory(equality)])).
% cnf(1878,negated_conjecture,(esk50_0=nil|$false|$false),inference(rw,[status(thm)],[1877,585,theory(equality)])).
% cnf(1879,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[1878,theory(equality)])).
% cnf(1908,negated_conjecture,(esk51_0=nil|$false),inference(rw,[status(thm)],[576,1879,theory(equality)])).
% cnf(1909,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[1908,theory(equality)])).
% cnf(1913,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[589,1909,theory(equality)])).
% cnf(1914,negated_conjecture,($false),inference(sr,[status(thm)],[1913,1384,theory(equality)])).
% cnf(1915,negated_conjecture,($false),1914,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 258
% # ...of these trivial : 2
% # ...subsumed : 12
% # ...remaining for further processing: 244
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 38
% # Generated clauses : 709
% # ...of the previous two non-trivial : 603
% # Contextual simplify-reflections : 3
% # Paramodulations : 616
% # Factorizations : 0
% # Equation resolutions : 93
% # Current number of processed clauses: 199
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 175
% # Current number of unprocessed clauses: 451
% # ...number of literals in the above : 3202
% # Clause-clause subsumption calls (NU) : 956
% # Rec. Clause-clause subsumption calls : 226
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 231 leaves, 1.35+/-1.141 terms/leaf
% # Paramod-from index: 105 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 196 leaves, 1.24+/-0.984 terms/leaf
% # -------------------------------------------------
% # User time : 0.074 s
% # System time : 0.006 s
% # Total time : 0.080 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.32 WC
% FINAL PrfWatch: 0.23 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP23667/SWC024+1.tptp
%
%------------------------------------------------------------------------------