TSTP Solution File: NUM837+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM837+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 : art09.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:44:57 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP28483/NUM837+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28483/NUM837+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28483/NUM837+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 28579
% 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(9, axiom,less(vd268,vd269),file('/tmp/SRASS.s.p', 'holds(conjunct1(170), 270, 0)')).
% fof(10, axiom,![X15]:![X16]:(less(X16,X15)<=>?[X17]:X15=vplus(X16,X17)),file('/tmp/SRASS.s.p', 'def(cond(conseq(axiom(3)), 12), 1)')).
% fof(31, conjecture,?[X47]:vd269=vplus(vd268,X47),file('/tmp/SRASS.s.p', 'qe(171)')).
% fof(32, negated_conjecture,~(?[X47]:vd269=vplus(vd268,X47)),inference(assume_negation,[status(cth)],[31])).
% cnf(61,plain,(less(vd268,vd269)),inference(split_conjunct,[status(thm)],[9])).
% fof(62, plain,![X15]:![X16]:((~(less(X16,X15))|?[X17]:X15=vplus(X16,X17))&(![X17]:~(X15=vplus(X16,X17))|less(X16,X15))),inference(fof_nnf,[status(thm)],[10])).
% fof(63, plain,![X18]:![X19]:((~(less(X19,X18))|?[X20]:X18=vplus(X19,X20))&(![X21]:~(X18=vplus(X19,X21))|less(X19,X18))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X18]:![X19]:((~(less(X19,X18))|X18=vplus(X19,esk3_2(X18,X19)))&(![X21]:~(X18=vplus(X19,X21))|less(X19,X18))),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X18]:![X19]:![X21]:((~(X18=vplus(X19,X21))|less(X19,X18))&(~(less(X19,X18))|X18=vplus(X19,esk3_2(X18,X19)))),inference(shift_quantors,[status(thm)],[64])).
% cnf(66,plain,(X1=vplus(X2,esk3_2(X1,X2))|~less(X2,X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(127, negated_conjecture,![X47]:~(vd269=vplus(vd268,X47)),inference(fof_nnf,[status(thm)],[32])).
% fof(128, negated_conjecture,![X48]:~(vd269=vplus(vd268,X48)),inference(variable_rename,[status(thm)],[127])).
% cnf(129,negated_conjecture,(vd269!=vplus(vd268,X1)),inference(split_conjunct,[status(thm)],[128])).
% cnf(218,negated_conjecture,(X1!=vd269|~less(vd268,X1)),inference(spm,[status(thm)],[129,66,theory(equality)])).
% cnf(349,negated_conjecture,($false),inference(spm,[status(thm)],[218,61,theory(equality)])).
% cnf(350,negated_conjecture,($false),349,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 85
% # ...of these trivial : 2
% # ...subsumed : 37
% # ...remaining for further processing: 46
% # Other redundant clauses eliminated : 28
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 188
% # ...of the previous two non-trivial : 151
% # Contextual simplify-reflections : 0
% # Paramodulations : 154
% # Factorizations : 0
% # Equation resolutions : 34
% # Current number of processed clauses: 39
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 12
% # Non-unit-clauses : 21
% # Current number of unprocessed clauses: 96
% # ...number of literals in the above : 212
% # Clause-clause subsumption calls (NU) : 11
% # Rec. Clause-clause subsumption calls : 11
% # Unit Clause-clause subsumption calls : 30
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 13
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 31 leaves, 1.71+/-1.249 terms/leaf
% # Paramod-from index: 12 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-into index: 29 leaves, 1.62+/-1.096 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.003 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP28483/NUM837+1.tptp
%
%------------------------------------------------------------------------------