TSTP Solution File: NUM301+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM301+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 17:39:30 EST 2010
% Result : Theorem 8.46s
% Output : Solution 8.46s
% 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/SystemOnTPTP6586/NUM301+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6586/NUM301+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6586/NUM301+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 6718
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,rdn_translate(nn2,rdn_neg(rdnn(n2))),file('/tmp/SRASS.s.p', rdnn2)).
% fof(8, axiom,![X1]:![X2]:![X4]:![X5]:(((rdn_translate(X1,rdn_neg(X4))&rdn_translate(X2,rdn_neg(X5)))&rdn_positive_less(X5,X4))=>less(X1,X2)),file('/tmp/SRASS.s.p', less_entry_point_neg_neg)).
% fof(62, axiom,rdn_positive_less(rdnn(n2),rdnn(n3)),file('/tmp/SRASS.s.p', rdn_positive_less23)).
% fof(64, axiom,rdn_translate(nn3,rdn_neg(rdnn(n3))),file('/tmp/SRASS.s.p', rdnn3)).
% fof(402, conjecture,?[X1]:less(X1,nn2),file('/tmp/SRASS.s.p', something_less_nn2)).
% fof(403, negated_conjecture,~(?[X1]:less(X1,nn2)),inference(assume_negation,[status(cth)],[402])).
% cnf(417,plain,(rdn_translate(nn2,rdn_neg(rdnn(n2)))),inference(split_conjunct,[status(thm)],[4])).
% fof(427, plain,![X1]:![X2]:![X4]:![X5]:(((~(rdn_translate(X1,rdn_neg(X4)))|~(rdn_translate(X2,rdn_neg(X5))))|~(rdn_positive_less(X5,X4)))|less(X1,X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(428, plain,![X6]:![X7]:![X8]:![X9]:(((~(rdn_translate(X6,rdn_neg(X8)))|~(rdn_translate(X7,rdn_neg(X9))))|~(rdn_positive_less(X9,X8)))|less(X6,X7)),inference(variable_rename,[status(thm)],[427])).
% cnf(429,plain,(less(X1,X2)|~rdn_positive_less(X3,X4)|~rdn_translate(X2,rdn_neg(X3))|~rdn_translate(X1,rdn_neg(X4))),inference(split_conjunct,[status(thm)],[428])).
% cnf(508,plain,(rdn_positive_less(rdnn(n2),rdnn(n3))),inference(split_conjunct,[status(thm)],[62])).
% cnf(510,plain,(rdn_translate(nn3,rdn_neg(rdnn(n3)))),inference(split_conjunct,[status(thm)],[64])).
% fof(867, negated_conjecture,![X1]:~(less(X1,nn2)),inference(fof_nnf,[status(thm)],[403])).
% fof(868, negated_conjecture,![X2]:~(less(X2,nn2)),inference(variable_rename,[status(thm)],[867])).
% cnf(869,negated_conjecture,(~less(X1,nn2)),inference(split_conjunct,[status(thm)],[868])).
% cnf(1087,plain,(less(X1,nn2)|~rdn_translate(X1,rdn_neg(X2))|~rdn_positive_less(rdnn(n2),X2)),inference(spm,[status(thm)],[429,417,theory(equality)])).
% cnf(1088,plain,(~rdn_translate(X1,rdn_neg(X2))|~rdn_positive_less(rdnn(n2),X2)),inference(sr,[status(thm)],[1087,869,theory(equality)])).
% cnf(31233,plain,(~rdn_positive_less(rdnn(n2),rdnn(n3))),inference(spm,[status(thm)],[1088,510,theory(equality)])).
% cnf(31265,plain,($false),inference(rw,[status(thm)],[31233,508,theory(equality)])).
% cnf(31266,plain,($false),inference(cn,[status(thm)],[31265,theory(equality)])).
% cnf(31267,plain,($false),31266,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2618
% # ...of these trivial : 0
% # ...subsumed : 105
% # ...remaining for further processing: 2513
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 30269
% # ...of the previous two non-trivial : 30220
% # Contextual simplify-reflections : 0
% # Paramodulations : 30265
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 2511
% # Positive orientable unit clauses: 2159
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 120
% # Non-unit-clauses : 232
% # Current number of unprocessed clauses: 28009
% # ...number of literals in the above : 43046
% # Clause-clause subsumption calls (NU) : 30233
% # Rec. Clause-clause subsumption calls : 30214
% # Unit Clause-clause subsumption calls : 9000
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 2903 leaves, 1.14+/-2.979 terms/leaf
% # Paramod-from index: 2164 leaves, 1.00+/-0.030 terms/leaf
% # Paramod-into index: 2688 leaves, 1.10+/-2.549 terms/leaf
% # -------------------------------------------------
% # User time : 0.565 s
% # System time : 0.030 s
% # Total time : 0.595 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.04 CPU 1.11 WC
% FINAL PrfWatch: 1.04 CPU 1.11 WC
% SZS output end Solution for /tmp/SystemOnTPTP6586/NUM301+1.tptp
%
%------------------------------------------------------------------------------