%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC027+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 : art07.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:52:10 EST 2010
% Result : Theorem 1.27s
% Output : Solution 1.27s
% 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/SystemOnTPTP16811/SWC027+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16811/SWC027+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16811/SWC027+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 16907
% 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(3, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(7, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(12, 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)))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X5,X6))))&(~(nil=X4)|~(nil=X3))))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=X2))))))),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)))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X5,X6))))&(~(nil=X4)|~(nil=X3))))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=X2)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[12,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)))|?[X6]:(((ssItem(X6)&~(X5=X6))&memberP(X4,X6))&leq(X5,X6))))&(~(nil=X4)|~(nil=X3))))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=X2)))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% cnf(113,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[3])).
% fof(131, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(132, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[132])).
% cnf(134,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[133])).
% fof(153, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[98])).
% fof(154, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[153])).
% cnf(155,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[154])).
% 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))&![X6]:(((~(ssItem(X6))|X5=X6)|~(memberP(X4,X6)))|~(leq(X5,X6)))))|(nil=X4&nil=X3)))&((nil=X2&~(nil=X1))|(nil=X1&~(nil=X2)))))))),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))&![X12]:(((~(ssItem(X12))|X11=X12)|~(memberP(X10,X12)))|~(leq(X11,X12)))))|(nil=X10&nil=X9)))&((nil=X8&~(nil=X7))|(nil=X7&~(nil=X8)))))))),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))&![X12]:(((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12)))))|(nil=esk51_0&nil=esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(nil=esk48_0&~(nil=esk49_0)))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X12]:((((((((((((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12)))&(cons(esk52_0,nil)=esk50_0&memberP(esk51_0,esk52_0)))&ssItem(esk52_0))|(nil=esk51_0&nil=esk50_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&((nil=esk49_0&~(nil=esk48_0))|(nil=esk48_0&~(nil=esk49_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=esk51_0|(((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12))))&(nil=esk50_0|(((~(ssItem(X12))|esk52_0=X12)|~(memberP(esk51_0,X12)))|~(leq(esk52_0,X12)))))&(((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)))))&((nil=esk51_0|ssItem(esk52_0))&(nil=esk50_0|ssItem(esk52_0))))&(esk49_0=esk51_0&esk48_0=esk50_0))&(((nil=esk48_0|nil=esk49_0)&(~(nil=esk49_0)|nil=esk49_0))&((nil=esk48_0|~(nil=esk48_0))&(~(nil=esk49_0)|~(nil=esk48_0)))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(577,negated_conjecture,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(nil=esk49_0|nil=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssItem(esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(ssItem(esk52_0)|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(memberP(esk51_0,esk52_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(cons(esk52_0,nil)=esk50_0|nil=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(esk50_0!=nil|esk49_0!=nil),inference(rw,[status(thm)],[577,581,theory(equality)])).
% cnf(592,negated_conjecture,(esk50_0!=nil|esk51_0!=nil),inference(rw,[status(thm)],[591,582,theory(equality)])).
% cnf(597,negated_conjecture,(esk50_0=nil|esk49_0=nil),inference(rw,[status(thm)],[580,581,theory(equality)])).
% cnf(598,negated_conjecture,(esk50_0=nil|esk51_0=nil),inference(rw,[status(thm)],[597,582,theory(equality)])).
% cnf(603,negated_conjecture,(esk51_0=nil|esk50_0!=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[134,588,theory(equality)])).
% cnf(606,negated_conjecture,(esk51_0=nil|esk50_0!=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[603,113,theory(equality)])).
% cnf(607,negated_conjecture,(esk51_0=nil|esk50_0!=nil|~ssItem(esk52_0)),inference(cn,[status(thm)],[606,theory(equality)])).
% cnf(1527,negated_conjecture,(esk51_0=nil|esk50_0!=nil),inference(csr,[status(thm)],[607,584])).
% cnf(1528,negated_conjecture,(esk51_0=nil),inference(csr,[status(thm)],[1527,598])).
% cnf(1534,negated_conjecture,(esk50_0=nil|memberP(nil,esk52_0)),inference(rw,[status(thm)],[585,1528,theory(equality)])).
% cnf(1538,negated_conjecture,(esk50_0!=nil|$false),inference(rw,[status(thm)],[592,1528,theory(equality)])).
% cnf(1539,negated_conjecture,(esk50_0!=nil),inference(cn,[status(thm)],[1538,theory(equality)])).
% cnf(1542,negated_conjecture,(ssItem(esk52_0)),inference(sr,[status(thm)],[583,1539,theory(equality)])).
% cnf(1692,negated_conjecture,(memberP(nil,esk52_0)),inference(sr,[status(thm)],[1534,1539,theory(equality)])).
% cnf(1699,negated_conjecture,(~ssItem(esk52_0)),inference(spm,[status(thm)],[155,1692,theory(equality)])).
% cnf(1718,negated_conjecture,($false),inference(rw,[status(thm)],[1699,1542,theory(equality)])).
% cnf(1719,negated_conjecture,($false),inference(cn,[status(thm)],[1718,theory(equality)])).
% cnf(1720,negated_conjecture,($false),1719,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 213
% # ...of these trivial : 2
% # ...subsumed : 3
% # ...remaining for further processing: 208
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 10
% # Generated clauses : 674
% # ...of the previous two non-trivial : 568
% # Contextual simplify-reflections : 4
% # Paramodulations : 581
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 190
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 480
% # ...number of literals in the above : 3310
% # Clause-clause subsumption calls (NU) : 869
% # Rec. Clause-clause subsumption calls : 164
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 227 leaves, 1.35+/-1.149 terms/leaf
% # Paramod-from index: 101 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 192 leaves, 1.24+/-0.992 terms/leaf
% # -------------------------------------------------
% # User time : 0.070 s
% # System time : 0.005 s
% # Total time : 0.075 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP16811/SWC027+1.tptp
%
%------------------------------------------------------------------------------