TSTP Solution File: NUM302+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM302+1 : TPTP v5.0.0. Released v3.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 17:34:54 EST 2010
% Result : Theorem 8.27s
% Output : Solution 8.27s
% 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/SystemOnTPTP9929/NUM302+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9929/NUM302+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9929/NUM302+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 10028
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:![X4]:![X5]:((rdn_translate(X1,rdn_neg(X4))&rdn_translate(X2,rdn_pos(X5)))=>less(X1,X2)),file('/tmp/SRASS.s.p', less_entry_point_neg_pos)).
% fof(4, axiom,rdn_translate(nn2,rdn_neg(rdnn(n2))),file('/tmp/SRASS.s.p', rdnn2)).
% fof(22, axiom,rdn_translate(n9,rdn_pos(rdnn(n9))),file('/tmp/SRASS.s.p', rdn9)).
% fof(402, conjecture,?[X1]:less(nn2,X1),file('/tmp/SRASS.s.p', nn2_less_something)).
% fof(403, negated_conjecture,~(?[X1]:less(nn2,X1)),inference(assume_negation,[status(cth)],[402])).
% fof(414, plain,![X1]:![X2]:![X4]:![X5]:((~(rdn_translate(X1,rdn_neg(X4)))|~(rdn_translate(X2,rdn_pos(X5))))|less(X1,X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(415, plain,![X6]:![X7]:![X8]:![X9]:((~(rdn_translate(X6,rdn_neg(X8)))|~(rdn_translate(X7,rdn_pos(X9))))|less(X6,X7)),inference(variable_rename,[status(thm)],[414])).
% cnf(416,plain,(less(X1,X2)|~rdn_translate(X2,rdn_pos(X3))|~rdn_translate(X1,rdn_neg(X4))),inference(split_conjunct,[status(thm)],[415])).
% cnf(417,plain,(rdn_translate(nn2,rdn_neg(rdnn(n2)))),inference(split_conjunct,[status(thm)],[4])).
% cnf(452,plain,(rdn_translate(n9,rdn_pos(rdnn(n9)))),inference(split_conjunct,[status(thm)],[22])).
% fof(867, negated_conjecture,![X1]:~(less(nn2,X1)),inference(fof_nnf,[status(thm)],[403])).
% fof(868, negated_conjecture,![X2]:~(less(nn2,X2)),inference(variable_rename,[status(thm)],[867])).
% cnf(869,negated_conjecture,(~less(nn2,X1)),inference(split_conjunct,[status(thm)],[868])).
% cnf(889,plain,(less(X1,n9)|~rdn_translate(X1,rdn_neg(X2))),inference(spm,[status(thm)],[416,452,theory(equality)])).
% cnf(2256,plain,(less(nn2,n9)),inference(spm,[status(thm)],[889,417,theory(equality)])).
% cnf(2257,plain,($false),inference(sr,[status(thm)],[2256,869,theory(equality)])).
% cnf(2258,plain,($false),2257,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 424
% # ...of these trivial : 0
% # ...subsumed : 3
% # ...remaining for further processing: 421
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1387
% # ...of the previous two non-trivial : 1382
% # Contextual simplify-reflections : 0
% # Paramodulations : 1383
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 419
% # Positive orientable unit clauses: 384
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 1365
% # ...number of literals in the above : 4262
% # Clause-clause subsumption calls (NU) : 32
% # Rec. Clause-clause subsumption calls : 15
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 803 leaves, 1.41+/-4.704 terms/leaf
% # Paramod-from index: 389 leaves, 1.00+/-0.051 terms/leaf
% # Paramod-into index: 795 leaves, 1.35+/-4.678 terms/leaf
% # -------------------------------------------------
% # User time : 0.075 s
% # System time : 0.009 s
% # Total time : 0.084 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.31 WC
% FINAL PrfWatch: 0.21 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP9929/NUM302+1.tptp
%
%------------------------------------------------------------------------------