TSTP Solution File: SET598+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET598+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:14:08 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP24784/SET598+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24784/SET598+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24784/SET598+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 24880
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:subset(intersection(X1,X2),X1),file('/tmp/SRASS.s.p', intersection_is_subset)).
% fof(2, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X1,X3))=>subset(X1,intersection(X2,X3))),file('/tmp/SRASS.s.p', intersection_of_subsets)).
% fof(3, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(4, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(9, conjecture,![X1]:![X2]:![X3]:(X1=intersection(X2,X3)<=>((subset(X1,X2)&subset(X1,X3))&![X4]:((subset(X4,X2)&subset(X4,X3))=>subset(X4,X1)))),file('/tmp/SRASS.s.p', prove_th57)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:(X1=intersection(X2,X3)<=>((subset(X1,X2)&subset(X1,X3))&![X4]:((subset(X4,X2)&subset(X4,X3))=>subset(X4,X1))))),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X3]:![X4]:subset(intersection(X3,X4),X3),inference(variable_rename,[status(thm)],[1])).
% cnf(12,plain,(subset(intersection(X1,X2),X1)),inference(split_conjunct,[status(thm)],[11])).
% fof(13, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X1,X3)))|subset(X1,intersection(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(14, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X4,X6)))|subset(X4,intersection(X5,X6))),inference(variable_rename,[status(thm)],[13])).
% cnf(15,plain,(subset(X1,intersection(X2,X3))|~subset(X1,X3)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(17, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[16])).
% fof(18, 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)],[17])).
% cnf(19,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(49, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(X1=intersection(X2,X3))|((~(subset(X1,X2))|~(subset(X1,X3)))|?[X4]:((subset(X4,X2)&subset(X4,X3))&~(subset(X4,X1)))))&(X1=intersection(X2,X3)|((subset(X1,X2)&subset(X1,X3))&![X4]:((~(subset(X4,X2))|~(subset(X4,X3)))|subset(X4,X1))))),inference(fof_nnf,[status(thm)],[10])).
% fof(50, negated_conjecture,?[X5]:?[X6]:?[X7]:((~(X5=intersection(X6,X7))|((~(subset(X5,X6))|~(subset(X5,X7)))|?[X8]:((subset(X8,X6)&subset(X8,X7))&~(subset(X8,X5)))))&(X5=intersection(X6,X7)|((subset(X5,X6)&subset(X5,X7))&![X9]:((~(subset(X9,X6))|~(subset(X9,X7)))|subset(X9,X5))))),inference(variable_rename,[status(thm)],[49])).
% fof(51, negated_conjecture,((~(esk3_0=intersection(esk4_0,esk5_0))|((~(subset(esk3_0,esk4_0))|~(subset(esk3_0,esk5_0)))|((subset(esk6_0,esk4_0)&subset(esk6_0,esk5_0))&~(subset(esk6_0,esk3_0)))))&(esk3_0=intersection(esk4_0,esk5_0)|((subset(esk3_0,esk4_0)&subset(esk3_0,esk5_0))&![X9]:((~(subset(X9,esk4_0))|~(subset(X9,esk5_0)))|subset(X9,esk3_0))))),inference(skolemize,[status(esa)],[50])).
% fof(52, negated_conjecture,![X9]:(((((~(subset(X9,esk4_0))|~(subset(X9,esk5_0)))|subset(X9,esk3_0))&(subset(esk3_0,esk4_0)&subset(esk3_0,esk5_0)))|esk3_0=intersection(esk4_0,esk5_0))&(~(esk3_0=intersection(esk4_0,esk5_0))|((~(subset(esk3_0,esk4_0))|~(subset(esk3_0,esk5_0)))|((subset(esk6_0,esk4_0)&subset(esk6_0,esk5_0))&~(subset(esk6_0,esk3_0)))))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, negated_conjecture,![X9]:(((((~(subset(X9,esk4_0))|~(subset(X9,esk5_0)))|subset(X9,esk3_0))|esk3_0=intersection(esk4_0,esk5_0))&((subset(esk3_0,esk4_0)|esk3_0=intersection(esk4_0,esk5_0))&(subset(esk3_0,esk5_0)|esk3_0=intersection(esk4_0,esk5_0))))&((((subset(esk6_0,esk4_0)|(~(subset(esk3_0,esk4_0))|~(subset(esk3_0,esk5_0))))|~(esk3_0=intersection(esk4_0,esk5_0)))&((subset(esk6_0,esk5_0)|(~(subset(esk3_0,esk4_0))|~(subset(esk3_0,esk5_0))))|~(esk3_0=intersection(esk4_0,esk5_0))))&((~(subset(esk6_0,esk3_0))|(~(subset(esk3_0,esk4_0))|~(subset(esk3_0,esk5_0))))|~(esk3_0=intersection(esk4_0,esk5_0))))),inference(distribute,[status(thm)],[52])).
% cnf(54,negated_conjecture,(esk3_0!=intersection(esk4_0,esk5_0)|~subset(esk3_0,esk5_0)|~subset(esk3_0,esk4_0)|~subset(esk6_0,esk3_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(subset(esk6_0,esk5_0)|esk3_0!=intersection(esk4_0,esk5_0)|~subset(esk3_0,esk5_0)|~subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,negated_conjecture,(subset(esk6_0,esk4_0)|esk3_0!=intersection(esk4_0,esk5_0)|~subset(esk3_0,esk5_0)|~subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(57,negated_conjecture,(esk3_0=intersection(esk4_0,esk5_0)|subset(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(58,negated_conjecture,(esk3_0=intersection(esk4_0,esk5_0)|subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(59,negated_conjecture,(esk3_0=intersection(esk4_0,esk5_0)|subset(X1,esk3_0)|~subset(X1,esk5_0)|~subset(X1,esk4_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(60,negated_conjecture,(subset(esk3_0,esk4_0)),inference(spm,[status(thm)],[12,58,theory(equality)])).
% cnf(66,plain,(subset(intersection(X2,X1),X1)),inference(spm,[status(thm)],[12,23,theory(equality)])).
% cnf(87,negated_conjecture,(intersection(esk4_0,esk5_0)=esk3_0|subset(intersection(esk5_0,X1),esk3_0)|~subset(intersection(esk5_0,X1),esk4_0)),inference(spm,[status(thm)],[59,12,theory(equality)])).
% cnf(114,negated_conjecture,(intersection(esk4_0,esk5_0)!=esk3_0|$false|~subset(esk3_0,esk5_0)|~subset(esk6_0,esk3_0)),inference(rw,[status(thm)],[54,60,theory(equality)])).
% cnf(115,negated_conjecture,(intersection(esk4_0,esk5_0)!=esk3_0|~subset(esk3_0,esk5_0)|~subset(esk6_0,esk3_0)),inference(cn,[status(thm)],[114,theory(equality)])).
% cnf(116,negated_conjecture,(subset(esk6_0,esk5_0)|intersection(esk4_0,esk5_0)!=esk3_0|$false|~subset(esk3_0,esk5_0)),inference(rw,[status(thm)],[55,60,theory(equality)])).
% cnf(117,negated_conjecture,(subset(esk6_0,esk5_0)|intersection(esk4_0,esk5_0)!=esk3_0|~subset(esk3_0,esk5_0)),inference(cn,[status(thm)],[116,theory(equality)])).
% cnf(118,negated_conjecture,(subset(esk6_0,esk4_0)|intersection(esk4_0,esk5_0)!=esk3_0|$false|~subset(esk3_0,esk5_0)),inference(rw,[status(thm)],[56,60,theory(equality)])).
% cnf(119,negated_conjecture,(subset(esk6_0,esk4_0)|intersection(esk4_0,esk5_0)!=esk3_0|~subset(esk3_0,esk5_0)),inference(cn,[status(thm)],[118,theory(equality)])).
% cnf(137,negated_conjecture,(subset(esk3_0,esk5_0)),inference(spm,[status(thm)],[66,57,theory(equality)])).
% cnf(146,negated_conjecture,(intersection(esk4_0,esk5_0)!=esk3_0|$false|~subset(esk6_0,esk3_0)),inference(rw,[status(thm)],[115,137,theory(equality)])).
% cnf(147,negated_conjecture,(intersection(esk4_0,esk5_0)!=esk3_0|~subset(esk6_0,esk3_0)),inference(cn,[status(thm)],[146,theory(equality)])).
% cnf(148,negated_conjecture,(subset(esk6_0,esk5_0)|intersection(esk4_0,esk5_0)!=esk3_0|$false),inference(rw,[status(thm)],[117,137,theory(equality)])).
% cnf(149,negated_conjecture,(subset(esk6_0,esk5_0)|intersection(esk4_0,esk5_0)!=esk3_0),inference(cn,[status(thm)],[148,theory(equality)])).
% cnf(150,negated_conjecture,(subset(esk6_0,esk4_0)|intersection(esk4_0,esk5_0)!=esk3_0|$false),inference(rw,[status(thm)],[119,137,theory(equality)])).
% cnf(151,negated_conjecture,(subset(esk6_0,esk4_0)|intersection(esk4_0,esk5_0)!=esk3_0),inference(cn,[status(thm)],[150,theory(equality)])).
% cnf(261,negated_conjecture,(intersection(esk4_0,esk5_0)=esk3_0|subset(intersection(esk5_0,esk4_0),esk3_0)),inference(spm,[status(thm)],[87,66,theory(equality)])).
% cnf(264,negated_conjecture,(intersection(esk4_0,esk5_0)=esk3_0|subset(intersection(esk4_0,esk5_0),esk3_0)),inference(rw,[status(thm)],[261,23,theory(equality)])).
% cnf(265,negated_conjecture,(esk3_0=intersection(esk4_0,esk5_0)|~subset(esk3_0,intersection(esk4_0,esk5_0))),inference(spm,[status(thm)],[19,264,theory(equality)])).
% cnf(280,negated_conjecture,(intersection(esk4_0,esk5_0)=esk3_0|~subset(esk3_0,esk5_0)|~subset(esk3_0,esk4_0)),inference(spm,[status(thm)],[265,15,theory(equality)])).
% cnf(285,negated_conjecture,(intersection(esk4_0,esk5_0)=esk3_0|$false|~subset(esk3_0,esk4_0)),inference(rw,[status(thm)],[280,137,theory(equality)])).
% cnf(286,negated_conjecture,(intersection(esk4_0,esk5_0)=esk3_0|$false|$false),inference(rw,[status(thm)],[285,60,theory(equality)])).
% cnf(287,negated_conjecture,(intersection(esk4_0,esk5_0)=esk3_0),inference(cn,[status(thm)],[286,theory(equality)])).
% cnf(296,negated_conjecture,(subset(X1,esk3_0)|~subset(X1,esk5_0)|~subset(X1,esk4_0)),inference(spm,[status(thm)],[15,287,theory(equality)])).
% cnf(305,negated_conjecture,($false|~subset(esk6_0,esk3_0)),inference(rw,[status(thm)],[147,287,theory(equality)])).
% cnf(306,negated_conjecture,(~subset(esk6_0,esk3_0)),inference(cn,[status(thm)],[305,theory(equality)])).
% cnf(307,negated_conjecture,(subset(esk6_0,esk5_0)|$false),inference(rw,[status(thm)],[149,287,theory(equality)])).
% cnf(308,negated_conjecture,(subset(esk6_0,esk5_0)),inference(cn,[status(thm)],[307,theory(equality)])).
% cnf(309,negated_conjecture,(subset(esk6_0,esk4_0)|$false),inference(rw,[status(thm)],[151,287,theory(equality)])).
% cnf(310,negated_conjecture,(subset(esk6_0,esk4_0)),inference(cn,[status(thm)],[309,theory(equality)])).
% cnf(708,negated_conjecture,(subset(esk6_0,esk3_0)|~subset(esk6_0,esk4_0)),inference(spm,[status(thm)],[296,308,theory(equality)])).
% cnf(716,negated_conjecture,(subset(esk6_0,esk3_0)|$false),inference(rw,[status(thm)],[708,310,theory(equality)])).
% cnf(717,negated_conjecture,(subset(esk6_0,esk3_0)),inference(cn,[status(thm)],[716,theory(equality)])).
% cnf(718,negated_conjecture,($false),inference(sr,[status(thm)],[717,306,theory(equality)])).
% cnf(719,negated_conjecture,($false),718,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 175
% # ...of these trivial : 7
% # ...subsumed : 63
% # ...remaining for further processing: 105
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 16
% # Backward-rewritten : 15
% # Generated clauses : 549
% # ...of the previous two non-trivial : 476
% # Contextual simplify-reflections : 17
% # Paramodulations : 537
% # Factorizations : 10
% # Equation resolutions : 2
% # Current number of processed clauses: 72
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 58
% # Current number of unprocessed clauses: 286
% # ...number of literals in the above : 956
% # Clause-clause subsumption calls (NU) : 615
% # Rec. Clause-clause subsumption calls : 574
% # Unit Clause-clause subsumption calls : 28
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 68 leaves, 1.38+/-1.029 terms/leaf
% # Paramod-from index: 29 leaves, 1.28+/-0.581 terms/leaf
% # Paramod-into index: 60 leaves, 1.32+/-0.719 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.005 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.21 WC
% FINAL PrfWatch: 0.15 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP24784/SET598+3.tptp
%
%------------------------------------------------------------------------------