TSTP Solution File: SET597+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET597+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 23:18:47 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/SystemOnTPTP11643/SET597+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11643/SET597+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11643/SET597+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 11775
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:subset(X1,union(X1,X2)),file('/tmp/SRASS.s.p', subset_of_union)).
% fof(2, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X3,X2))=>subset(union(X1,X3),X2)),file('/tmp/SRASS.s.p', union_subset)).
% 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]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(9, conjecture,![X1]:![X2]:![X3]:(X1=union(X2,X3)<=>((subset(X2,X1)&subset(X3,X1))&![X4]:((subset(X2,X4)&subset(X3,X4))=>subset(X1,X4)))),file('/tmp/SRASS.s.p', prove_th56)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:(X1=union(X2,X3)<=>((subset(X2,X1)&subset(X3,X1))&![X4]:((subset(X2,X4)&subset(X3,X4))=>subset(X1,X4))))),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X3]:![X4]:subset(X3,union(X3,X4)),inference(variable_rename,[status(thm)],[1])).
% cnf(12,plain,(subset(X1,union(X1,X2))),inference(split_conjunct,[status(thm)],[11])).
% fof(13, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X3,X2)))|subset(union(X1,X3),X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(14, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X6,X5)))|subset(union(X4,X6),X5)),inference(variable_rename,[status(thm)],[13])).
% cnf(15,plain,(subset(union(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3)),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]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(49, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(X1=union(X2,X3))|((~(subset(X2,X1))|~(subset(X3,X1)))|?[X4]:((subset(X2,X4)&subset(X3,X4))&~(subset(X1,X4)))))&(X1=union(X2,X3)|((subset(X2,X1)&subset(X3,X1))&![X4]:((~(subset(X2,X4))|~(subset(X3,X4)))|subset(X1,X4))))),inference(fof_nnf,[status(thm)],[10])).
% fof(50, negated_conjecture,?[X5]:?[X6]:?[X7]:((~(X5=union(X6,X7))|((~(subset(X6,X5))|~(subset(X7,X5)))|?[X8]:((subset(X6,X8)&subset(X7,X8))&~(subset(X5,X8)))))&(X5=union(X6,X7)|((subset(X6,X5)&subset(X7,X5))&![X9]:((~(subset(X6,X9))|~(subset(X7,X9)))|subset(X5,X9))))),inference(variable_rename,[status(thm)],[49])).
% fof(51, negated_conjecture,((~(esk3_0=union(esk4_0,esk5_0))|((~(subset(esk4_0,esk3_0))|~(subset(esk5_0,esk3_0)))|((subset(esk4_0,esk6_0)&subset(esk5_0,esk6_0))&~(subset(esk3_0,esk6_0)))))&(esk3_0=union(esk4_0,esk5_0)|((subset(esk4_0,esk3_0)&subset(esk5_0,esk3_0))&![X9]:((~(subset(esk4_0,X9))|~(subset(esk5_0,X9)))|subset(esk3_0,X9))))),inference(skolemize,[status(esa)],[50])).
% fof(52, negated_conjecture,![X9]:(((((~(subset(esk4_0,X9))|~(subset(esk5_0,X9)))|subset(esk3_0,X9))&(subset(esk4_0,esk3_0)&subset(esk5_0,esk3_0)))|esk3_0=union(esk4_0,esk5_0))&(~(esk3_0=union(esk4_0,esk5_0))|((~(subset(esk4_0,esk3_0))|~(subset(esk5_0,esk3_0)))|((subset(esk4_0,esk6_0)&subset(esk5_0,esk6_0))&~(subset(esk3_0,esk6_0)))))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, negated_conjecture,![X9]:(((((~(subset(esk4_0,X9))|~(subset(esk5_0,X9)))|subset(esk3_0,X9))|esk3_0=union(esk4_0,esk5_0))&((subset(esk4_0,esk3_0)|esk3_0=union(esk4_0,esk5_0))&(subset(esk5_0,esk3_0)|esk3_0=union(esk4_0,esk5_0))))&((((subset(esk4_0,esk6_0)|(~(subset(esk4_0,esk3_0))|~(subset(esk5_0,esk3_0))))|~(esk3_0=union(esk4_0,esk5_0)))&((subset(esk5_0,esk6_0)|(~(subset(esk4_0,esk3_0))|~(subset(esk5_0,esk3_0))))|~(esk3_0=union(esk4_0,esk5_0))))&((~(subset(esk3_0,esk6_0))|(~(subset(esk4_0,esk3_0))|~(subset(esk5_0,esk3_0))))|~(esk3_0=union(esk4_0,esk5_0))))),inference(distribute,[status(thm)],[52])).
% cnf(54,negated_conjecture,(esk3_0!=union(esk4_0,esk5_0)|~subset(esk5_0,esk3_0)|~subset(esk4_0,esk3_0)|~subset(esk3_0,esk6_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(subset(esk5_0,esk6_0)|esk3_0!=union(esk4_0,esk5_0)|~subset(esk5_0,esk3_0)|~subset(esk4_0,esk3_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,negated_conjecture,(subset(esk4_0,esk6_0)|esk3_0!=union(esk4_0,esk5_0)|~subset(esk5_0,esk3_0)|~subset(esk4_0,esk3_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(57,negated_conjecture,(esk3_0=union(esk4_0,esk5_0)|subset(esk5_0,esk3_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(58,negated_conjecture,(esk3_0=union(esk4_0,esk5_0)|subset(esk4_0,esk3_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(59,negated_conjecture,(esk3_0=union(esk4_0,esk5_0)|subset(esk3_0,X1)|~subset(esk5_0,X1)|~subset(esk4_0,X1)),inference(split_conjunct,[status(thm)],[53])).
% cnf(60,negated_conjecture,(subset(esk4_0,esk3_0)),inference(spm,[status(thm)],[12,58,theory(equality)])).
% cnf(66,plain,(subset(X1,union(X2,X1))),inference(spm,[status(thm)],[12,23,theory(equality)])).
% cnf(87,negated_conjecture,(union(esk4_0,esk5_0)=esk3_0|subset(esk3_0,union(esk5_0,X1))|~subset(esk4_0,union(esk5_0,X1))),inference(spm,[status(thm)],[59,12,theory(equality)])).
% cnf(113,negated_conjecture,(union(esk4_0,esk5_0)!=esk3_0|~subset(esk3_0,esk6_0)|$false|~subset(esk5_0,esk3_0)),inference(rw,[status(thm)],[54,60,theory(equality)])).
% cnf(114,negated_conjecture,(union(esk4_0,esk5_0)!=esk3_0|~subset(esk3_0,esk6_0)|~subset(esk5_0,esk3_0)),inference(cn,[status(thm)],[113,theory(equality)])).
% cnf(115,negated_conjecture,(subset(esk5_0,esk6_0)|union(esk4_0,esk5_0)!=esk3_0|$false|~subset(esk5_0,esk3_0)),inference(rw,[status(thm)],[55,60,theory(equality)])).
% cnf(116,negated_conjecture,(subset(esk5_0,esk6_0)|union(esk4_0,esk5_0)!=esk3_0|~subset(esk5_0,esk3_0)),inference(cn,[status(thm)],[115,theory(equality)])).
% cnf(117,negated_conjecture,(subset(esk4_0,esk6_0)|union(esk4_0,esk5_0)!=esk3_0|$false|~subset(esk5_0,esk3_0)),inference(rw,[status(thm)],[56,60,theory(equality)])).
% cnf(118,negated_conjecture,(subset(esk4_0,esk6_0)|union(esk4_0,esk5_0)!=esk3_0|~subset(esk5_0,esk3_0)),inference(cn,[status(thm)],[117,theory(equality)])).
% cnf(136,negated_conjecture,(subset(esk5_0,esk3_0)),inference(spm,[status(thm)],[66,57,theory(equality)])).
% cnf(145,negated_conjecture,(union(esk4_0,esk5_0)!=esk3_0|~subset(esk3_0,esk6_0)|$false),inference(rw,[status(thm)],[114,136,theory(equality)])).
% cnf(146,negated_conjecture,(union(esk4_0,esk5_0)!=esk3_0|~subset(esk3_0,esk6_0)),inference(cn,[status(thm)],[145,theory(equality)])).
% cnf(147,negated_conjecture,(subset(esk5_0,esk6_0)|union(esk4_0,esk5_0)!=esk3_0|$false),inference(rw,[status(thm)],[116,136,theory(equality)])).
% cnf(148,negated_conjecture,(subset(esk5_0,esk6_0)|union(esk4_0,esk5_0)!=esk3_0),inference(cn,[status(thm)],[147,theory(equality)])).
% cnf(149,negated_conjecture,(subset(esk4_0,esk6_0)|union(esk4_0,esk5_0)!=esk3_0|$false),inference(rw,[status(thm)],[118,136,theory(equality)])).
% cnf(150,negated_conjecture,(subset(esk4_0,esk6_0)|union(esk4_0,esk5_0)!=esk3_0),inference(cn,[status(thm)],[149,theory(equality)])).
% cnf(302,negated_conjecture,(union(esk4_0,esk5_0)=esk3_0|subset(esk3_0,union(esk5_0,esk4_0))),inference(spm,[status(thm)],[87,66,theory(equality)])).
% cnf(306,negated_conjecture,(union(esk4_0,esk5_0)=esk3_0|subset(esk3_0,union(esk4_0,esk5_0))),inference(rw,[status(thm)],[302,23,theory(equality)])).
% cnf(307,negated_conjecture,(union(esk4_0,esk5_0)=esk3_0|~subset(union(esk4_0,esk5_0),esk3_0)),inference(spm,[status(thm)],[19,306,theory(equality)])).
% cnf(316,negated_conjecture,(union(esk4_0,esk5_0)=esk3_0|~subset(esk5_0,esk3_0)|~subset(esk4_0,esk3_0)),inference(spm,[status(thm)],[307,15,theory(equality)])).
% cnf(321,negated_conjecture,(union(esk4_0,esk5_0)=esk3_0|$false|~subset(esk4_0,esk3_0)),inference(rw,[status(thm)],[316,136,theory(equality)])).
% cnf(322,negated_conjecture,(union(esk4_0,esk5_0)=esk3_0|$false|$false),inference(rw,[status(thm)],[321,60,theory(equality)])).
% cnf(323,negated_conjecture,(union(esk4_0,esk5_0)=esk3_0),inference(cn,[status(thm)],[322,theory(equality)])).
% cnf(325,negated_conjecture,(subset(esk3_0,X1)|~subset(esk5_0,X1)|~subset(esk4_0,X1)),inference(spm,[status(thm)],[15,323,theory(equality)])).
% cnf(341,negated_conjecture,($false|~subset(esk3_0,esk6_0)),inference(rw,[status(thm)],[146,323,theory(equality)])).
% cnf(342,negated_conjecture,(~subset(esk3_0,esk6_0)),inference(cn,[status(thm)],[341,theory(equality)])).
% cnf(343,negated_conjecture,(subset(esk5_0,esk6_0)|$false),inference(rw,[status(thm)],[148,323,theory(equality)])).
% cnf(344,negated_conjecture,(subset(esk5_0,esk6_0)),inference(cn,[status(thm)],[343,theory(equality)])).
% cnf(345,negated_conjecture,(subset(esk4_0,esk6_0)|$false),inference(rw,[status(thm)],[150,323,theory(equality)])).
% cnf(346,negated_conjecture,(subset(esk4_0,esk6_0)),inference(cn,[status(thm)],[345,theory(equality)])).
% cnf(663,negated_conjecture,(subset(esk3_0,esk6_0)|~subset(esk4_0,esk6_0)),inference(spm,[status(thm)],[325,344,theory(equality)])).
% cnf(668,negated_conjecture,(subset(esk3_0,esk6_0)|$false),inference(rw,[status(thm)],[663,346,theory(equality)])).
% cnf(669,negated_conjecture,(subset(esk3_0,esk6_0)),inference(cn,[status(thm)],[668,theory(equality)])).
% cnf(670,negated_conjecture,($false),inference(sr,[status(thm)],[669,342,theory(equality)])).
% cnf(671,negated_conjecture,($false),670,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 169
% # ...of these trivial : 5
% # ...subsumed : 65
% # ...remaining for further processing: 99
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 12
% # Backward-rewritten : 16
% # Generated clauses : 500
% # ...of the previous two non-trivial : 425
% # Contextual simplify-reflections : 18
% # Paramodulations : 488
% # Factorizations : 10
% # Equation resolutions : 2
% # Current number of processed clauses: 69
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 55
% # Current number of unprocessed clauses: 240
% # ...number of literals in the above : 880
% # Clause-clause subsumption calls (NU) : 601
% # Rec. Clause-clause subsumption calls : 562
% # Unit Clause-clause subsumption calls : 36
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 61 leaves, 1.41+/-1.107 terms/leaf
% # Paramod-from index: 27 leaves, 1.22+/-0.497 terms/leaf
% # Paramod-into index: 54 leaves, 1.35+/-0.774 terms/leaf
% # -------------------------------------------------
% # User time : 0.026 s
% # System time : 0.002 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.20 WC
% FINAL PrfWatch: 0.13 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP11643/SET597+3.tptp
%
%------------------------------------------------------------------------------