%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SYO561+1 : TPTP v5.3.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art03.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory   : 2005MB
% OS       : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec  4 01:31:20 EST 2011

% Result   : Theorem 0.56s
% Output   : Solution 0.56s
% 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/SystemOnTPTP22945/SYO561+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP22945/SYO561+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22945/SYO561+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.4/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=60 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC  time limit is 120s
% TreeLimitedRun: PID is 23059
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Garbage collection reclaimed 2 unused term cells.
% # Garbage collection reclaimed 1 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type UHPFGFFSF00SS
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <precrank20>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type UHPFGFFSF00SS
% # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # No equality, disabling AC handling.
% #
% # Initializing proof state
% # Presaturation interreduction done
% # Proof found!
% # SZS status Theorem
% # Parsed axioms                    : 1
% # Removed by relevancy pruning     : 0
% # Initial clauses                  : 1
% # Removed in clause preprocessing  : 0
% # Initial clauses in saturation    : 1
% # Processed clauses                : 1
% # ...of these trivial              : 0
% # ...subsumed                      : 0
% # ...remaining for further processing: 0
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                : 0
% # Backward-rewritten               : 0
% # Generated clauses                : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections  : 0
% # Paramodulations                  : 0
% # Factorizations                   : 0
% # Equation resolutions             : 0
% # Current number of processed clauses: 0
% #    Positive orientable unit clauses: 0
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses         : 0
% #    Non-unit-clauses              : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts      : 0
% # Indexed BW rewrite successes     : 0
% # Backwards rewriting index :     0 leaves,   0.00+/-0.000 terms/leaf
% # Paramod-from index    :     0 leaves,   0.00+/-0.000 terms/leaf
% # Paramod-into index    :     0 leaves,   0.00+/-0.000 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, conjecture,~("Apple"="Microsoft"),file('/tmp/SRASS.s.p', apple_not_microsoft)).
% fof(2, negated_conjecture,~(~("Apple"="Microsoft")),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,"Apple"="Microsoft",inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% cnf(4,negated_conjecture,("Apple"="Microsoft"),inference(split_conjunct,[status(thm)],[3])).
% cnf(5,negated_conjecture,($false),4,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.03 CPU 0.15 WC
% FINAL PrfWatch: 0.03 CPU 0.15 WC
% SZS output end Solution for /tmp/SystemOnTPTP22945/SYO561+1.tptp
% 
%------------------------------------------------------------------------------