%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET627+3 : TPTP v5.0.0. Released v2.2.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 : Wed Dec 29 23:18:48 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/SystemOnTPTP30194/SET627+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP30194/SET627+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30194/SET627+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 30290
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_defn)).
% fof(2, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>~(intersect(X1,X2))),file('/tmp/SRASS.s.p', disjoint_defn)).
% fof(4, axiom,![X1]:![X2]:(intersect(X1,X2)<=>?[X3]:(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersect_defn)).
% fof(6, conjecture,![X1]:disjoint(X1,empty_set),file('/tmp/SRASS.s.p', prove_th104)).
% fof(7, negated_conjecture,~(![X1]:disjoint(X1,empty_set)),inference(assume_negation,[status(cth)],[6])).
% fof(8, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(9, plain,![X1]:![X2]:(disjoint(X1,X2)<=>~(intersect(X1,X2))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(11, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[8])).
% cnf(12,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[11])).
% fof(13, plain,![X1]:![X2]:((~(disjoint(X1,X2))|~(intersect(X1,X2)))&(intersect(X1,X2)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(14, plain,![X3]:![X4]:((~(disjoint(X3,X4))|~(intersect(X3,X4)))&(intersect(X3,X4)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[13])).
% cnf(15,plain,(disjoint(X1,X2)|intersect(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% fof(20, plain,![X1]:![X2]:((~(intersect(X1,X2))|?[X3]:(member(X3,X1)&member(X3,X2)))&(![X3]:(~(member(X3,X1))|~(member(X3,X2)))|intersect(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(21, plain,![X4]:![X5]:((~(intersect(X4,X5))|?[X6]:(member(X6,X4)&member(X6,X5)))&(![X7]:(~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))),inference(variable_rename,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:((~(intersect(X4,X5))|(member(esk1_2(X4,X5),X4)&member(esk1_2(X4,X5),X5)))&(![X7]:(~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))),inference(skolemize,[status(esa)],[21])).
% fof(23, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&(~(intersect(X4,X5))|(member(esk1_2(X4,X5),X4)&member(esk1_2(X4,X5),X5)))),inference(shift_quantors,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&((member(esk1_2(X4,X5),X4)|~(intersect(X4,X5)))&(member(esk1_2(X4,X5),X5)|~(intersect(X4,X5))))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(member(esk1_2(X1,X2),X2)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(34, negated_conjecture,?[X1]:~(disjoint(X1,empty_set)),inference(fof_nnf,[status(thm)],[7])).
% fof(35, negated_conjecture,?[X2]:~(disjoint(X2,empty_set)),inference(variable_rename,[status(thm)],[34])).
% fof(36, negated_conjecture,~(disjoint(esk3_0,empty_set)),inference(skolemize,[status(esa)],[35])).
% cnf(37,negated_conjecture,(~disjoint(esk3_0,empty_set)),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,negated_conjecture,(intersect(esk3_0,empty_set)),inference(spm,[status(thm)],[37,15,theory(equality)])).
% cnf(40,plain,(~intersect(X1,empty_set)),inference(spm,[status(thm)],[12,25,theory(equality)])).
% cnf(54,negated_conjecture,($false),inference(sr,[status(thm)],[38,40,theory(equality)])).
% cnf(55,negated_conjecture,($false),54,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 26
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 26
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 16
% # ...of the previous two non-trivial : 12
% # Contextual simplify-reflections : 0
% # Paramodulations : 15
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 15
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 10
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 13
% # Clause-clause subsumption calls (NU) : 7
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 16 leaves, 1.38+/-0.696 terms/leaf
% # Paramod-from index: 7 leaves, 1.14+/-0.350 terms/leaf
% # Paramod-into index: 15 leaves, 1.27+/-0.442 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.004 s
% # Total time : 0.013 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/SystemOnTPTP30194/SET627+3.tptp
%
%------------------------------------------------------------------------------