TSTP Solution File: NUM849+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM849+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:58 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP19814/NUM849+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19814/NUM849+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19814/NUM849+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 19910
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 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(6, axiom,![X4]:![X5]:vmul(vsucc(X4),X5)=vplus(vmul(X4,X5),X5),file('/tmp/SRASS.s.p', 'ass(cond(261, 0), 0)')).
% fof(8, axiom,![X6]:![X7]:![X8]:vmul(X6,vplus(X7,X8))=vplus(vmul(X6,X7),vmul(X6,X8)),file('/tmp/SRASS.s.p', 'ass(cond(281, 0), 0)')).
% fof(9, axiom,![X9]:![X10]:vplus(X10,X9)=vplus(X9,X10),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(11, axiom,![X13]:![X14]:(vplus(X13,vsucc(X14))=vsucc(vplus(X13,X14))&vplus(X13,v1)=vsucc(X13)),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))')).
% fof(12, conjecture,![X15]:(vmul(vmul(vd448,vd449),X15)=vmul(vd448,vmul(vd449,X15))=>vmul(vmul(vd448,vd449),vsucc(X15))=vmul(vd448,vmul(vd449,vsucc(X15)))),file('/tmp/SRASS.s.p', 'qu(ind(296), imp(296))')).
% fof(13, negated_conjecture,~(![X15]:(vmul(vmul(vd448,vd449),X15)=vmul(vd448,vmul(vd449,X15))=>vmul(vmul(vd448,vd449),vsucc(X15))=vmul(vd448,vmul(vd449,vsucc(X15))))),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X3]:![X4]:vmul(X3,X4)=vmul(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(15,plain,(vmul(X1,X2)=vmul(X2,X1)),inference(split_conjunct,[status(thm)],[14])).
% fof(28, plain,![X6]:![X7]:vmul(vsucc(X6),X7)=vplus(vmul(X6,X7),X7),inference(variable_rename,[status(thm)],[6])).
% cnf(29,plain,(vmul(vsucc(X1),X2)=vplus(vmul(X1,X2),X2)),inference(split_conjunct,[status(thm)],[28])).
% fof(31, plain,![X9]:![X10]:![X11]:vmul(X9,vplus(X10,X11))=vplus(vmul(X9,X10),vmul(X9,X11)),inference(variable_rename,[status(thm)],[8])).
% cnf(32,plain,(vmul(X1,vplus(X2,X3))=vplus(vmul(X1,X2),vmul(X1,X3))),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X11]:![X12]:vplus(X12,X11)=vplus(X11,X12),inference(variable_rename,[status(thm)],[9])).
% cnf(34,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(38, plain,![X15]:![X16]:(vplus(X15,vsucc(X16))=vsucc(vplus(X15,X16))&vplus(X15,v1)=vsucc(X15)),inference(variable_rename,[status(thm)],[11])).
% cnf(39,plain,(vplus(X1,v1)=vsucc(X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(41, negated_conjecture,?[X15]:(vmul(vmul(vd448,vd449),X15)=vmul(vd448,vmul(vd449,X15))&~(vmul(vmul(vd448,vd449),vsucc(X15))=vmul(vd448,vmul(vd449,vsucc(X15))))),inference(fof_nnf,[status(thm)],[13])).
% fof(42, negated_conjecture,?[X16]:(vmul(vmul(vd448,vd449),X16)=vmul(vd448,vmul(vd449,X16))&~(vmul(vmul(vd448,vd449),vsucc(X16))=vmul(vd448,vmul(vd449,vsucc(X16))))),inference(variable_rename,[status(thm)],[41])).
% fof(43, negated_conjecture,(vmul(vmul(vd448,vd449),esk1_0)=vmul(vd448,vmul(vd449,esk1_0))&~(vmul(vmul(vd448,vd449),vsucc(esk1_0))=vmul(vd448,vmul(vd449,vsucc(esk1_0))))),inference(skolemize,[status(esa)],[42])).
% cnf(44,negated_conjecture,(vmul(vmul(vd448,vd449),vsucc(esk1_0))!=vmul(vd448,vmul(vd449,vsucc(esk1_0)))),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,negated_conjecture,(vmul(vmul(vd448,vd449),esk1_0)=vmul(vd448,vmul(vd449,esk1_0))),inference(split_conjunct,[status(thm)],[43])).
% cnf(48,plain,(vplus(vmul(X1,X2),X2)=vmul(vplus(X1,v1),X2)),inference(rw,[status(thm)],[29,39,theory(equality)]),['unfolding']).
% cnf(51,negated_conjecture,(vmul(vmul(vd448,vd449),vplus(esk1_0,v1))!=vmul(vd448,vmul(vd449,vplus(esk1_0,v1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[44,39,theory(equality)]),39,theory(equality)]),['unfolding']).
% cnf(55,negated_conjecture,(vmul(esk1_0,vmul(vd448,vd449))=vmul(vd448,vmul(vd449,esk1_0))),inference(rw,[status(thm)],[45,15,theory(equality)])).
% cnf(56,negated_conjecture,(vmul(esk1_0,vmul(vd448,vd449))=vmul(vd448,vmul(esk1_0,vd449))),inference(rw,[status(thm)],[55,15,theory(equality)])).
% cnf(76,plain,(vplus(X2,vmul(X1,X2))=vmul(vplus(X1,v1),X2)),inference(rw,[status(thm)],[48,34,theory(equality)])).
% cnf(97,negated_conjecture,(vplus(vmul(vd448,X1),vmul(esk1_0,vmul(vd448,vd449)))=vmul(vd448,vplus(X1,vmul(esk1_0,vd449)))),inference(spm,[status(thm)],[32,56,theory(equality)])).
% cnf(139,negated_conjecture,(vmul(vd448,vplus(vd449,vmul(esk1_0,vd449)))=vmul(vplus(esk1_0,v1),vmul(vd448,vd449))),inference(spm,[status(thm)],[76,97,theory(equality)])).
% cnf(147,negated_conjecture,(vmul(vd448,vmul(vd449,vplus(esk1_0,v1)))=vmul(vplus(esk1_0,v1),vmul(vd448,vd449))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[139,76,theory(equality)]),15,theory(equality)])).
% cnf(148,negated_conjecture,(vmul(vd448,vmul(vd449,vplus(esk1_0,v1)))=vmul(vmul(vd448,vd449),vplus(esk1_0,v1))),inference(rw,[status(thm)],[147,15,theory(equality)])).
% cnf(149,negated_conjecture,($false),inference(sr,[status(thm)],[148,51,theory(equality)])).
% cnf(150,negated_conjecture,($false),149,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 23
% # ...of these trivial : 4
% # ...subsumed : 6
% # ...remaining for further processing: 13
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 66
% # ...of the previous two non-trivial : 62
% # Contextual simplify-reflections : 0
% # Paramodulations : 66
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 12
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 52
% # ...number of literals in the above : 52
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 15
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 32 leaves, 1.16+/-0.507 terms/leaf
% # Paramod-from index: 13 leaves, 1.23+/-0.421 terms/leaf
% # Paramod-into index: 25 leaves, 1.16+/-0.463 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.003 s
% # Total time : 0.014 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/SystemOnTPTP19814/NUM849+2.tptp
%
%------------------------------------------------------------------------------