TSTP Solution File: NUM837+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM837+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:45:06 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/SystemOnTPTP18324/NUM837+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18324/NUM837+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18324/NUM837+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 18420
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,less(vd268,vd269),file('/tmp/SRASS.s.p', 'holds(conjunct1(170), 270, 0)')).
% fof(8, axiom,![X11]:![X12]:(less(X12,X11)<=>?[X13]:X11=vplus(X12,X13)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 12), 1)')).
% fof(22, conjecture,?[X33]:vd269=vplus(vd268,X33),file('/tmp/SRASS.s.p', 'qe(171)')).
% fof(23, negated_conjecture,~(?[X33]:vd269=vplus(vd268,X33)),inference(assume_negation,[status(cth)],[22])).
% cnf(48,plain,(less(vd268,vd269)),inference(split_conjunct,[status(thm)],[7])).
% fof(49, plain,![X11]:![X12]:((~(less(X12,X11))|?[X13]:X11=vplus(X12,X13))&(![X13]:~(X11=vplus(X12,X13))|less(X12,X11))),inference(fof_nnf,[status(thm)],[8])).
% fof(50, plain,![X14]:![X15]:((~(less(X15,X14))|?[X16]:X14=vplus(X15,X16))&(![X17]:~(X14=vplus(X15,X17))|less(X15,X14))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X14]:![X15]:((~(less(X15,X14))|X14=vplus(X15,esk3_2(X14,X15)))&(![X17]:~(X14=vplus(X15,X17))|less(X15,X14))),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X14]:![X15]:![X17]:((~(X14=vplus(X15,X17))|less(X15,X14))&(~(less(X15,X14))|X14=vplus(X15,esk3_2(X14,X15)))),inference(shift_quantors,[status(thm)],[51])).
% cnf(53,plain,(X1=vplus(X2,esk3_2(X1,X2))|~less(X2,X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(97, negated_conjecture,![X33]:~(vd269=vplus(vd268,X33)),inference(fof_nnf,[status(thm)],[23])).
% fof(98, negated_conjecture,![X34]:~(vd269=vplus(vd268,X34)),inference(variable_rename,[status(thm)],[97])).
% cnf(99,negated_conjecture,(vd269!=vplus(vd268,X1)),inference(split_conjunct,[status(thm)],[98])).
% cnf(129,negated_conjecture,(X1!=vd269|~less(vd268,X1)),inference(spm,[status(thm)],[99,53,theory(equality)])).
% cnf(209,negated_conjecture,($false),inference(spm,[status(thm)],[129,48,theory(equality)])).
% cnf(210,negated_conjecture,($false),209,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 67
% # ...of these trivial : 1
% # ...subsumed : 5
% # ...remaining for further processing: 61
% # Other redundant clauses eliminated : 20
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 98
% # ...of the previous two non-trivial : 69
% # Contextual simplify-reflections : 0
% # Paramodulations : 73
% # Factorizations : 0
% # Equation resolutions : 25
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 56
% # ...number of literals in the above : 148
% # Clause-clause subsumption calls (NU) : 10
% # Rec. Clause-clause subsumption calls : 10
% # Unit Clause-clause subsumption calls : 18
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 24 leaves, 1.71+/-1.541 terms/leaf
% # Paramod-from index: 11 leaves, 1.18+/-0.386 terms/leaf
% # Paramod-into index: 23 leaves, 1.52+/-1.314 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.002 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP18324/NUM837+2.tptp
%
%------------------------------------------------------------------------------