TSTP Solution File: NUM844+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM844+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 : 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 : Wed Dec 29 20:46:49 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/SystemOnTPTP29001/NUM844+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP29001/NUM844+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29001/NUM844+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 29097
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:vplus(X2,X1)=vplus(X1,X2),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(7, axiom,![X5]:![X6]:![X7]:vplus(vplus(X5,X6),X7)=vplus(X5,vplus(X6,X7)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(15, axiom,![X14]:![X15]:(vplus(X14,vsucc(X15))=vsucc(vplus(X14,X15))&vplus(X14,v1)=vsucc(X14)),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))')).
% fof(20, conjecture,vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411)))=vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),file('/tmp/SRASS.s.p', 'holds(266, 415, 3)')).
% fof(21, negated_conjecture,~(vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411)))=vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413))),inference(assume_negation,[status(cth)],[20])).
% fof(22, negated_conjecture,~(vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411)))=vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413))),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% fof(27, plain,![X3]:![X4]:vplus(X4,X3)=vplus(X3,X4),inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(31, plain,![X8]:![X9]:![X10]:vplus(vplus(X8,X9),X10)=vplus(X8,vplus(X9,X10)),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[31])).
% fof(46, plain,![X16]:![X17]:(vplus(X16,vsucc(X17))=vsucc(vplus(X16,X17))&vplus(X16,v1)=vsucc(X16)),inference(variable_rename,[status(thm)],[15])).
% cnf(47,plain,(vplus(X1,v1)=vsucc(X1)),inference(split_conjunct,[status(thm)],[46])).
% cnf(60,negated_conjecture,(vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411)))!=vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413))),inference(split_conjunct,[status(thm)],[22])).
% cnf(75,negated_conjecture,(vplus(vmul(vd411,vd413),vplus(vplus(vd411,v1),vd413))!=vplus(vmul(vd411,vd413),vplus(vd413,vplus(vd411,v1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[60,47,theory(equality)]),47,theory(equality)]),['unfolding']).
% cnf(125,negated_conjecture,(vplus(v1,vplus(vd411,vplus(vd413,vmul(vd411,vd413))))!=vplus(vmul(vd411,vd413),vplus(vd413,vplus(vd411,v1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[75,28,theory(equality)]),32,theory(equality)]),28,theory(equality)]),32,theory(equality)]),32,theory(equality)])).
% cnf(126,negated_conjecture,(vplus(v1,vplus(vd411,vplus(vd413,vmul(vd411,vd413))))!=vplus(vd413,vplus(v1,vplus(vd411,vmul(vd411,vd413))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[125,28,theory(equality)]),28,theory(equality)]),32,theory(equality)]),32,theory(equality)])).
% cnf(127,negated_conjecture,($false),inference(ar,[status(thm)],[126,28,32,theory(equality)])).
% cnf(128,negated_conjecture,($false),127,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 17
% # ...of these trivial : 4
% # ...subsumed : 1
% # ...remaining for further processing: 12
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 31
% # ...of the previous two non-trivial : 29
% # Contextual simplify-reflections : 0
% # Paramodulations : 30
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 11
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 1
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 32
% # ...number of literals in the above : 45
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 23 leaves, 1.13+/-0.448 terms/leaf
% # Paramod-from index: 9 leaves, 1.11+/-0.314 terms/leaf
% # Paramod-into index: 17 leaves, 1.12+/-0.322 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.003 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP29001/NUM844+2.tptp
%
%------------------------------------------------------------------------------