## TSTP Solution File: SYN721+1 by SRASS---0.1

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SYN721+1 : TPTP v5.0.0. Released v2.5.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 : Thu Dec 30 10:03:34 EST 2010

% Result   : Theorem 1.10s
% Output   : Solution 1.10s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ...
% found
% SZS status THM for /tmp/SystemOnTPTP5898/SYN721+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5898/SYN721+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 6030
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time   : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(((r(a,b)&![X1]:(?[X2]:r(X1,X2)=>q(X1,X1)))&![X3]:![X4]:(q(X3,X4)=>![X5]:r(X5,X4)))=>?[X6]:(r(b,X6)&q(X6,a))),file('/tmp/SRASS.s.p', lx1)).
% fof(2, negated_conjecture,~((((r(a,b)&![X1]:(?[X2]:r(X1,X2)=>q(X1,X1)))&![X3]:![X4]:(q(X3,X4)=>![X5]:r(X5,X4)))=>?[X6]:(r(b,X6)&q(X6,a)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,(((r(a,b)&![X1]:(![X2]:~(r(X1,X2))|q(X1,X1)))&![X3]:![X4]:(~(q(X3,X4))|![X5]:r(X5,X4)))&![X6]:(~(r(b,X6))|~(q(X6,a)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,(((r(a,b)&![X7]:(![X8]:~(r(X7,X8))|q(X7,X7)))&![X9]:![X10]:(~(q(X9,X10))|![X11]:r(X11,X10)))&![X12]:(~(r(b,X12))|~(q(X12,a)))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((~(r(b,X12))|~(q(X12,a)))&((r(X11,X10)|~(q(X9,X10)))&((~(r(X7,X8))|q(X7,X7))&r(a,b)))),inference(shift_quantors,[status(thm)],[4])).
% cnf(6,negated_conjecture,(r(a,b)),inference(split_conjunct,[status(thm)],[5])).
% cnf(7,negated_conjecture,(q(X1,X1)|~r(X1,X2)),inference(split_conjunct,[status(thm)],[5])).
% cnf(8,negated_conjecture,(r(X3,X2)|~q(X1,X2)),inference(split_conjunct,[status(thm)],[5])).
% cnf(9,negated_conjecture,(~q(X1,a)|~r(b,X1)),inference(split_conjunct,[status(thm)],[5])).
% cnf(10,negated_conjecture,(q(a,a)),inference(spm,[status(thm)],[7,6,theory(equality)])).
% cnf(11,negated_conjecture,(r(X1,a)),inference(spm,[status(thm)],[8,10,theory(equality)])).
% cnf(12,negated_conjecture,(~r(b,a)),inference(spm,[status(thm)],[9,10,theory(equality)])).
% cnf(14,negated_conjecture,(\$false),inference(rw,[status(thm)],[12,11,theory(equality)])).
% cnf(15,negated_conjecture,(\$false),inference(cn,[status(thm)],[14,theory(equality)])).
% cnf(16,negated_conjecture,(\$false),15,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                : 11
% # ...of these trivial              : 0
% # ...subsumed                      : 0
% # ...remaining for further processing: 11
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                : 0
% # Backward-rewritten               : 1
% # Generated clauses                : 4
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections  : 0
% # Paramodulations                  : 4
% # Factorizations                   : 0
% # Equation resolutions             : 0
% # Current number of processed clauses: 6
% #    Positive orientable unit clauses: 3
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses         : 0
% #    Non-unit-clauses              : 3
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts      : 1
% # Indexed BW rewrite successes     : 1
% # Backwards rewriting index:    10 leaves,   1.10+/-0.300 terms/leaf
% # Paramod-from index:            3 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            8 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time            : 0.007 s
% # System time          : 0.003 s
% # Total time           : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP5898/SYN721+1.tptp
%
%------------------------------------------------------------------------------
```