%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM295+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:33:52 EST 2010
% Result : Theorem 8.47s
% Output : Solution 8.47s
% 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/SystemOnTPTP9408/NUM295+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9408/NUM295+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9408/NUM295+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 9507
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.030 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(176, axiom,rdn_translate(nn59,rdn_neg(rdn(rdnn(n9),rdnn(n5)))),file('/tmp/SRASS.s.p', rdnn59)).
% fof(315, axiom,rdn_translate(n127,rdn_pos(rdn(rdnn(n7),rdn(rdnn(n2),rdnn(n1))))),file('/tmp/SRASS.s.p', rdn127)).
% fof(402, conjecture,?[X1]:?[X2]:less(X1,X2),file('/tmp/SRASS.s.p', something_less_something)).
% fof(403, negated_conjecture,~(?[X1]:?[X2]:less(X1,X2)),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(635,plain,(rdn_translate(nn59,rdn_neg(rdn(rdnn(n9),rdnn(n5))))),inference(split_conjunct,[status(thm)],[176])).
% cnf(774,plain,(rdn_translate(n127,rdn_pos(rdn(rdnn(n7),rdn(rdnn(n2),rdnn(n1)))))),inference(split_conjunct,[status(thm)],[315])).
% fof(867, negated_conjecture,![X1]:![X2]:~(less(X1,X2)),inference(fof_nnf,[status(thm)],[403])).
% fof(868, negated_conjecture,![X3]:![X4]:~(less(X3,X4)),inference(variable_rename,[status(thm)],[867])).
% cnf(869,negated_conjecture,(~less(X1,X2)),inference(split_conjunct,[status(thm)],[868])).
% cnf(1129,plain,(~rdn_translate(X2,rdn_pos(X3))|~rdn_translate(X1,rdn_neg(X4))),inference(sr,[status(thm)],[416,869,theory(equality)])).
% fof(1130, plain,(~(epred1_0)<=>![X3]:![X2]:~(rdn_translate(X2,rdn_pos(X3)))),introduced(definition),['split']).
% cnf(1131,plain,(epred1_0|~rdn_translate(X2,rdn_pos(X3))),inference(split_equiv,[status(thm)],[1130])).
% fof(1132, plain,(~(epred2_0)<=>![X4]:![X1]:~(rdn_translate(X1,rdn_neg(X4)))),introduced(definition),['split']).
% cnf(1133,plain,(epred2_0|~rdn_translate(X1,rdn_neg(X4))),inference(split_equiv,[status(thm)],[1132])).
% cnf(1134,plain,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[1129,1130,theory(equality)]),1132,theory(equality)]),['split']).
% cnf(9044,plain,(epred1_0),inference(spm,[status(thm)],[1131,774,theory(equality)])).
% cnf(9206,plain,(~epred2_0|$false),inference(rw,[status(thm)],[1134,9044,theory(equality)])).
% cnf(9207,plain,(~epred2_0),inference(cn,[status(thm)],[9206,theory(equality)])).
% cnf(9296,plain,(~rdn_translate(X1,rdn_neg(X4))),inference(sr,[status(thm)],[1133,9207,theory(equality)])).
% cnf(9424,plain,($false),inference(sr,[status(thm)],[635,9296,theory(equality)])).
% cnf(9425,plain,($false),9424,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 561
% # ...of these trivial : 0
% # ...subsumed : 8
% # ...remaining for further processing: 553
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 163
% # Generated clauses : 8457
% # ...of the previous two non-trivial : 8248
% # Contextual simplify-reflections : 0
% # Paramodulations : 8366
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 301
% # Positive orientable unit clauses: 282
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 3
% # Non-unit-clauses : 15
% # Current number of unprocessed clauses: 3996
% # ...number of literals in the above : 7017
% # Clause-clause subsumption calls (NU) : 24
% # Rec. Clause-clause subsumption calls : 12
% # Unit Clause-clause subsumption calls : 48
% # Rewrite failures with RHS unbound : 1398
% # Indexed BW rewrite attempts : 353
% # Indexed BW rewrite successes : 262
% # Backwards rewriting index: 510 leaves, 1.21+/-1.550 terms/leaf
% # Paramod-from index: 283 leaves, 1.00+/-0.059 terms/leaf
% # Paramod-into index: 505 leaves, 1.16+/-1.434 terms/leaf
% # -------------------------------------------------
% # User time : 0.155 s
% # System time : 0.017 s
% # Total time : 0.172 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.36 CPU 0.45 WC
% FINAL PrfWatch: 0.36 CPU 0.45 WC
% SZS output end Solution for /tmp/SystemOnTPTP9408/NUM295+1.tptp
%
%------------------------------------------------------------------------------