TSTP Solution File: NUM848+2 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM848+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 : art04.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:45 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/SystemOnTPTP20272/NUM848+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP20272/NUM848+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20272/NUM848+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 20368
% 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(1, axiom,vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),file('/tmp/SRASS.s.p', 'holds(286, 441, 3)')).
% fof(5, axiom,vmul(vd436,vplus(vd437,vd439))=vplus(vmul(vd436,vd437),vmul(vd436,vd439)),file('/tmp/SRASS.s.p', 'holds(285, 440, 0)')).
% fof(7, axiom,![X1]:![X2]:vplus(X2,X1)=vplus(X1,X2),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(9, 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(11, axiom,![X8]:![X9]:(vmul(X8,vsucc(X9))=vplus(vmul(X8,X9),X8)&vmul(X8,v1)=X8),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,![X11]:![X12]:(vplus(X11,vsucc(X12))=vsucc(vplus(X11,X12))&vplus(X11,v1)=vsucc(X11)),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))')).
% fof(16, conjecture,vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))=vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),file('/tmp/SRASS.s.p', 'holds(286, 441, 4)')).
% fof(17, negated_conjecture,~(vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))=vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439)))),inference(assume_negation,[status(cth)],[16])).
% fof(18, negated_conjecture,~(vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))=vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439)))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% cnf(19,plain,(vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))),inference(split_conjunct,[status(thm)],[1])).
% cnf(23,plain,(vmul(vd436,vplus(vd437,vd439))=vplus(vmul(vd436,vd437),vmul(vd436,vd439))),inference(split_conjunct,[status(thm)],[5])).
% fof(25, plain,![X3]:![X4]:vplus(X4,X3)=vplus(X3,X4),inference(variable_rename,[status(thm)],[7])).
% cnf(26,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(29, plain,![X8]:![X9]:![X10]:vplus(vplus(X8,X9),X10)=vplus(X8,vplus(X9,X10)),inference(variable_rename,[status(thm)],[9])).
% cnf(30,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[29])).
% fof(32, plain,![X10]:![X11]:(vmul(X10,vsucc(X11))=vplus(vmul(X10,X11),X10)&vmul(X10,v1)=X10),inference(variable_rename,[status(thm)],[11])).
% cnf(34,plain,(vmul(X1,vsucc(X2))=vplus(vmul(X1,X2),X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(37, plain,![X13]:![X14]:(vplus(X13,vsucc(X14))=vsucc(vplus(X13,X14))&vplus(X13,v1)=vsucc(X13)),inference(variable_rename,[status(thm)],[13])).
% cnf(38,plain,(vplus(X1,v1)=vsucc(X1)),inference(split_conjunct,[status(thm)],[37])).
% cnf(46,negated_conjecture,(vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))!=vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439)))),inference(split_conjunct,[status(thm)],[18])).
% cnf(50,plain,(vplus(vmul(X1,X2),X1)=vmul(X1,vplus(X2,v1))),inference(rw,[status(thm)],[34,38,theory(equality)]),['unfolding']).
% cnf(55,negated_conjecture,(vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))!=vplus(vmul(vd436,vd437),vmul(vd436,vplus(vd439,v1)))),inference(rw,[status(thm)],[46,38,theory(equality)]),['unfolding']).
% cnf(57,plain,(vplus(X1,vplus(X2,X3))=vplus(X3,vplus(X1,X2))),inference(spm,[status(thm)],[26,30,theory(equality)])).
% cnf(69,plain,(vmul(X1,vplus(X2,v1))=vplus(X1,vmul(X1,X2))),inference(rw,[status(thm)],[50,26,theory(equality)])).
% cnf(75,plain,(vmul(X1,vplus(v1,X2))=vplus(X1,vmul(X1,X2))),inference(spm,[status(thm)],[69,26,theory(equality)])).
% cnf(87,negated_conjecture,(vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439)))!=vplus(vmul(vd436,vd437),vmul(vd436,vplus(vd439,v1)))),inference(rw,[status(thm)],[55,26,theory(equality)])).
% cnf(88,negated_conjecture,(vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439)))!=vplus(vmul(vd436,vd437),vmul(vd436,vplus(v1,vd439)))),inference(rw,[status(thm)],[87,26,theory(equality)])).
% cnf(95,plain,(vplus(vd436,vmul(vd436,vplus(vd437,vd439)))=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[19,23,theory(equality)]),26,theory(equality)])).
% cnf(96,plain,(vplus(vd436,vmul(vd436,vplus(vd437,vd439)))=vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439)))),inference(rw,[status(thm)],[95,26,theory(equality)])).
% cnf(98,negated_conjecture,(vplus(vmul(vd436,vd437),vmul(vd436,vplus(v1,vd439)))!=vplus(vd436,vmul(vd436,vplus(vd437,vd439)))),inference(rw,[status(thm)],[88,96,theory(equality)])).
% cnf(634,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[98,75,theory(equality)]),57,theory(equality)]),26,theory(equality)]),23,theory(equality)])).
% cnf(635,negated_conjecture,($false),inference(cn,[status(thm)],[634,theory(equality)])).
% cnf(636,negated_conjecture,($false),635,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 66
% # ...of these trivial                : 5
% # ...subsumed                        : 37
% # ...remaining for further processing: 24
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 6
% # Generated clauses                  : 404
% # ...of the previous two non-trivial : 355
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 404
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 18
% #    Positive orientable unit clauses: 4
% #    Positive unorientable unit clauses: 10
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 4
% # Current number of unprocessed clauses: 305
% # ...number of literals in the above : 354
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 20
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 59
% # Indexed BW rewrite successes       : 34
% # Backwards rewriting index:    41 leaves,   1.24+/-0.790 terms/leaf
% # Paramod-from index:           16 leaves,   1.44+/-0.864 terms/leaf
% # Paramod-into index:           36 leaves,   1.28+/-0.837 terms/leaf
% # -------------------------------------------------
% # User time              : 0.016 s
% # System time            : 0.005 s
% # Total time             : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.17 WC
% FINAL PrfWatch: 0.12 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP20272/NUM848+2.tptp
% 
%------------------------------------------------------------------------------