TSTP Solution File: SWC213+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC213+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 07:23:45 EST 2010
% Result : Theorem 1.28s
% Output : Solution 1.28s
% 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/SystemOnTPTP25973/SWC213+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25973/SWC213+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25973/SWC213+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 26069
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(6, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% 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)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(equalelemsP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssList(X9)&app(cons(X7,nil),X9)=X3))))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X6)&?[X12]:(ssList(X12)&app(X12,cons(X10,nil))=X3)))))))|neq(X1,nil))|(~(nil=X4)&nil=X3)))))),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)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(equalelemsP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssList(X9)&app(cons(X7,nil),X9)=X3))))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X6)&?[X12]:(ssList(X12)&app(X12,cons(X10,nil))=X3)))))))|neq(X1,nil))|(~(nil=X4)&nil=X3))))))),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)=>![X6]:(ssList(X6)=>(((~(app(app(X5,X3),X6)=X4)|~(equalelemsP(X3)))|?[X7]:(ssItem(X7)&?[X8]:((ssList(X8)&app(X8,cons(X7,nil))=X5)&?[X9]:(ssList(X9)&app(cons(X7,nil),X9)=X3))))|?[X10]:(ssItem(X10)&?[X11]:((ssList(X11)&app(cons(X10,nil),X11)=X6)&?[X12]:(ssList(X12)&app(X12,cons(X10,nil))=X3)))))))|neq(X1,nil))|(~(nil=X4)&nil=X3))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(127, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[4])).
% fof(128, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[127])).
% fof(129, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[128])).
% fof(130, 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)],[129])).
% cnf(131,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[130])).
% cnf(137,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[6])).
% 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)&?[X6]:(ssList(X6)&(((app(app(X5,X3),X6)=X4&equalelemsP(X3))&![X7]:(~(ssItem(X7))|![X8]:((~(ssList(X8))|~(app(X8,cons(X7,nil))=X5))|![X9]:(~(ssList(X9))|~(app(cons(X7,nil),X9)=X3)))))&![X10]:(~(ssItem(X10))|![X11]:((~(ssList(X11))|~(app(cons(X10,nil),X11)=X6))|![X12]:(~(ssList(X12))|~(app(X12,cons(X10,nil))=X3))))))))&~(neq(X1,nil)))&(nil=X4|~(nil=X3))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X13]:(ssList(X13)&?[X14]:(ssList(X14)&?[X15]:(ssList(X15)&?[X16]:(ssList(X16)&(((((X14=X16&X13=X15)&neq(X14,nil))&?[X17]:(ssList(X17)&?[X18]:(ssList(X18)&(((app(app(X17,X15),X18)=X16&equalelemsP(X15))&![X19]:(~(ssItem(X19))|![X20]:((~(ssList(X20))|~(app(X20,cons(X19,nil))=X17))|![X21]:(~(ssList(X21))|~(app(cons(X19,nil),X21)=X15)))))&![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(cons(X22,nil),X23)=X18))|![X24]:(~(ssList(X24))|~(app(X24,cons(X22,nil))=X15))))))))&~(neq(X13,nil)))&(nil=X16|~(nil=X15))))))),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))&(ssList(esk52_0)&(ssList(esk53_0)&(((app(app(esk52_0,esk50_0),esk53_0)=esk51_0&equalelemsP(esk50_0))&![X19]:(~(ssItem(X19))|![X20]:((~(ssList(X20))|~(app(X20,cons(X19,nil))=esk52_0))|![X21]:(~(ssList(X21))|~(app(cons(X19,nil),X21)=esk50_0)))))&![X22]:(~(ssItem(X22))|![X23]:((~(ssList(X23))|~(app(cons(X22,nil),X23)=esk53_0))|![X24]:(~(ssList(X24))|~(app(X24,cons(X22,nil))=esk50_0))))))))&~(neq(esk48_0,nil)))&(nil=esk51_0|~(nil=esk50_0))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X19]:![X20]:![X21]:![X22]:![X23]:![X24]:(((((((((((((~(ssList(X24))|~(app(X24,cons(X22,nil))=esk50_0))|(~(ssList(X23))|~(app(cons(X22,nil),X23)=esk53_0)))|~(ssItem(X22)))&((((~(ssList(X21))|~(app(cons(X19,nil),X21)=esk50_0))|(~(ssList(X20))|~(app(X20,cons(X19,nil))=esk52_0)))|~(ssItem(X19)))&(app(app(esk52_0,esk50_0),esk53_0)=esk51_0&equalelemsP(esk50_0))))&ssList(esk53_0))&ssList(esk52_0))&((esk49_0=esk51_0&esk48_0=esk50_0)&neq(esk49_0,nil)))&~(neq(esk48_0,nil)))&(nil=esk51_0|~(nil=esk50_0)))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% cnf(572,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[571])).
% cnf(576,negated_conjecture,(nil=esk51_0|nil!=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(577,negated_conjecture,(~neq(esk48_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(578,negated_conjecture,(neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[571])).
% cnf(579,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(580,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[571])).
% cnf(587,negated_conjecture,(~neq(esk50_0,nil)),inference(rw,[status(thm)],[577,579,theory(equality)])).
% cnf(588,negated_conjecture,(ssList(esk50_0)),inference(rw,[status(thm)],[572,579,theory(equality)])).
% cnf(592,negated_conjecture,(neq(esk51_0,nil)),inference(rw,[status(thm)],[578,580,theory(equality)])).
% cnf(675,negated_conjecture,(esk50_0=nil|~ssList(nil)|~ssList(esk50_0)),inference(spm,[status(thm)],[587,131,theory(equality)])).
% cnf(676,negated_conjecture,(esk50_0=nil|$false|~ssList(esk50_0)),inference(rw,[status(thm)],[675,137,theory(equality)])).
% cnf(677,negated_conjecture,(esk50_0=nil|$false|$false),inference(rw,[status(thm)],[676,588,theory(equality)])).
% cnf(678,negated_conjecture,(esk50_0=nil),inference(cn,[status(thm)],[677,theory(equality)])).
% cnf(1375,negated_conjecture,(~neq(nil,nil)),inference(rw,[status(thm)],[587,678,theory(equality)])).
% cnf(1378,negated_conjecture,(esk51_0=nil|$false),inference(rw,[status(thm)],[576,678,theory(equality)])).
% cnf(1379,negated_conjecture,(esk51_0=nil),inference(cn,[status(thm)],[1378,theory(equality)])).
% cnf(1381,negated_conjecture,(neq(nil,nil)),inference(rw,[status(thm)],[592,1379,theory(equality)])).
% cnf(1396,negated_conjecture,($false),inference(sr,[status(thm)],[1381,1375,theory(equality)])).
% cnf(1397,negated_conjecture,($false),1396,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 210
% # ...of these trivial : 2
% # ...subsumed : 1
% # ...remaining for further processing: 207
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 11
% # Generated clauses : 571
% # ...of the previous two non-trivial : 476
% # Contextual simplify-reflections : 2
% # Paramodulations : 480
% # Factorizations : 0
% # Equation resolutions : 91
% # Current number of processed clauses: 189
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 443
% # ...number of literals in the above : 3169
% # Clause-clause subsumption calls (NU) : 871
% # Rec. Clause-clause subsumption calls : 148
% # Unit Clause-clause subsumption calls : 21
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 227 leaves, 1.35+/-1.149 terms/leaf
% # Paramod-from index: 100 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 192 leaves, 1.24+/-0.992 terms/leaf
% # -------------------------------------------------
% # User time : 0.068 s
% # System time : 0.003 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP25973/SWC213+1.tptp
%
%------------------------------------------------------------------------------