%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM845+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 : Wed Dec 29 20:47:00 EST 2010
% Result : Theorem 1.20s
% Output : Solution 1.20s
% 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/SystemOnTPTP16342/NUM845+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16342/NUM845+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16342/NUM845+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 16438
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(17, axiom,![X17]:![X18]:vplus(X18,X17)=vplus(X17,X18),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(19, axiom,![X21]:![X22]:![X23]:vplus(vplus(X21,X22),X23)=vplus(X21,vplus(X22,X23)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(26, axiom,![X29]:![X30]:(vmul(X29,vsucc(X30))=vplus(vmul(X29,X30),X29)&vmul(X29,v1)=X29),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))')).
% fof(27, axiom,![X31]:vplus(v1,X31)=vsucc(X31),file('/tmp/SRASS.s.p', 'ass(cond(43, 0), 0)')).
% fof(28, axiom,![X32]:![X33]:(vplus(X32,vsucc(X33))=vsucc(vplus(X32,X33))&vplus(X32,v1)=vsucc(X32)),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))')).
% fof(58, conjecture,![X85]:(vmul(vsucc(vd411),X85)=vplus(vmul(vd411,X85),X85)=>vmul(vsucc(vd411),vsucc(X85))=vplus(vmul(vd411,vsucc(X85)),vsucc(X85))),file('/tmp/SRASS.s.p', 'qu(ind(267), imp(267))')).
% fof(59, negated_conjecture,~(![X85]:(vmul(vsucc(vd411),X85)=vplus(vmul(vd411,X85),X85)=>vmul(vsucc(vd411),vsucc(X85))=vplus(vmul(vd411,vsucc(X85)),vsucc(X85)))),inference(assume_negation,[status(cth)],[58])).
% fof(114, plain,![X19]:![X20]:vplus(X20,X19)=vplus(X19,X20),inference(variable_rename,[status(thm)],[17])).
% cnf(115,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[114])).
% fof(118, plain,![X24]:![X25]:![X26]:vplus(vplus(X24,X25),X26)=vplus(X24,vplus(X25,X26)),inference(variable_rename,[status(thm)],[19])).
% cnf(119,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[118])).
% fof(131, plain,![X31]:![X32]:(vmul(X31,vsucc(X32))=vplus(vmul(X31,X32),X31)&vmul(X31,v1)=X31),inference(variable_rename,[status(thm)],[26])).
% cnf(133,plain,(vmul(X1,vsucc(X2))=vplus(vmul(X1,X2),X1)),inference(split_conjunct,[status(thm)],[131])).
% fof(134, plain,![X32]:vplus(v1,X32)=vsucc(X32),inference(variable_rename,[status(thm)],[27])).
% cnf(135,plain,(vplus(v1,X1)=vsucc(X1)),inference(split_conjunct,[status(thm)],[134])).
% fof(136, plain,![X34]:![X35]:(vplus(X34,vsucc(X35))=vsucc(vplus(X34,X35))&vplus(X34,v1)=vsucc(X34)),inference(variable_rename,[status(thm)],[28])).
% cnf(137,plain,(vplus(X1,v1)=vsucc(X1)),inference(split_conjunct,[status(thm)],[136])).
% fof(234, negated_conjecture,?[X85]:(vmul(vsucc(vd411),X85)=vplus(vmul(vd411,X85),X85)&~(vmul(vsucc(vd411),vsucc(X85))=vplus(vmul(vd411,vsucc(X85)),vsucc(X85)))),inference(fof_nnf,[status(thm)],[59])).
% fof(235, negated_conjecture,?[X86]:(vmul(vsucc(vd411),X86)=vplus(vmul(vd411,X86),X86)&~(vmul(vsucc(vd411),vsucc(X86))=vplus(vmul(vd411,vsucc(X86)),vsucc(X86)))),inference(variable_rename,[status(thm)],[234])).
% fof(236, negated_conjecture,(vmul(vsucc(vd411),esk5_0)=vplus(vmul(vd411,esk5_0),esk5_0)&~(vmul(vsucc(vd411),vsucc(esk5_0))=vplus(vmul(vd411,vsucc(esk5_0)),vsucc(esk5_0)))),inference(skolemize,[status(esa)],[235])).
% cnf(237,negated_conjecture,(vmul(vsucc(vd411),vsucc(esk5_0))!=vplus(vmul(vd411,vsucc(esk5_0)),vsucc(esk5_0))),inference(split_conjunct,[status(thm)],[236])).
% cnf(238,negated_conjecture,(vmul(vsucc(vd411),esk5_0)=vplus(vmul(vd411,esk5_0),esk5_0)),inference(split_conjunct,[status(thm)],[236])).
% cnf(239,plain,(vplus(v1,X1)=vplus(X1,v1)),inference(rw,[status(thm)],[135,137,theory(equality)]),['unfolding']).
% cnf(244,plain,(vplus(vmul(X1,X2),X1)=vmul(X1,vplus(X2,v1))),inference(rw,[status(thm)],[133,137,theory(equality)]),['unfolding']).
% cnf(246,negated_conjecture,(vplus(vmul(vd411,esk5_0),esk5_0)=vmul(vplus(vd411,v1),esk5_0)),inference(rw,[status(thm)],[238,137,theory(equality)]),['unfolding']).
% cnf(259,negated_conjecture,(vplus(vmul(vd411,vplus(esk5_0,v1)),vplus(esk5_0,v1))!=vmul(vplus(vd411,v1),vplus(esk5_0,v1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[237,137,theory(equality)]),137,theory(equality)]),137,theory(equality)]),137,theory(equality)]),['unfolding']).
% cnf(299,negated_conjecture,(vplus(vmul(vd411,vplus(v1,esk5_0)),vplus(v1,esk5_0))!=vmul(vplus(vd411,v1),vplus(esk5_0,v1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[259,239,theory(equality)]),239,theory(equality)])).
% cnf(300,negated_conjecture,(vplus(vmul(vd411,vplus(v1,esk5_0)),vplus(v1,esk5_0))!=vmul(vplus(v1,vd411),vplus(v1,esk5_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[299,239,theory(equality)]),239,theory(equality)])).
% cnf(315,negated_conjecture,(vmul(vplus(v1,vd411),esk5_0)=vplus(vmul(vd411,esk5_0),esk5_0)),inference(rw,[status(thm)],[246,239,theory(equality)])).
% cnf(316,negated_conjecture,(vmul(vplus(v1,vd411),esk5_0)=vplus(esk5_0,vmul(vd411,esk5_0))),inference(rw,[status(thm)],[315,115,theory(equality)])).
% cnf(322,plain,(vplus(X1,vplus(X2,X3))=vplus(X2,vplus(X3,X1))),inference(spm,[status(thm)],[115,119,theory(equality)])).
% cnf(385,plain,(vmul(X1,vplus(X2,v1))=vplus(X1,vmul(X1,X2))),inference(rw,[status(thm)],[244,115,theory(equality)])).
% cnf(403,negated_conjecture,(vmul(vplus(v1,vd411),vplus(esk5_0,v1))=vplus(vplus(v1,vd411),vplus(esk5_0,vmul(vd411,esk5_0)))),inference(spm,[status(thm)],[385,316,theory(equality)])).
% cnf(406,plain,(vmul(X1,vplus(v1,X2))=vplus(X1,vmul(X1,X2))),inference(spm,[status(thm)],[385,115,theory(equality)])).
% cnf(410,negated_conjecture,(vmul(vplus(v1,vd411),vplus(v1,esk5_0))=vplus(vplus(v1,vd411),vplus(esk5_0,vmul(vd411,esk5_0)))),inference(rw,[status(thm)],[403,239,theory(equality)])).
% cnf(411,negated_conjecture,(vmul(vplus(v1,vd411),vplus(v1,esk5_0))=vplus(v1,vplus(vd411,vplus(esk5_0,vmul(vd411,esk5_0))))),inference(rw,[status(thm)],[410,119,theory(equality)])).
% cnf(1052,negated_conjecture,(vplus(v1,vplus(esk5_0,vmul(vd411,vplus(v1,esk5_0))))!=vmul(vplus(v1,vd411),vplus(v1,esk5_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[300,115,theory(equality)]),119,theory(equality)])).
% cnf(6894,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1052,406,theory(equality)]),322,theory(equality)]),115,theory(equality)]),411,theory(equality)])).
% cnf(6895,negated_conjecture,($false),inference(cn,[status(thm)],[6894,theory(equality)])).
% cnf(6896,negated_conjecture,($false),6895,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1326
% # ...of these trivial : 33
% # ...subsumed : 991
% # ...remaining for further processing: 302
% # Other redundant clauses eliminated : 46
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 15
% # Backward-rewritten : 9
% # Generated clauses : 5588
% # ...of the previous two non-trivial : 5021
% # Contextual simplify-reflections : 7
% # Paramodulations : 5505
% # Factorizations : 2
% # Equation resolutions : 81
% # Current number of processed clauses: 272
% # Positive orientable unit clauses: 35
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 85
% # Non-unit-clauses : 143
% # Current number of unprocessed clauses: 3608
% # ...number of literals in the above : 6709
% # Clause-clause subsumption calls (NU) : 3723
% # Rec. Clause-clause subsumption calls : 3717
% # Unit Clause-clause subsumption calls : 696
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 240
% # Indexed BW rewrite successes : 102
% # Backwards rewriting index: 139 leaves, 1.75+/-1.636 terms/leaf
% # Paramod-from index: 48 leaves, 1.29+/-0.538 terms/leaf
% # Paramod-into index: 132 leaves, 1.73+/-1.614 terms/leaf
% # -------------------------------------------------
% # User time : 0.159 s
% # System time : 0.006 s
% # Total time : 0.165 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.32 CPU 0.41 WC
% FINAL PrfWatch: 0.32 CPU 0.41 WC
% SZS output end Solution for /tmp/SystemOnTPTP16342/NUM845+1.tptp
%
%------------------------------------------------------------------------------