TSTP Solution File: SWC012+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC012+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 : art06.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:02 EST 2010
% Result : Theorem 1.34s
% Output : Solution 1.34s
% 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/SystemOnTPTP5973/SWC012+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5973/SWC012+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5973/SWC012+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 6069
% 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(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(16, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>app(app(X1,X2),X3)=app(X1,app(X2,X3))))),file('/tmp/SRASS.s.p', ax82)).
% 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))|(((~(neq(X2,nil))|?[X5]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(X6,X7)=X1))))|![X8]:(ssItem(X8)=>~(app(X3,cons(X8,nil))=X4)))&(~(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]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(X6,X7)=X1))))|![X8]:(ssItem(X8)=>~(app(X3,cons(X8,nil))=X4)))&(~(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]:(ssItem(X5)&?[X6]:(ssList(X6)&?[X7]:((ssList(X7)&app(app(X6,cons(X5,nil)),X7)=X2)&app(X6,X7)=X1))))|![X8]:(ssItem(X8)=>~(app(X3,cons(X8,nil))=X4)))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% 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(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(170, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|![X3]:(~(ssList(X3))|app(app(X1,X2),X3)=app(X1,app(X2,X3))))),inference(fof_nnf,[status(thm)],[16])).
% fof(171, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|![X6]:(~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6))))),inference(variable_rename,[status(thm)],[170])).
% fof(172, plain,![X4]:![X5]:![X6]:(((~(ssList(X6))|app(app(X4,X5),X6)=app(X4,app(X5,X6)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[171])).
% cnf(173,plain,(app(app(X1,X2),X3)=app(X1,app(X2,X3))|~ssList(X1)|~ssList(X2)|~ssList(X3)),inference(split_conjunct,[status(thm)],[172])).
% fof(181, plain,![X1]:(~(ssList(X1))|app(X1,nil)=X1),inference(fof_nnf,[status(thm)],[18])).
% fof(182, plain,![X2]:(~(ssList(X2))|app(X2,nil)=X2),inference(variable_rename,[status(thm)],[181])).
% cnf(183,plain,(app(X1,nil)=X1|~ssList(X1)),inference(split_conjunct,[status(thm)],[182])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((X2=X4&X1=X3)&(((neq(X2,nil)&![X5]:(~(ssItem(X5))|![X6]:(~(ssList(X6))|![X7]:((~(ssList(X7))|~(app(app(X6,cons(X5,nil)),X7)=X2))|~(app(X6,X7)=X1)))))&?[X8]:(ssItem(X8)&app(X3,cons(X8,nil))=X4))|(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]:(~(ssItem(X13))|![X14]:(~(ssList(X14))|![X15]:((~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=X10))|~(app(X14,X15)=X9)))))&?[X16]:(ssItem(X16)&app(X11,cons(X16,nil))=X12))|(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]:(~(ssItem(X13))|![X14]:(~(ssList(X14))|![X15]:((~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk49_0))|~(app(X14,X15)=esk48_0)))))&(ssItem(esk52_0)&app(esk50_0,cons(esk52_0,nil))=esk51_0))|(neq(esk49_0,nil)&~(neq(esk51_0,nil))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X13]:![X14]:![X15]:((((((((((((~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk49_0))|~(app(X14,X15)=esk48_0))|~(ssList(X14)))|~(ssItem(X13)))&neq(esk49_0,nil))&(ssItem(esk52_0)&app(esk50_0,cons(esk52_0,nil))=esk51_0))|(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]:(((((((((neq(esk49_0,nil)|((((~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk49_0))|~(app(X14,X15)=esk48_0))|~(ssList(X14)))|~(ssItem(X13))))&(~(neq(esk51_0,nil))|((((~(ssList(X15))|~(app(app(X14,cons(X13,nil)),X15)=esk49_0))|~(app(X14,X15)=esk48_0))|~(ssList(X14)))|~(ssItem(X13)))))&((neq(esk49_0,nil)|neq(esk49_0,nil))&(~(neq(esk51_0,nil))|neq(esk49_0,nil))))&(((neq(esk49_0,nil)|ssItem(esk52_0))&(~(neq(esk51_0,nil))|ssItem(esk52_0)))&((neq(esk49_0,nil)|app(esk50_0,cons(esk52_0,nil))=esk51_0)&(~(neq(esk51_0,nil))|app(esk50_0,cons(esk52_0,nil))=esk51_0))))&(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(573,negated_conjecture,(ssList(esk48_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(579,negated_conjecture,(app(esk50_0,cons(esk52_0,nil))=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(~ssItem(X1)|~ssList(X2)|app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssList(X3)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[581,578,theory(equality)]),584,theory(equality)])).
% cnf(590,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[589,theory(equality)])).
% cnf(597,negated_conjecture,(app(esk48_0,cons(esk52_0,nil))=esk51_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[579,577,theory(equality)])).
% cnf(598,negated_conjecture,(app(esk48_0,cons(esk52_0,nil))=esk49_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[597,578,theory(equality)])).
% cnf(599,negated_conjecture,(app(esk48_0,cons(esk52_0,nil))=esk49_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[598,578,theory(equality)]),584,theory(equality)])).
% cnf(600,negated_conjecture,(app(esk48_0,cons(esk52_0,nil))=esk49_0),inference(cn,[status(thm)],[599,theory(equality)])).
% cnf(686,negated_conjecture,(app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssItem(X1)|~ssList(X3)|~ssList(X2)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[585,578,theory(equality)]),584,theory(equality)])).
% cnf(687,negated_conjecture,(app(X2,X3)!=esk48_0|app(app(X2,cons(X1,nil)),X3)!=esk49_0|~ssItem(X1)|~ssList(X3)|~ssList(X2)),inference(cn,[status(thm)],[686,theory(equality)])).
% cnf(691,negated_conjecture,(app(app(X1,cons(X2,nil)),nil)!=esk49_0|X1!=esk48_0|~ssList(nil)|~ssList(X1)|~ssItem(X2)),inference(spm,[status(thm)],[687,183,theory(equality)])).
% cnf(696,negated_conjecture,(app(app(X1,cons(X2,nil)),nil)!=esk49_0|X1!=esk48_0|$false|~ssList(X1)|~ssItem(X2)),inference(rw,[status(thm)],[691,125,theory(equality)])).
% cnf(697,negated_conjecture,(app(app(X1,cons(X2,nil)),nil)!=esk49_0|X1!=esk48_0|~ssList(X1)|~ssItem(X2)),inference(cn,[status(thm)],[696,theory(equality)])).
% cnf(915,negated_conjecture,(app(esk49_0,X1)=app(esk48_0,app(cons(esk52_0,nil),X1))|~ssList(X1)|~ssList(cons(esk52_0,nil))|~ssList(esk48_0)),inference(spm,[status(thm)],[173,600,theory(equality)])).
% cnf(922,negated_conjecture,(app(esk49_0,X1)=app(esk48_0,app(cons(esk52_0,nil),X1))|~ssList(X1)|~ssList(cons(esk52_0,nil))|$false),inference(rw,[status(thm)],[915,573,theory(equality)])).
% cnf(923,negated_conjecture,(app(esk49_0,X1)=app(esk48_0,app(cons(esk52_0,nil),X1))|~ssList(X1)|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[922,theory(equality)])).
% cnf(2057,negated_conjecture,(app(esk48_0,app(cons(esk52_0,nil),X1))=app(esk49_0,X1)|~ssList(X1)|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[923,124,theory(equality)])).
% cnf(2058,negated_conjecture,(app(esk48_0,app(cons(esk52_0,nil),X1))=app(esk49_0,X1)|~ssList(X1)|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2057,125,theory(equality)])).
% cnf(2059,negated_conjecture,(app(esk48_0,app(cons(esk52_0,nil),X1))=app(esk49_0,X1)|~ssList(X1)|$false|$false),inference(rw,[status(thm)],[2058,590,theory(equality)])).
% cnf(2060,negated_conjecture,(app(esk48_0,app(cons(esk52_0,nil),X1))=app(esk49_0,X1)|~ssList(X1)),inference(cn,[status(thm)],[2059,theory(equality)])).
% cnf(2077,negated_conjecture,(app(esk48_0,cons(esk52_0,nil))=app(esk49_0,nil)|~ssList(nil)|~ssList(cons(esk52_0,nil))),inference(spm,[status(thm)],[2060,183,theory(equality)])).
% cnf(2079,negated_conjecture,(app(esk48_0,cons(esk52_0,X1))=app(esk49_0,X1)|~ssList(X1)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2060,169,theory(equality)])).
% cnf(2110,negated_conjecture,(esk49_0=app(esk49_0,nil)|~ssList(nil)|~ssList(cons(esk52_0,nil))),inference(rw,[status(thm)],[2077,600,theory(equality)])).
% cnf(2111,negated_conjecture,(esk49_0=app(esk49_0,nil)|$false|~ssList(cons(esk52_0,nil))),inference(rw,[status(thm)],[2110,125,theory(equality)])).
% cnf(2112,negated_conjecture,(esk49_0=app(esk49_0,nil)|~ssList(cons(esk52_0,nil))),inference(cn,[status(thm)],[2111,theory(equality)])).
% cnf(2116,negated_conjecture,(app(esk48_0,cons(esk52_0,X1))=app(esk49_0,X1)|~ssList(X1)|$false),inference(rw,[status(thm)],[2079,590,theory(equality)])).
% cnf(2117,negated_conjecture,(app(esk48_0,cons(esk52_0,X1))=app(esk49_0,X1)|~ssList(X1)),inference(cn,[status(thm)],[2116,theory(equality)])).
% cnf(2118,negated_conjecture,(app(esk49_0,nil)=esk49_0|~ssList(nil)|~ssItem(esk52_0)),inference(spm,[status(thm)],[2112,124,theory(equality)])).
% cnf(2119,negated_conjecture,(app(esk49_0,nil)=esk49_0|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[2118,125,theory(equality)])).
% cnf(2120,negated_conjecture,(app(esk49_0,nil)=esk49_0|$false|$false),inference(rw,[status(thm)],[2119,590,theory(equality)])).
% cnf(2121,negated_conjecture,(app(esk49_0,nil)=esk49_0),inference(cn,[status(thm)],[2120,theory(equality)])).
% cnf(3174,negated_conjecture,(app(app(esk48_0,cons(X1,nil)),nil)!=esk49_0|~ssList(esk48_0)|~ssItem(X1)),inference(er,[status(thm)],[697,theory(equality)])).
% cnf(3175,negated_conjecture,(app(app(esk48_0,cons(X1,nil)),nil)!=esk49_0|$false|~ssItem(X1)),inference(rw,[status(thm)],[3174,573,theory(equality)])).
% cnf(3176,negated_conjecture,(app(app(esk48_0,cons(X1,nil)),nil)!=esk49_0|~ssItem(X1)),inference(cn,[status(thm)],[3175,theory(equality)])).
% cnf(3178,negated_conjecture,(app(app(esk49_0,nil),nil)!=esk49_0|~ssItem(esk52_0)|~ssList(nil)),inference(spm,[status(thm)],[3176,2117,theory(equality)])).
% cnf(3182,negated_conjecture,($false|~ssItem(esk52_0)|~ssList(nil)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3178,2121,theory(equality)]),2121,theory(equality)])).
% cnf(3183,negated_conjecture,($false|$false|~ssList(nil)),inference(rw,[status(thm)],[3182,590,theory(equality)])).
% cnf(3184,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[3183,125,theory(equality)])).
% cnf(3185,negated_conjecture,($false),inference(cn,[status(thm)],[3184,theory(equality)])).
% cnf(3186,negated_conjecture,($false),3185,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 394
% # ...of these trivial : 6
% # ...subsumed : 59
% # ...remaining for further processing: 329
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 15
% # Backward-rewritten : 15
% # Generated clauses : 1143
% # ...of the previous two non-trivial : 955
% # Contextual simplify-reflections : 33
% # Paramodulations : 1046
% # Factorizations : 0
% # Equation resolutions : 97
% # Current number of processed clauses: 293
% # Positive orientable unit clauses: 34
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 257
% # Current number of unprocessed clauses: 655
% # ...number of literals in the above : 4373
% # Clause-clause subsumption calls (NU) : 2294
% # Rec. Clause-clause subsumption calls : 1032
% # Unit Clause-clause subsumption calls : 22
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 322 leaves, 1.25+/-0.980 terms/leaf
% # Paramod-from index: 142 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 268 leaves, 1.18+/-0.848 terms/leaf
% # -------------------------------------------------
% # User time : 0.104 s
% # System time : 0.006 s
% # Total time : 0.110 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.32 WC
% FINAL PrfWatch: 0.25 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP5973/SWC012+1.tptp
%
%------------------------------------------------------------------------------