TSTP Solution File: NUM850+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM850+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 : 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:48:06 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP19369/NUM850+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19369/NUM850+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19369/NUM850+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 19465
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(11, axiom,greater(vd470,vd471),file('/tmp/SRASS.s.p', 'holds(antec(302), 472, 0)')).
% fof(12, axiom,![X21]:![X22]:(greater(X22,X21)<=>?[X23]:X22=vplus(X21,X23)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 11), 1)')).
% fof(52, conjecture,?[X94]:vd470=vplus(vd471,X94),file('/tmp/SRASS.s.p', 'qe(conseq_conjunct1(conseq(302)))')).
% fof(53, negated_conjecture,~(?[X94]:vd470=vplus(vd471,X94)),inference(assume_negation,[status(cth)],[52])).
% cnf(88,plain,(greater(vd470,vd471)),inference(split_conjunct,[status(thm)],[11])).
% fof(89, plain,![X21]:![X22]:((~(greater(X22,X21))|?[X23]:X22=vplus(X21,X23))&(![X23]:~(X22=vplus(X21,X23))|greater(X22,X21))),inference(fof_nnf,[status(thm)],[12])).
% fof(90, plain,![X24]:![X25]:((~(greater(X25,X24))|?[X26]:X25=vplus(X24,X26))&(![X27]:~(X25=vplus(X24,X27))|greater(X25,X24))),inference(variable_rename,[status(thm)],[89])).
% fof(91, plain,![X24]:![X25]:((~(greater(X25,X24))|X25=vplus(X24,esk3_2(X24,X25)))&(![X27]:~(X25=vplus(X24,X27))|greater(X25,X24))),inference(skolemize,[status(esa)],[90])).
% fof(92, plain,![X24]:![X25]:![X27]:((~(X25=vplus(X24,X27))|greater(X25,X24))&(~(greater(X25,X24))|X25=vplus(X24,esk3_2(X24,X25)))),inference(shift_quantors,[status(thm)],[91])).
% cnf(93,plain,(X1=vplus(X2,esk3_2(X2,X1))|~greater(X1,X2)),inference(split_conjunct,[status(thm)],[92])).
% fof(210, negated_conjecture,![X94]:~(vd470=vplus(vd471,X94)),inference(fof_nnf,[status(thm)],[53])).
% fof(211, negated_conjecture,![X95]:~(vd470=vplus(vd471,X95)),inference(variable_rename,[status(thm)],[210])).
% cnf(212,negated_conjecture,(vd470!=vplus(vd471,X1)),inference(split_conjunct,[status(thm)],[211])).
% cnf(383,negated_conjecture,(X1!=vd470|~greater(X1,vd471)),inference(spm,[status(thm)],[212,93,theory(equality)])).
% cnf(757,negated_conjecture,($false),inference(spm,[status(thm)],[383,88,theory(equality)])).
% cnf(760,negated_conjecture,($false),757,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 104
% # ...of these trivial : 3
% # ...subsumed : 33
% # ...remaining for further processing: 68
% # Other redundant clauses eliminated : 23
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 473
% # ...of the previous two non-trivial : 419
% # Contextual simplify-reflections : 0
% # Paramodulations : 444
% # Factorizations : 0
% # Equation resolutions : 29
% # Current number of processed clauses: 60
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 12
% # Non-unit-clauses : 34
% # Current number of unprocessed clauses: 364
% # ...number of literals in the above : 849
% # Clause-clause subsumption calls (NU) : 46
% # Rec. Clause-clause subsumption calls : 42
% # Unit Clause-clause subsumption calls : 52
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 25
% # Indexed BW rewrite successes : 13
% # Backwards rewriting index: 46 leaves, 1.80+/-1.408 terms/leaf
% # Paramod-from index: 25 leaves, 1.24+/-0.427 terms/leaf
% # Paramod-into index: 41 leaves, 1.73+/-1.250 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.005 s
% # Total time : 0.029 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.20 WC
% FINAL PrfWatch: 0.13 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP19369/NUM850+1.tptp
%
%------------------------------------------------------------------------------