TSTP Solution File: SWC198+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC198+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 : art05.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:20:24 EST 2010
% Result : Theorem 1.33s
% Output : Solution 1.33s
% 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/SystemOnTPTP32065/SWC198+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32065/SWC198+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32065/SWC198+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 32161
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,?[X1]:(ssItem(X1)&?[X2]:(ssItem(X2)&~(X1=X2))),file('/tmp/SRASS.s.p', ax2)).
% fof(3, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(11, axiom,![X1]:(ssItem(X1)=>![X2]:(ssItem(X2)=>![X3]:(ssList(X3)=>(memberP(cons(X2,X3),X1)<=>(X1=X2|memberP(X3,X1)))))),file('/tmp/SRASS.s.p', ax37)).
% 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)&![X6]:(ssItem(X6)=>(~(memberP(X1,X6))|X5=X6))))|(![X7]:(ssItem(X7)=>((~(cons(X7,nil)=X3)|~(memberP(X4,X7)))|?[X8]:(((ssItem(X8)&~(X7=X8))&memberP(X4,X8))&leq(X7,X8))))&(~(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))|?[X5]:(ssItem(X5)&![X6]:(ssItem(X6)=>(~(memberP(X1,X6))|X5=X6))))|(![X7]:(ssItem(X7)=>((~(cons(X7,nil)=X3)|~(memberP(X4,X7)))|?[X8]:(((ssItem(X8)&~(X7=X8))&memberP(X4,X8))&leq(X7,X8))))&(~(nil=X4)|~(nil=X3))))))))),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)&![X6]:(ssItem(X6)=>(~(memberP(X1,X6))|X5=X6))))|(![X7]:(ssItem(X7)=>((~(cons(X7,nil)=X3)|~(memberP(X4,X7)))|?[X8]:(((ssItem(X8)&~(X7=X8))&memberP(X4,X8))&leq(X7,X8))))&(~(nil=X4)|~(nil=X3))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(104, plain,?[X3]:(ssItem(X3)&?[X4]:(ssItem(X4)&~(X3=X4))),inference(variable_rename,[status(thm)],[1])).
% fof(105, plain,(ssItem(esk1_0)&(ssItem(esk2_0)&~(esk1_0=esk2_0))),inference(skolemize,[status(esa)],[104])).
% cnf(108,plain,(ssItem(esk1_0)),inference(split_conjunct,[status(thm)],[105])).
% cnf(113,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[3])).
% fof(146, plain,![X1]:(~(ssItem(X1))|![X2]:(~(ssItem(X2))|![X3]:(~(ssList(X3))|((~(memberP(cons(X2,X3),X1))|(X1=X2|memberP(X3,X1)))&((~(X1=X2)&~(memberP(X3,X1)))|memberP(cons(X2,X3),X1)))))),inference(fof_nnf,[status(thm)],[11])).
% fof(147, plain,![X4]:(~(ssItem(X4))|![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4)))))),inference(variable_rename,[status(thm)],[146])).
% fof(148, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))&((~(X4=X5)&~(memberP(X6,X4)))|memberP(cons(X5,X6),X4))))|~(ssItem(X5)))|~(ssItem(X4))),inference(shift_quantors,[status(thm)],[147])).
% fof(149, plain,![X4]:![X5]:![X6]:(((((~(memberP(cons(X5,X6),X4))|(X4=X5|memberP(X6,X4)))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&(((((~(X4=X5)|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4)))&((((~(memberP(X6,X4))|memberP(cons(X5,X6),X4))|~(ssList(X6)))|~(ssItem(X5)))|~(ssItem(X4))))),inference(distribute,[status(thm)],[148])).
% cnf(152,plain,(memberP(X3,X1)|X1=X2|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|~memberP(cons(X2,X3),X1)),inference(split_conjunct,[status(thm)],[149])).
% 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))|?[X6]:(ssItem(X6)&(memberP(X1,X6)&~(X5=X6)))))&(?[X7]:(ssItem(X7)&((cons(X7,nil)=X3&memberP(X4,X7))&![X8]:(((~(ssItem(X8))|X7=X8)|~(memberP(X4,X8)))|~(leq(X7,X8)))))|(nil=X4&nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&(((X10=X12&X9=X11)&![X13]:(~(ssItem(X13))|?[X14]:(ssItem(X14)&(memberP(X9,X14)&~(X13=X14)))))&(?[X15]:(ssItem(X15)&((cons(X15,nil)=X11&memberP(X12,X15))&![X16]:(((~(ssItem(X16))|X15=X16)|~(memberP(X12,X16)))|~(leq(X15,X16)))))|(nil=X12&nil=X11))))))),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)&![X13]:(~(ssItem(X13))|(ssItem(esk52_1(X13))&(memberP(esk48_0,esk52_1(X13))&~(X13=esk52_1(X13))))))&((ssItem(esk53_0)&((cons(esk53_0,nil)=esk50_0&memberP(esk51_0,esk53_0))&![X16]:(((~(ssItem(X16))|esk53_0=X16)|~(memberP(esk51_0,X16)))|~(leq(esk53_0,X16)))))|(nil=esk51_0&nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X16]:(((((((((((~(ssItem(X16))|esk53_0=X16)|~(memberP(esk51_0,X16)))|~(leq(esk53_0,X16)))&(cons(esk53_0,nil)=esk50_0&memberP(esk51_0,esk53_0)))&ssItem(esk53_0))|(nil=esk51_0&nil=esk50_0))&((~(ssItem(X13))|(ssItem(esk52_1(X13))&(memberP(esk48_0,esk52_1(X13))&~(X13=esk52_1(X13)))))&(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,![X13]:![X16]:(((((((((nil=esk51_0|(((~(ssItem(X16))|esk53_0=X16)|~(memberP(esk51_0,X16)))|~(leq(esk53_0,X16))))&(nil=esk50_0|(((~(ssItem(X16))|esk53_0=X16)|~(memberP(esk51_0,X16)))|~(leq(esk53_0,X16)))))&(((nil=esk51_0|cons(esk53_0,nil)=esk50_0)&(nil=esk50_0|cons(esk53_0,nil)=esk50_0))&((nil=esk51_0|memberP(esk51_0,esk53_0))&(nil=esk50_0|memberP(esk51_0,esk53_0)))))&((nil=esk51_0|ssItem(esk53_0))&(nil=esk50_0|ssItem(esk53_0))))&(((ssItem(esk52_1(X13))|~(ssItem(X13)))&((memberP(esk48_0,esk52_1(X13))|~(ssItem(X13)))&(~(X13=esk52_1(X13))|~(ssItem(X13)))))&(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(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(~ssItem(X1)|X1!=esk52_1(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(memberP(esk48_0,esk52_1(X1))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssItem(esk52_1(X1))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(ssItem(esk53_0)|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(cons(esk53_0,nil)=esk50_0|nil=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(594,negated_conjecture,(memberP(esk50_0,esk52_1(X1))|~ssItem(X1)),inference(rw,[status(thm)],[580,577,theory(equality)])).
% cnf(942,negated_conjecture,(X1=esk53_0|memberP(nil,X1)|esk50_0=nil|~memberP(esk50_0,X1)|~ssList(nil)|~ssItem(esk53_0)|~ssItem(X1)),inference(spm,[status(thm)],[152,586,theory(equality)])).
% cnf(947,negated_conjecture,(X1=esk53_0|memberP(nil,X1)|esk50_0=nil|~memberP(esk50_0,X1)|$false|~ssItem(esk53_0)|~ssItem(X1)),inference(rw,[status(thm)],[942,113,theory(equality)])).
% cnf(948,negated_conjecture,(X1=esk53_0|memberP(nil,X1)|esk50_0=nil|~memberP(esk50_0,X1)|~ssItem(esk53_0)|~ssItem(X1)),inference(cn,[status(thm)],[947,theory(equality)])).
% cnf(2169,negated_conjecture,(esk50_0=nil|X1=esk53_0|memberP(nil,X1)|~memberP(esk50_0,X1)|~ssItem(X1)),inference(csr,[status(thm)],[948,582])).
% cnf(2170,negated_conjecture,(esk50_0=nil|X1=esk53_0|~memberP(esk50_0,X1)|~ssItem(X1)),inference(csr,[status(thm)],[2169,155])).
% cnf(2171,negated_conjecture,(esk50_0=nil|esk52_1(X1)=esk53_0|~ssItem(esk52_1(X1))|~ssItem(X1)),inference(spm,[status(thm)],[2170,594,theory(equality)])).
% cnf(2172,negated_conjecture,(esk52_1(X1)=esk53_0|esk50_0=nil|~ssItem(X1)),inference(csr,[status(thm)],[2171,581])).
% cnf(2173,negated_conjecture,(esk50_0=nil|esk53_0!=X1|~ssItem(X1)),inference(spm,[status(thm)],[579,2172,theory(equality)])).
% cnf(2218,negated_conjecture,(esk50_0=nil|~ssItem(esk53_0)),inference(er,[status(thm)],[2173,theory(equality)])).
% cnf(2219,negated_conjecture,(esk50_0=nil),inference(csr,[status(thm)],[2218,582])).
% cnf(2276,negated_conjecture,(memberP(nil,esk52_1(X1))|~ssItem(X1)),inference(rw,[status(thm)],[594,2219,theory(equality)])).
% cnf(2314,negated_conjecture,(~ssItem(esk52_1(X1))|~ssItem(X1)),inference(spm,[status(thm)],[155,2276,theory(equality)])).
% cnf(2327,negated_conjecture,(~ssItem(X1)),inference(csr,[status(thm)],[2314,581])).
% cnf(2347,plain,($false),inference(sr,[status(thm)],[108,2327,theory(equality)])).
% cnf(2348,plain,($false),2347,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 335
% # ...of these trivial : 6
% # ...subsumed : 55
% # ...remaining for further processing: 274
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 60
% # Generated clauses : 914
% # ...of the previous two non-trivial : 772
% # Contextual simplify-reflections : 84
% # Paramodulations : 817
% # Factorizations : 0
% # Equation resolutions : 95
% # Current number of processed clauses: 205
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 182
% # Current number of unprocessed clauses: 431
% # ...number of literals in the above : 3154
% # Clause-clause subsumption calls (NU) : 1630
% # Rec. Clause-clause subsumption calls : 643
% # Unit Clause-clause subsumption calls : 103
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 240 leaves, 1.34+/-1.121 terms/leaf
% # Paramod-from index: 110 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 205 leaves, 1.23+/-0.963 terms/leaf
% # -------------------------------------------------
% # User time : 0.086 s
% # System time : 0.007 s
% # Total time : 0.093 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.30 WC
% FINAL PrfWatch: 0.22 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP32065/SWC198+1.tptp
%
%------------------------------------------------------------------------------