%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU295+2 : 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:48 EST 2010
% Result : Theorem 8.34s
% Output : Solution 8.34s
% 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/SystemOnTPTP25918/SEU295+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25918/SEU295+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25918/SEU295+2.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 26014
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.168 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(30, axiom,![X1]:![X2]:set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2),file('/tmp/SRASS.s.p', t48_xboole_1)).
% fof(398, conjecture,![X1]:![X2]:(finite(X1)=>finite(set_intersection2(X1,X2))),file('/tmp/SRASS.s.p', t15_finset_1)).
% fof(399, negated_conjecture,~(![X1]:![X2]:(finite(X1)=>finite(set_intersection2(X1,X2)))),inference(assume_negation,[status(cth)],[398])).
% fof(454, plain,![X1]:![X2]:(~(finite(X1))|finite(set_intersection2(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(455, plain,![X3]:![X4]:(~(finite(X3))|finite(set_intersection2(X3,X4))),inference(variable_rename,[status(thm)],[454])).
% cnf(456,plain,(finite(set_intersection2(X1,X2))|~finite(X1)),inference(split_conjunct,[status(thm)],[455])).
% fof(554, plain,![X3]:![X4]:set_difference(X3,set_difference(X3,X4))=set_intersection2(X3,X4),inference(variable_rename,[status(thm)],[30])).
% cnf(555,plain,(set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2)),inference(split_conjunct,[status(thm)],[554])).
% fof(2971, negated_conjecture,?[X1]:?[X2]:(finite(X1)&~(finite(set_intersection2(X1,X2)))),inference(fof_nnf,[status(thm)],[399])).
% fof(2972, negated_conjecture,?[X3]:?[X4]:(finite(X3)&~(finite(set_intersection2(X3,X4)))),inference(variable_rename,[status(thm)],[2971])).
% fof(2973, negated_conjecture,(finite(esk257_0)&~(finite(set_intersection2(esk257_0,esk258_0)))),inference(skolemize,[status(esa)],[2972])).
% cnf(2974,negated_conjecture,(~finite(set_intersection2(esk257_0,esk258_0))),inference(split_conjunct,[status(thm)],[2973])).
% cnf(2975,negated_conjecture,(finite(esk257_0)),inference(split_conjunct,[status(thm)],[2973])).
% cnf(3142,plain,(finite(set_difference(X1,set_difference(X1,X2)))|~finite(X1)),inference(rw,[status(thm)],[456,555,theory(equality)]),['unfolding']).
% cnf(3157,negated_conjecture,(~finite(set_difference(esk257_0,set_difference(esk257_0,esk258_0)))),inference(rw,[status(thm)],[2974,555,theory(equality)]),['unfolding']).
% cnf(4245,negated_conjecture,(~finite(esk257_0)),inference(spm,[status(thm)],[3157,3142,theory(equality)])).
% cnf(4252,negated_conjecture,($false),inference(rw,[status(thm)],[4245,2975,theory(equality)])).
% cnf(4253,negated_conjecture,($false),inference(cn,[status(thm)],[4252,theory(equality)])).
% cnf(4254,negated_conjecture,($false),4253,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1635
% # ...of these trivial : 8
% # ...subsumed : 65
% # ...remaining for further processing: 1562
% # Other redundant clauses eliminated : 141
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 145
% # ...of the previous two non-trivial : 123
% # Contextual simplify-reflections : 180
% # Paramodulations : 39
% # Factorizations : 0
% # Equation resolutions : 141
% # Current number of processed clauses: 83
% # Positive orientable unit clauses: 66
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 8
% # Current number of unprocessed clauses: 1308
% # ...number of literals in the above : 5576
% # Clause-clause subsumption calls (NU) : 423956
% # Rec. Clause-clause subsumption calls : 20790
% # Unit Clause-clause subsumption calls : 55
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 26
% # Indexed BW rewrite successes : 15
% # Backwards rewriting index: 107 leaves, 1.02+/-0.135 terms/leaf
% # Paramod-from index: 69 leaves, 1.01+/-0.120 terms/leaf
% # Paramod-into index: 104 leaves, 1.01+/-0.098 terms/leaf
% # -------------------------------------------------
% # User time : 0.748 s
% # System time : 0.015 s
% # Total time : 0.763 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.09 CPU 1.17 WC
% FINAL PrfWatch: 1.09 CPU 1.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP25918/SEU295+2.tptp
%
%------------------------------------------------------------------------------