%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET632+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:19:31 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP30712/SET632+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP30712/SET632+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30712/SET632+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 30808
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(3, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_defn)).
% fof(4, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>~(intersect(X1,X2))),file('/tmp/SRASS.s.p', disjoint_defn)).
% fof(5, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(6, axiom,![X1]:![X2]:(intersect(X1,X2)=>intersect(X2,X1)),file('/tmp/SRASS.s.p', symmetry_of_intersect)).
% fof(7, axiom,![X1]:![X2]:(intersect(X1,X2)<=>?[X3]:(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersect_defn)).
% fof(8, axiom,![X1]:(empty(X1)<=>![X2]:~(member(X2,X1))),file('/tmp/SRASS.s.p', empty_defn)).
% fof(9, conjecture,![X1]:![X2]:![X3]:(((subset(X1,X2)&subset(X1,X3))&disjoint(X2,X3))=>X1=empty_set),file('/tmp/SRASS.s.p', prove_th114)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:(((subset(X1,X2)&subset(X1,X3))&disjoint(X2,X3))=>X1=empty_set)),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(12, plain,![X1]:![X2]:(disjoint(X1,X2)<=>~(intersect(X1,X2))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(13, plain,![X1]:(empty(X1)<=>![X2]:~(member(X2,X1))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(14, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(15, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[14])).
% fof(16, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[15])).
% cnf(17,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[16])).
% fof(22, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[11])).
% cnf(23,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X1]:![X2]:((~(disjoint(X1,X2))|~(intersect(X1,X2)))&(intersect(X1,X2)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(25, plain,![X3]:![X4]:((~(disjoint(X3,X4))|~(intersect(X3,X4)))&(intersect(X3,X4)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[24])).
% cnf(27,plain,(~intersect(X1,X2)|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(28, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(29, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[31])).
% cnf(34,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(35,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(36, plain,![X1]:![X2]:(~(intersect(X1,X2))|intersect(X2,X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(37, plain,![X3]:![X4]:(~(intersect(X3,X4))|intersect(X4,X3)),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(intersect(X1,X2)|~intersect(X2,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, 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)],[7])).
% fof(40, 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)],[39])).
% fof(41, plain,![X4]:![X5]:((~(intersect(X4,X5))|(member(esk2_2(X4,X5),X4)&member(esk2_2(X4,X5),X5)))&(![X7]:(~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))),inference(skolemize,[status(esa)],[40])).
% fof(42, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&(~(intersect(X4,X5))|(member(esk2_2(X4,X5),X4)&member(esk2_2(X4,X5),X5)))),inference(shift_quantors,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&((member(esk2_2(X4,X5),X4)|~(intersect(X4,X5)))&(member(esk2_2(X4,X5),X5)|~(intersect(X4,X5))))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(member(esk2_2(X1,X2),X2)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,plain,(member(esk2_2(X1,X2),X1)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[43])).
% cnf(46,plain,(intersect(X1,X2)|~member(X3,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(47, plain,![X1]:((~(empty(X1))|![X2]:~(member(X2,X1)))&(?[X2]:member(X2,X1)|empty(X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(48, plain,![X3]:((~(empty(X3))|![X4]:~(member(X4,X3)))&(?[X5]:member(X5,X3)|empty(X3))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X3]:((~(empty(X3))|![X4]:~(member(X4,X3)))&(member(esk3_1(X3),X3)|empty(X3))),inference(skolemize,[status(esa)],[48])).
% fof(50, plain,![X3]:![X4]:((~(member(X4,X3))|~(empty(X3)))&(member(esk3_1(X3),X3)|empty(X3))),inference(shift_quantors,[status(thm)],[49])).
% cnf(51,plain,(empty(X1)|member(esk3_1(X1),X1)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(~empty(X1)|~member(X2,X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(53, negated_conjecture,?[X1]:?[X2]:?[X3]:(((subset(X1,X2)&subset(X1,X3))&disjoint(X2,X3))&~(X1=empty_set)),inference(fof_nnf,[status(thm)],[10])).
% fof(54, negated_conjecture,?[X4]:?[X5]:?[X6]:(((subset(X4,X5)&subset(X4,X6))&disjoint(X5,X6))&~(X4=empty_set)),inference(variable_rename,[status(thm)],[53])).
% fof(55, negated_conjecture,(((subset(esk4_0,esk5_0)&subset(esk4_0,esk6_0))&disjoint(esk5_0,esk6_0))&~(esk4_0=empty_set)),inference(skolemize,[status(esa)],[54])).
% cnf(56,negated_conjecture,(esk4_0!=empty_set),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,negated_conjecture,(disjoint(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[55])).
% cnf(58,negated_conjecture,(subset(esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[55])).
% cnf(59,negated_conjecture,(subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[55])).
% cnf(65,negated_conjecture,(~intersect(esk5_0,esk6_0)),inference(spm,[status(thm)],[27,57,theory(equality)])).
% cnf(70,plain,(subset(empty_set,X1)),inference(spm,[status(thm)],[23,34,theory(equality)])).
% cnf(71,plain,(subset(X1,X2)|~empty(X1)),inference(spm,[status(thm)],[52,34,theory(equality)])).
% cnf(75,plain,(~empty(X1)|~intersect(X2,X1)),inference(spm,[status(thm)],[52,44,theory(equality)])).
% cnf(76,negated_conjecture,(member(X1,esk6_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[35,58,theory(equality)])).
% cnf(77,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[35,59,theory(equality)])).
% cnf(80,plain,(~empty(X1)|~intersect(X1,X2)),inference(spm,[status(thm)],[52,45,theory(equality)])).
% cnf(81,plain,(intersect(X1,X2)|empty(X2)|~member(esk3_1(X2),X1)),inference(spm,[status(thm)],[46,51,theory(equality)])).
% cnf(82,plain,(intersect(X1,X2)|~member(esk2_2(X3,X2),X1)|~intersect(X3,X2)),inference(spm,[status(thm)],[46,44,theory(equality)])).
% cnf(97,negated_conjecture,(empty(X1)|intersect(esk6_0,X1)|~member(esk3_1(X1),esk4_0)),inference(spm,[status(thm)],[81,76,theory(equality)])).
% cnf(98,negated_conjecture,(empty(X1)|intersect(esk5_0,X1)|~member(esk3_1(X1),esk4_0)),inference(spm,[status(thm)],[81,77,theory(equality)])).
% cnf(99,plain,(empty(X1)|intersect(X1,X1)),inference(spm,[status(thm)],[81,51,theory(equality)])).
% cnf(105,plain,(subset(X1,X2)|intersect(X1,X1)),inference(spm,[status(thm)],[71,99,theory(equality)])).
% cnf(106,plain,(X1=X2|intersect(X2,X2)|~subset(X1,X2)),inference(spm,[status(thm)],[17,105,theory(equality)])).
% cnf(115,negated_conjecture,(intersect(esk6_0,X1)|~intersect(X2,X1)|~member(esk2_2(X2,X1),esk4_0)),inference(spm,[status(thm)],[82,76,theory(equality)])).
% cnf(186,plain,(empty_set=X1|intersect(X1,X1)),inference(spm,[status(thm)],[106,70,theory(equality)])).
% cnf(190,plain,(empty_set=X1|~empty(X1)),inference(spm,[status(thm)],[80,186,theory(equality)])).
% cnf(243,negated_conjecture,(empty(esk4_0)|intersect(esk6_0,esk4_0)),inference(spm,[status(thm)],[97,51,theory(equality)])).
% cnf(245,negated_conjecture,(empty_set=esk4_0|intersect(esk6_0,esk4_0)),inference(spm,[status(thm)],[190,243,theory(equality)])).
% cnf(246,negated_conjecture,(intersect(esk6_0,esk4_0)),inference(sr,[status(thm)],[245,56,theory(equality)])).
% cnf(249,negated_conjecture,(~empty(esk4_0)),inference(spm,[status(thm)],[75,246,theory(equality)])).
% cnf(260,negated_conjecture,(empty(esk4_0)|intersect(esk5_0,esk4_0)),inference(spm,[status(thm)],[98,51,theory(equality)])).
% cnf(269,negated_conjecture,(intersect(esk5_0,esk4_0)),inference(sr,[status(thm)],[260,249,theory(equality)])).
% cnf(271,negated_conjecture,(intersect(esk4_0,esk5_0)),inference(spm,[status(thm)],[38,269,theory(equality)])).
% cnf(311,negated_conjecture,(intersect(esk6_0,X1)|~intersect(esk4_0,X1)),inference(spm,[status(thm)],[115,45,theory(equality)])).
% cnf(318,negated_conjecture,(intersect(X1,esk6_0)|~intersect(esk4_0,X1)),inference(spm,[status(thm)],[38,311,theory(equality)])).
% cnf(327,negated_conjecture,(intersect(esk5_0,esk6_0)),inference(spm,[status(thm)],[318,271,theory(equality)])).
% cnf(334,negated_conjecture,($false),inference(sr,[status(thm)],[327,65,theory(equality)])).
% cnf(335,negated_conjecture,($false),334,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 151
% # ...of these trivial : 0
% # ...subsumed : 51
% # ...remaining for further processing: 100
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 11
% # Generated clauses : 217
% # ...of the previous two non-trivial : 167
% # Contextual simplify-reflections : 2
% # Paramodulations : 213
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 67
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 46
% # Current number of unprocessed clauses: 51
% # ...number of literals in the above : 190
% # Clause-clause subsumption calls (NU) : 253
% # Rec. Clause-clause subsumption calls : 234
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 55 leaves, 1.45+/-1.203 terms/leaf
% # Paramod-from index: 23 leaves, 1.17+/-0.379 terms/leaf
% # Paramod-into index: 48 leaves, 1.35+/-0.878 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.004 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP30712/SET632+3.tptp
%
%------------------------------------------------------------------------------