TSTP Solution File: SWC200+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC200+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 07:20:51 EST 2010
% Result : Theorem 1.28s
% Output : Solution 1.28s
% 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/SystemOnTPTP32342/SWC200+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32342/SWC200+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32342/SWC200+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 32438
% 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(2, 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(4, axiom,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),file('/tmp/SRASS.s.p', ax38)).
% fof(7, axiom,![X1]:(ssList(X1)=>(singletonP(X1)<=>?[X2]:(ssItem(X2)&cons(X2,nil)=X1))),file('/tmp/SRASS.s.p', ax4)).
% fof(15, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(38, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>hd(cons(X2,X1))=X2)),file('/tmp/SRASS.s.p', ax23)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|~(singletonP(X3)))|?[X5]:(ssItem(X5)&![X6]:(ssItem(X6)=>(~(memberP(X1,X6))|X5=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))|~(singletonP(X3)))|?[X5]:(ssItem(X5)&![X6]:(ssItem(X6)=>(~(memberP(X1,X6))|X5=X6))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(98, plain,![X1]:(ssItem(X1)=>~(memberP(nil,X1))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|~(singletonP(X3)))|?[X5]:(ssItem(X5)&![X6]:(ssItem(X6)=>(~(memberP(X1,X6))|X5=X6))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(109, 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)],[2])).
% fof(110, 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)],[109])).
% fof(111, 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)],[110])).
% fof(112, 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)],[111])).
% cnf(115,plain,(memberP(X3,X1)|X1=X2|~ssItem(X1)|~ssItem(X2)|~ssList(X3)|~memberP(cons(X2,X3),X1)),inference(split_conjunct,[status(thm)],[112])).
% fof(123, plain,![X1]:(~(ssItem(X1))|~(memberP(nil,X1))),inference(fof_nnf,[status(thm)],[98])).
% fof(124, plain,![X2]:(~(ssItem(X2))|~(memberP(nil,X2))),inference(variable_rename,[status(thm)],[123])).
% cnf(125,plain,(~memberP(nil,X1)|~ssItem(X1)),inference(split_conjunct,[status(thm)],[124])).
% fof(136, plain,![X1]:(~(ssList(X1))|((~(singletonP(X1))|?[X2]:(ssItem(X2)&cons(X2,nil)=X1))&(![X2]:(~(ssItem(X2))|~(cons(X2,nil)=X1))|singletonP(X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(137, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|?[X4]:(ssItem(X4)&cons(X4,nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(variable_rename,[status(thm)],[136])).
% fof(138, plain,![X3]:(~(ssList(X3))|((~(singletonP(X3))|(ssItem(esk3_1(X3))&cons(esk3_1(X3),nil)=X3))&(![X5]:(~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3)))),inference(skolemize,[status(esa)],[137])).
% fof(139, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))&(~(singletonP(X3))|(ssItem(esk3_1(X3))&cons(esk3_1(X3),nil)=X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[138])).
% fof(140, plain,![X3]:![X5]:((((~(ssItem(X5))|~(cons(X5,nil)=X3))|singletonP(X3))|~(ssList(X3)))&(((ssItem(esk3_1(X3))|~(singletonP(X3)))|~(ssList(X3)))&((cons(esk3_1(X3),nil)=X3|~(singletonP(X3)))|~(ssList(X3))))),inference(distribute,[status(thm)],[139])).
% cnf(141,plain,(cons(esk3_1(X1),nil)=X1|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[140])).
% cnf(142,plain,(ssItem(esk3_1(X1))|~ssList(X1)|~singletonP(X1)),inference(split_conjunct,[status(thm)],[140])).
% cnf(174,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[15])).
% fof(285, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|hd(cons(X2,X1))=X2)),inference(fof_nnf,[status(thm)],[38])).
% fof(286, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|hd(cons(X4,X3))=X4)),inference(variable_rename,[status(thm)],[285])).
% fof(287, plain,![X3]:![X4]:((~(ssItem(X4))|hd(cons(X4,X3))=X4)|~(ssList(X3))),inference(shift_quantors,[status(thm)],[286])).
% cnf(288,plain,(hd(cons(X2,X1))=X2|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[287])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&singletonP(X3))&![X5]:(~(ssItem(X5))|?[X6]:(ssItem(X6)&(memberP(X1,X6)&~(X5=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)&singletonP(X9))&![X11]:(~(ssItem(X11))|?[X12]:(ssItem(X12)&(memberP(X7,X12)&~(X11=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)&singletonP(esk50_0))&![X11]:(~(ssItem(X11))|(ssItem(esk52_1(X11))&(memberP(esk48_0,esk52_1(X11))&~(X11=esk52_1(X11)))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X11]:((((((~(ssItem(X11))|(ssItem(esk52_1(X11))&(memberP(esk48_0,esk52_1(X11))&~(X11=esk52_1(X11)))))&((esk49_0=esk51_0&esk48_0=esk50_0)&singletonP(esk50_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X11]:(((((((ssItem(esk52_1(X11))|~(ssItem(X11)))&((memberP(esk48_0,esk52_1(X11))|~(ssItem(X11)))&(~(X11=esk52_1(X11))|~(ssItem(X11)))))&((esk49_0=esk51_0&esk48_0=esk50_0)&singletonP(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,(singletonP(esk50_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(~ssItem(X1)|X1!=esk52_1(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(memberP(esk48_0,esk52_1(X1))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(ssItem(esk52_1(X1))|~ssItem(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(586,negated_conjecture,(singletonP(esk48_0)),inference(rw,[status(thm)],[577,578,theory(equality)])).
% cnf(640,plain,(hd(X1)=esk3_1(X1)|~ssList(nil)|~ssItem(esk3_1(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[288,141,theory(equality)])).
% cnf(641,plain,(hd(X1)=esk3_1(X1)|$false|~ssItem(esk3_1(X1))|~singletonP(X1)|~ssList(X1)),inference(rw,[status(thm)],[640,174,theory(equality)])).
% cnf(642,plain,(hd(X1)=esk3_1(X1)|~ssItem(esk3_1(X1))|~singletonP(X1)|~ssList(X1)),inference(cn,[status(thm)],[641,theory(equality)])).
% cnf(1553,plain,(esk3_1(X1)=hd(X1)|~singletonP(X1)|~ssList(X1)),inference(csr,[status(thm)],[642,142])).
% cnf(1554,plain,(ssItem(hd(X1))|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[142,1553,theory(equality)])).
% cnf(1555,plain,(cons(hd(X1),nil)=X1|~singletonP(X1)|~ssList(X1)),inference(spm,[status(thm)],[141,1553,theory(equality)])).
% cnf(1556,negated_conjecture,(ssItem(hd(esk48_0))|~ssList(esk48_0)),inference(spm,[status(thm)],[1554,586,theory(equality)])).
% cnf(1558,negated_conjecture,(ssItem(hd(esk48_0))|$false),inference(rw,[status(thm)],[1556,573,theory(equality)])).
% cnf(1559,negated_conjecture,(ssItem(hd(esk48_0))),inference(cn,[status(thm)],[1558,theory(equality)])).
% cnf(1735,negated_conjecture,(cons(hd(esk48_0),nil)=esk48_0|~ssList(esk48_0)),inference(spm,[status(thm)],[1555,586,theory(equality)])).
% cnf(1737,negated_conjecture,(cons(hd(esk48_0),nil)=esk48_0|$false),inference(rw,[status(thm)],[1735,573,theory(equality)])).
% cnf(1738,negated_conjecture,(cons(hd(esk48_0),nil)=esk48_0),inference(cn,[status(thm)],[1737,theory(equality)])).
% cnf(1744,negated_conjecture,(X1=hd(esk48_0)|memberP(nil,X1)|~memberP(esk48_0,X1)|~ssList(nil)|~ssItem(hd(esk48_0))|~ssItem(X1)),inference(spm,[status(thm)],[115,1738,theory(equality)])).
% cnf(1792,negated_conjecture,(X1=hd(esk48_0)|memberP(nil,X1)|~memberP(esk48_0,X1)|$false|~ssItem(hd(esk48_0))|~ssItem(X1)),inference(rw,[status(thm)],[1744,174,theory(equality)])).
% cnf(1793,negated_conjecture,(X1=hd(esk48_0)|memberP(nil,X1)|~memberP(esk48_0,X1)|$false|$false|~ssItem(X1)),inference(rw,[status(thm)],[1792,1559,theory(equality)])).
% cnf(1794,negated_conjecture,(X1=hd(esk48_0)|memberP(nil,X1)|~memberP(esk48_0,X1)|~ssItem(X1)),inference(cn,[status(thm)],[1793,theory(equality)])).
% cnf(1917,negated_conjecture,(X1=hd(esk48_0)|~memberP(esk48_0,X1)|~ssItem(X1)),inference(csr,[status(thm)],[1794,125])).
% cnf(1918,negated_conjecture,(esk52_1(X1)=hd(esk48_0)|~ssItem(esk52_1(X1))|~ssItem(X1)),inference(spm,[status(thm)],[1917,581,theory(equality)])).
% cnf(1919,negated_conjecture,(esk52_1(X1)=hd(esk48_0)|~ssItem(X1)),inference(csr,[status(thm)],[1918,582])).
% cnf(1920,negated_conjecture,(hd(esk48_0)!=X1|~ssItem(X1)),inference(spm,[status(thm)],[580,1919,theory(equality)])).
% cnf(1976,negated_conjecture,(~ssItem(hd(esk48_0))),inference(er,[status(thm)],[1920,theory(equality)])).
% cnf(1977,negated_conjecture,($false),inference(rw,[status(thm)],[1976,1559,theory(equality)])).
% cnf(1978,negated_conjecture,($false),inference(cn,[status(thm)],[1977,theory(equality)])).
% cnf(1979,negated_conjecture,($false),1978,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 287
% # ...of these trivial : 2
% # ...subsumed : 27
% # ...remaining for further processing: 258
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 4
% # Generated clauses : 765
% # ...of the previous two non-trivial : 616
% # Contextual simplify-reflections : 21
% # Paramodulations : 669
% # Factorizations : 0
% # Equation resolutions : 96
% # Current number of processed clauses: 245
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 209
% # Current number of unprocessed clauses: 484
% # ...number of literals in the above : 3422
% # Clause-clause subsumption calls (NU) : 1180
% # Rec. Clause-clause subsumption calls : 433
% # Unit Clause-clause subsumption calls : 44
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 264 leaves, 1.34+/-1.082 terms/leaf
% # Paramod-from index: 132 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 238 leaves, 1.20+/-0.898 terms/leaf
% # -------------------------------------------------
% # User time : 0.080 s
% # System time : 0.003 s
% # Total time : 0.083 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP32342/SWC200+1.tptp
%
%------------------------------------------------------------------------------