%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU295+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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 03:10:37 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP25659/SEU295+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25659/SEU295+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25659/SEU295+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 25755
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(finite(X1)=>finite(set_intersection2(X1,X2))),file('/tmp/SRASS.s.p', fc11_finset_1)).
% fof(57, conjecture,![X1]:![X2]:(finite(X1)=>finite(set_intersection2(X1,X2))),file('/tmp/SRASS.s.p', t15_finset_1)).
% fof(58, negated_conjecture,~(![X1]:![X2]:(finite(X1)=>finite(set_intersection2(X1,X2)))),inference(assume_negation,[status(cth)],[57])).
% fof(71, plain,![X1]:![X2]:(~(finite(X1))|finite(set_intersection2(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(72, plain,![X3]:![X4]:(~(finite(X3))|finite(set_intersection2(X3,X4))),inference(variable_rename,[status(thm)],[71])).
% cnf(73,plain,(finite(set_intersection2(X1,X2))|~finite(X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(285, negated_conjecture,?[X1]:?[X2]:(finite(X1)&~(finite(set_intersection2(X1,X2)))),inference(fof_nnf,[status(thm)],[58])).
% fof(286, negated_conjecture,?[X3]:?[X4]:(finite(X3)&~(finite(set_intersection2(X3,X4)))),inference(variable_rename,[status(thm)],[285])).
% fof(287, negated_conjecture,(finite(esk20_0)&~(finite(set_intersection2(esk20_0,esk21_0)))),inference(skolemize,[status(esa)],[286])).
% cnf(288,negated_conjecture,(~finite(set_intersection2(esk20_0,esk21_0))),inference(split_conjunct,[status(thm)],[287])).
% cnf(289,negated_conjecture,(finite(esk20_0)),inference(split_conjunct,[status(thm)],[287])).
% cnf(488,negated_conjecture,(finite(set_intersection2(esk20_0,X1))),inference(pm,[status(thm)],[73,289,theory(equality)])).
% cnf(765,negated_conjecture,($false),inference(rw,[status(thm)],[288,488,theory(equality)])).
% cnf(766,negated_conjecture,($false),inference(cn,[status(thm)],[765,theory(equality)])).
% cnf(767,negated_conjecture,($false),766,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 198
% # ...of these trivial : 9
% # ...subsumed : 15
% # ...remaining for further processing: 174
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 44
% # Generated clauses : 283
% # ...of the previous two non-trivial : 202
% # Contextual simplify-reflections : 0
% # Paramodulations : 274
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 130
% # Positive orientable unit clauses: 69
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 12
% # Non-unit-clauses : 48
% # Current number of unprocessed clauses: 55
% # ...number of literals in the above : 95
% # Clause-clause subsumption calls (NU) : 47
% # Rec. Clause-clause subsumption calls : 40
% # Unit Clause-clause subsumption calls : 56
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 28
% # Indexed BW rewrite successes : 18
% # Backwards rewriting index: 139 leaves, 1.12+/-0.450 terms/leaf
% # Paramod-from index: 74 leaves, 1.03+/-0.231 terms/leaf
% # Paramod-into index: 127 leaves, 1.09+/-0.397 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.006 s
% # Total time : 0.029 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP25659/SEU295+1.tptp
%
%------------------------------------------------------------------------------