TSTP Solution File: SWC013+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC013+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 06:50:11 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/SystemOnTPTP14074/SWC013+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14074/SWC013+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14074/SWC013+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 14170
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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(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(10, axiom,![X1]:(ssList(X1)=>(~(nil=X1)=>ssItem(hd(X1)))),file('/tmp/SRASS.s.p', ax22)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((~(X2=X4)|~(X1=X3))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X3=X5))&?[X6]:(((ssItem(X6)&cons(X6,nil)=X5)&hd(X4)=X6)&neq(nil,X4))))|?[X7]:((ssList(X7)&X1=X7)&?[X8]:(((ssItem(X8)&cons(X8,nil)=X7)&hd(X2)=X8)&neq(nil,X2))))&(~(neq(X2,nil))|neq(X4,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))|(((~(neq(X2,nil))|?[X5]:((ssList(X5)&~(X3=X5))&?[X6]:(((ssItem(X6)&cons(X6,nil)=X5)&hd(X4)=X6)&neq(nil,X4))))|?[X7]:((ssList(X7)&X1=X7)&?[X8]:(((ssItem(X8)&cons(X8,nil)=X7)&hd(X2)=X8)&neq(nil,X2))))&(~(neq(X2,nil))|neq(X4,nil))))))))),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]:((ssList(X5)&~(X3=X5))&?[X6]:(((ssItem(X6)&cons(X6,nil)=X5)&hd(X4)=X6)&neq(nil,X4))))|?[X7]:((ssList(X7)&X1=X7)&?[X8]:(((ssItem(X8)&cons(X8,nil)=X7)&hd(X2)=X8)&neq(nil,X2))))&(~(neq(X2,nil))|neq(X4,nil))))))))),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(119,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[118])).
% cnf(120,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[118])).
% fof(121, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssItem(X2))|ssList(cons(X2,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(122, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssItem(X4))|ssList(cons(X4,X3)))),inference(variable_rename,[status(thm)],[121])).
% fof(123, plain,![X3]:![X4]:((~(ssItem(X4))|ssList(cons(X4,X3)))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[122])).
% cnf(124,plain,(ssList(cons(X2,X1))|~ssList(X1)|~ssItem(X2)),inference(split_conjunct,[status(thm)],[123])).
% cnf(125,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[5])).
% fof(147, plain,![X1]:(~(ssList(X1))|(nil=X1|ssItem(hd(X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(148, plain,![X2]:(~(ssList(X2))|(nil=X2|ssItem(hd(X2)))),inference(variable_rename,[status(thm)],[147])).
% cnf(149,plain,(ssItem(hd(X1))|nil=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[148])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&![X5]:((~(ssList(X5))|X3=X5)|![X6]:(((~(ssItem(X6))|~(cons(X6,nil)=X5))|~(hd(X4)=X6))|~(neq(nil,X4)))))&![X7]:((~(ssList(X7))|~(X1=X7))|![X8]:(((~(ssItem(X8))|~(cons(X8,nil)=X7))|~(hd(X2)=X8))|~(neq(nil,X2)))))|(neq(X2,nil)&~(neq(X4,nil))))))))),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]:((~(ssList(X13))|X11=X13)|![X14]:(((~(ssItem(X14))|~(cons(X14,nil)=X13))|~(hd(X12)=X14))|~(neq(nil,X12)))))&![X15]:((~(ssList(X15))|~(X9=X15))|![X16]:(((~(ssItem(X16))|~(cons(X16,nil)=X15))|~(hd(X10)=X16))|~(neq(nil,X10)))))|(neq(X10,nil)&~(neq(X12,nil))))))))),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]:((~(ssList(X13))|esk50_0=X13)|![X14]:(((~(ssItem(X14))|~(cons(X14,nil)=X13))|~(hd(esk51_0)=X14))|~(neq(nil,esk51_0)))))&![X15]:((~(ssList(X15))|~(esk48_0=X15))|![X16]:(((~(ssItem(X16))|~(cons(X16,nil)=X15))|~(hd(esk49_0)=X16))|~(neq(nil,esk49_0)))))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X14]:![X15]:![X16]:(((((((((((~(ssItem(X16))|~(cons(X16,nil)=X15))|~(hd(esk49_0)=X16))|~(neq(nil,esk49_0)))|(~(ssList(X15))|~(esk48_0=X15)))&(((((~(ssItem(X14))|~(cons(X14,nil)=X13))|~(hd(esk51_0)=X14))|~(neq(nil,esk51_0)))|(~(ssList(X13))|esk50_0=X13))&neq(esk49_0,nil)))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X13]:![X14]:![X15]:![X16]:((((((((neq(esk49_0,nil)|((((~(ssItem(X16))|~(cons(X16,nil)=X15))|~(hd(esk49_0)=X16))|~(neq(nil,esk49_0)))|(~(ssList(X15))|~(esk48_0=X15))))&(~(neq(esk51_0,nil))|((((~(ssItem(X16))|~(cons(X16,nil)=X15))|~(hd(esk49_0)=X16))|~(neq(nil,esk49_0)))|(~(ssList(X15))|~(esk48_0=X15)))))&(((neq(esk49_0,nil)|((((~(ssItem(X14))|~(cons(X14,nil)=X13))|~(hd(esk51_0)=X14))|~(neq(nil,esk51_0)))|(~(ssList(X13))|esk50_0=X13)))&(~(neq(esk51_0,nil))|((((~(ssItem(X14))|~(cons(X14,nil)=X13))|~(hd(esk51_0)=X14))|~(neq(nil,esk51_0)))|(~(ssList(X13))|esk50_0=X13))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil)))))&(esk49_0=esk51_0&esk48_0=esk50_0))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(esk50_0=X1|~ssList(X1)|~neq(nil,esk51_0)|hd(esk51_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(esk48_0!=X1|~ssList(X1)|~neq(nil,esk49_0)|hd(esk49_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(602,plain,(~ssList(X1)|~neq(X1,X1)),inference(er,[status(thm)],[120,theory(equality)])).
% cnf(618,negated_conjecture,(esk48_0!=X1|hd(esk49_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk49_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,578,theory(equality)]),580,theory(equality)])).
% cnf(619,negated_conjecture,(esk48_0!=X1|hd(esk49_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk49_0)),inference(cn,[status(thm)],[618,theory(equality)])).
% cnf(643,negated_conjecture,(esk48_0=X1|hd(esk51_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk51_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,577,theory(equality)])).
% cnf(644,negated_conjecture,(esk48_0=X1|hd(esk49_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk51_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[643,578,theory(equality)])).
% cnf(645,negated_conjecture,(esk48_0=X1|hd(esk49_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk49_0)|~neq(esk51_0,nil)),inference(rw,[status(thm)],[644,578,theory(equality)])).
% cnf(646,negated_conjecture,(esk48_0=X1|hd(esk49_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk49_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[645,578,theory(equality)]),580,theory(equality)])).
% cnf(647,negated_conjecture,(esk48_0=X1|hd(esk49_0)!=X2|cons(X2,nil)!=X1|~ssItem(X2)|~ssList(X1)|~neq(nil,esk49_0)),inference(cn,[status(thm)],[646,theory(equality)])).
% cnf(648,negated_conjecture,(cons(X2,nil)!=X1|hd(esk49_0)!=X2|~ssList(X1)|~neq(nil,esk49_0)|~ssItem(X2)),inference(csr,[status(thm)],[647,619])).
% cnf(664,negated_conjecture,(nil=esk49_0|cons(X1,nil)!=X2|hd(esk49_0)!=X1|~ssList(X2)|~ssItem(X1)|~ssList(esk49_0)|~ssList(nil)),inference(spm,[status(thm)],[648,119,theory(equality)])).
% cnf(665,negated_conjecture,(nil=esk49_0|cons(X1,nil)!=X2|hd(esk49_0)!=X1|~ssList(X2)|~ssItem(X1)|$false|~ssList(nil)),inference(rw,[status(thm)],[664,574,theory(equality)])).
% cnf(666,negated_conjecture,(nil=esk49_0|cons(X1,nil)!=X2|hd(esk49_0)!=X1|~ssList(X2)|~ssItem(X1)|$false|$false),inference(rw,[status(thm)],[665,125,theory(equality)])).
% cnf(667,negated_conjecture,(nil=esk49_0|cons(X1,nil)!=X2|hd(esk49_0)!=X1|~ssList(X2)|~ssItem(X1)),inference(cn,[status(thm)],[666,theory(equality)])).
% cnf(1718,negated_conjecture,(esk49_0=nil|cons(hd(esk49_0),nil)!=X1|~ssList(X1)|~ssItem(hd(esk49_0))),inference(er,[status(thm)],[667,theory(equality)])).
% cnf(1722,negated_conjecture,(esk49_0=nil|cons(hd(esk49_0),nil)!=X1|~ssList(X1)|~ssList(esk49_0)),inference(spm,[status(thm)],[1718,149,theory(equality)])).
% cnf(1723,negated_conjecture,(esk49_0=nil|cons(hd(esk49_0),nil)!=X1|~ssList(X1)|$false),inference(rw,[status(thm)],[1722,574,theory(equality)])).
% cnf(1724,negated_conjecture,(esk49_0=nil|cons(hd(esk49_0),nil)!=X1|~ssList(X1)),inference(cn,[status(thm)],[1723,theory(equality)])).
% cnf(1725,negated_conjecture,(esk49_0=nil|~ssList(cons(hd(esk49_0),nil))),inference(er,[status(thm)],[1724,theory(equality)])).
% cnf(1726,negated_conjecture,(esk49_0=nil|~ssList(nil)|~ssItem(hd(esk49_0))),inference(spm,[status(thm)],[1725,124,theory(equality)])).
% cnf(1727,negated_conjecture,(esk49_0=nil|$false|~ssItem(hd(esk49_0))),inference(rw,[status(thm)],[1726,125,theory(equality)])).
% cnf(1728,negated_conjecture,(esk49_0=nil|~ssItem(hd(esk49_0))),inference(cn,[status(thm)],[1727,theory(equality)])).
% cnf(1729,negated_conjecture,(esk49_0=nil|~ssList(esk49_0)),inference(spm,[status(thm)],[1728,149,theory(equality)])).
% cnf(1730,negated_conjecture,(esk49_0=nil|$false),inference(rw,[status(thm)],[1729,574,theory(equality)])).
% cnf(1731,negated_conjecture,(esk49_0=nil),inference(cn,[status(thm)],[1730,theory(equality)])).
% cnf(1742,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[580,1731,theory(equality)])).
% cnf(1746,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[602,1742,theory(equality)])).
% cnf(1747,negated_conjecture,($false),inference(rw,[status(thm)],[1746,125,theory(equality)])).
% cnf(1748,negated_conjecture,($false),inference(cn,[status(thm)],[1747,theory(equality)])).
% cnf(1749,negated_conjecture,($false),1748,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 260
% # ...of these trivial : 5
% # ...subsumed : 22
% # ...remaining for further processing: 233
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 18
% # Generated clauses : 665
% # ...of the previous two non-trivial : 544
% # Contextual simplify-reflections : 8
% # Paramodulations : 570
% # Factorizations : 0
% # Equation resolutions : 95
% # Current number of processed clauses: 206
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 181
% # Current number of unprocessed clauses: 420
% # ...number of literals in the above : 3121
% # Clause-clause subsumption calls (NU) : 970
% # Rec. Clause-clause subsumption calls : 246
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 240 leaves, 1.34+/-1.121 terms/leaf
% # Paramod-from index: 112 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 205 leaves, 1.23+/-0.963 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.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP14074/SWC013+1.tptp
%
%------------------------------------------------------------------------------