TSTP Solution File: NUM847+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM847+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 : art01.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:33 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP19107/NUM847+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19107/NUM847+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19107/NUM847+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 19203
% 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(2, axiom,vmul(vd436,vplus(vd437,vd439))=vplus(vmul(vd436,vd437),vmul(vd436,vd439)),file('/tmp/SRASS.s.p', 'holds(285, 440, 0)')).
% fof(3, axiom,![X1]:![X2]:vplus(X2,X1)=vplus(X1,X2),file('/tmp/SRASS.s.p', 'ass(cond(61, 0), 0)')).
% fof(4, axiom,![X3]:![X4]:![X5]:vplus(vplus(X3,X4),X5)=vplus(X3,vplus(X4,X5)),file('/tmp/SRASS.s.p', 'ass(cond(33, 0), 0)')).
% fof(19, conjecture,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(20, negated_conjecture,~(vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))),inference(assume_negation,[status(cth)],[19])).
% fof(21, negated_conjecture,~(vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% cnf(23,plain,(vmul(vd436,vplus(vd437,vd439))=vplus(vmul(vd436,vd437),vmul(vd436,vd439))),inference(split_conjunct,[status(thm)],[2])).
% fof(24, plain,![X3]:![X4]:vplus(X4,X3)=vplus(X3,X4),inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(vplus(X1,X2)=vplus(X2,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X6]:![X7]:![X8]:vplus(vplus(X6,X7),X8)=vplus(X6,vplus(X7,X8)),inference(variable_rename,[status(thm)],[4])).
% cnf(27,plain,(vplus(vplus(X1,X2),X3)=vplus(X1,vplus(X2,X3))),inference(split_conjunct,[status(thm)],[26])).
% cnf(56,negated_conjecture,(vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436)!=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))),inference(split_conjunct,[status(thm)],[21])).
% cnf(70,plain,(vplus(X1,vplus(X2,X3))=vplus(X3,vplus(X1,X2))),inference(spm,[status(thm)],[25,27,theory(equality)])).
% cnf(104,negated_conjecture,(vplus(vd436,vmul(vd436,vplus(vd437,vd439)))!=vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[56,23,theory(equality)]),25,theory(equality)])).
% cnf(105,negated_conjecture,(vplus(vd436,vmul(vd436,vplus(vd437,vd439)))!=vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439)))),inference(rw,[status(thm)],[104,25,theory(equality)])).
% cnf(182,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[105,70,theory(equality)]),25,theory(equality)]),23,theory(equality)])).
% cnf(183,negated_conjecture,($false),inference(cn,[status(thm)],[182,theory(equality)])).
% cnf(184,negated_conjecture,($false),183,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 30
% # ...of these trivial : 5
% # ...subsumed : 6
% # ...remaining for further processing: 19
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 83
% # ...of the previous two non-trivial : 45
% # Contextual simplify-reflections : 0
% # Paramodulations : 83
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 17
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 5
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 34
% # ...number of literals in the above : 43
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 31 leaves, 1.16+/-0.447 terms/leaf
% # Paramod-from index: 11 leaves, 1.18+/-0.386 terms/leaf
% # Paramod-into index: 25 leaves, 1.20+/-0.490 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.004 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP19107/NUM847+2.tptp
%
%------------------------------------------------------------------------------