TSTP Solution File: SWC320+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC320+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:48:24 EST 2010
% Result : Theorem 1.29s
% Output : Solution 1.29s
% 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/SystemOnTPTP21728/SWC320+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21728/SWC320+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21728/SWC320+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 21824
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% 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))|(~(nil=X3)&nil=X4))|(![X5]:(ssItem(X5)=>![X6]:((~(ssList(X6))|~(app(cons(X5,nil),X6)=X3))|~(app(X6,cons(X5,nil))=X4)))&neq(X4,nil)))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(cons(X7,nil),X8)=X1)&app(X8,cons(X7,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))|(~(nil=X3)&nil=X4))|(![X5]:(ssItem(X5)=>![X6]:((~(ssList(X6))|~(app(cons(X5,nil),X6)=X3))|~(app(X6,cons(X5,nil))=X4)))&neq(X4,nil)))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(cons(X7,nil),X8)=X1)&app(X8,cons(X7,nil))=X2))))))))),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))|(~(nil=X3)&nil=X4))|(![X5]:(ssItem(X5)=>![X6]:((~(ssList(X6))|~(app(cons(X5,nil),X6)=X3))|~(app(X6,cons(X5,nil))=X4)))&neq(X4,nil)))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(cons(X7,nil),X8)=X1)&app(X8,cons(X7,nil))=X2))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(143, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(144, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[143])).
% fof(145, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[144])).
% cnf(146,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[145])).
% 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)&(nil=X3|~(nil=X4)))&(?[X5]:(ssItem(X5)&?[X6]:((ssList(X6)&app(cons(X5,nil),X6)=X3)&app(X6,cons(X5,nil))=X4))|~(neq(X4,nil))))&((nil=X2&~(nil=X1))|(neq(X2,nil)&![X7]:(~(ssItem(X7))|![X8]:((~(ssList(X8))|~(app(cons(X7,nil),X8)=X1))|~(app(X8,cons(X7,nil))=X2))))))))),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)&(nil=X11|~(nil=X12)))&(?[X13]:(ssItem(X13)&?[X14]:((ssList(X14)&app(cons(X13,nil),X14)=X11)&app(X14,cons(X13,nil))=X12))|~(neq(X12,nil))))&((nil=X10&~(nil=X9))|(neq(X10,nil)&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=X9))|~(app(X16,cons(X15,nil))=X10))))))))),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)&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)&((ssList(esk53_0)&app(cons(esk52_0,nil),esk53_0)=esk50_0)&app(esk53_0,cons(esk52_0,nil))=esk51_0))|~(neq(esk51_0,nil))))&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=esk48_0))|~(app(X16,cons(X15,nil))=esk49_0))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:(((((((((~(ssList(X16))|~(app(cons(X15,nil),X16)=esk48_0))|~(app(X16,cons(X15,nil))=esk49_0))|~(ssItem(X15)))&neq(esk49_0,nil))|(nil=esk49_0&~(nil=esk48_0)))&((((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)&((ssList(esk53_0)&app(cons(esk52_0,nil),esk53_0)=esk50_0)&app(esk53_0,cons(esk52_0,nil))=esk51_0))|~(neq(esk51_0,nil)))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X15]:![X16]:(((((((nil=esk49_0|(((~(ssList(X16))|~(app(cons(X15,nil),X16)=esk48_0))|~(app(X16,cons(X15,nil))=esk49_0))|~(ssItem(X15))))&(~(nil=esk48_0)|(((~(ssList(X16))|~(app(cons(X15,nil),X16)=esk48_0))|~(app(X16,cons(X15,nil))=esk49_0))|~(ssItem(X15)))))&((nil=esk49_0|neq(esk49_0,nil))&(~(nil=esk48_0)|neq(esk49_0,nil))))&((((ssList(esk51_0)&esk49_0=esk51_0)&esk48_0=esk50_0)&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)|~(neq(esk51_0,nil)))&(((ssList(esk53_0)|~(neq(esk51_0,nil)))&(app(cons(esk52_0,nil),esk53_0)=esk50_0|~(neq(esk51_0,nil))))&(app(esk53_0,cons(esk52_0,nil))=esk51_0|~(neq(esk51_0,nil)))))))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(576,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(ssList(esk53_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(nil=esk50_0|nil!=esk51_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(584,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(neq(esk49_0,nil)|nil=esk49_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(nil=esk49_0|~ssItem(X1)|app(X2,cons(X1,nil))!=esk49_0|app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(esk48_0=nil|esk51_0!=nil),inference(rw,[status(thm)],[580,581,theory(equality)])).
% cnf(592,negated_conjecture,(neq(esk51_0,nil)|esk48_0!=nil),inference(rw,[status(thm)],[584,582,theory(equality)])).
% cnf(593,negated_conjecture,(esk51_0=nil|neq(esk49_0,nil)),inference(rw,[status(thm)],[585,582,theory(equality)])).
% cnf(594,negated_conjecture,(esk51_0=nil|neq(esk51_0,nil)),inference(rw,[status(thm)],[593,582,theory(equality)])).
% cnf(595,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil),inference(spm,[status(thm)],[579,594,theory(equality)])).
% cnf(596,negated_conjecture,(ssList(esk53_0)|esk51_0=nil),inference(spm,[status(thm)],[578,594,theory(equality)])).
% cnf(597,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk51_0|esk51_0=nil),inference(spm,[status(thm)],[576,594,theory(equality)])).
% cnf(598,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[577,581,theory(equality)])).
% cnf(599,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk48_0|esk51_0=nil),inference(spm,[status(thm)],[598,594,theory(equality)])).
% cnf(627,negated_conjecture,(esk51_0=nil|app(X2,cons(X1,nil))!=esk49_0|app(cons(X1,nil),X2)!=esk48_0|~ssItem(X1)|~ssList(X2)),inference(rw,[status(thm)],[587,582,theory(equality)])).
% cnf(628,negated_conjecture,(esk51_0=nil|app(X2,cons(X1,nil))!=esk51_0|app(cons(X1,nil),X2)!=esk48_0|~ssItem(X1)|~ssList(X2)),inference(rw,[status(thm)],[627,582,theory(equality)])).
% cnf(1357,negated_conjecture,(esk51_0=nil|app(cons(esk52_0,nil),esk53_0)!=esk48_0|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[628,597,theory(equality)])).
% cnf(1432,negated_conjecture,(esk51_0=nil|app(cons(esk52_0,nil),esk53_0)!=esk48_0|~ssList(esk53_0)),inference(csr,[status(thm)],[1357,595])).
% cnf(1433,negated_conjecture,(esk51_0=nil|app(cons(esk52_0,nil),esk53_0)!=esk48_0),inference(csr,[status(thm)],[1432,596])).
% cnf(1434,negated_conjecture,(esk51_0=nil),inference(csr,[status(thm)],[1433,599])).
% cnf(1445,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk48_0|~neq(nil,nil)),inference(rw,[status(thm)],[598,1434,theory(equality)])).
% cnf(1448,negated_conjecture,(ssList(esk53_0)|~neq(nil,nil)),inference(rw,[status(thm)],[578,1434,theory(equality)])).
% cnf(1449,negated_conjecture,(ssItem(esk52_0)|~neq(nil,nil)),inference(rw,[status(thm)],[579,1434,theory(equality)])).
% cnf(1450,negated_conjecture,(neq(nil,nil)|esk48_0!=nil),inference(rw,[status(thm)],[592,1434,theory(equality)])).
% cnf(1455,negated_conjecture,(esk48_0=nil|$false),inference(rw,[status(thm)],[591,1434,theory(equality)])).
% cnf(1456,negated_conjecture,(esk48_0=nil),inference(cn,[status(thm)],[1455,theory(equality)])).
% cnf(1472,negated_conjecture,(neq(nil,nil)|$false),inference(rw,[status(thm)],[1450,1456,theory(equality)])).
% cnf(1473,negated_conjecture,(neq(nil,nil)),inference(cn,[status(thm)],[1472,theory(equality)])).
% cnf(1474,negated_conjecture,(ssList(esk53_0)|$false),inference(rw,[status(thm)],[1448,1473,theory(equality)])).
% cnf(1475,negated_conjecture,(ssList(esk53_0)),inference(cn,[status(thm)],[1474,theory(equality)])).
% cnf(1476,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[1449,1473,theory(equality)])).
% cnf(1477,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[1476,theory(equality)])).
% cnf(1478,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=nil|~neq(nil,nil)),inference(rw,[status(thm)],[1445,1456,theory(equality)])).
% cnf(1479,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=nil|$false),inference(rw,[status(thm)],[1478,1473,theory(equality)])).
% cnf(1480,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=nil),inference(cn,[status(thm)],[1479,theory(equality)])).
% cnf(1496,negated_conjecture,(nil=cons(esk52_0,esk53_0)|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[169,1480,theory(equality)])).
% cnf(1530,negated_conjecture,(nil=cons(esk52_0,esk53_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1496,1475,theory(equality)])).
% cnf(1531,negated_conjecture,(nil=cons(esk52_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[1530,1477,theory(equality)])).
% cnf(1532,negated_conjecture,(nil=cons(esk52_0,esk53_0)),inference(cn,[status(thm)],[1531,theory(equality)])).
% cnf(1537,negated_conjecture,(~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[146,1532,theory(equality)])).
% cnf(1580,negated_conjecture,($false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1537,1475,theory(equality)])).
% cnf(1581,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1580,1477,theory(equality)])).
% cnf(1582,negated_conjecture,($false),inference(cn,[status(thm)],[1581,theory(equality)])).
% cnf(1583,negated_conjecture,($false),1582,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 228
% # ...of these trivial : 2
% # ...subsumed : 7
% # ...remaining for further processing: 219
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 22
% # Generated clauses : 675
% # ...of the previous two non-trivial : 551
% # Contextual simplify-reflections : 15
% # Paramodulations : 584
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 191
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 460
% # ...number of literals in the above : 3221
% # Clause-clause subsumption calls (NU) : 916
% # Rec. Clause-clause subsumption calls : 202
% # Unit Clause-clause subsumption calls : 62
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 230 leaves, 1.35+/-1.142 terms/leaf
% # Paramod-from index: 103 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 195 leaves, 1.24+/-0.985 terms/leaf
% # -------------------------------------------------
% # User time : 0.068 s
% # System time : 0.009 s
% # Total time : 0.077 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/SystemOnTPTP21728/SWC320+1.tptp
%
%------------------------------------------------------------------------------