TSTP Solution File: SWC322+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC322+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 : art04.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:48:39 EST 2010
% Result : Theorem 1.30s
% Output : Solution 1.30s
% 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/SystemOnTPTP20825/SWC322+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20825/SWC322+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20825/SWC322+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 20921
% 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(2, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(3, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(13, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|?[X5]:(ssItem(X5)&?[X6]:((ssList(X6)&~(app(cons(X5,nil),X6)=X3))&app(X6,cons(X5,nil))=X4)))|(~(nil=X3)&nil=X4))|(![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>(~(app(X8,cons(X7,nil))=X2)|app(cons(X7,nil),X8)=X1)))&(~(nil=X2)|nil=X1))))))),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]:((ssList(X6)&~(app(cons(X5,nil),X6)=X3))&app(X6,cons(X5,nil))=X4)))|(~(nil=X3)&nil=X4))|(![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>(~(app(X8,cons(X7,nil))=X2)|app(cons(X7,nil),X8)=X1)))&(~(nil=X2)|nil=X1)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(108, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(109, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[108])).
% fof(110, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[109])).
% cnf(111,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[110])).
% cnf(112,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[3])).
% fof(153, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(154, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[153])).
% fof(155, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[154])).
% cnf(156,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[155])).
% fof(161, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[15])).
% fof(162, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[161])).
% fof(163, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[162])).
% fof(164, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[163])).
% cnf(166,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[164])).
% cnf(167,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[164])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&![X5]:(~(ssItem(X5))|![X6]:((~(ssList(X6))|app(cons(X5,nil),X6)=X3)|~(app(X6,cons(X5,nil))=X4))))&(nil=X3|~(nil=X4)))&(?[X7]:(ssItem(X7)&?[X8]:(ssList(X8)&(app(X8,cons(X7,nil))=X2&~(app(cons(X7,nil),X8)=X1))))|(nil=X2&~(nil=X1)))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&((((X10=X12&X9=X11)&![X13]:(~(ssItem(X13))|![X14]:((~(ssList(X14))|app(cons(X13,nil),X14)=X11)|~(app(X14,cons(X13,nil))=X12))))&(nil=X11|~(nil=X12)))&(?[X15]:(ssItem(X15)&?[X16]:(ssList(X16)&(app(X16,cons(X15,nil))=X10&~(app(cons(X15,nil),X16)=X9))))|(nil=X10&~(nil=X9)))))))),inference(variable_rename,[status(thm)],[567])).
% fof(569, 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))|![X14]:((~(ssList(X14))|app(cons(X13,nil),X14)=esk50_0)|~(app(X14,cons(X13,nil))=esk51_0))))&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)&(ssList(esk53_0)&(app(esk53_0,cons(esk52_0,nil))=esk49_0&~(app(cons(esk52_0,nil),esk53_0)=esk48_0))))|(nil=esk49_0&~(nil=esk48_0)))))))),inference(skolemize,[status(esa)],[568])).
% fof(570, negated_conjecture,![X13]:![X14]:((((((((((~(ssList(X14))|app(cons(X13,nil),X14)=esk50_0)|~(app(X14,cons(X13,nil))=esk51_0))|~(ssItem(X13)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)&(ssList(esk53_0)&(app(esk53_0,cons(esk52_0,nil))=esk49_0&~(app(cons(esk52_0,nil),esk53_0)=esk48_0))))|(nil=esk49_0&~(nil=esk48_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[569])).
% fof(571, negated_conjecture,![X13]:![X14]:((((((((((~(ssList(X14))|app(cons(X13,nil),X14)=esk50_0)|~(app(X14,cons(X13,nil))=esk51_0))|~(ssItem(X13)))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk50_0|~(nil=esk51_0)))&(((nil=esk49_0|ssItem(esk52_0))&(~(nil=esk48_0)|ssItem(esk52_0)))&(((nil=esk49_0|ssList(esk53_0))&(~(nil=esk48_0)|ssList(esk53_0)))&(((nil=esk49_0|app(esk53_0,cons(esk52_0,nil))=esk49_0)&(~(nil=esk48_0)|app(esk53_0,cons(esk52_0,nil))=esk49_0))&((nil=esk49_0|~(app(cons(esk52_0,nil),esk53_0)=esk48_0))&(~(nil=esk48_0)|~(app(cons(esk52_0,nil),esk53_0)=esk48_0)))))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[570])).
% cnf(576,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)!=esk48_0|nil!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(nil=esk49_0|app(cons(esk52_0,nil),esk53_0)!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk49_0|nil!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk49_0|nil=esk49_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(ssList(esk53_0)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(581,negated_conjecture,(ssList(esk53_0)|nil=esk49_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(582,negated_conjecture,(ssItem(esk52_0)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(583,negated_conjecture,(ssItem(esk52_0)|nil=esk49_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(584,negated_conjecture,(nil=esk50_0|nil!=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(585,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(586,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(587,negated_conjecture,(app(cons(X1,nil),X2)=esk50_0|~ssItem(X1)|app(X2,cons(X1,nil))!=esk51_0|~ssList(X2)),inference(split_conjunct,[status(thm)],[571])).
% cnf(590,negated_conjecture,(esk48_0=nil|esk51_0!=nil),inference(rw,[status(thm)],[584,585,theory(equality)])).
% cnf(591,negated_conjecture,(esk48_0=nil|esk49_0!=nil),inference(rw,[status(thm)],[590,586,theory(equality)])).
% cnf(651,negated_conjecture,(app(cons(X1,nil),X2)=esk48_0|app(X2,cons(X1,nil))!=esk51_0|~ssItem(X1)|~ssList(X2)),inference(rw,[status(thm)],[587,585,theory(equality)])).
% cnf(652,negated_conjecture,(app(cons(X1,nil),X2)=esk48_0|app(X2,cons(X1,nil))!=esk49_0|~ssItem(X1)|~ssList(X2)),inference(rw,[status(thm)],[651,586,theory(equality)])).
% cnf(654,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk48_0|esk49_0=nil|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[652,579,theory(equality)])).
% cnf(1391,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk48_0|esk49_0=nil|~ssList(esk53_0)),inference(csr,[status(thm)],[654,583])).
% cnf(1392,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk48_0|esk49_0=nil),inference(csr,[status(thm)],[1391,581])).
% cnf(1393,negated_conjecture,(esk49_0=nil),inference(csr,[status(thm)],[1392,577])).
% cnf(1398,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|esk48_0!=nil),inference(rw,[status(thm)],[578,1393,theory(equality)])).
% cnf(1404,negated_conjecture,(esk48_0=nil|$false),inference(rw,[status(thm)],[591,1393,theory(equality)])).
% cnf(1405,negated_conjecture,(esk48_0=nil),inference(cn,[status(thm)],[1404,theory(equality)])).
% cnf(1407,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)!=nil|esk48_0!=nil),inference(rw,[status(thm)],[576,1405,theory(equality)])).
% cnf(1408,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)!=nil|$false),inference(rw,[status(thm)],[1407,1405,theory(equality)])).
% cnf(1409,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)!=nil),inference(cn,[status(thm)],[1408,theory(equality)])).
% cnf(1410,negated_conjecture,(ssList(esk53_0)|$false),inference(rw,[status(thm)],[580,1405,theory(equality)])).
% cnf(1411,negated_conjecture,(ssList(esk53_0)),inference(cn,[status(thm)],[1410,theory(equality)])).
% cnf(1412,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[582,1405,theory(equality)])).
% cnf(1413,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[1412,theory(equality)])).
% cnf(1417,negated_conjecture,(cons(esk52_0,esk53_0)!=nil|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1409,156,theory(equality)])).
% cnf(1422,negated_conjecture,(cons(esk52_0,esk53_0)!=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1417,1411,theory(equality)])).
% cnf(1423,negated_conjecture,(cons(esk52_0,esk53_0)!=nil|$false|$false),inference(rw,[status(thm)],[1422,1413,theory(equality)])).
% cnf(1424,negated_conjecture,(cons(esk52_0,esk53_0)!=nil),inference(cn,[status(thm)],[1423,theory(equality)])).
% cnf(1428,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|$false),inference(rw,[status(thm)],[1398,1405,theory(equality)])).
% cnf(1429,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil),inference(cn,[status(thm)],[1428,theory(equality)])).
% cnf(1430,negated_conjecture,(nil=esk53_0|~ssList(cons(esk52_0,nil))|~ssList(esk53_0)),inference(spm,[status(thm)],[166,1429,theory(equality)])).
% cnf(1450,negated_conjecture,(nil=esk53_0|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[1430,1411,theory(equality)])).
% cnf(1451,negated_conjecture,(nil=esk53_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[1450,theory(equality)])).
% cnf(1503,negated_conjecture,(esk53_0=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1451,111,theory(equality)])).
% cnf(1504,negated_conjecture,(esk53_0=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1503,112,theory(equality)])).
% cnf(1505,negated_conjecture,(esk53_0=nil|$false|$false),inference(rw,[status(thm)],[1504,1413,theory(equality)])).
% cnf(1506,negated_conjecture,(esk53_0=nil),inference(cn,[status(thm)],[1505,theory(equality)])).
% cnf(1509,negated_conjecture,(app(nil,cons(esk52_0,nil))=nil),inference(rw,[status(thm)],[1429,1506,theory(equality)])).
% cnf(1511,negated_conjecture,(cons(esk52_0,nil)!=nil),inference(rw,[status(thm)],[1424,1506,theory(equality)])).
% cnf(1535,negated_conjecture,(nil=cons(esk52_0,nil)|~ssList(cons(esk52_0,nil))|~ssList(nil)),inference(spm,[status(thm)],[167,1509,theory(equality)])).
% cnf(1561,negated_conjecture,(nil=cons(esk52_0,nil)|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[1535,112,theory(equality)])).
% cnf(1562,negated_conjecture,(nil=cons(esk52_0,nil)|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[1561,theory(equality)])).
% cnf(1563,negated_conjecture,(~ssList(cons(esk52_0,nil))),inference(sr,[status(thm)],[1562,1511,theory(equality)])).
% cnf(1589,negated_conjecture,(~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1563,111,theory(equality)])).
% cnf(1590,negated_conjecture,($false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1589,112,theory(equality)])).
% cnf(1591,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1590,1413,theory(equality)])).
% cnf(1592,negated_conjecture,($false),inference(cn,[status(thm)],[1591,theory(equality)])).
% cnf(1593,negated_conjecture,($false),1592,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 239
% # ...of these trivial : 2
% # ...subsumed : 10
% # ...remaining for further processing: 227
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 22
% # Generated clauses : 629
% # ...of the previous two non-trivial : 530
% # Contextual simplify-reflections : 10
% # Paramodulations : 538
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 199
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 455
% # ...number of literals in the above : 3229
% # Clause-clause subsumption calls (NU) : 885
% # Rec. Clause-clause subsumption calls : 199
% # Unit Clause-clause subsumption calls : 72
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 241 leaves, 1.33+/-1.118 terms/leaf
% # Paramod-from index: 107 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 206 leaves, 1.22+/-0.960 terms/leaf
% # -------------------------------------------------
% # User time : 0.069 s
% # System time : 0.006 s
% # Total time : 0.075 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/SystemOnTPTP20825/SWC322+1.tptp
%
%------------------------------------------------------------------------------