TSTP Solution File: SWC309+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC309+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 07:49:48 EST 2010
% Result : Theorem 1.52s
% Output : Solution 1.52s
% 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/SystemOnTPTP28154/SWC309+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28154/SWC309+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28154/SWC309+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 28286
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 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(8, axiom,![X1]:(ssList(X1)=>(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),file('/tmp/SRASS.s.p', ax20)).
% fof(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((((~(X2=X4)|~(X1=X3))|~(neq(X2,nil)))|?[X5]:(ssItem(X5)&?[X6]:((ssList(X6)&app(cons(X5,nil),X6)=X2)&app(X6,cons(X5,nil))=X1)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&~(app(X8,cons(X7,nil))=X3))&app(cons(X7,nil),X8)=X4)))|(~(nil=X3)&nil=X4)))))),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]:(ssItem(X5)&?[X6]:((ssList(X6)&app(cons(X5,nil),X6)=X2)&app(X6,cons(X5,nil))=X1)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&~(app(X8,cons(X7,nil))=X3))&app(cons(X7,nil),X8)=X4)))|(~(nil=X3)&nil=X4))))))),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]:(ssItem(X5)&?[X6]:((ssList(X6)&app(cons(X5,nil),X6)=X2)&app(X6,cons(X5,nil))=X1)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&~(app(X8,cons(X7,nil))=X3))&app(cons(X7,nil),X8)=X4)))|(~(nil=X3)&nil=X4))))))),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(136, plain,![X1]:(~(ssList(X1))|(nil=X1|?[X2]:(ssList(X2)&?[X3]:(ssItem(X3)&cons(X3,X2)=X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(137, plain,![X4]:(~(ssList(X4))|(nil=X4|?[X5]:(ssList(X5)&?[X6]:(ssItem(X6)&cons(X6,X5)=X4)))),inference(variable_rename,[status(thm)],[136])).
% fof(138, plain,![X4]:(~(ssList(X4))|(nil=X4|(ssList(esk3_1(X4))&(ssItem(esk4_1(X4))&cons(esk4_1(X4),esk3_1(X4))=X4)))),inference(skolemize,[status(esa)],[137])).
% fof(139, plain,![X4]:(((ssList(esk3_1(X4))|nil=X4)|~(ssList(X4)))&(((ssItem(esk4_1(X4))|nil=X4)|~(ssList(X4)))&((cons(esk4_1(X4),esk3_1(X4))=X4|nil=X4)|~(ssList(X4))))),inference(distribute,[status(thm)],[138])).
% cnf(140,plain,(nil=X1|cons(esk4_1(X1),esk3_1(X1))=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[139])).
% cnf(141,plain,(nil=X1|ssItem(esk4_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[139])).
% cnf(142,plain,(nil=X1|ssList(esk3_1(X1))|~ssList(X1)),inference(split_conjunct,[status(thm)],[139])).
% fof(166, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(167, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[166])).
% fof(168, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[167])).
% cnf(169,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[168])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((((X2=X4&X1=X3)&neq(X2,nil))&![X5]:(~(ssItem(X5))|![X6]:((~(ssList(X6))|~(app(cons(X5,nil),X6)=X2))|~(app(X6,cons(X5,nil))=X1))))&![X7]:(~(ssItem(X7))|![X8]:((~(ssList(X8))|app(X8,cons(X7,nil))=X3)|~(app(cons(X7,nil),X8)=X4))))&(nil=X3|~(nil=X4))))))),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)&neq(X10,nil))&![X13]:(~(ssItem(X13))|![X14]:((~(ssList(X14))|~(app(cons(X13,nil),X14)=X10))|~(app(X14,cons(X13,nil))=X9))))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|app(X16,cons(X15,nil))=X11)|~(app(cons(X15,nil),X16)=X12))))&(nil=X11|~(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))&![X13]:(~(ssItem(X13))|![X14]:((~(ssList(X14))|~(app(cons(X13,nil),X14)=esk49_0))|~(app(X14,cons(X13,nil))=esk48_0))))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|app(X16,cons(X15,nil))=esk50_0)|~(app(cons(X15,nil),X16)=esk51_0))))&(nil=esk50_0|~(nil=esk51_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X14]:![X15]:![X16]:(((((((((~(ssList(X16))|app(X16,cons(X15,nil))=esk50_0)|~(app(cons(X15,nil),X16)=esk51_0))|~(ssItem(X15)))&((((~(ssList(X14))|~(app(cons(X13,nil),X14)=esk49_0))|~(app(X14,cons(X13,nil))=esk48_0))|~(ssItem(X13)))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil))))&(nil=esk50_0|~(nil=esk51_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(573,negated_conjecture,(ssList(esk49_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,(~ssItem(X1)|app(X2,cons(X1,nil))!=esk48_0|app(cons(X1,nil),X2)!=esk49_0|~ssList(X2)),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(app(X2,cons(X1,nil))=esk50_0|~ssItem(X1)|app(cons(X1,nil),X2)!=esk51_0|~ssList(X2)),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[573,579,theory(equality)])).
% cnf(586,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[577,579,theory(equality)])).
% cnf(611,plain,(~ssList(X1)|~neq(X1,X1)),inference(er,[status(thm)],[120,theory(equality)])).
% cnf(612,negated_conjecture,(app(X2,cons(X1,nil))!=esk50_0|app(cons(X1,nil),X2)!=esk49_0|~ssItem(X1)|~ssList(X2)),inference(rw,[status(thm)],[580,578,theory(equality)])).
% cnf(613,negated_conjecture,(app(X2,cons(X1,nil))!=esk50_0|app(cons(X1,nil),X2)!=esk51_0|~ssItem(X1)|~ssList(X2)),inference(rw,[status(thm)],[612,579,theory(equality)])).
% cnf(648,negated_conjecture,(app(cons(X1,nil),X2)!=esk51_0|~ssList(X2)|~ssItem(X1)),inference(csr,[status(thm)],[581,613])).
% cnf(664,negated_conjecture,(cons(X1,X2)!=esk51_0|~ssList(X2)|~ssItem(X1)),inference(spm,[status(thm)],[648,169,theory(equality)])).
% cnf(1682,negated_conjecture,(nil=X1|X1!=esk51_0|~ssList(esk3_1(X1))|~ssItem(esk4_1(X1))|~ssList(X1)),inference(spm,[status(thm)],[664,140,theory(equality)])).
% cnf(2066,negated_conjecture,(nil=X1|X1!=esk51_0|~ssList(esk3_1(X1))|~ssList(X1)),inference(csr,[status(thm)],[1682,141])).
% cnf(2067,negated_conjecture,(nil=X1|X1!=esk51_0|~ssList(X1)),inference(csr,[status(thm)],[2066,142])).
% cnf(2068,negated_conjecture,(nil=esk51_0|~ssList(esk51_0)),inference(er,[status(thm)],[2067,theory(equality)])).
% cnf(2069,negated_conjecture,(nil=esk51_0|$false),inference(rw,[status(thm)],[2068,583,theory(equality)])).
% cnf(2070,negated_conjecture,(nil=esk51_0),inference(cn,[status(thm)],[2069,theory(equality)])).
% cnf(2080,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[586,2070,theory(equality)])).
% cnf(2087,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[611,2080,theory(equality)])).
% cnf(2089,negated_conjecture,($false),inference(rw,[status(thm)],[2087,125,theory(equality)])).
% cnf(2090,negated_conjecture,($false),inference(cn,[status(thm)],[2089,theory(equality)])).
% cnf(2091,negated_conjecture,($false),2090,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 324
% # ...of these trivial : 2
% # ...subsumed : 62
% # ...remaining for further processing: 260
% # Other redundant clauses eliminated : 75
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 23
% # Generated clauses : 804
% # ...of the previous two non-trivial : 648
% # Contextual simplify-reflections : 50
% # Paramodulations : 699
% # Factorizations : 0
% # Equation resolutions : 105
% # Current number of processed clauses: 228
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 203
% # Current number of unprocessed clauses: 456
% # ...number of literals in the above : 3340
% # Clause-clause subsumption calls (NU) : 1568
% # Rec. Clause-clause subsumption calls : 815
% # Unit Clause-clause subsumption calls : 63
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 244 leaves, 1.36+/-1.121 terms/leaf
% # Paramod-from index: 122 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 218 leaves, 1.22+/-0.936 terms/leaf
% # -------------------------------------------------
% # User time : 0.079 s
% # System time : 0.003 s
% # Total time : 0.082 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.27 WC
% FINAL PrfWatch: 0.21 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP28154/SWC309+1.tptp
%
%------------------------------------------------------------------------------