TSTP Solution File: SWC029+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC029+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 06:52: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/SystemOnTPTP17070/SWC029+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17070/SWC029+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17070/SWC029+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 17166
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.031 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(4, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>ssList(cons(X2,X1)))),file('/tmp/SRASS.s.p', ax16)).
% fof(5, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(15, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>cons(X2,X1)=app(cons(X2,nil),X1))),file('/tmp/SRASS.s.p', ax81)).
% fof(17, 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))|(~(nil=X3)&nil=X4))|(![X5]:(ssItem(X5)=>![X6]:(ssList(X6)=>(~(app(cons(X5,nil),X6)=X4)|~(app(X6,cons(X5,nil))=X3))))&neq(X4,nil)))|((~(nil=X2)|nil=X1)&(~(nil=X1)|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)=X4)|~(app(X6,cons(X5,nil))=X3))))&neq(X4,nil)))|((~(nil=X2)|nil=X1)&(~(nil=X1)|nil=X2)))))))),inference(assume_negation,[status(cth)],[96])).
% fof(114, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(115, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[114])).
% fof(116, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[115])).
% fof(117, 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)],[116])).
% cnf(118,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[117])).
% fof(120, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(121, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[120])).
% fof(122, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[121])).
% cnf(123,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[122])).
% cnf(124,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(165, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|cons(X2,X1)=app(cons(X2,nil),X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(166, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))),inference(variable_rename,[status(thm)],[165])).
% fof(167, plain,![X3]:![X4]:((~(ssItem(X4))|cons(X4,X3)=app(cons(X4,nil),X3))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[166])).
% cnf(168,plain,(cons(X2,X1)=app(cons(X2,nil),X1)|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[167])).
% fof(173, 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)],[17])).
% fof(174, 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)],[173])).
% fof(175, 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)],[174])).
% fof(176, 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)],[175])).
% cnf(178,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[176])).
% cnf(179,plain,(nil=X2|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[176])).
% fof(567, 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)=X4&app(X6,cons(X5,nil))=X3)))|~(neq(X4,nil))))&((nil=X2&~(nil=X1))|(nil=X1&~(nil=X2)))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X7]:(ssList(X7)&?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&((((X8=X10&X7=X9)&(nil=X9|~(nil=X10)))&(?[X11]:(ssItem(X11)&?[X12]:(ssList(X12)&(app(cons(X11,nil),X12)=X10&app(X12,cons(X11,nil))=X9)))|~(neq(X10,nil))))&((nil=X8&~(nil=X7))|(nil=X7&~(nil=X8)))))))),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)&(nil=esk50_0|~(nil=esk51_0)))&((ssItem(esk52_0)&(ssList(esk53_0)&(app(cons(esk52_0,nil),esk53_0)=esk51_0&app(esk53_0,cons(esk52_0,nil))=esk50_0)))|~(neq(esk51_0,nil))))&((nil=esk49_0&~(nil=esk48_0))|(nil=esk48_0&~(nil=esk49_0)))))))),inference(skolemize,[status(esa)],[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)|~(neq(esk51_0,nil)))&((ssList(esk53_0)|~(neq(esk51_0,nil)))&((app(cons(esk52_0,nil),esk53_0)=esk51_0|~(neq(esk51_0,nil)))&(app(esk53_0,cons(esk52_0,nil))=esk50_0|~(neq(esk51_0,nil)))))))&(((nil=esk48_0|nil=esk49_0)&(~(nil=esk49_0)|nil=esk49_0))&((nil=esk48_0|~(nil=esk48_0))&(~(nil=esk49_0)|~(nil=esk48_0))))))))),inference(distribute,[status(thm)],[569])).
% cnf(571,negated_conjecture,(nil!=esk48_0|nil!=esk49_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(574,negated_conjecture,(nil=esk49_0|nil=esk48_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(575,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[570])).
% cnf(576,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[570])).
% cnf(577,negated_conjecture,(ssList(esk53_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[570])).
% cnf(578,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[570])).
% cnf(579,negated_conjecture,(nil=esk50_0|nil!=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(580,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(581,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[570])).
% cnf(584,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[570])).
% cnf(586,negated_conjecture,(esk48_0!=nil|esk51_0!=nil),inference(rw,[status(thm)],[571,581,theory(equality)])).
% cnf(587,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[584,581,theory(equality)])).
% cnf(590,negated_conjecture,(esk48_0=nil|esk51_0!=nil),inference(rw,[status(thm)],[579,580,theory(equality)])).
% cnf(591,negated_conjecture,(esk51_0!=nil),inference(csr,[status(thm)],[590,586])).
% cnf(592,negated_conjecture,(esk48_0=nil|esk51_0=nil),inference(rw,[status(thm)],[574,581,theory(equality)])).
% cnf(593,negated_conjecture,(esk48_0=nil),inference(sr,[status(thm)],[592,591,theory(equality)])).
% cnf(598,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|~neq(esk51_0,nil)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[575,580,theory(equality)]),593,theory(equality)])).
% cnf(670,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[578,118,theory(equality)])).
% cnf(671,negated_conjecture,(ssList(esk53_0)|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[577,118,theory(equality)])).
% cnf(672,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[598,118,theory(equality)])).
% cnf(673,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk51_0|esk51_0=nil|~ssList(nil)|~ssList(esk51_0)),inference(spm,[status(thm)],[576,118,theory(equality)])).
% cnf(674,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[670,124,theory(equality)])).
% cnf(675,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[674,587,theory(equality)])).
% cnf(676,negated_conjecture,(ssItem(esk52_0)|esk51_0=nil),inference(cn,[status(thm)],[675,theory(equality)])).
% cnf(677,negated_conjecture,(ssItem(esk52_0)),inference(sr,[status(thm)],[676,591,theory(equality)])).
% cnf(678,negated_conjecture,(ssList(esk53_0)|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[671,124,theory(equality)])).
% cnf(679,negated_conjecture,(ssList(esk53_0)|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[678,587,theory(equality)])).
% cnf(680,negated_conjecture,(ssList(esk53_0)|esk51_0=nil),inference(cn,[status(thm)],[679,theory(equality)])).
% cnf(681,negated_conjecture,(ssList(esk53_0)),inference(sr,[status(thm)],[680,591,theory(equality)])).
% cnf(682,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[672,124,theory(equality)])).
% cnf(683,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[682,587,theory(equality)])).
% cnf(684,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil|esk51_0=nil),inference(cn,[status(thm)],[683,theory(equality)])).
% cnf(685,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=nil),inference(sr,[status(thm)],[684,591,theory(equality)])).
% cnf(686,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk51_0|esk51_0=nil|$false|~ssList(esk51_0)),inference(rw,[status(thm)],[673,124,theory(equality)])).
% cnf(687,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk51_0|esk51_0=nil|$false|$false),inference(rw,[status(thm)],[686,587,theory(equality)])).
% cnf(688,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk51_0|esk51_0=nil),inference(cn,[status(thm)],[687,theory(equality)])).
% cnf(689,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk51_0),inference(sr,[status(thm)],[688,591,theory(equality)])).
% cnf(1336,negated_conjecture,(nil=esk53_0|~ssList(cons(esk52_0,nil))|~ssList(esk53_0)),inference(spm,[status(thm)],[178,685,theory(equality)])).
% cnf(1357,negated_conjecture,(nil=esk53_0|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[1336,681,theory(equality)])).
% cnf(1358,negated_conjecture,(nil=esk53_0|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[1357,theory(equality)])).
% cnf(1425,negated_conjecture,(esk51_0=cons(esk52_0,esk53_0)|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[168,689,theory(equality)])).
% cnf(1460,negated_conjecture,(esk51_0=cons(esk52_0,esk53_0)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1425,681,theory(equality)])).
% cnf(1461,negated_conjecture,(esk51_0=cons(esk52_0,esk53_0)|$false|$false),inference(rw,[status(thm)],[1460,677,theory(equality)])).
% cnf(1462,negated_conjecture,(esk51_0=cons(esk52_0,esk53_0)),inference(cn,[status(thm)],[1461,theory(equality)])).
% cnf(1600,negated_conjecture,(esk53_0=nil|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[1358,123,theory(equality)])).
% cnf(1601,negated_conjecture,(esk53_0=nil|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[1600,124,theory(equality)])).
% cnf(1602,negated_conjecture,(esk53_0=nil|$false|$false),inference(rw,[status(thm)],[1601,677,theory(equality)])).
% cnf(1603,negated_conjecture,(esk53_0=nil),inference(cn,[status(thm)],[1602,theory(equality)])).
% cnf(1605,negated_conjecture,(cons(esk52_0,nil)=esk51_0),inference(rw,[status(thm)],[1462,1603,theory(equality)])).
% cnf(1607,negated_conjecture,(app(nil,cons(esk52_0,nil))=nil),inference(rw,[status(thm)],[685,1603,theory(equality)])).
% cnf(1797,negated_conjecture,(app(nil,esk51_0)=nil),inference(rw,[status(thm)],[1607,1605,theory(equality)])).
% cnf(1805,negated_conjecture,(nil=esk51_0|~ssList(esk51_0)|~ssList(nil)),inference(spm,[status(thm)],[179,1797,theory(equality)])).
% cnf(1832,negated_conjecture,(nil=esk51_0|$false|~ssList(nil)),inference(rw,[status(thm)],[1805,587,theory(equality)])).
% cnf(1833,negated_conjecture,(nil=esk51_0|$false|$false),inference(rw,[status(thm)],[1832,124,theory(equality)])).
% cnf(1834,negated_conjecture,(nil=esk51_0),inference(cn,[status(thm)],[1833,theory(equality)])).
% cnf(1835,negated_conjecture,($false),inference(sr,[status(thm)],[1834,591,theory(equality)])).
% cnf(1836,negated_conjecture,($false),1835,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 219
% # ...of these trivial : 2
% # ...subsumed : 6
% # ...remaining for further processing: 211
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 13
% # Generated clauses : 679
% # ...of the previous two non-trivial : 570
% # Contextual simplify-reflections : 3
% # Paramodulations : 588
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 192
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 488
% # ...number of literals in the above : 3339
% # Clause-clause subsumption calls (NU) : 823
% # Rec. Clause-clause subsumption calls : 147
% # Unit Clause-clause subsumption calls : 66
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 229 leaves, 1.35+/-1.145 terms/leaf
% # Paramod-from index: 103 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 194 leaves, 1.24+/-0.987 terms/leaf
% # -------------------------------------------------
% # User time : 0.067 s
% # System time : 0.009 s
% # Total time : 0.076 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.28 WC
% FINAL PrfWatch: 0.19 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP17070/SWC029+1.tptp
%
%------------------------------------------------------------------------------