TSTP Solution File: NUM290+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM290+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 : 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 17:33:03 EST 2010
% Result : Theorem 8.91s
% Output : Solution 8.91s
% 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/SystemOnTPTP4489/NUM290+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4489/NUM290+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4489/NUM290+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 4621
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,rdn_positive_less(rdnn(n2),rdnn(n3)),file('/tmp/SRASS.s.p', rdn_positive_less23)).
% fof(9, axiom,rdn_translate(n3,rdn_pos(rdnn(n3))),file('/tmp/SRASS.s.p', rdn3)).
% fof(11, axiom,rdn_translate(n2,rdn_pos(rdnn(n2))),file('/tmp/SRASS.s.p', rdn2)).
% fof(48, axiom,![X1]:![X2]:![X4]:![X5]:(((rdn_translate(X1,rdn_pos(X4))&rdn_translate(X2,rdn_pos(X5)))&rdn_positive_less(X4,X5))=>less(X1,X2)),file('/tmp/SRASS.s.p', less_entry_point_pos_pos)).
% fof(402, conjecture,less(n2,n3),file('/tmp/SRASS.s.p', n2_less_n3)).
% fof(403, negated_conjecture,~(less(n2,n3)),inference(assume_negation,[status(cth)],[402])).
% fof(405, negated_conjecture,~(less(n2,n3)),inference(fof_simplification,[status(thm)],[403,theory(equality)])).
% cnf(406,plain,(rdn_positive_less(rdnn(n2),rdnn(n3))),inference(split_conjunct,[status(thm)],[1])).
% cnf(421,plain,(rdn_translate(n3,rdn_pos(rdnn(n3)))),inference(split_conjunct,[status(thm)],[9])).
% cnf(423,plain,(rdn_translate(n2,rdn_pos(rdnn(n2)))),inference(split_conjunct,[status(thm)],[11])).
% fof(464, plain,![X1]:![X2]:![X4]:![X5]:(((~(rdn_translate(X1,rdn_pos(X4)))|~(rdn_translate(X2,rdn_pos(X5))))|~(rdn_positive_less(X4,X5)))|less(X1,X2)),inference(fof_nnf,[status(thm)],[48])).
% fof(465, plain,![X6]:![X7]:![X8]:![X9]:(((~(rdn_translate(X6,rdn_pos(X8)))|~(rdn_translate(X7,rdn_pos(X9))))|~(rdn_positive_less(X8,X9)))|less(X6,X7)),inference(variable_rename,[status(thm)],[464])).
% cnf(466,plain,(less(X1,X2)|~rdn_positive_less(X3,X4)|~rdn_translate(X2,rdn_pos(X4))|~rdn_translate(X1,rdn_pos(X3))),inference(split_conjunct,[status(thm)],[465])).
% cnf(868,negated_conjecture,(~less(n2,n3)),inference(split_conjunct,[status(thm)],[405])).
% cnf(1084,plain,(less(X1,n3)|~rdn_translate(X1,rdn_pos(X2))|~rdn_positive_less(X2,rdnn(n3))),inference(spm,[status(thm)],[466,421,theory(equality)])).
% cnf(31195,plain,(less(n2,n3)|~rdn_positive_less(rdnn(n2),rdnn(n3))),inference(spm,[status(thm)],[1084,423,theory(equality)])).
% cnf(31198,plain,(less(n2,n3)|$false),inference(rw,[status(thm)],[31195,406,theory(equality)])).
% cnf(31199,plain,(less(n2,n3)),inference(cn,[status(thm)],[31198,theory(equality)])).
% cnf(31200,plain,($false),inference(sr,[status(thm)],[31199,868,theory(equality)])).
% cnf(31201,plain,($false),31200,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2618
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 2617
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 30085
% # ...of the previous two non-trivial : 29950
% # Contextual simplify-reflections : 0
% # Paramodulations : 30081
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 2615
% # Positive orientable unit clauses: 2126
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 259
% # Non-unit-clauses : 230
% # Current number of unprocessed clauses: 27739
% # ...number of literals in the above : 42901
% # Clause-clause subsumption calls (NU) : 11163
% # Rec. Clause-clause subsumption calls : 11099
% # Unit Clause-clause subsumption calls : 22099
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 2909 leaves, 1.14+/-2.978 terms/leaf
% # Paramod-from index: 2129 leaves, 1.00+/-0.031 terms/leaf
% # Paramod-into index: 2792 leaves, 1.10+/-2.503 terms/leaf
% # -------------------------------------------------
% # User time : 0.559 s
% # System time : 0.038 s
% # Total time : 0.597 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.06 CPU 1.14 WC
% FINAL PrfWatch: 1.06 CPU 1.14 WC
% SZS output end Solution for /tmp/SystemOnTPTP4489/NUM290+1.tptp
%
%------------------------------------------------------------------------------