↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM844+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:46:42 EST 2010

% Result   : Theorem 1.00s
% Output   : Solution 1.00s
% 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/SystemOnTPTP16083/NUM844+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP16083/NUM844+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16083/NUM844+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 16179
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(13, axiom,![X16]:![X17]:vplus(X17,X16)=vplus(X16,X17),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(15, axiom,![X20]:![X21]:![X22]:vplus(vplus(X20,X21),X22)=vplus(X20,vplus(X21,X22)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(24, axiom,![X31]:![X32]:(vplus(X31,vsucc(X32))=vsucc(vplus(X31,X32))&vplus(X31,v1)=vsucc(X31)),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))')).
% fof(54, 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(55, negated_conjecture,~(vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411)))=vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413))),inference(assume_negation,[status(cth)],[54])).
% fof(59, negated_conjecture,~(vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411)))=vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413))),inference(fof_simplification,[status(thm)],[55,theory(equality)])).
% fof(91, plain,![X18]:![X19]:vplus(X19,X18)=vplus(X18,X19),inference(variable_rename,[status(thm)],[13])).
% cnf(92,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[91])).
% fof(95, plain,![X23]:![X24]:![X25]:vplus(vplus(X23,X24),X25)=vplus(X23,vplus(X24,X25)),inference(variable_rename,[status(thm)],[15])).
% cnf(96,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[95])).
% fof(113, plain,![X33]:![X34]:(vplus(X33,vsucc(X34))=vsucc(vplus(X33,X34))&vplus(X33,v1)=vsucc(X33)),inference(variable_rename,[status(thm)],[24])).
% cnf(114,plain,(vplus(X1,v1)=vsucc(X1)),inference(split_conjunct,[status(thm)],[113])).
% cnf(211,negated_conjecture,(vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411)))!=vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413))),inference(split_conjunct,[status(thm)],[59])).
% cnf(228,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)],[211,114,theory(equality)]),114,theory(equality)]),['unfolding']).
% cnf(447,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)],[228,92,theory(equality)]),96,theory(equality)]),92,theory(equality)]),96,theory(equality)]),96,theory(equality)])).
% cnf(448,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)],[447,92,theory(equality)]),92,theory(equality)]),96,theory(equality)]),96,theory(equality)])).
% cnf(449,negated_conjecture,($false),inference(ar,[status(thm)],[448,92,96,theory(equality)])).
% cnf(450,negated_conjecture,($false),449,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 53
% # ...of these trivial                : 4
% # ...subsumed                        : 4
% # ...remaining for further processing: 45
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 196
% # ...of the previous two non-trivial : 172
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 176
% # Factorizations                     : 0
% # Equation resolutions               : 20
% # Current number of processed clauses: 38
% #    Positive orientable unit clauses: 6
% #    Positive unorientable unit clauses: 2
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 28
% # Current number of unprocessed clauses: 180
% # ...number of literals in the above : 384
% # Clause-clause subsumption calls (NU) : 30
% # Rec. Clause-clause subsumption calls : 30
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 14
% # Indexed BW rewrite successes       : 14
% # Backwards rewriting index:    33 leaves,   1.55+/-1.257 terms/leaf
% # Paramod-from index:           18 leaves,   1.06+/-0.229 terms/leaf
% # Paramod-into index:           27 leaves,   1.48+/-1.134 terms/leaf
% # -------------------------------------------------
% # User time              : 0.021 s
% # System time            : 0.004 s
% # Total time             : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP16083/NUM844+1.tptp
% 
%------------------------------------------------------------------------------