TSTP Solution File: NUM849+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM849+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 : art03.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:51 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/SystemOnTPTP21852/NUM849+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21852/NUM849+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21852/NUM849+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 21948
% 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(1, axiom,![X1]:![X2]:vmul(X1,X2)=vmul(X2,X1),file('/tmp/SRASS.s.p', 'ass(cond(270, 0), 0)')).
% fof(9, axiom,![X9]:![X10]:vmul(vsucc(X9),X10)=vplus(vmul(X9,X10),X10),file('/tmp/SRASS.s.p', 'ass(cond(261, 0), 0)')).
% fof(12, axiom,![X11]:![X12]:![X13]:vmul(X11,vplus(X12,X13))=vplus(vmul(X11,X12),vmul(X11,X13)),file('/tmp/SRASS.s.p', 'ass(cond(281, 0), 0)')).
% fof(14, axiom,![X16]:![X17]:(vmul(X16,vsucc(X17))=vplus(vmul(X16,X17),X16)&vmul(X16,v1)=X16),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))')).
% fof(25, axiom,![X35]:![X36]:vplus(X36,X35)=vplus(X35,X36),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(27, axiom,![X40]:vplus(v1,X40)=vsucc(X40),file('/tmp/SRASS.s.p', 'ass(cond(43, 0), 0)')).
% fof(28, axiom,![X41]:![X42]:(vplus(X41,vsucc(X42))=vsucc(vplus(X41,X42))&vplus(X41,v1)=vsucc(X41)),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))')).
% fof(56, conjecture,![X92]:(vmul(vmul(vd448,vd449),X92)=vmul(vd448,vmul(vd449,X92))=>vmul(vmul(vd448,vd449),vsucc(X92))=vmul(vd448,vmul(vd449,vsucc(X92)))),file('/tmp/SRASS.s.p', 'qu(ind(296), imp(296))')).
% fof(57, negated_conjecture,~(![X92]:(vmul(vmul(vd448,vd449),X92)=vmul(vd448,vmul(vd449,X92))=>vmul(vmul(vd448,vd449),vsucc(X92))=vmul(vd448,vmul(vd449,vsucc(X92))))),inference(assume_negation,[status(cth)],[56])).
% fof(61, plain,![X3]:![X4]:vmul(X3,X4)=vmul(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(62,plain,(vmul(X1,X2)=vmul(X2,X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(83, plain,![X11]:![X12]:vmul(vsucc(X11),X12)=vplus(vmul(X11,X12),X12),inference(variable_rename,[status(thm)],[9])).
% cnf(84,plain,(vmul(vsucc(X1),X2)=vplus(vmul(X1,X2),X2)),inference(split_conjunct,[status(thm)],[83])).
% fof(87, plain,![X14]:![X15]:![X16]:vmul(X14,vplus(X15,X16))=vplus(vmul(X14,X15),vmul(X14,X16)),inference(variable_rename,[status(thm)],[12])).
% cnf(88,plain,(vmul(X1,vplus(X2,X3))=vplus(vmul(X1,X2),vmul(X1,X3))),inference(split_conjunct,[status(thm)],[87])).
% fof(91, plain,![X18]:![X19]:(vmul(X18,vsucc(X19))=vplus(vmul(X18,X19),X18)&vmul(X18,v1)=X18),inference(variable_rename,[status(thm)],[14])).
% cnf(92,plain,(vmul(X1,v1)=X1),inference(split_conjunct,[status(thm)],[91])).
% fof(125, plain,![X37]:![X38]:vplus(X38,X37)=vplus(X37,X38),inference(variable_rename,[status(thm)],[25])).
% cnf(126,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[125])).
% fof(129, plain,![X41]:vplus(v1,X41)=vsucc(X41),inference(variable_rename,[status(thm)],[27])).
% cnf(130,plain,(vplus(v1,X1)=vsucc(X1)),inference(split_conjunct,[status(thm)],[129])).
% fof(131, plain,![X43]:![X44]:(vplus(X43,vsucc(X44))=vsucc(vplus(X43,X44))&vplus(X43,v1)=vsucc(X43)),inference(variable_rename,[status(thm)],[28])).
% cnf(132,plain,(vplus(X1,v1)=vsucc(X1)),inference(split_conjunct,[status(thm)],[131])).
% fof(225, negated_conjecture,?[X92]:(vmul(vmul(vd448,vd449),X92)=vmul(vd448,vmul(vd449,X92))&~(vmul(vmul(vd448,vd449),vsucc(X92))=vmul(vd448,vmul(vd449,vsucc(X92))))),inference(fof_nnf,[status(thm)],[57])).
% fof(226, negated_conjecture,?[X93]:(vmul(vmul(vd448,vd449),X93)=vmul(vd448,vmul(vd449,X93))&~(vmul(vmul(vd448,vd449),vsucc(X93))=vmul(vd448,vmul(vd449,vsucc(X93))))),inference(variable_rename,[status(thm)],[225])).
% fof(227, negated_conjecture,(vmul(vmul(vd448,vd449),esk5_0)=vmul(vd448,vmul(vd449,esk5_0))&~(vmul(vmul(vd448,vd449),vsucc(esk5_0))=vmul(vd448,vmul(vd449,vsucc(esk5_0))))),inference(skolemize,[status(esa)],[226])).
% cnf(228,negated_conjecture,(vmul(vmul(vd448,vd449),vsucc(esk5_0))!=vmul(vd448,vmul(vd449,vsucc(esk5_0)))),inference(split_conjunct,[status(thm)],[227])).
% cnf(229,negated_conjecture,(vmul(vmul(vd448,vd449),esk5_0)=vmul(vd448,vmul(vd449,esk5_0))),inference(split_conjunct,[status(thm)],[227])).
% cnf(230,plain,(vplus(v1,X1)=vplus(X1,v1)),inference(rw,[status(thm)],[130,132,theory(equality)]),['unfolding']).
% cnf(234,plain,(vplus(vmul(X1,X2),X2)=vmul(vplus(X1,v1),X2)),inference(rw,[status(thm)],[84,132,theory(equality)]),['unfolding']).
% cnf(242,negated_conjecture,(vmul(vmul(vd448,vd449),vplus(esk5_0,v1))!=vmul(vd448,vmul(vd449,vplus(esk5_0,v1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[228,132,theory(equality)]),132,theory(equality)]),['unfolding']).
% cnf(282,negated_conjecture,(vmul(vmul(vd448,vd449),vplus(v1,esk5_0))!=vmul(vd448,vmul(vd449,vplus(esk5_0,v1)))),inference(rw,[status(thm)],[242,230,theory(equality)])).
% cnf(283,negated_conjecture,(vmul(vmul(vd448,vd449),vplus(v1,esk5_0))!=vmul(vd448,vmul(vd449,vplus(v1,esk5_0)))),inference(rw,[status(thm)],[282,230,theory(equality)])).
% cnf(306,negated_conjecture,(vmul(esk5_0,vmul(vd449,vd448))=vmul(vd448,vmul(vd449,esk5_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[229,62,theory(equality)]),62,theory(equality)])).
% cnf(394,plain,(vplus(X1,vmul(X1,X2))=vmul(X1,vplus(v1,X2))),inference(spm,[status(thm)],[88,92,theory(equality)])).
% cnf(395,plain,(vplus(vmul(X2,X1),vmul(X1,X3))=vmul(X1,vplus(X2,X3))),inference(spm,[status(thm)],[88,62,theory(equality)])).
% cnf(448,plain,(vmul(vplus(X1,v1),X2)=vplus(X2,vmul(X1,X2))),inference(rw,[status(thm)],[234,126,theory(equality)])).
% cnf(473,negated_conjecture,(vmul(vplus(esk5_0,v1),vmul(vd449,vd448))=vplus(vmul(vd449,vd448),vmul(vd448,vmul(vd449,esk5_0)))),inference(spm,[status(thm)],[448,306,theory(equality)])).
% cnf(485,negated_conjecture,(vmul(vplus(v1,esk5_0),vmul(vd449,vd448))=vplus(vmul(vd449,vd448),vmul(vd448,vmul(vd449,esk5_0)))),inference(rw,[status(thm)],[473,230,theory(equality)])).
% cnf(621,negated_conjecture,(vmul(vplus(v1,esk5_0),vmul(vd449,vd448))!=vmul(vd448,vmul(vd449,vplus(v1,esk5_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[283,62,theory(equality)]),62,theory(equality)])).
% cnf(6437,negated_conjecture,(vmul(vplus(v1,esk5_0),vmul(vd449,vd448))!=vmul(vd448,vplus(vd449,vmul(vd449,esk5_0)))),inference(rw,[status(thm)],[621,394,theory(equality)])).
% cnf(6673,negated_conjecture,(vmul(vd448,vplus(vd449,vmul(vd449,esk5_0)))=vmul(vplus(v1,esk5_0),vmul(vd449,vd448))),inference(rw,[status(thm)],[485,395,theory(equality)])).
% cnf(6674,negated_conjecture,($false),inference(sr,[status(thm)],[6673,6437,theory(equality)])).
% cnf(6675,negated_conjecture,($false),6674,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1482
% # ...of these trivial : 22
% # ...subsumed : 1127
% # ...remaining for further processing: 333
% # Other redundant clauses eliminated : 31
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 24
% # Backward-rewritten : 7
% # Generated clauses : 5519
% # ...of the previous two non-trivial : 5132
% # Contextual simplify-reflections : 1
% # Paramodulations : 5448
% # Factorizations : 2
% # Equation resolutions : 69
% # Current number of processed clauses: 296
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 7
% # Negative unit clauses : 106
% # Non-unit-clauses : 150
% # Current number of unprocessed clauses: 3391
% # ...number of literals in the above : 6241
% # Clause-clause subsumption calls (NU) : 4921
% # Rec. Clause-clause subsumption calls : 4913
% # Unit Clause-clause subsumption calls : 964
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 126
% # Indexed BW rewrite successes : 62
% # Backwards rewriting index: 152 leaves, 1.67+/-1.601 terms/leaf
% # Paramod-from index: 42 leaves, 1.31+/-0.556 terms/leaf
% # Paramod-into index: 133 leaves, 1.69+/-1.595 terms/leaf
% # -------------------------------------------------
% # User time : 0.166 s
% # System time : 0.006 s
% # Total time : 0.172 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/SystemOnTPTP21852/NUM849+1.tptp
%
%------------------------------------------------------------------------------