TSTP Solution File: NUM854+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM854+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:49:01 EST 2010
% Result : Theorem 3.58s
% Output : Solution 3.58s
% 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/SystemOnTPTP22111/NUM854+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22111/NUM854+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22111/NUM854+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 22207
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.91 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,greater(vd508,vd509),file('/tmp/SRASS.s.p', 'holds(conjunct1(314), 510, 0)')).
% fof(3, axiom,![X4]:![X5]:![X6]:(greater(X5,X6)=>greater(vmul(X5,X4),vmul(X6,X4))),file('/tmp/SRASS.s.p', 'ass(cond(299, 0), 2)')).
% fof(7, axiom,![X15]:![X16]:vmul(X15,X16)=vmul(X16,X15),file('/tmp/SRASS.s.p', 'ass(cond(270, 0), 0)')).
% fof(59, conjecture,greater(vmul(vd508,vd511),vmul(vd509,vd511)),file('/tmp/SRASS.s.p', 'holds(conjunct1(315), 514, 0)')).
% fof(60, negated_conjecture,~(greater(vmul(vd508,vd511),vmul(vd509,vd511))),inference(assume_negation,[status(cth)],[59])).
% fof(64, negated_conjecture,~(greater(vmul(vd508,vd511),vmul(vd509,vd511))),inference(fof_simplification,[status(thm)],[60,theory(equality)])).
% cnf(65,plain,(greater(vd508,vd509)),inference(split_conjunct,[status(thm)],[1])).
% fof(69, plain,![X4]:![X5]:![X6]:(~(greater(X5,X6))|greater(vmul(X5,X4),vmul(X6,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(70, plain,![X7]:![X8]:![X9]:(~(greater(X8,X9))|greater(vmul(X8,X7),vmul(X9,X7))),inference(variable_rename,[status(thm)],[69])).
% cnf(71,plain,(greater(vmul(X1,X2),vmul(X3,X2))|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[70])).
% fof(80, plain,![X17]:![X18]:vmul(X17,X18)=vmul(X18,X17),inference(variable_rename,[status(thm)],[7])).
% cnf(81,plain,(vmul(X1,X2)=vmul(X2,X1)),inference(split_conjunct,[status(thm)],[80])).
% cnf(237,negated_conjecture,(~greater(vmul(vd508,vd511),vmul(vd509,vd511))),inference(split_conjunct,[status(thm)],[64])).
% cnf(253,negated_conjecture,(~greater(vmul(vd511,vd508),vmul(vd511,vd509))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[237,81,theory(equality)]),81,theory(equality)])).
% cnf(328,plain,(greater(vmul(X1,X2),vmul(X2,X3))|~greater(X1,X3)),inference(spm,[status(thm)],[71,81,theory(equality)])).
% cnf(1512,plain,(greater(vmul(X2,X1),vmul(X2,X3))|~greater(X1,X3)),inference(spm,[status(thm)],[328,81,theory(equality)])).
% cnf(73147,negated_conjecture,(~greater(vd508,vd509)),inference(spm,[status(thm)],[253,1512,theory(equality)])).
% cnf(73230,negated_conjecture,($false),inference(rw,[status(thm)],[73147,65,theory(equality)])).
% cnf(73231,negated_conjecture,($false),inference(cn,[status(thm)],[73230,theory(equality)])).
% cnf(73232,negated_conjecture,($false),73231,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 8890
% # ...of these trivial : 107
% # ...subsumed : 7317
% # ...remaining for further processing: 1466
% # Other redundant clauses eliminated : 501
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 33
% # Backward-rewritten : 15
% # Generated clauses : 57217
% # ...of the previous two non-trivial : 53209
% # Contextual simplify-reflections : 231
% # Paramodulations : 56658
% # Factorizations : 2
% # Equation resolutions : 557
% # Current number of processed clauses: 1412
% # Positive orientable unit clauses: 98
% # Positive unorientable unit clauses: 22
% # Negative unit clauses : 421
% # Non-unit-clauses : 871
% # Current number of unprocessed clauses: 43712
% # ...number of literals in the above : 101977
% # Clause-clause subsumption calls (NU) : 57886
% # Rec. Clause-clause subsumption calls : 52701
% # Unit Clause-clause subsumption calls : 7592
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 698
% # Indexed BW rewrite successes : 250
% # Backwards rewriting index: 565 leaves, 2.13+/-2.486 terms/leaf
% # Paramod-from index: 213 leaves, 1.48+/-1.239 terms/leaf
% # Paramod-into index: 550 leaves, 2.02+/-2.312 terms/leaf
% # -------------------------------------------------
% # User time : 1.678 s
% # System time : 0.054 s
% # Total time : 1.732 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.69 CPU 2.79 WC
% FINAL PrfWatch: 2.69 CPU 2.79 WC
% SZS output end Solution for /tmp/SystemOnTPTP22111/NUM854+1.tptp
%
%------------------------------------------------------------------------------