%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC386+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:01:06 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP19514/SWC386+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19514/SWC386+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19514/SWC386+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 19610
% 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)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(11, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|(![X5]:(ssItem(X5)=>(~(cons(X5,nil)=X3)|~(memberP(X4,X5))))&(~(nil=X4)|~(nil=X3))))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X6]:((ssItem(X6)&cons(X6,nil)=X1)&memberP(X2,X6))))))))),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)=>(~(cons(X5,nil)=X3)|~(memberP(X4,X5))))&(~(nil=X4)|~(nil=X3))))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X6]:((ssItem(X6)&cons(X6,nil)=X1)&memberP(X2,X6)))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|(![X5]:(ssItem(X5)=>(~(cons(X5,nil)=X3)|~(memberP(X4,X5))))&(~(nil=X4)|~(nil=X3))))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X6]:((ssItem(X6)&cons(X6,nil)=X1)&memberP(X2,X6)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[116])).
% fof(118, 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)],[117])).
% cnf(120,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[118])).
% cnf(125,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(154, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[98])).
% fof(155, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[154])).
% cnf(156,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[155])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&(?[X5]:(ssItem(X5)&(cons(X5,nil)=X3&memberP(X4,X5)))|(nil=X4&nil=X3)))&((nil=X2&~(nil=X1))|(neq(X2,nil)&![X6]:((~(ssItem(X6))|~(cons(X6,nil)=X1))|~(memberP(X2,X6)))))))))),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)&(?[X11]:(ssItem(X11)&(cons(X11,nil)=X9&memberP(X10,X11)))|(nil=X10&nil=X9)))&((nil=X8&~(nil=X7))|(neq(X8,nil)&![X12]:((~(ssItem(X12))|~(cons(X12,nil)=X7))|~(memberP(X8,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)&((ssItem(esk52_0)&(cons(esk52_0,nil)=esk50_0&memberP(esk51_0,esk52_0)))|(nil=esk51_0&nil=esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&![X12]:((~(ssItem(X12))|~(cons(X12,nil)=esk48_0))|~(memberP(esk49_0,X12)))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X12]:(((((((((~(ssItem(X12))|~(cons(X12,nil)=esk48_0))|~(memberP(esk49_0,X12)))&neq(esk49_0,nil))|(nil=esk49_0&~(nil=esk48_0)))&((esk49_0=esk51_0&esk48_0=esk50_0)&((ssItem(esk52_0)&(cons(esk52_0,nil)=esk50_0&memberP(esk51_0,esk52_0)))|(nil=esk51_0&nil=esk50_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X12]:((((((((nil=esk49_0|((~(ssItem(X12))|~(cons(X12,nil)=esk48_0))|~(memberP(esk49_0,X12))))&(~(nil=esk48_0)|((~(ssItem(X12))|~(cons(X12,nil)=esk48_0))|~(memberP(esk49_0,X12)))))&((nil=esk49_0|neq(esk49_0,nil))&(~(nil=esk48_0)|neq(esk49_0,nil))))&((esk49_0=esk51_0&esk48_0=esk50_0)&(((nil=esk51_0|ssItem(esk52_0))&(nil=esk50_0|ssItem(esk52_0)))&(((nil=esk51_0|cons(esk52_0,nil)=esk50_0)&(nil=esk50_0|cons(esk52_0,nil)=esk50_0))&((nil=esk51_0|memberP(esk51_0,esk52_0))&(nil=esk50_0|memberP(esk51_0,esk52_0)))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(memberP(esk51_0,esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(memberP(esk51_0,esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssItem(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(ssItem(esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(nil=esk49_0|~memberP(esk49_0,X1)|cons(X1,nil)!=esk48_0|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(592,negated_conjecture,(esk49_0=nil|ssItem(esk52_0)),inference(rw,[status(thm)],[582,584,theory(equality)])).
% cnf(593,negated_conjecture,(neq(esk49_0,nil)|esk50_0!=nil),inference(rw,[status(thm)],[585,583,theory(equality)])).
% cnf(594,negated_conjecture,(esk49_0=nil|cons(esk52_0,nil)=esk50_0),inference(rw,[status(thm)],[580,584,theory(equality)])).
% cnf(595,negated_conjecture,(esk50_0=nil|memberP(esk49_0,esk52_0)),inference(rw,[status(thm)],[577,584,theory(equality)])).
% cnf(596,negated_conjecture,(esk49_0=nil|memberP(esk51_0,esk52_0)),inference(rw,[status(thm)],[578,584,theory(equality)])).
% cnf(597,negated_conjecture,(esk49_0=nil|memberP(esk49_0,esk52_0)),inference(rw,[status(thm)],[596,584,theory(equality)])).
% cnf(600,negated_conjecture,(esk49_0=nil|cons(X1,nil)!=esk50_0|~ssItem(X1)|~memberP(esk49_0,X1)),inference(rw,[status(thm)],[588,583,theory(equality)])).
% cnf(602,negated_conjecture,(esk49_0=nil|~memberP(esk49_0,esk52_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[600,594,theory(equality)])).
% cnf(649,plain,(~ssList(X1)|~neq(X1,X1)),inference(er,[status(thm)],[120,theory(equality)])).
% cnf(1531,negated_conjecture,(esk49_0=nil|~memberP(esk49_0,esk52_0)),inference(csr,[status(thm)],[602,592])).
% cnf(1532,negated_conjecture,(esk49_0=nil),inference(csr,[status(thm)],[1531,597])).
% cnf(1537,negated_conjecture,(neq(nil,nil)|esk50_0!=nil),inference(rw,[status(thm)],[593,1532,theory(equality)])).
% cnf(1540,negated_conjecture,(esk50_0=nil|memberP(nil,esk52_0)),inference(rw,[status(thm)],[595,1532,theory(equality)])).
% cnf(1554,negated_conjecture,(esk50_0=nil|~ssItem(esk52_0)),inference(spm,[status(thm)],[156,1540,theory(equality)])).
% cnf(1567,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[1554,581])).
% cnf(1568,negated_conjecture,(neq(nil,nil)|$false),inference(rw,[status(thm)],[1537,1567,theory(equality)])).
% cnf(1569,negated_conjecture,(neq(nil,nil)),inference(cn,[status(thm)],[1568,theory(equality)])).
% cnf(1757,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[649,1569,theory(equality)])).
% cnf(1758,negated_conjecture,($false),inference(rw,[status(thm)],[1757,125,theory(equality)])).
% cnf(1759,negated_conjecture,($false),inference(cn,[status(thm)],[1758,theory(equality)])).
% cnf(1760,negated_conjecture,($false),1759,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 230
% # ...of these trivial : 2
% # ...subsumed : 3
% # ...remaining for further processing: 225
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 22
% # Generated clauses : 684
% # ...of the previous two non-trivial : 576
% # Contextual simplify-reflections : 8
% # Paramodulations : 593
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 197
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 171
% # Current number of unprocessed clauses: 445
% # ...number of literals in the above : 3181
% # Clause-clause subsumption calls (NU) : 868
% # Rec. Clause-clause subsumption calls : 175
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 233 leaves, 1.35+/-1.136 terms/leaf
% # Paramod-from index: 106 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 198 leaves, 1.24+/-0.979 terms/leaf
% # -------------------------------------------------
% # User time : 0.074 s
% # System time : 0.003 s
% # Total time : 0.077 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.28 WC
% FINAL PrfWatch: 0.19 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP19514/SWC386+1.tptp
%
%------------------------------------------------------------------------------