TSTP Solution File: SWC218+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC218+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 : art01.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:24:57 EST 2010
% Result : Theorem 1.48s
% Output : Solution 1.48s
% 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/SystemOnTPTP16237/SWC218+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16237/SWC218+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16237/SWC218+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 16333
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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(9, axiom,![X1]:(ssList(X1)=>![X2]:(ssItem(X2)=>~(nil=cons(X2,X1)))),file('/tmp/SRASS.s.p', ax21)).
% fof(10, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>ssList(app(X1,X2)))),file('/tmp/SRASS.s.p', ax26)).
% fof(17, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(18, axiom,![X1]:(ssList(X1)=>app(X1,nil)=X1),file('/tmp/SRASS.s.p', ax84)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>(((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>![X6]:(ssList(X6)=>(~(app(X5,X6)=X4)|![X7]:(ssItem(X7)=>~(app(app(X5,cons(X7,nil)),X6)=X3))))))|neq(X1,nil)))))),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]:(ssList(X5)=>![X6]:(ssList(X6)=>(~(app(X5,X6)=X4)|![X7]:(ssItem(X7)=>~(app(app(X5,cons(X7,nil)),X6)=X3))))))|neq(X1,nil))))))),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(142, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|~(nil=cons(X2,X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(143, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|~(nil=cons(X4,X3)))),inference(variable_rename,[status(thm)],[142])).
% fof(144, plain,![X3]:![X4]:((~(ssItem(X4))|~(nil=cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[143])).
% cnf(145,plain,(~ssList(X1)|nil!=cons(X2,X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[144])).
% fof(146, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|ssList(app(X1,X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(147, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|ssList(app(X3,X4)))),inference(variable_rename,[status(thm)],[146])).
% fof(148, plain,![X3]:![X4]:((~(ssList(X4))|ssList(app(X3,X4)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[147])).
% cnf(149,plain,(ssList(app(X1,X2))|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[148])).
% 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(180, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[18])).
% fof(181, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[180])).
% cnf(182,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[181])).
% fof(567, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&(((X2=X4&X1=X3)&?[X5]:(ssList(X5)&?[X6]:(ssList(X6)&(app(X5,X6)=X4&?[X7]:(ssItem(X7)&app(app(X5,cons(X7,nil)),X6)=X3)))))&~(neq(X1,nil))))))),inference(fof_nnf,[status(thm)],[97])).
% fof(568, negated_conjecture,?[X8]:(ssList(X8)&?[X9]:(ssList(X9)&?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&(((X9=X11&X8=X10)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&(app(X12,X13)=X11&?[X14]:(ssItem(X14)&app(app(X12,cons(X14,nil)),X13)=X10)))))&~(neq(X8,nil))))))),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)&(ssList(esk52_0)&(ssList(esk53_0)&(app(esk52_0,esk53_0)=esk51_0&(ssItem(esk54_0)&app(app(esk52_0,cons(esk54_0,nil)),esk53_0)=esk50_0)))))&~(neq(esk48_0,nil))))))),inference(skolemize,[status(esa)],[568])).
% cnf(570,negated_conjecture,(~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[569])).
% cnf(571,negated_conjecture,(app(app(esk52_0,cons(esk54_0,nil)),esk53_0)=esk50_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(572,negated_conjecture,(ssItem(esk54_0)),inference(split_conjunct,[status(thm)],[569])).
% cnf(573,negated_conjecture,(app(esk52_0,esk53_0)=esk51_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(574,negated_conjecture,(ssList(esk53_0)),inference(split_conjunct,[status(thm)],[569])).
% cnf(575,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[569])).
% cnf(576,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(577,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[569])).
% cnf(580,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[569])).
% cnf(581,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[569])).
% cnf(582,negated_conjecture,(ssList(esk51_0)),inference(rw,[status(thm)],[580,577,theory(equality)])).
% cnf(585,negated_conjecture,(app(app(esk52_0,cons(esk54_0,nil)),esk53_0)=esk48_0),inference(rw,[status(thm)],[571,576,theory(equality)])).
% cnf(673,negated_conjecture,(esk48_0=nil|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[570,118,theory(equality)])).
% cnf(674,negated_conjecture,(esk48_0=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[673,124,theory(equality)])).
% cnf(675,negated_conjecture,(esk48_0=nil|$false|$false),inference(rw,[status(thm)],[674,581,theory(equality)])).
% cnf(676,negated_conjecture,(esk48_0=nil),inference(cn,[status(thm)],[675,theory(equality)])).
% cnf(1406,negated_conjecture,(app(app(esk52_0,cons(esk54_0,nil)),esk53_0)=nil),inference(rw,[status(thm)],[585,676,theory(equality)])).
% cnf(1420,negated_conjecture,(nil=esk53_0|~ssList(esk53_0)|~ssList(app(esk52_0,cons(esk54_0,nil)))),inference(spm,[status(thm)],[179,1406,theory(equality)])).
% cnf(1447,negated_conjecture,(nil=esk53_0|$false|~ssList(app(esk52_0,cons(esk54_0,nil)))),inference(rw,[status(thm)],[1420,574,theory(equality)])).
% cnf(1448,negated_conjecture,(nil=esk53_0|~ssList(app(esk52_0,cons(esk54_0,nil)))),inference(cn,[status(thm)],[1447,theory(equality)])).
% cnf(1461,negated_conjecture,(esk53_0=nil|~ssList(cons(esk54_0,nil))|~ssList(esk52_0)),inference(spm,[status(thm)],[1448,149,theory(equality)])).
% cnf(1462,negated_conjecture,(esk53_0=nil|~ssList(cons(esk54_0,nil))|$false),inference(rw,[status(thm)],[1461,575,theory(equality)])).
% cnf(1463,negated_conjecture,(esk53_0=nil|~ssList(cons(esk54_0,nil))),inference(cn,[status(thm)],[1462,theory(equality)])).
% cnf(1464,negated_conjecture,(esk53_0=nil|~ssList(nil)|~ssItem(esk54_0)),inference(spm,[status(thm)],[1463,123,theory(equality)])).
% cnf(1465,negated_conjecture,(esk53_0=nil|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1464,124,theory(equality)])).
% cnf(1466,negated_conjecture,(esk53_0=nil|$false|$false),inference(rw,[status(thm)],[1465,572,theory(equality)])).
% cnf(1467,negated_conjecture,(esk53_0=nil),inference(cn,[status(thm)],[1466,theory(equality)])).
% cnf(1482,negated_conjecture,(app(app(esk52_0,cons(esk54_0,nil)),nil)=nil),inference(rw,[status(thm)],[1406,1467,theory(equality)])).
% cnf(1483,negated_conjecture,(app(esk52_0,nil)=esk51_0),inference(rw,[status(thm)],[573,1467,theory(equality)])).
% cnf(1499,negated_conjecture,(esk51_0=esk52_0|~ssList(esk52_0)),inference(spm,[status(thm)],[182,1483,theory(equality)])).
% cnf(1540,negated_conjecture,(esk51_0=esk52_0|$false),inference(rw,[status(thm)],[1499,575,theory(equality)])).
% cnf(1541,negated_conjecture,(esk51_0=esk52_0),inference(cn,[status(thm)],[1540,theory(equality)])).
% cnf(1594,negated_conjecture,(app(app(esk51_0,cons(esk54_0,nil)),nil)=nil),inference(rw,[status(thm)],[1482,1541,theory(equality)])).
% cnf(1595,negated_conjecture,(nil=app(esk51_0,cons(esk54_0,nil))|~ssList(nil)|~ssList(app(esk51_0,cons(esk54_0,nil)))),inference(spm,[status(thm)],[178,1594,theory(equality)])).
% cnf(1611,negated_conjecture,(nil=app(esk51_0,cons(esk54_0,nil))|$false|~ssList(app(esk51_0,cons(esk54_0,nil)))),inference(rw,[status(thm)],[1595,124,theory(equality)])).
% cnf(1612,negated_conjecture,(nil=app(esk51_0,cons(esk54_0,nil))|~ssList(app(esk51_0,cons(esk54_0,nil)))),inference(cn,[status(thm)],[1611,theory(equality)])).
% cnf(1644,negated_conjecture,(app(esk51_0,cons(esk54_0,nil))=nil|~ssList(cons(esk54_0,nil))|~ssList(esk51_0)),inference(spm,[status(thm)],[1612,149,theory(equality)])).
% cnf(1645,negated_conjecture,(app(esk51_0,cons(esk54_0,nil))=nil|~ssList(cons(esk54_0,nil))|$false),inference(rw,[status(thm)],[1644,582,theory(equality)])).
% cnf(1646,negated_conjecture,(app(esk51_0,cons(esk54_0,nil))=nil|~ssList(cons(esk54_0,nil))),inference(cn,[status(thm)],[1645,theory(equality)])).
% cnf(1647,negated_conjecture,(app(esk51_0,cons(esk54_0,nil))=nil|~ssList(nil)|~ssItem(esk54_0)),inference(spm,[status(thm)],[1646,123,theory(equality)])).
% cnf(1648,negated_conjecture,(app(esk51_0,cons(esk54_0,nil))=nil|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1647,124,theory(equality)])).
% cnf(1649,negated_conjecture,(app(esk51_0,cons(esk54_0,nil))=nil|$false|$false),inference(rw,[status(thm)],[1648,572,theory(equality)])).
% cnf(1650,negated_conjecture,(app(esk51_0,cons(esk54_0,nil))=nil),inference(cn,[status(thm)],[1649,theory(equality)])).
% cnf(1651,negated_conjecture,(nil=esk51_0|~ssList(cons(esk54_0,nil))|~ssList(esk51_0)),inference(spm,[status(thm)],[178,1650,theory(equality)])).
% cnf(1676,negated_conjecture,(nil=esk51_0|~ssList(cons(esk54_0,nil))|$false),inference(rw,[status(thm)],[1651,582,theory(equality)])).
% cnf(1677,negated_conjecture,(nil=esk51_0|~ssList(cons(esk54_0,nil))),inference(cn,[status(thm)],[1676,theory(equality)])).
% cnf(1760,negated_conjecture,(esk51_0=nil|~ssList(nil)|~ssItem(esk54_0)),inference(spm,[status(thm)],[1677,123,theory(equality)])).
% cnf(1761,negated_conjecture,(esk51_0=nil|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1760,124,theory(equality)])).
% cnf(1762,negated_conjecture,(esk51_0=nil|$false|$false),inference(rw,[status(thm)],[1761,572,theory(equality)])).
% cnf(1763,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[1762,theory(equality)])).
% cnf(1777,negated_conjecture,(app(nil,cons(esk54_0,nil))=nil),inference(rw,[status(thm)],[1650,1763,theory(equality)])).
% cnf(1790,negated_conjecture,(nil=cons(esk54_0,nil)|~ssList(cons(esk54_0,nil))|~ssList(nil)),inference(spm,[status(thm)],[179,1777,theory(equality)])).
% cnf(1816,negated_conjecture,(nil=cons(esk54_0,nil)|~ssList(cons(esk54_0,nil))|$false),inference(rw,[status(thm)],[1790,124,theory(equality)])).
% cnf(1817,negated_conjecture,(nil=cons(esk54_0,nil)|~ssList(cons(esk54_0,nil))),inference(cn,[status(thm)],[1816,theory(equality)])).
% cnf(1842,negated_conjecture,(cons(esk54_0,nil)=nil|~ssList(nil)|~ssItem(esk54_0)),inference(spm,[status(thm)],[1817,123,theory(equality)])).
% cnf(1843,negated_conjecture,(cons(esk54_0,nil)=nil|$false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1842,124,theory(equality)])).
% cnf(1844,negated_conjecture,(cons(esk54_0,nil)=nil|$false|$false),inference(rw,[status(thm)],[1843,572,theory(equality)])).
% cnf(1845,negated_conjecture,(cons(esk54_0,nil)=nil),inference(cn,[status(thm)],[1844,theory(equality)])).
% cnf(1846,negated_conjecture,(~ssList(nil)|~ssItem(esk54_0)),inference(spm,[status(thm)],[145,1845,theory(equality)])).
% cnf(1886,negated_conjecture,($false|~ssItem(esk54_0)),inference(rw,[status(thm)],[1846,124,theory(equality)])).
% cnf(1887,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1886,572,theory(equality)])).
% cnf(1888,negated_conjecture,($false),inference(cn,[status(thm)],[1887,theory(equality)])).
% cnf(1889,negated_conjecture,($false),1888,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 226
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 223
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 24
% # Generated clauses : 727
% # ...of the previous two non-trivial : 584
% # Contextual simplify-reflections : 2
% # Paramodulations : 636
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 193
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 450
% # ...number of literals in the above : 3185
% # Clause-clause subsumption calls (NU) : 834
% # Rec. Clause-clause subsumption calls : 158
% # Unit Clause-clause subsumption calls : 41
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 230 leaves, 1.35+/-1.142 terms/leaf
% # Paramod-from index: 104 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 195 leaves, 1.24+/-0.985 terms/leaf
% # -------------------------------------------------
% # User time : 0.073 s
% # System time : 0.005 s
% # Total time : 0.078 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.28 WC
% FINAL PrfWatch: 0.21 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP16237/SWC218+1.tptp
%
%------------------------------------------------------------------------------