%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET579+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 : art01.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:11:24 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP23963/SET579+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23963/SET579+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23963/SET579+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 24059
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(2, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(5, conjecture,![X1]:![X2]:![X3]:(![X4]:(member(X4,X1)<=>(member(X4,X2)&~(member(X4,X3))))=>X1=difference(X2,X3)),file('/tmp/SRASS.s.p', prove_th20)).
% fof(6, negated_conjecture,~(![X1]:![X2]:![X3]:(![X4]:(member(X4,X1)<=>(member(X4,X2)&~(member(X4,X3))))=>X1=difference(X2,X3))),inference(assume_negation,[status(cth)],[5])).
% fof(7, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(8, negated_conjecture,~(![X1]:![X2]:![X3]:(![X4]:(member(X4,X1)<=>(member(X4,X2)&~(member(X4,X3))))=>X1=difference(X2,X3))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(9, plain,![X1]:![X2]:![X3]:((~(member(X3,difference(X1,X2)))|(member(X3,X1)&~(member(X3,X2))))&((~(member(X3,X1))|member(X3,X2))|member(X3,difference(X1,X2)))),inference(fof_nnf,[status(thm)],[7])).
% fof(10, plain,![X4]:![X5]:![X6]:((~(member(X6,difference(X4,X5)))|(member(X6,X4)&~(member(X6,X5))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(variable_rename,[status(thm)],[9])).
% fof(11, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,difference(X4,X5))))&(~(member(X6,X5))|~(member(X6,difference(X4,X5)))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(distribute,[status(thm)],[10])).
% cnf(12,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[11])).
% cnf(13,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[11])).
% cnf(14,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[11])).
% fof(15, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(16, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[15])).
% fof(17, 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)],[16])).
% cnf(18,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[17])).
% fof(21, 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)],[3])).
% fof(22, 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)],[21])).
% fof(23, 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)],[22])).
% fof(24, 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)],[23])).
% fof(25, 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)],[24])).
% cnf(26,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(31, negated_conjecture,?[X1]:?[X2]:?[X3]:(![X4]:((~(member(X4,X1))|(member(X4,X2)&~(member(X4,X3))))&((~(member(X4,X2))|member(X4,X3))|member(X4,X1)))&~(X1=difference(X2,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(32, negated_conjecture,?[X5]:?[X6]:?[X7]:(![X8]:((~(member(X8,X5))|(member(X8,X6)&~(member(X8,X7))))&((~(member(X8,X6))|member(X8,X7))|member(X8,X5)))&~(X5=difference(X6,X7))),inference(variable_rename,[status(thm)],[31])).
% fof(33, negated_conjecture,(![X8]:((~(member(X8,esk2_0))|(member(X8,esk3_0)&~(member(X8,esk4_0))))&((~(member(X8,esk3_0))|member(X8,esk4_0))|member(X8,esk2_0)))&~(esk2_0=difference(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[32])).
% fof(34, negated_conjecture,![X8]:(((~(member(X8,esk2_0))|(member(X8,esk3_0)&~(member(X8,esk4_0))))&((~(member(X8,esk3_0))|member(X8,esk4_0))|member(X8,esk2_0)))&~(esk2_0=difference(esk3_0,esk4_0))),inference(shift_quantors,[status(thm)],[33])).
% fof(35, negated_conjecture,![X8]:((((member(X8,esk3_0)|~(member(X8,esk2_0)))&(~(member(X8,esk4_0))|~(member(X8,esk2_0))))&((~(member(X8,esk3_0))|member(X8,esk4_0))|member(X8,esk2_0)))&~(esk2_0=difference(esk3_0,esk4_0))),inference(distribute,[status(thm)],[34])).
% cnf(36,negated_conjecture,(esk2_0!=difference(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[35])).
% cnf(37,negated_conjecture,(member(X1,esk2_0)|member(X1,esk4_0)|~member(X1,esk3_0)),inference(split_conjunct,[status(thm)],[35])).
% cnf(38,negated_conjecture,(~member(X1,esk2_0)|~member(X1,esk4_0)),inference(split_conjunct,[status(thm)],[35])).
% cnf(39,negated_conjecture,(member(X1,esk3_0)|~member(X1,esk2_0)),inference(split_conjunct,[status(thm)],[35])).
% cnf(46,plain,(member(esk1_2(difference(X1,X2),X3),X1)|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[14,27,theory(equality)])).
% cnf(47,plain,(subset(difference(X1,X2),X3)|~member(esk1_2(difference(X1,X2),X3),X2)),inference(spm,[status(thm)],[13,27,theory(equality)])).
% cnf(52,plain,(subset(X1,difference(X2,X3))|member(esk1_2(X1,difference(X2,X3)),X3)|~member(esk1_2(X1,difference(X2,X3)),X2)),inference(spm,[status(thm)],[26,12,theory(equality)])).
% cnf(56,negated_conjecture,(subset(difference(X1,esk4_0),X2)|member(esk1_2(difference(X1,esk4_0),X2),esk2_0)|~member(esk1_2(difference(X1,esk4_0),X2),esk3_0)),inference(spm,[status(thm)],[47,37,theory(equality)])).
% cnf(69,negated_conjecture,(subset(difference(esk3_0,esk4_0),X1)|member(esk1_2(difference(esk3_0,esk4_0),X1),esk2_0)),inference(spm,[status(thm)],[56,46,theory(equality)])).
% cnf(208,negated_conjecture,(subset(X1,difference(esk3_0,X2))|member(esk1_2(X1,difference(esk3_0,X2)),X2)|~member(esk1_2(X1,difference(esk3_0,X2)),esk2_0)),inference(spm,[status(thm)],[52,39,theory(equality)])).
% cnf(651,negated_conjecture,(subset(difference(esk3_0,esk4_0),esk2_0)),inference(spm,[status(thm)],[26,69,theory(equality)])).
% cnf(654,negated_conjecture,(esk2_0=difference(esk3_0,esk4_0)|~subset(esk2_0,difference(esk3_0,esk4_0))),inference(spm,[status(thm)],[18,651,theory(equality)])).
% cnf(656,negated_conjecture,(~subset(esk2_0,difference(esk3_0,esk4_0))),inference(sr,[status(thm)],[654,36,theory(equality)])).
% cnf(1459,negated_conjecture,(subset(esk2_0,difference(esk3_0,X1))|member(esk1_2(esk2_0,difference(esk3_0,X1)),X1)),inference(spm,[status(thm)],[208,27,theory(equality)])).
% cnf(3644,negated_conjecture,(subset(esk2_0,difference(esk3_0,esk4_0))|~member(esk1_2(esk2_0,difference(esk3_0,esk4_0)),esk2_0)),inference(spm,[status(thm)],[38,1459,theory(equality)])).
% cnf(3671,negated_conjecture,(~member(esk1_2(esk2_0,difference(esk3_0,esk4_0)),esk2_0)),inference(sr,[status(thm)],[3644,656,theory(equality)])).
% cnf(3684,negated_conjecture,(subset(esk2_0,difference(esk3_0,esk4_0))),inference(spm,[status(thm)],[3671,27,theory(equality)])).
% cnf(3685,negated_conjecture,($false),inference(sr,[status(thm)],[3684,656,theory(equality)])).
% cnf(3686,negated_conjecture,($false),3685,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 494
% # ...of these trivial : 14
% # ...subsumed : 345
% # ...remaining for further processing: 135
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 21
% # Generated clauses : 2054
% # ...of the previous two non-trivial : 1227
% # Contextual simplify-reflections : 99
% # Paramodulations : 2048
% # Factorizations : 4
% # Equation resolutions : 2
% # Current number of processed clauses: 100
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 5
% # Non-unit-clauses : 68
% # Current number of unprocessed clauses: 648
% # ...number of literals in the above : 1835
% # Clause-clause subsumption calls (NU) : 1774
% # Rec. Clause-clause subsumption calls : 1383
% # Unit Clause-clause subsumption calls : 193
% # Rewrite failures with RHS unbound : 16
% # Indexed BW rewrite attempts : 96
% # Indexed BW rewrite successes : 18
% # Backwards rewriting index: 129 leaves, 1.80+/-2.535 terms/leaf
% # Paramod-from index: 40 leaves, 1.30+/-1.005 terms/leaf
% # Paramod-into index: 107 leaves, 1.62+/-1.616 terms/leaf
% # -------------------------------------------------
% # User time : 0.067 s
% # System time : 0.004 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.28 WC
% FINAL PrfWatch: 0.22 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP23963/SET579+3.tptp
%
%------------------------------------------------------------------------------