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

% Computer : art02.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 : Thu Dec 30 09:23:44 EST 2010

% Result   : Theorem 0.87s
% Output   : Solution 0.87s
% 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/SystemOnTPTP10894/SYN346+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP10894/SYN346+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10894/SYN346+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 10990
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time   : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,![X1]:![X2]:?[X3]:?[X4]:![X5]:![X6]:(big_f(X2,X5)=>(big_f(X3,X6)=>((big_f(X3,X5)&big_f(X4,X5))|(big_f(X2,X6)&big_f(X4,X6))))),file('/tmp/SRASS.s.p', church_46_17_2)).
% fof(2, negated_conjecture,~(![X1]:![X2]:?[X3]:?[X4]:![X5]:![X6]:(big_f(X2,X5)=>(big_f(X3,X6)=>((big_f(X3,X5)&big_f(X4,X5))|(big_f(X2,X6)&big_f(X4,X6)))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,?[X1]:?[X2]:![X3]:![X4]:?[X5]:?[X6]:(big_f(X2,X5)&(big_f(X3,X6)&((~(big_f(X3,X5))|~(big_f(X4,X5)))&(~(big_f(X2,X6))|~(big_f(X4,X6)))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,?[X7]:?[X8]:![X9]:![X10]:?[X11]:?[X12]:(big_f(X8,X11)&(big_f(X9,X12)&((~(big_f(X9,X11))|~(big_f(X10,X11)))&(~(big_f(X8,X12))|~(big_f(X10,X12)))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,![X9]:![X10]:(big_f(esk2_0,esk3_2(X9,X10))&(big_f(X9,esk4_2(X9,X10))&((~(big_f(X9,esk3_2(X9,X10)))|~(big_f(X10,esk3_2(X9,X10))))&(~(big_f(esk2_0,esk4_2(X9,X10)))|~(big_f(X10,esk4_2(X9,X10))))))),inference(skolemize,[status(esa)],[4])).
% cnf(6,negated_conjecture,(~big_f(X1,esk4_2(X2,X1))|~big_f(esk2_0,esk4_2(X2,X1))),inference(split_conjunct,[status(thm)],[5])).
% cnf(8,negated_conjecture,(big_f(X1,esk4_2(X1,X2))),inference(split_conjunct,[status(thm)],[5])).
% cnf(10,negated_conjecture,(~big_f(X1,esk4_2(esk2_0,X1))),inference(spm,[status(thm)],[6,8,theory(equality)])).
% cnf(12,negated_conjecture,($false),inference(spm,[status(thm)],[10,8,theory(equality)])).
% cnf(13,negated_conjecture,($false),12,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                : 9
% # ...of these trivial              : 0
% # ...subsumed                      : 0
% # ...remaining for further processing: 9
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                : 0
% # Backward-rewritten               : 0
% # Generated clauses                : 3
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections  : 0
% # Paramodulations                  : 3
% # Factorizations                   : 0
% # Equation resolutions             : 0
% # Current number of processed clauses: 5
% #    Positive orientable unit clauses: 2
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses         : 1
% #    Non-unit-clauses              : 2
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts      : 0
% # Indexed BW rewrite successes     : 0
% # Backwards rewriting index:    10 leaves,   1.20+/-0.400 terms/leaf
% # Paramod-from index:            2 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            9 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time            : 0.005 s
% # System time          : 0.005 s
% # Total time           : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP10894/SYN346+1.tptp
% 
%------------------------------------------------------------------------------