TSTP Solution File: NUM848+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM848+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 20:52:24 EST 2010
% Result : Theorem 1.31s
% Output : Solution 1.31s
% 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/SystemOnTPTP26037/NUM848+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26037/NUM848+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26037/NUM848+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 26169
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 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(17, axiom,![X20]:![X21]:vplus(X21,X20)=vplus(X20,X21),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(19, axiom,![X24]:![X25]:![X26]:vplus(vplus(X24,X25),X26)=vplus(X24,vplus(X25,X26)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(25, axiom,![X32]:![X33]:(vmul(X32,vsucc(X33))=vplus(vmul(X32,X33),X32)&vmul(X32,v1)=X32),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 32), and(holds(definiens(249), 399, 0), holds(definiens(249), 398, 0)))')).
% fof(27, axiom,![X35]:![X36]:(vplus(X35,vsucc(X36))=vsucc(vplus(X35,X36))&vplus(X35,v1)=vsucc(X35)),file('/tmp/SRASS.s.p', 'qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))')).
% fof(57, 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(58, negated_conjecture,~(vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))=vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439)))),inference(assume_negation,[status(cth)],[57])).
% fof(62, negated_conjecture,~(vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))=vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439)))),inference(fof_simplification,[status(thm)],[58,theory(equality)])).
% cnf(63,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(67,plain,(vmul(vd436,vplus(vd437,vd439))=vplus(vmul(vd436,vd437),vmul(vd436,vd439))),inference(split_conjunct,[status(thm)],[5])).
% fof(100, plain,![X22]:![X23]:vplus(X23,X22)=vplus(X22,X23),inference(variable_rename,[status(thm)],[17])).
% cnf(101,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[100])).
% fof(104, plain,![X27]:![X28]:![X29]:vplus(vplus(X27,X28),X29)=vplus(X27,vplus(X28,X29)),inference(variable_rename,[status(thm)],[19])).
% cnf(105,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[104])).
% fof(116, plain,![X34]:![X35]:(vmul(X34,vsucc(X35))=vplus(vmul(X34,X35),X34)&vmul(X34,v1)=X34),inference(variable_rename,[status(thm)],[25])).
% cnf(118,plain,(vmul(X1,vsucc(X2))=vplus(vmul(X1,X2),X1)),inference(split_conjunct,[status(thm)],[116])).
% fof(121, plain,![X37]:![X38]:(vplus(X37,vsucc(X38))=vsucc(vplus(X37,X38))&vplus(X37,v1)=vsucc(X37)),inference(variable_rename,[status(thm)],[27])).
% cnf(122,plain,(vplus(X1,v1)=vsucc(X1)),inference(split_conjunct,[status(thm)],[121])).
% cnf(219,negated_conjecture,(vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))!=vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439)))),inference(split_conjunct,[status(thm)],[62])).
% cnf(223,plain,(vplus(vmul(X1,X2),X1)=vmul(X1,vplus(X2,v1))),inference(rw,[status(thm)],[118,122,theory(equality)]),['unfolding']).
% cnf(234,negated_conjecture,(vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))!=vplus(vmul(vd436,vd437),vmul(vd436,vplus(vd439,v1)))),inference(rw,[status(thm)],[219,122,theory(equality)]),['unfolding']).
% cnf(289,plain,(vplus(X1,vplus(X2,X3))=vplus(X2,vplus(X3,X1))),inference(spm,[status(thm)],[101,105,theory(equality)])).
% cnf(316,plain,(vmul(X1,vplus(X2,v1))=vplus(X1,vmul(X1,X2))),inference(rw,[status(thm)],[223,101,theory(equality)])).
% cnf(336,plain,(vmul(X1,vplus(v1,X2))=vplus(X1,vmul(X1,X2))),inference(spm,[status(thm)],[316,101,theory(equality)])).
% cnf(562,negated_conjecture,(vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439)))!=vplus(vmul(vd436,vd437),vmul(vd436,vplus(vd439,v1)))),inference(rw,[status(thm)],[234,101,theory(equality)])).
% cnf(563,negated_conjecture,(vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439)))!=vplus(vmul(vd436,vd437),vmul(vd436,vplus(v1,vd439)))),inference(rw,[status(thm)],[562,101,theory(equality)])).
% cnf(668,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)],[63,67,theory(equality)]),101,theory(equality)])).
% cnf(669,plain,(vplus(vd436,vmul(vd436,vplus(vd437,vd439)))=vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439)))),inference(rw,[status(thm)],[668,101,theory(equality)])).
% cnf(696,negated_conjecture,(vplus(vmul(vd436,vd437),vmul(vd436,vplus(v1,vd439)))!=vplus(vd436,vmul(vd436,vplus(vd437,vd439)))),inference(rw,[status(thm)],[563,669,theory(equality)])).
% cnf(3597,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[696,336,theory(equality)]),289,theory(equality)]),101,theory(equality)]),67,theory(equality)])).
% cnf(3598,negated_conjecture,($false),inference(cn,[status(thm)],[3597,theory(equality)])).
% cnf(3599,negated_conjecture,($false),3598,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 456
% # ...of these trivial : 7
% # ...subsumed : 313
% # ...remaining for further processing: 136
% # Other redundant clauses eliminated : 43
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 2937
% # ...of the previous two non-trivial : 2696
% # Contextual simplify-reflections : 1
% # Paramodulations : 2875
% # Factorizations : 2
% # Equation resolutions : 60
% # Current number of processed clauses: 124
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 13
% # Negative unit clauses : 30
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 2229
% # ...number of literals in the above : 4285
% # Clause-clause subsumption calls (NU) : 530
% # Rec. Clause-clause subsumption calls : 522
% # Unit Clause-clause subsumption calls : 185
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 167
% # Indexed BW rewrite successes : 68
% # Backwards rewriting index: 70 leaves, 1.81+/-1.846 terms/leaf
% # Paramod-from index: 39 leaves, 1.41+/-0.629 terms/leaf
% # Paramod-into index: 64 leaves, 1.77+/-1.712 terms/leaf
% # -------------------------------------------------
% # User time : 0.069 s
% # System time : 0.006 s
% # Total time : 0.075 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.27 WC
% FINAL PrfWatch: 0.21 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP26037/NUM848+1.tptp
%
%------------------------------------------------------------------------------