TSTP Solution File: SET601+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET601+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 : art09.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:32 EST 2010
% Result : Theorem 6.93s
% Output : Solution 6.93s
% 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/SystemOnTPTP27450/SET601+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27450/SET601+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27450/SET601+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 27546
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.92 CPU 2.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.92 CPU 4.02 WC
% PrfWatch: 5.92 CPU 6.03 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:union(union(X1,X2),X3)=union(X1,union(X2,X3)),file('/tmp/SRASS.s.p', associativity_of_union)).
% fof(2, axiom,![X1]:intersection(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotency_of_intersection)).
% fof(3, axiom,![X1]:![X2]:![X3]:intersection(intersection(X1,X2),X3)=intersection(X1,intersection(X2,X3)),file('/tmp/SRASS.s.p', associativity_of_intersection)).
% fof(4, axiom,![X1]:![X2]:union(X1,intersection(X1,X2))=X1,file('/tmp/SRASS.s.p', union_intersection)).
% fof(5, axiom,![X1]:![X2]:![X3]:union(X1,intersection(X2,X3))=intersection(union(X1,X2),union(X1,X3)),file('/tmp/SRASS.s.p', union_distributes_over_intersection)).
% fof(6, axiom,![X1]:![X2]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(7, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(14, conjecture,![X1]:![X2]:![X3]:union(union(intersection(X1,X2),intersection(X2,X3)),intersection(X3,X1))=intersection(intersection(union(X1,X2),union(X2,X3)),union(X3,X1)),file('/tmp/SRASS.s.p', prove_th72)).
% fof(15, negated_conjecture,~(![X1]:![X2]:![X3]:union(union(intersection(X1,X2),intersection(X2,X3)),intersection(X3,X1))=intersection(intersection(union(X1,X2),union(X2,X3)),union(X3,X1))),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X4]:![X5]:![X6]:union(union(X4,X5),X6)=union(X4,union(X5,X6)),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(union(union(X1,X2),X3)=union(X1,union(X2,X3))),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X2]:intersection(X2,X2)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(intersection(X1,X1)=X1),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:intersection(intersection(X4,X5),X6)=intersection(X4,intersection(X5,X6)),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(intersection(intersection(X1,X2),X3)=intersection(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:union(X3,intersection(X3,X4))=X3,inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(union(X1,intersection(X1,X2))=X1),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:union(X4,intersection(X5,X6))=intersection(union(X4,X5),union(X4,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(union(X1,intersection(X2,X3))=intersection(union(X1,X2),union(X1,X3))),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(67, negated_conjecture,?[X1]:?[X2]:?[X3]:~(union(union(intersection(X1,X2),intersection(X2,X3)),intersection(X3,X1))=intersection(intersection(union(X1,X2),union(X2,X3)),union(X3,X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(68, negated_conjecture,?[X4]:?[X5]:?[X6]:~(union(union(intersection(X4,X5),intersection(X5,X6)),intersection(X6,X4))=intersection(intersection(union(X4,X5),union(X5,X6)),union(X6,X4))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,~(union(union(intersection(esk3_0,esk4_0),intersection(esk4_0,esk5_0)),intersection(esk5_0,esk3_0))=intersection(intersection(union(esk3_0,esk4_0),union(esk4_0,esk5_0)),union(esk5_0,esk3_0))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(union(union(intersection(esk3_0,esk4_0),intersection(esk4_0,esk5_0)),intersection(esk5_0,esk3_0))!=intersection(intersection(union(esk3_0,esk4_0),union(esk4_0,esk5_0)),union(esk5_0,esk3_0))),inference(split_conjunct,[status(thm)],[69])).
% cnf(75,negated_conjecture,(intersection(union(esk3_0,esk4_0),intersection(union(esk3_0,esk5_0),union(esk4_0,esk5_0)))!=union(union(intersection(esk3_0,esk4_0),intersection(esk4_0,esk5_0)),intersection(esk5_0,esk3_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[70,27,theory(equality)]),21,theory(equality)]),29,theory(equality)])).
% cnf(76,negated_conjecture,(intersection(union(esk3_0,esk4_0),intersection(union(esk3_0,esk5_0),union(esk4_0,esk5_0)))!=union(intersection(esk3_0,esk4_0),union(intersection(esk3_0,esk5_0),intersection(esk4_0,esk5_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[75,29,theory(equality)]),17,theory(equality)]),27,theory(equality)])).
% cnf(77,plain,(union(X1,X1)=X1),inference(spm,[status(thm)],[23,19,theory(equality)])).
% cnf(79,plain,(union(X1,intersection(X2,X1))=X1),inference(spm,[status(thm)],[23,29,theory(equality)])).
% cnf(85,plain,(union(X1,union(X2,X3))=union(X3,union(X1,X2))),inference(spm,[status(thm)],[27,17,theory(equality)])).
% cnf(88,plain,(union(X1,X3)=union(X1,union(intersection(X1,X2),X3))),inference(spm,[status(thm)],[17,23,theory(equality)])).
% cnf(110,plain,(intersection(union(X1,intersection(X2,X3)),X4)=intersection(union(X1,X2),intersection(union(X1,X3),X4))),inference(spm,[status(thm)],[21,25,theory(equality)])).
% cnf(114,plain,(intersection(union(X1,X2),union(X3,X1))=union(X1,intersection(X2,X3))),inference(spm,[status(thm)],[25,27,theory(equality)])).
% cnf(117,plain,(intersection(X1,union(X1,X3))=union(X1,intersection(intersection(X1,X2),X3))),inference(spm,[status(thm)],[25,23,theory(equality)])).
% cnf(118,plain,(intersection(union(X2,X1),union(X1,X3))=union(X1,intersection(X2,X3))),inference(spm,[status(thm)],[25,27,theory(equality)])).
% cnf(128,plain,(intersection(X1,union(X1,X3))=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[117,21,theory(equality)]),23,theory(equality)])).
% cnf(183,plain,(union(X1,X2)=union(X1,union(X1,X2))),inference(spm,[status(thm)],[17,77,theory(equality)])).
% cnf(194,plain,(union(X1,X3)=union(X1,union(intersection(X2,X1),X3))),inference(spm,[status(thm)],[17,79,theory(equality)])).
% cnf(200,plain,(union(X1,intersection(X2,intersection(X3,X1)))=X1),inference(spm,[status(thm)],[79,21,theory(equality)])).
% cnf(214,plain,(union(union(X1,X2),X1)=union(X1,X2)),inference(spm,[status(thm)],[79,128,theory(equality)])).
% cnf(221,plain,(intersection(X1,union(X2,X1))=X1),inference(spm,[status(thm)],[128,27,theory(equality)])).
% cnf(225,plain,(union(X1,union(X2,X1))=union(X1,X2)),inference(rw,[status(thm)],[214,17,theory(equality)])).
% cnf(239,plain,(intersection(X1,union(X2,union(X3,X1)))=X1),inference(spm,[status(thm)],[221,17,theory(equality)])).
% cnf(240,plain,(intersection(intersection(X1,X2),X1)=intersection(X1,X2)),inference(spm,[status(thm)],[221,23,theory(equality)])).
% cnf(248,plain,(intersection(X1,intersection(X2,X1))=intersection(X1,X2)),inference(rw,[status(thm)],[240,21,theory(equality)])).
% cnf(290,plain,(intersection(union(X1,X2),union(X1,X3))=union(X1,intersection(X2,union(X1,X3)))),inference(spm,[status(thm)],[25,183,theory(equality)])).
% cnf(305,plain,(union(X1,intersection(X2,X3))=union(X1,intersection(X2,union(X1,X3)))),inference(rw,[status(thm)],[290,25,theory(equality)])).
% cnf(434,plain,(union(intersection(X1,X2),intersection(X3,intersection(X2,X1)))=intersection(X1,X2)),inference(spm,[status(thm)],[200,248,theory(equality)])).
% cnf(699,plain,(intersection(union(intersection(X1,X2),X3),X2)=union(intersection(X1,X2),intersection(X3,X2))),inference(spm,[status(thm)],[114,79,theory(equality)])).
% cnf(716,plain,(intersection(union(X3,union(X1,X2)),union(X4,X1))=union(X1,intersection(union(X2,X3),X4))),inference(spm,[status(thm)],[114,85,theory(equality)])).
% cnf(789,plain,(intersection(union(X1,X2),union(X4,union(X2,X3)))=union(X2,intersection(X1,union(X3,X4)))),inference(spm,[status(thm)],[118,85,theory(equality)])).
% cnf(871,plain,(intersection(intersection(X1,X2),union(X3,X1))=intersection(X1,X2)),inference(spm,[status(thm)],[239,23,theory(equality)])).
% cnf(902,plain,(intersection(X1,intersection(X2,union(X3,X1)))=intersection(X1,X2)),inference(rw,[status(thm)],[871,21,theory(equality)])).
% cnf(1547,plain,(intersection(intersection(X1,union(X2,X3)),union(X2,intersection(X1,X3)))=intersection(X1,union(X2,X3))),inference(spm,[status(thm)],[221,305,theory(equality)])).
% cnf(1606,plain,(intersection(X1,union(X2,intersection(X3,X1)))=intersection(X1,union(X2,X3))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1547,21,theory(equality)]),25,theory(equality)]),248,theory(equality)])).
% cnf(3731,plain,(intersection(X2,union(intersection(X1,X2),X3))=union(intersection(X1,X2),intersection(X3,X2))),inference(rw,[status(thm)],[699,29,theory(equality)])).
% cnf(3815,plain,(intersection(X1,union(X3,intersection(X2,X1)))=union(intersection(X2,X1),intersection(X3,X1))),inference(spm,[status(thm)],[3731,27,theory(equality)])).
% cnf(4009,plain,(intersection(union(X1,X2),union(X3,intersection(X1,X4)))=intersection(union(X1,intersection(X2,X3)),union(X3,X4))),inference(spm,[status(thm)],[110,118,theory(equality)])).
% cnf(4036,negated_conjecture,(intersection(union(esk4_0,esk5_0),union(esk3_0,intersection(esk4_0,esk5_0)))!=union(intersection(esk3_0,esk4_0),union(intersection(esk3_0,esk5_0),intersection(esk4_0,esk5_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[76,110,theory(equality)]),29,theory(equality)])).
% cnf(7065,plain,(intersection(X1,union(X3,X2))=union(intersection(X2,X1),intersection(X3,X1))),inference(rw,[status(thm)],[3815,1606,theory(equality)])).
% cnf(7190,negated_conjecture,(union(intersection(esk3_0,esk4_0),intersection(esk5_0,union(esk3_0,esk4_0)))!=intersection(union(esk4_0,esk5_0),union(esk3_0,intersection(esk4_0,esk5_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4036,7065,theory(equality)]),27,theory(equality)])).
% cnf(11040,plain,(union(intersection(union(X1,X2),X3),intersection(X2,X3))=intersection(union(X1,X2),X3)),inference(spm,[status(thm)],[434,902,theory(equality)])).
% cnf(11204,plain,(intersection(X3,union(X2,X1))=intersection(union(X1,X2),X3)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[11040,7065,theory(equality)]),225,theory(equality)])).
% cnf(19725,plain,(intersection(union(X1,X3),union(X4,intersection(X1,X2)))=union(intersection(X1,X2),intersection(union(X3,X1),X4))),inference(spm,[status(thm)],[716,88,theory(equality)])).
% cnf(21109,plain,(intersection(union(X1,intersection(X2,X3)),union(X3,X4))=union(intersection(X2,X3),intersection(X1,union(X4,X3)))),inference(spm,[status(thm)],[789,194,theory(equality)])).
% cnf(188878,negated_conjecture,(union(intersection(esk4_0,esk5_0),intersection(esk3_0,union(esk4_0,esk5_0)))!=union(intersection(esk3_0,esk4_0),intersection(esk5_0,union(esk3_0,esk4_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[7190,19725,theory(equality)]),27,theory(equality)]),11204,theory(equality)]),27,theory(equality)])).
% cnf(212213,plain,(union(intersection(X1,X4),intersection(union(X2,X1),X3))=intersection(union(X1,intersection(X2,X3)),union(X3,X4))),inference(rw,[status(thm)],[4009,19725,theory(equality)])).
% cnf(212214,plain,(union(intersection(X1,X4),intersection(union(X2,X1),X3))=union(intersection(X2,X3),intersection(X1,union(X4,X3)))),inference(rw,[status(thm)],[212213,21109,theory(equality)])).
% cnf(213599,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[188878,212214,theory(equality)]),27,theory(equality)]),11204,theory(equality)]),27,theory(equality)])).
% cnf(213600,negated_conjecture,($false),inference(cn,[status(thm)],[213599,theory(equality)])).
% cnf(213601,negated_conjecture,($false),213600,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5236
% # ...of these trivial : 1670
% # ...subsumed : 3138
% # ...remaining for further processing: 428
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 40
% # Generated clauses : 113584
% # ...of the previous two non-trivial : 89836
% # Contextual simplify-reflections : 6
% # Paramodulations : 113558
% # Factorizations : 24
% # Equation resolutions : 2
% # Current number of processed clauses: 365
% # Positive orientable unit clauses: 267
% # Positive unorientable unit clauses: 11
% # Negative unit clauses : 0
% # Non-unit-clauses : 87
% # Current number of unprocessed clauses: 71707
% # ...number of literals in the above : 93510
% # Clause-clause subsumption calls (NU) : 1596
% # Rec. Clause-clause subsumption calls : 1536
% # Unit Clause-clause subsumption calls : 174
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1722
% # Indexed BW rewrite successes : 347
% # Backwards rewriting index: 114 leaves, 5.51+/-5.392 terms/leaf
% # Paramod-from index: 89 leaves, 3.52+/-2.385 terms/leaf
% # Paramod-into index: 109 leaves, 4.69+/-4.283 terms/leaf
% # -------------------------------------------------
% # User time : 3.136 s
% # System time : 0.117 s
% # Total time : 3.253 s
% # Maximum resident set size: 0 pages
% PrfWatch: 6.12 CPU 6.24 WC
% FINAL PrfWatch: 6.12 CPU 6.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP27450/SET601+3.tptp
%
%------------------------------------------------------------------------------