%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN397+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 : art06.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:28:52 EST 2010
% Result : Theorem 0.86s
% Output : Solution 0.86s
% 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/SystemOnTPTP11525/SYN397+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP11525/SYN397+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11525/SYN397+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 11621
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(~(?[X1]:f(X1))<=>![X2]:~(f(X2))),file('/tmp/SRASS.s.p', kalish204)).
% fof(2, negated_conjecture,~((~(?[X1]:f(X1))<=>![X2]:~(f(X2)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~((~(?[X1]:f(X1))<=>![X2]:~(f(X2)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,((?[X1]:f(X1)|?[X2]:f(X2))&(![X1]:~(f(X1))|![X2]:~(f(X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,((?[X3]:f(X3)|?[X4]:f(X4))&(![X5]:~(f(X5))|![X6]:~(f(X6)))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,((f(esk1_0)|f(esk2_0))&(![X5]:~(f(X5))|![X6]:~(f(X6)))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X5]:![X6]:((~(f(X6))|~(f(X5)))&(f(esk1_0)|f(esk2_0))),inference(shift_quantors,[status(thm)],[6])).
% cnf(8,negated_conjecture,(f(esk2_0)|f(esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(~f(X1)|~f(X2)),inference(split_conjunct,[status(thm)],[7])).
% fof(10, plain,(~(epred1_0)<=>![X2]:~(f(X2))),introduced(definition),['split']).
% cnf(11,plain,(epred1_0|~f(X2)),inference(split_equiv,[status(thm)],[10])).
% fof(12, plain,(~(epred2_0)<=>![X1]:~(f(X1))),introduced(definition),['split']).
% cnf(13,plain,(epred2_0|~f(X1)),inference(split_equiv,[status(thm)],[12])).
% cnf(14,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[9,10,theory(equality)]),12,theory(equality)]),['split']).
% cnf(15,negated_conjecture,(epred1_0|f(esk1_0)),inference(spm,[status(thm)],[11,8,theory(equality)])).
% cnf(16,negated_conjecture,(epred2_0|f(esk1_0)),inference(spm,[status(thm)],[13,8,theory(equality)])).
% cnf(17,negated_conjecture,(epred1_0),inference(csr,[status(thm)],[15,11])).
% cnf(19,negated_conjecture,(~epred2_0|$false),inference(rw,[status(thm)],[14,17,theory(equality)])).
% cnf(20,negated_conjecture,(~epred2_0),inference(cn,[status(thm)],[19,theory(equality)])).
% cnf(21,negated_conjecture,(f(esk1_0)),inference(sr,[status(thm)],[16,20,theory(equality)])).
% cnf(22,negated_conjecture,(epred2_0),inference(spm,[status(thm)],[13,21,theory(equality)])).
% cnf(24,negated_conjecture,($false),inference(sr,[status(thm)],[22,20,theory(equality)])).
% cnf(25,negated_conjecture,($false),24,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 12
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 12
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 6
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 1
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 4
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 5 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.006 s
% # System time : 0.005 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.17 WC
% FINAL PrfWatch: 0.08 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP11525/SYN397+1.tptp
%
%------------------------------------------------------------------------------