TSTP Solution File: SET699+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET699+4 : TPTP v5.0.0. Released v2.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 : Wed Dec 29 23:32:01 EST 2010
% Result : Theorem 8.13s
% Output : Solution 8.13s
% 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/SystemOnTPTP10270/SET699+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10270/SET699+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10270/SET699+4.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 10366
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.02 WC
% PrfWatch: 5.92 CPU 6.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]:![X3]:(member(X1,intersection(X2,X3))<=>(member(X1,X2)&member(X1,X3))),file('/tmp/SRASS.s.p', intersection)).
% fof(2, axiom,![X3]:![X2]:![X4]:(member(X3,difference(X4,X2))<=>(member(X3,X4)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference)).
% fof(3, axiom,![X2]:![X3]:(subset(X2,X3)<=>![X1]:(member(X1,X2)=>member(X1,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(12, conjecture,![X2]:![X3]:![X4]:((subset(X2,X4)&subset(X3,X4))=>(subset(X2,X3)<=>subset(intersection(X2,difference(X4,X3)),difference(X4,X2)))),file('/tmp/SRASS.s.p', thI33)).
% fof(13, negated_conjecture,~(![X2]:![X3]:![X4]:((subset(X2,X4)&subset(X3,X4))=>(subset(X2,X3)<=>subset(intersection(X2,difference(X4,X3)),difference(X4,X2))))),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X3]:![X2]:![X4]:(member(X3,difference(X4,X2))<=>(member(X3,X4)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(16, plain,![X1]:![X2]:![X3]:((~(member(X1,intersection(X2,X3)))|(member(X1,X2)&member(X1,X3)))&((~(member(X1,X2))|~(member(X1,X3)))|member(X1,intersection(X2,X3)))),inference(fof_nnf,[status(thm)],[1])).
% fof(17, plain,![X4]:![X5]:![X6]:((~(member(X4,intersection(X5,X6)))|(member(X4,X5)&member(X4,X6)))&((~(member(X4,X5))|~(member(X4,X6)))|member(X4,intersection(X5,X6)))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:(((member(X4,X5)|~(member(X4,intersection(X5,X6))))&(member(X4,X6)|~(member(X4,intersection(X5,X6)))))&((~(member(X4,X5))|~(member(X4,X6)))|member(X4,intersection(X5,X6)))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% cnf(21,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X3]:![X2]:![X4]:((~(member(X3,difference(X4,X2)))|(member(X3,X4)&~(member(X3,X2))))&((~(member(X3,X4))|member(X3,X2))|member(X3,difference(X4,X2)))),inference(fof_nnf,[status(thm)],[14])).
% fof(23, plain,![X5]:![X6]:![X7]:((~(member(X5,difference(X7,X6)))|(member(X5,X7)&~(member(X5,X6))))&((~(member(X5,X7))|member(X5,X6))|member(X5,difference(X7,X6)))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X5]:![X6]:![X7]:(((member(X5,X7)|~(member(X5,difference(X7,X6))))&(~(member(X5,X6))|~(member(X5,difference(X7,X6)))))&((~(member(X5,X7))|member(X5,X6))|member(X5,difference(X7,X6)))),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]:![X3]:((~(subset(X2,X3))|![X1]:(~(member(X1,X2))|member(X1,X3)))&(?[X1]:(member(X1,X2)&~(member(X1,X3)))|subset(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% 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(33,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[32])).
% 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(80, negated_conjecture,?[X2]:?[X3]:?[X4]:((subset(X2,X4)&subset(X3,X4))&((~(subset(X2,X3))|~(subset(intersection(X2,difference(X4,X3)),difference(X4,X2))))&(subset(X2,X3)|subset(intersection(X2,difference(X4,X3)),difference(X4,X2))))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X5]:?[X6]:?[X7]:((subset(X5,X7)&subset(X6,X7))&((~(subset(X5,X6))|~(subset(intersection(X5,difference(X7,X6)),difference(X7,X5))))&(subset(X5,X6)|subset(intersection(X5,difference(X7,X6)),difference(X7,X5))))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,((subset(esk4_0,esk6_0)&subset(esk5_0,esk6_0))&((~(subset(esk4_0,esk5_0))|~(subset(intersection(esk4_0,difference(esk6_0,esk5_0)),difference(esk6_0,esk4_0))))&(subset(esk4_0,esk5_0)|subset(intersection(esk4_0,difference(esk6_0,esk5_0)),difference(esk6_0,esk4_0))))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(subset(intersection(esk4_0,difference(esk6_0,esk5_0)),difference(esk6_0,esk4_0))|subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(~subset(intersection(esk4_0,difference(esk6_0,esk5_0)),difference(esk6_0,esk4_0))|~subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(86,negated_conjecture,(subset(esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(96,plain,(member(esk1_2(difference(X1,X2),X3),X1)|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[27,34,theory(equality)])).
% cnf(97,plain,(subset(difference(X1,X2),X3)|~member(esk1_2(difference(X1,X2),X3),X2)),inference(spm,[status(thm)],[26,34,theory(equality)])).
% cnf(98,plain,(member(esk1_2(intersection(X1,X2),X3),X1)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[21,34,theory(equality)])).
% cnf(99,plain,(member(esk1_2(intersection(X1,X2),X3),X2)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[20,34,theory(equality)])).
% cnf(107,negated_conjecture,(member(X1,esk6_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[35,86,theory(equality)])).
% cnf(108,negated_conjecture,(member(X1,difference(esk6_0,esk4_0))|subset(esk4_0,esk5_0)|~member(X1,intersection(esk4_0,difference(esk6_0,esk5_0)))),inference(spm,[status(thm)],[35,83,theory(equality)])).
% cnf(175,plain,(subset(difference(X1,difference(X2,X3)),X4)|member(esk1_2(difference(X1,difference(X2,X3)),X4),X3)|~member(esk1_2(difference(X1,difference(X2,X3)),X4),X2)),inference(spm,[status(thm)],[97,25,theory(equality)])).
% cnf(190,negated_conjecture,(subset(X1,esk6_0)|~member(esk1_2(X1,esk6_0),esk4_0)),inference(spm,[status(thm)],[33,107,theory(equality)])).
% cnf(236,negated_conjecture,(subset(difference(esk4_0,X1),esk6_0)),inference(spm,[status(thm)],[190,96,theory(equality)])).
% cnf(282,negated_conjecture,(member(X1,esk6_0)|~member(X1,difference(esk4_0,X2))),inference(spm,[status(thm)],[35,236,theory(equality)])).
% cnf(408,plain,(subset(intersection(X1,difference(X2,X3)),X4)|~member(esk1_2(intersection(X1,difference(X2,X3)),X4),X3)),inference(spm,[status(thm)],[26,99,theory(equality)])).
% cnf(792,negated_conjecture,(subset(esk4_0,esk5_0)|member(X1,difference(esk6_0,esk4_0))|~member(X1,difference(esk6_0,esk5_0))|~member(X1,esk4_0)),inference(spm,[status(thm)],[108,19,theory(equality)])).
% cnf(2995,negated_conjecture,(member(esk1_2(difference(esk4_0,X1),X2),esk6_0)|subset(difference(esk4_0,X1),X2)),inference(spm,[status(thm)],[282,34,theory(equality)])).
% cnf(5948,negated_conjecture,(subset(difference(esk4_0,difference(esk6_0,X1)),X2)|member(esk1_2(difference(esk4_0,difference(esk6_0,X1)),X2),X1)),inference(spm,[status(thm)],[175,2995,theory(equality)])).
% cnf(9514,negated_conjecture,(subset(difference(esk4_0,difference(esk6_0,X1)),X1)),inference(spm,[status(thm)],[33,5948,theory(equality)])).
% cnf(9517,negated_conjecture,(member(X1,X2)|~member(X1,difference(esk4_0,difference(esk6_0,X2)))),inference(spm,[status(thm)],[35,9514,theory(equality)])).
% cnf(9695,negated_conjecture,(member(X1,X2)|member(X1,difference(esk6_0,X2))|~member(X1,esk4_0)),inference(spm,[status(thm)],[9517,25,theory(equality)])).
% cnf(32145,negated_conjecture,(subset(esk4_0,esk5_0)|~member(X1,difference(esk6_0,esk5_0))|~member(X1,esk4_0)),inference(csr,[status(thm)],[792,26])).
% cnf(32190,negated_conjecture,(subset(esk4_0,esk5_0)|member(X1,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[32145,9695,theory(equality)])).
% cnf(32191,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk4_0)),inference(csr,[status(thm)],[32190,35])).
% cnf(32214,negated_conjecture,(subset(X1,esk5_0)|~member(esk1_2(X1,esk5_0),esk4_0)),inference(spm,[status(thm)],[33,32191,theory(equality)])).
% cnf(32252,negated_conjecture,(subset(intersection(esk4_0,X1),esk5_0)),inference(spm,[status(thm)],[32214,98,theory(equality)])).
% cnf(32266,negated_conjecture,(subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[32214,34,theory(equality)])).
% cnf(32294,negated_conjecture,(~subset(intersection(esk4_0,difference(esk6_0,esk5_0)),difference(esk6_0,esk4_0))|$false),inference(rw,[status(thm)],[84,32266,theory(equality)])).
% cnf(32295,negated_conjecture,(~subset(intersection(esk4_0,difference(esk6_0,esk5_0)),difference(esk6_0,esk4_0))),inference(cn,[status(thm)],[32294,theory(equality)])).
% cnf(32299,negated_conjecture,(member(X1,esk5_0)|~member(X1,intersection(esk4_0,X2))),inference(spm,[status(thm)],[35,32252,theory(equality)])).
% cnf(32456,negated_conjecture,(member(esk1_2(intersection(esk4_0,X1),X2),esk5_0)|subset(intersection(esk4_0,X1),X2)),inference(spm,[status(thm)],[32299,34,theory(equality)])).
% cnf(32614,negated_conjecture,(subset(intersection(esk4_0,difference(X1,esk5_0)),X2)),inference(spm,[status(thm)],[408,32456,theory(equality)])).
% cnf(32621,negated_conjecture,($false),inference(rw,[status(thm)],[32295,32614,theory(equality)])).
% cnf(32622,negated_conjecture,($false),inference(cn,[status(thm)],[32621,theory(equality)])).
% cnf(32623,negated_conjecture,($false),32622,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3773
% # ...of these trivial : 50
% # ...subsumed : 133
% # ...remaining for further processing: 3590
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 69
% # Generated clauses : 31748
% # ...of the previous two non-trivial : 31086
% # Contextual simplify-reflections : 35
% # Paramodulations : 31715
% # Factorizations : 20
% # Equation resolutions : 13
% # Current number of processed clauses: 3485
% # Positive orientable unit clauses: 3092
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 81
% # Non-unit-clauses : 312
% # Current number of unprocessed clauses: 21297
% # ...number of literals in the above : 42274
% # Clause-clause subsumption calls (NU) : 3358
% # Rec. Clause-clause subsumption calls : 3133
% # Unit Clause-clause subsumption calls : 816
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 164084
% # Indexed BW rewrite successes : 44
% # Backwards rewriting index: 802 leaves, 9.12+/-22.430 terms/leaf
% # Paramod-from index: 286 leaves, 11.27+/-30.498 terms/leaf
% # Paramod-into index: 741 leaves, 9.70+/-23.136 terms/leaf
% # -------------------------------------------------
% # User time : 6.694 s
% # System time : 0.074 s
% # Total time : 6.768 s
% # Maximum resident set size: 0 pages
% PrfWatch: 7.32 CPU 7.43 WC
% FINAL PrfWatch: 7.32 CPU 7.43 WC
% SZS output end Solution for /tmp/SystemOnTPTP10270/SET699+4.tptp
%
%------------------------------------------------------------------------------