TSTP Solution File: SET587+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET587+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 : art07.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:12:40 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP27655/SET587+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP27655/SET587+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27655/SET587+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 27751
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 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]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(4, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_defn)).
% fof(6, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(8, axiom,![X1]:(empty(X1)<=>![X2]:~(member(X2,X1))),file('/tmp/SRASS.s.p', empty_defn)).
% fof(9, conjecture,![X1]:![X2]:(difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', prove_difference_empty_set)).
% fof(10, negated_conjecture,~(![X1]:![X2]:(difference(X1,X2)=empty_set<=>subset(X1,X2))),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(12, plain,![X1]:~(member(X1,empty_set)),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,![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)],[11])).
% fof(23, 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)],[22])).
% fof(24, 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)],[23])).
% cnf(25,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[24])).
% cnf(27,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[12])).
% cnf(29,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[28])).
% fof(36, 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)],[6])).
% fof(37, 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)],[36])).
% fof(38, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[37])).
% fof(39, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[38])).
% fof(40, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[39])).
% cnf(41,plain,(subset(X1,X2)|~member(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[40])).
% cnf(43,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(53, plain,![X1]:((~(empty(X1))|![X2]:~(member(X2,X1)))&(?[X2]:member(X2,X1)|empty(X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(54, plain,![X3]:((~(empty(X3))|![X4]:~(member(X4,X3)))&(?[X5]:member(X5,X3)|empty(X3))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X3]:((~(empty(X3))|![X4]:~(member(X4,X3)))&(member(esk4_1(X3),X3)|empty(X3))),inference(skolemize,[status(esa)],[54])).
% fof(56, plain,![X3]:![X4]:((~(member(X4,X3))|~(empty(X3)))&(member(esk4_1(X3),X3)|empty(X3))),inference(shift_quantors,[status(thm)],[55])).
% cnf(57,plain,(empty(X1)|member(esk4_1(X1),X1)),inference(split_conjunct,[status(thm)],[56])).
% cnf(58,plain,(~empty(X1)|~member(X2,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(59, negated_conjecture,?[X1]:?[X2]:((~(difference(X1,X2)=empty_set)|~(subset(X1,X2)))&(difference(X1,X2)=empty_set|subset(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(60, negated_conjecture,?[X3]:?[X4]:((~(difference(X3,X4)=empty_set)|~(subset(X3,X4)))&(difference(X3,X4)=empty_set|subset(X3,X4))),inference(variable_rename,[status(thm)],[59])).
% fof(61, negated_conjecture,((~(difference(esk5_0,esk6_0)=empty_set)|~(subset(esk5_0,esk6_0)))&(difference(esk5_0,esk6_0)=empty_set|subset(esk5_0,esk6_0))),inference(skolemize,[status(esa)],[60])).
% cnf(62,negated_conjecture,(subset(esk5_0,esk6_0)|difference(esk5_0,esk6_0)=empty_set),inference(split_conjunct,[status(thm)],[61])).
% cnf(63,negated_conjecture,(~subset(esk5_0,esk6_0)|difference(esk5_0,esk6_0)!=empty_set),inference(split_conjunct,[status(thm)],[61])).
% cnf(74,plain,(empty(difference(X1,X2))|~member(esk4_1(difference(X1,X2)),X2)),inference(spm,[status(thm)],[26,57,theory(equality)])).
% cnf(75,plain,(subset(empty_set,X1)),inference(spm,[status(thm)],[29,42,theory(equality)])).
% cnf(76,plain,(member(esk2_2(difference(X1,X2),X3),X1)|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[27,42,theory(equality)])).
% cnf(78,plain,(subset(X1,X2)|~empty(X1)),inference(spm,[status(thm)],[58,42,theory(equality)])).
% cnf(86,negated_conjecture,(member(X1,empty_set)|member(X1,esk6_0)|subset(esk5_0,esk6_0)|~member(X1,esk5_0)),inference(spm,[status(thm)],[25,62,theory(equality)])).
% cnf(87,negated_conjecture,(member(X1,esk6_0)|subset(esk5_0,esk6_0)|~member(X1,esk5_0)),inference(sr,[status(thm)],[86,29,theory(equality)])).
% cnf(112,plain,(X1=empty_set|~subset(X1,empty_set)),inference(spm,[status(thm)],[17,75,theory(equality)])).
% cnf(116,negated_conjecture,(member(X1,esk6_0)|~member(X1,esk5_0)),inference(csr,[status(thm)],[87,43])).
% cnf(118,negated_conjecture,(subset(X1,esk6_0)|~member(esk2_2(X1,esk6_0),esk5_0)),inference(spm,[status(thm)],[41,116,theory(equality)])).
% cnf(208,negated_conjecture,(subset(esk5_0,esk6_0)),inference(spm,[status(thm)],[118,42,theory(equality)])).
% cnf(211,negated_conjecture,(difference(esk5_0,esk6_0)!=empty_set|$false),inference(rw,[status(thm)],[63,208,theory(equality)])).
% cnf(212,negated_conjecture,(difference(esk5_0,esk6_0)!=empty_set),inference(cn,[status(thm)],[211,theory(equality)])).
% cnf(218,negated_conjecture,(subset(difference(esk5_0,X1),esk6_0)),inference(spm,[status(thm)],[118,76,theory(equality)])).
% cnf(228,negated_conjecture,(member(X1,esk6_0)|~member(X1,difference(esk5_0,X2))),inference(spm,[status(thm)],[43,218,theory(equality)])).
% cnf(259,negated_conjecture,(member(esk4_1(difference(esk5_0,X1)),esk6_0)|empty(difference(esk5_0,X1))),inference(spm,[status(thm)],[228,57,theory(equality)])).
% cnf(269,negated_conjecture,(empty(difference(esk5_0,esk6_0))),inference(spm,[status(thm)],[74,259,theory(equality)])).
% cnf(272,negated_conjecture,(subset(difference(esk5_0,esk6_0),X1)),inference(spm,[status(thm)],[78,269,theory(equality)])).
% cnf(274,negated_conjecture,(difference(esk5_0,esk6_0)=empty_set),inference(spm,[status(thm)],[112,272,theory(equality)])).
% cnf(278,negated_conjecture,($false),inference(sr,[status(thm)],[274,212,theory(equality)])).
% cnf(279,negated_conjecture,($false),278,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 80
% # ...of these trivial : 0
% # ...subsumed : 12
% # ...remaining for further processing: 68
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 155
% # ...of the previous two non-trivial : 96
% # Contextual simplify-reflections : 2
% # Paramodulations : 149
% # Factorizations : 4
% # Equation resolutions : 2
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 47
% # ...number of literals in the above : 125
% # Clause-clause subsumption calls (NU) : 41
% # Rec. Clause-clause subsumption calls : 41
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 48 leaves, 1.29+/-0.644 terms/leaf
% # Paramod-from index: 21 leaves, 1.14+/-0.350 terms/leaf
% # Paramod-into index: 44 leaves, 1.25+/-0.528 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.006 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP27655/SET587+3.tptp
%
%------------------------------------------------------------------------------