TSTP Solution File: NUM845+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM845+2 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:06 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP19555/NUM845+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19555/NUM845+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19555/NUM845+2.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 19651
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,![X1]:(vmul(vsucc(vd411),X1)=vplus(vmul(vd411,X1),X1)=>vmul(vsucc(vd411),vsucc(X1))=vplus(vmul(vsucc(vd411),X1),vsucc(vd411))),file('/tmp/SRASS.s.p', 'ass(cond(conseq(263), 1), 7)')).
% fof(11, axiom,![X3]:![X4]:(vplus(X3,vsucc(X4))=vsucc(vplus(X3,X4))&vplus(X3,v1)=vsucc(X3)),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))')).
% fof(12, axiom,![X5]:![X6]:(vmul(X5,vsucc(X6))=vplus(vmul(X5,X6),X5)&vmul(X5,v1)=X5),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))')).
% fof(13, axiom,![X7]:![X8]:vplus(X8,X7)=vplus(X7,X8),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(14, axiom,![X9]:![X10]:![X11]:vplus(vplus(X9,X10),X11)=vplus(X9,vplus(X10,X11)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(15, conjecture,![X12]:(vmul(vsucc(vd411),X12)=vplus(vmul(vd411,X12),X12)=>vmul(vsucc(vd411),vsucc(X12))=vplus(vmul(vd411,vsucc(X12)),vsucc(X12))),file('/tmp/SRASS.s.p', 'qu(ind(267), imp(267))')).
% fof(16, negated_conjecture,~(![X12]:(vmul(vsucc(vd411),X12)=vplus(vmul(vd411,X12),X12)=>vmul(vsucc(vd411),vsucc(X12))=vplus(vmul(vd411,vsucc(X12)),vsucc(X12)))),inference(assume_negation,[status(cth)],[15])).
% fof(38, plain,![X1]:(~(vmul(vsucc(vd411),X1)=vplus(vmul(vd411,X1),X1))|vmul(vsucc(vd411),vsucc(X1))=vplus(vmul(vsucc(vd411),X1),vsucc(vd411))),inference(fof_nnf,[status(thm)],[8])).
% fof(39, plain,![X2]:(~(vmul(vsucc(vd411),X2)=vplus(vmul(vd411,X2),X2))|vmul(vsucc(vd411),vsucc(X2))=vplus(vmul(vsucc(vd411),X2),vsucc(vd411))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(vmul(vsucc(vd411),vsucc(X1))=vplus(vmul(vsucc(vd411),X1),vsucc(vd411))|vmul(vsucc(vd411),X1)!=vplus(vmul(vd411,X1),X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(44, plain,![X5]:![X6]:(vplus(X5,vsucc(X6))=vsucc(vplus(X5,X6))&vplus(X5,v1)=vsucc(X5)),inference(variable_rename,[status(thm)],[11])).
% cnf(45,plain,(vplus(X1,v1)=vsucc(X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(47, plain,![X7]:![X8]:(vmul(X7,vsucc(X8))=vplus(vmul(X7,X8),X7)&vmul(X7,v1)=X7),inference(variable_rename,[status(thm)],[12])).
% cnf(49,plain,(vmul(X1,vsucc(X2))=vplus(vmul(X1,X2),X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(50, plain,![X9]:![X10]:vplus(X10,X9)=vplus(X9,X10),inference(variable_rename,[status(thm)],[13])).
% cnf(51,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X12]:![X13]:![X14]:vplus(vplus(X12,X13),X14)=vplus(X12,vplus(X13,X14)),inference(variable_rename,[status(thm)],[14])).
% cnf(53,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[52])).
% fof(54, negated_conjecture,?[X12]:(vmul(vsucc(vd411),X12)=vplus(vmul(vd411,X12),X12)&~(vmul(vsucc(vd411),vsucc(X12))=vplus(vmul(vd411,vsucc(X12)),vsucc(X12)))),inference(fof_nnf,[status(thm)],[16])).
% fof(55, negated_conjecture,?[X13]:(vmul(vsucc(vd411),X13)=vplus(vmul(vd411,X13),X13)&~(vmul(vsucc(vd411),vsucc(X13))=vplus(vmul(vd411,vsucc(X13)),vsucc(X13)))),inference(variable_rename,[status(thm)],[54])).
% fof(56, negated_conjecture,(vmul(vsucc(vd411),esk1_0)=vplus(vmul(vd411,esk1_0),esk1_0)&~(vmul(vsucc(vd411),vsucc(esk1_0))=vplus(vmul(vd411,vsucc(esk1_0)),vsucc(esk1_0)))),inference(skolemize,[status(esa)],[55])).
% cnf(57,negated_conjecture,(vmul(vsucc(vd411),vsucc(esk1_0))!=vplus(vmul(vd411,vsucc(esk1_0)),vsucc(esk1_0))),inference(split_conjunct,[status(thm)],[56])).
% cnf(58,negated_conjecture,(vmul(vsucc(vd411),esk1_0)=vplus(vmul(vd411,esk1_0),esk1_0)),inference(split_conjunct,[status(thm)],[56])).
% cnf(61,plain,(vplus(vmul(X1,X2),X1)=vmul(X1,vplus(X2,v1))),inference(rw,[status(thm)],[49,45,theory(equality)]),['unfolding']).
% cnf(63,negated_conjecture,(vplus(vmul(vd411,esk1_0),esk1_0)=vmul(vplus(vd411,v1),esk1_0)),inference(rw,[status(thm)],[58,45,theory(equality)]),['unfolding']).
% cnf(64,plain,(vplus(vmul(vplus(vd411,v1),X1),vplus(vd411,v1))=vmul(vplus(vd411,v1),vplus(X1,v1))|vplus(vmul(vd411,X1),X1)!=vmul(vplus(vd411,v1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[40,45,theory(equality)]),45,theory(equality)]),45,theory(equality)]),45,theory(equality)]),45,theory(equality)]),['unfolding']).
% cnf(71,negated_conjecture,(vplus(vmul(vd411,vplus(esk1_0,v1)),vplus(esk1_0,v1))!=vmul(vplus(vd411,v1),vplus(esk1_0,v1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[57,45,theory(equality)]),45,theory(equality)]),45,theory(equality)]),45,theory(equality)]),['unfolding']).
% cnf(72,negated_conjecture,(vplus(esk1_0,vmul(vd411,esk1_0))=vmul(vplus(vd411,v1),esk1_0)),inference(rw,[status(thm)],[63,51,theory(equality)])).
% cnf(74,plain,(vmul(X1,vplus(X2,v1))=vplus(X1,vmul(X1,X2))),inference(rw,[status(thm)],[61,51,theory(equality)])).
% cnf(75,negated_conjecture,(vplus(v1,vplus(esk1_0,vmul(vd411,vplus(v1,esk1_0))))!=vmul(vplus(vd411,v1),vplus(esk1_0,v1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[71,51,theory(equality)]),51,theory(equality)]),51,theory(equality)]),53,theory(equality)])).
% cnf(76,negated_conjecture,(vplus(v1,vplus(esk1_0,vmul(vd411,vplus(v1,esk1_0))))!=vmul(vplus(vd411,v1),vplus(v1,esk1_0))),inference(rw,[status(thm)],[75,51,theory(equality)])).
% cnf(77,plain,(vplus(vd411,vplus(v1,vmul(vplus(vd411,v1),X1)))=vmul(vplus(vd411,v1),vplus(X1,v1))|vmul(vplus(vd411,v1),X1)!=vplus(vmul(vd411,X1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[64,51,theory(equality)]),53,theory(equality)])).
% cnf(78,plain,(vplus(vd411,vplus(v1,vmul(vplus(vd411,v1),X1)))=vmul(vplus(vd411,v1),vplus(X1,v1))|vmul(vplus(vd411,v1),X1)!=vplus(X1,vmul(vd411,X1))),inference(rw,[status(thm)],[77,51,theory(equality)])).
% cnf(97,plain,(vplus(X1,vplus(X2,X3))=vplus(X3,vplus(X1,X2))),inference(spm,[status(thm)],[51,53,theory(equality)])).
% cnf(112,plain,(vmul(X1,vplus(v1,X2))=vplus(X1,vmul(X1,X2))),inference(spm,[status(thm)],[74,51,theory(equality)])).
% cnf(120,negated_conjecture,(vplus(vd411,vplus(v1,vplus(esk1_0,vmul(vd411,esk1_0))))=vmul(vplus(vd411,v1),vplus(esk1_0,v1))),inference(spm,[status(thm)],[78,72,theory(equality)])).
% cnf(126,negated_conjecture,(vplus(vd411,vplus(v1,vplus(esk1_0,vmul(vd411,esk1_0))))=vmul(vplus(vd411,v1),vplus(v1,esk1_0))),inference(rw,[status(thm)],[120,51,theory(equality)])).
% cnf(229,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[76,112,theory(equality)]),97,theory(equality)]),51,theory(equality)]),97,theory(equality)]),53,theory(equality)]),51,theory(equality)]),97,theory(equality)]),51,theory(equality)]),126,theory(equality)])).
% cnf(230,negated_conjecture,($false),inference(cn,[status(thm)],[229,theory(equality)])).
% cnf(231,negated_conjecture,($false),230,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 33
% # ...of these trivial : 8
% # ...subsumed : 4
% # ...remaining for further processing: 21
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 2
% # Generated clauses : 81
% # ...of the previous two non-trivial : 53
% # Contextual simplify-reflections : 0
% # Paramodulations : 81
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 11
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 0
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 41
% # ...number of literals in the above : 43
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 49
% # Indexed BW rewrite successes : 21
% # Backwards rewriting index: 32 leaves, 1.22+/-0.599 terms/leaf
% # Paramod-from index: 11 leaves, 1.27+/-0.617 terms/leaf
% # Paramod-into index: 26 leaves, 1.15+/-0.601 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.001 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.16 WC
% FINAL PrfWatch: 0.10 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP19555/NUM845+2.tptp
%
%------------------------------------------------------------------------------