%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU295+3 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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:59 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP6465/SEU295+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6465/SEU295+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6465/SEU295+3.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 6561
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.016 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(62, conjecture,![X1]:![X2]:(finite(X1)=>finite(set_intersection2(X1,X2))),file('/tmp/SRASS.s.p', t15_finset_1)).
% fof(63, negated_conjecture,~(![X1]:![X2]:(finite(X1)=>finite(set_intersection2(X1,X2)))),inference(assume_negation,[status(cth)],[62])).
% fof(78, plain,![X1]:![X2]:(~(finite(X1))|finite(set_intersection2(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(79, plain,![X3]:![X4]:(~(finite(X3))|finite(set_intersection2(X3,X4))),inference(variable_rename,[status(thm)],[78])).
% cnf(80,plain,(finite(set_intersection2(X1,X2))|~finite(X1)),inference(split_conjunct,[status(thm)],[79])).
% fof(338, negated_conjecture,?[X1]:?[X2]:(finite(X1)&~(finite(set_intersection2(X1,X2)))),inference(fof_nnf,[status(thm)],[63])).
% fof(339, negated_conjecture,?[X3]:?[X4]:(finite(X3)&~(finite(set_intersection2(X3,X4)))),inference(variable_rename,[status(thm)],[338])).
% fof(340, negated_conjecture,(finite(esk27_0)&~(finite(set_intersection2(esk27_0,esk28_0)))),inference(skolemize,[status(esa)],[339])).
% cnf(341,negated_conjecture,(~finite(set_intersection2(esk27_0,esk28_0))),inference(split_conjunct,[status(thm)],[340])).
% cnf(342,negated_conjecture,(finite(esk27_0)),inference(split_conjunct,[status(thm)],[340])).
% cnf(618,negated_conjecture,(finite(set_intersection2(esk27_0,X1))),inference(pm,[status(thm)],[80,342,theory(equality)])).
% cnf(1007,negated_conjecture,($false),inference(rw,[status(thm)],[341,618,theory(equality)])).
% cnf(1008,negated_conjecture,($false),inference(cn,[status(thm)],[1007,theory(equality)])).
% cnf(1009,negated_conjecture,($false),1008,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 279
% # ...of these trivial : 23
% # ...subsumed : 23
% # ...remaining for further processing: 233
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 59
% # Generated clauses : 377
% # ...of the previous two non-trivial : 272
% # Contextual simplify-reflections : 0
% # Paramodulations : 368
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 174
% # Positive orientable unit clauses: 101
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 16
% # Non-unit-clauses : 56
% # Current number of unprocessed clauses: 71
% # ...number of literals in the above : 116
% # Clause-clause subsumption calls (NU) : 71
% # Rec. Clause-clause subsumption calls : 66
% # Unit Clause-clause subsumption calls : 84
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 33
% # Indexed BW rewrite successes : 21
% # Backwards rewriting index: 198 leaves, 1.09+/-0.386 terms/leaf
% # Paramod-from index: 105 leaves, 1.03+/-0.216 terms/leaf
% # Paramod-into index: 179 leaves, 1.06+/-0.337 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.004 s
% # Total time : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP6465/SEU295+3.tptp
%
%------------------------------------------------------------------------------