TSTP Solution File: NUM854+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM854+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 : art04.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:11 EST 2010
% Result : Theorem 1.19s
% Output : Solution 1.19s
% 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/SystemOnTPTP20790/NUM854+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20790/NUM854+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20790/NUM854+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 20886
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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(9, axiom,![X17]:![X18]:vmul(X17,X18)=vmul(X18,X17),file('/tmp/SRASS.s.p', 'ass(cond(270, 0), 0)')).
% fof(27, conjecture,greater(vmul(vd508,vd511),vmul(vd509,vd511)),file('/tmp/SRASS.s.p', 'holds(conjunct1(315), 514, 0)')).
% fof(28, negated_conjecture,~(greater(vmul(vd508,vd511),vmul(vd509,vd511))),inference(assume_negation,[status(cth)],[27])).
% fof(32, negated_conjecture,~(greater(vmul(vd508,vd511),vmul(vd509,vd511))),inference(fof_simplification,[status(thm)],[28,theory(equality)])).
% cnf(33,plain,(greater(vd508,vd509)),inference(split_conjunct,[status(thm)],[1])).
% fof(37, plain,![X4]:![X5]:![X6]:(~(greater(X5,X6))|greater(vmul(X5,X4),vmul(X6,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(38, plain,![X7]:![X8]:![X9]:(~(greater(X8,X9))|greater(vmul(X8,X7),vmul(X9,X7))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(greater(vmul(X1,X2),vmul(X3,X2))|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[38])).
% fof(51, plain,![X19]:![X20]:vmul(X19,X20)=vmul(X20,X19),inference(variable_rename,[status(thm)],[9])).
% cnf(52,plain,(vmul(X1,X2)=vmul(X2,X1)),inference(split_conjunct,[status(thm)],[51])).
% cnf(107,negated_conjecture,(~greater(vmul(vd508,vd511),vmul(vd509,vd511))),inference(split_conjunct,[status(thm)],[32])).
% cnf(116,negated_conjecture,(~greater(vmul(vd511,vd508),vmul(vd511,vd509))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[107,52,theory(equality)]),52,theory(equality)])).
% cnf(152,plain,(greater(vmul(X1,X2),vmul(X2,X3))|~greater(X1,X3)),inference(spm,[status(thm)],[39,52,theory(equality)])).
% cnf(732,plain,(greater(vmul(X2,X1),vmul(X2,X3))|~greater(X1,X3)),inference(spm,[status(thm)],[152,52,theory(equality)])).
% cnf(9731,negated_conjecture,(~greater(vd508,vd509)),inference(spm,[status(thm)],[116,732,theory(equality)])).
% cnf(9790,negated_conjecture,($false),inference(rw,[status(thm)],[9731,33,theory(equality)])).
% cnf(9791,negated_conjecture,($false),inference(cn,[status(thm)],[9790,theory(equality)])).
% cnf(9792,negated_conjecture,($false),9791,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2520
% # ...of these trivial : 15
% # ...subsumed : 2171
% # ...remaining for further processing: 334
% # Other redundant clauses eliminated : 158
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 3
% # Generated clauses : 7482
% # ...of the previous two non-trivial : 6868
% # Contextual simplify-reflections : 33
% # Paramodulations : 7304
% # Factorizations : 2
% # Equation resolutions : 176
% # Current number of processed clauses: 324
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 110
% # Non-unit-clauses : 185
% # Current number of unprocessed clauses: 4301
% # ...number of literals in the above : 9237
% # Clause-clause subsumption calls (NU) : 12020
% # Rec. Clause-clause subsumption calls : 11994
% # Unit Clause-clause subsumption calls : 510
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 65
% # Indexed BW rewrite successes : 22
% # Backwards rewriting index: 134 leaves, 2.25+/-2.265 terms/leaf
% # Paramod-from index: 44 leaves, 1.50+/-0.989 terms/leaf
% # Paramod-into index: 127 leaves, 2.02+/-1.895 terms/leaf
% # -------------------------------------------------
% # User time : 0.204 s
% # System time : 0.005 s
% # Total time : 0.209 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.39 CPU 0.46 WC
% FINAL PrfWatch: 0.39 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP20790/NUM854+2.tptp
%
%------------------------------------------------------------------------------