TSTP Solution File: SWC317+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC317+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 : art09.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:46:54 EST 2010
% Result : Theorem 1.24s
% Output : Solution 1.24s
% 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/SystemOnTPTP12572/SWC317+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12572/SWC317+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12572/SWC317+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 12668
% 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(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)&app(cons(X5,nil),X6)=X1)&app(X6,cons(X5,nil))=X2)))|![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>(~(app(cons(X7,nil),X8)=X3)|~(app(X8,cons(X7,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)&app(cons(X5,nil),X6)=X1)&app(X6,cons(X5,nil))=X2)))|![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>(~(app(cons(X7,nil),X8)=X3)|~(app(X8,cons(X7,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)&app(cons(X5,nil),X6)=X1)&app(X6,cons(X5,nil))=X2)))|![X7]:(ssItem(X7)=>![X8]:(ssList(X8)=>(~(app(cons(X7,nil),X8)=X3)|~(app(X8,cons(X7,nil))=X4)))))&(~(neq(X2,nil))|neq(X4,nil))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% 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))|~(app(cons(X5,nil),X6)=X1))|~(app(X6,cons(X5,nil))=X2))))&?[X7]:(ssItem(X7)&?[X8]:(ssList(X8)&(app(cons(X7,nil),X8)=X3&app(X8,cons(X7,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))|~(app(cons(X13,nil),X14)=X9))|~(app(X14,cons(X13,nil))=X10))))&?[X15]:(ssItem(X15)&?[X16]:(ssList(X16)&(app(cons(X15,nil),X16)=X11&app(X16,cons(X15,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))|~(app(cons(X13,nil),X14)=esk48_0))|~(app(X14,cons(X13,nil))=esk49_0))))&(ssItem(esk52_0)&(ssList(esk53_0)&(app(cons(esk52_0,nil),esk53_0)=esk50_0&app(esk53_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]:(((((((((((~(ssList(X14))|~(app(cons(X13,nil),X14)=esk48_0))|~(app(X14,cons(X13,nil))=esk49_0))|~(ssItem(X13)))&neq(esk49_0,nil))&(ssItem(esk52_0)&(ssList(esk53_0)&(app(cons(esk52_0,nil),esk53_0)=esk50_0&app(esk53_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]:(((((((((neq(esk49_0,nil)|(((~(ssList(X14))|~(app(cons(X13,nil),X14)=esk48_0))|~(app(X14,cons(X13,nil))=esk49_0))|~(ssItem(X13))))&(~(neq(esk51_0,nil))|(((~(ssList(X14))|~(app(cons(X13,nil),X14)=esk48_0))|~(app(X14,cons(X13,nil))=esk49_0))|~(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)|ssList(esk53_0))&(~(neq(esk51_0,nil))|ssList(esk53_0)))&(((neq(esk49_0,nil)|app(cons(esk52_0,nil),esk53_0)=esk50_0)&(~(neq(esk51_0,nil))|app(cons(esk52_0,nil),esk53_0)=esk50_0))&((neq(esk49_0,nil)|app(esk53_0,cons(esk52_0,nil))=esk51_0)&(~(neq(esk51_0,nil))|app(esk53_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(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(esk53_0,cons(esk52_0,nil))=esk51_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(581,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk50_0|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(583,negated_conjecture,(ssList(esk53_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(585,negated_conjecture,(ssItem(esk52_0)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(588,negated_conjecture,(neq(esk49_0,nil)|neq(esk49_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(589,negated_conjecture,(~ssItem(X1)|app(X2,cons(X1,nil))!=esk49_0|app(cons(X1,nil),X2)!=esk48_0|~ssList(X2)|~neq(esk51_0,nil)),inference(split_conjunct,[status(thm)],[572])).
% cnf(593,negated_conjecture,(ssItem(esk52_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[585,578,theory(equality)]),588,theory(equality)])).
% cnf(594,negated_conjecture,(ssItem(esk52_0)),inference(cn,[status(thm)],[593,theory(equality)])).
% cnf(595,negated_conjecture,(ssList(esk53_0)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[583,578,theory(equality)]),588,theory(equality)])).
% cnf(596,negated_conjecture,(ssList(esk53_0)),inference(cn,[status(thm)],[595,theory(equality)])).
% cnf(606,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk49_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[579,578,theory(equality)])).
% cnf(607,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk49_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[606,578,theory(equality)]),588,theory(equality)])).
% cnf(608,negated_conjecture,(app(esk53_0,cons(esk52_0,nil))=esk49_0),inference(cn,[status(thm)],[607,theory(equality)])).
% cnf(609,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk48_0|~neq(esk51_0,nil)),inference(rw,[status(thm)],[581,577,theory(equality)])).
% cnf(610,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk48_0|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[609,578,theory(equality)]),588,theory(equality)])).
% cnf(611,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)=esk48_0),inference(cn,[status(thm)],[610,theory(equality)])).
% cnf(664,negated_conjecture,(app(X2,cons(X1,nil))!=esk49_0|app(cons(X1,nil),X2)!=esk48_0|~ssItem(X1)|~ssList(X2)|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[589,578,theory(equality)]),588,theory(equality)])).
% cnf(665,negated_conjecture,(app(X2,cons(X1,nil))!=esk49_0|app(cons(X1,nil),X2)!=esk48_0|~ssItem(X1)|~ssList(X2)),inference(cn,[status(thm)],[664,theory(equality)])).
% cnf(666,negated_conjecture,(app(cons(esk52_0,nil),esk53_0)!=esk48_0|~ssList(esk53_0)|~ssItem(esk52_0)),inference(spm,[status(thm)],[665,608,theory(equality)])).
% cnf(668,negated_conjecture,($false|~ssList(esk53_0)|~ssItem(esk52_0)),inference(rw,[status(thm)],[666,611,theory(equality)])).
% cnf(669,negated_conjecture,($false|$false|~ssItem(esk52_0)),inference(rw,[status(thm)],[668,596,theory(equality)])).
% cnf(670,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[669,594,theory(equality)])).
% cnf(671,negated_conjecture,($false),inference(cn,[status(thm)],[670,theory(equality)])).
% cnf(672,negated_conjecture,($false),671,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 73
% # ...of these trivial : 7
% # ...subsumed : 0
% # ...remaining for further processing: 66
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 20
% # ...of the previous two non-trivial : 12
% # Contextual simplify-reflections : 0
% # Paramodulations : 14
% # Factorizations : 0
% # Equation resolutions : 6
% # Current number of processed clauses: 63
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 42
% # Current number of unprocessed clauses: 145
% # ...number of literals in the above : 607
% # Clause-clause subsumption calls (NU) : 47
% # Rec. Clause-clause subsumption calls : 31
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 78 leaves, 1.05+/-0.221 terms/leaf
% # Paramod-from index: 48 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 71 leaves, 1.03+/-0.165 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.006 s
% # Total time : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP12572/SWC317+1.tptp
%
%------------------------------------------------------------------------------