%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET911+1 : TPTP v5.0.0. Released v3.2.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 00:18:13 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/SystemOnTPTP3460/SET911+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP3460/SET911+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3460/SET911+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 3556
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:(in(X1,X2)=>set_intersection2(X2,singleton(X1))=singleton(X1)),file('/tmp/SRASS.s.p', l32_zfmisc_1)).
% fof(7, conjecture,![X1]:![X2]:(in(X1,X2)=>set_intersection2(X2,singleton(X1))=singleton(X1)),file('/tmp/SRASS.s.p', t52_zfmisc_1)).
% fof(8, negated_conjecture,~(![X1]:![X2]:(in(X1,X2)=>set_intersection2(X2,singleton(X1))=singleton(X1))),inference(assume_negation,[status(cth)],[7])).
% fof(18, plain,![X1]:![X2]:(~(in(X1,X2))|set_intersection2(X2,singleton(X1))=singleton(X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(19, plain,![X3]:![X4]:(~(in(X3,X4))|set_intersection2(X4,singleton(X3))=singleton(X3)),inference(variable_rename,[status(thm)],[18])).
% cnf(20,plain,(set_intersection2(X1,singleton(X2))=singleton(X2)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(27, negated_conjecture,?[X1]:?[X2]:(in(X1,X2)&~(set_intersection2(X2,singleton(X1))=singleton(X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(28, negated_conjecture,?[X3]:?[X4]:(in(X3,X4)&~(set_intersection2(X4,singleton(X3))=singleton(X3))),inference(variable_rename,[status(thm)],[27])).
% fof(29, negated_conjecture,(in(esk3_0,esk4_0)&~(set_intersection2(esk4_0,singleton(esk3_0))=singleton(esk3_0))),inference(skolemize,[status(esa)],[28])).
% cnf(30,negated_conjecture,(set_intersection2(esk4_0,singleton(esk3_0))!=singleton(esk3_0)),inference(split_conjunct,[status(thm)],[29])).
% cnf(31,negated_conjecture,(in(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[29])).
% cnf(37,negated_conjecture,(~in(esk3_0,esk4_0)),inference(spm,[status(thm)],[30,20,theory(equality)])).
% cnf(40,negated_conjecture,($false),inference(rw,[status(thm)],[37,31,theory(equality)])).
% cnf(41,negated_conjecture,($false),inference(cn,[status(thm)],[40,theory(equality)])).
% cnf(42,negated_conjecture,($false),41,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 15
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 15
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 6
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 0
% # Paramodulations : 6
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 7
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 12 leaves, 1.25+/-0.595 terms/leaf
% # Paramod-from index: 4 leaves, 1.50+/-0.866 terms/leaf
% # Paramod-into index: 11 leaves, 1.18+/-0.575 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.002 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP3460/SET911+1.tptp
%
%------------------------------------------------------------------------------