TSTP Solution File: SET984+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET984+1 : TPTP v5.0.0. Released v3.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 : Thu Dec 30 00:34:28 EST 2010
% Result : Theorem 1.91s
% Output : Solution 1.91s
% 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/SystemOnTPTP6692/SET984+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6692/SET984+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6692/SET984+1.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 6824
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(cartesian_product2(X1,X2)=empty_set<=>(X1=empty_set|X2=empty_set)),file('/tmp/SRASS.s.p', t113_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:(cartesian_product2(X1,X2)=cartesian_product2(X3,X4)=>((X1=empty_set|X2=empty_set)|(X1=X3&X2=X4))),file('/tmp/SRASS.s.p', t134_zfmisc_1)).
% fof(4, axiom,![X1]:![X2]:![X3]:![X4]:cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),file('/tmp/SRASS.s.p', t123_zfmisc_1)).
% fof(5, axiom,![X1]:![X2]:(subset(X1,X2)=>set_intersection2(X1,X2)=X1),file('/tmp/SRASS.s.p', t28_xboole_1)).
% fof(6, axiom,![X1]:![X2]:subset(set_intersection2(X1,X2),X1),file('/tmp/SRASS.s.p', t17_xboole_1)).
% fof(7, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(9, axiom,![X1]:![X2]:set_intersection2(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence_k3_xboole_0)).
% fof(12, conjecture,![X1]:![X2]:![X3]:![X4]:(subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))=>(cartesian_product2(X1,X2)=empty_set|(subset(X1,X3)&subset(X2,X4)))),file('/tmp/SRASS.s.p', t138_zfmisc_1)).
% fof(13, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))=>(cartesian_product2(X1,X2)=empty_set|(subset(X1,X3)&subset(X2,X4))))),inference(assume_negation,[status(cth)],[12])).
% fof(17, plain,![X1]:![X2]:((~(cartesian_product2(X1,X2)=empty_set)|(X1=empty_set|X2=empty_set))&((~(X1=empty_set)&~(X2=empty_set))|cartesian_product2(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[2])).
% fof(18, plain,![X3]:![X4]:((~(cartesian_product2(X3,X4)=empty_set)|(X3=empty_set|X4=empty_set))&((~(X3=empty_set)&~(X4=empty_set))|cartesian_product2(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:((~(cartesian_product2(X3,X4)=empty_set)|(X3=empty_set|X4=empty_set))&((~(X3=empty_set)|cartesian_product2(X3,X4)=empty_set)&(~(X4=empty_set)|cartesian_product2(X3,X4)=empty_set))),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(cartesian_product2(X1,X2)=empty_set|X2!=empty_set),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(cartesian_product2(X1,X2)=empty_set|X1!=empty_set),inference(split_conjunct,[status(thm)],[19])).
% cnf(22,plain,(X1=empty_set|X2=empty_set|cartesian_product2(X2,X1)!=empty_set),inference(split_conjunct,[status(thm)],[19])).
% fof(23, plain,![X1]:![X2]:![X3]:![X4]:(~(cartesian_product2(X1,X2)=cartesian_product2(X3,X4))|((X1=empty_set|X2=empty_set)|(X1=X3&X2=X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(24, plain,![X5]:![X6]:![X7]:![X8]:(~(cartesian_product2(X5,X6)=cartesian_product2(X7,X8))|((X5=empty_set|X6=empty_set)|(X5=X7&X6=X8))),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X5]:![X6]:![X7]:![X8]:(((X5=X7|(X5=empty_set|X6=empty_set))|~(cartesian_product2(X5,X6)=cartesian_product2(X7,X8)))&((X6=X8|(X5=empty_set|X6=empty_set))|~(cartesian_product2(X5,X6)=cartesian_product2(X7,X8)))),inference(distribute,[status(thm)],[24])).
% cnf(26,plain,(X2=empty_set|X1=empty_set|X2=X4|cartesian_product2(X1,X2)!=cartesian_product2(X3,X4)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(X2=empty_set|X1=empty_set|X1=X3|cartesian_product2(X1,X2)!=cartesian_product2(X3,X4)),inference(split_conjunct,[status(thm)],[25])).
% fof(28, plain,![X5]:![X6]:![X7]:![X8]:cartesian_product2(set_intersection2(X5,X6),set_intersection2(X7,X8))=set_intersection2(cartesian_product2(X5,X7),cartesian_product2(X6,X8)),inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:![X2]:(~(subset(X1,X2))|set_intersection2(X1,X2)=X1),inference(fof_nnf,[status(thm)],[5])).
% fof(31, plain,![X3]:![X4]:(~(subset(X3,X4))|set_intersection2(X3,X4)=X3),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(set_intersection2(X1,X2)=X1|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X3]:![X4]:subset(set_intersection2(X3,X4),X3),inference(variable_rename,[status(thm)],[6])).
% cnf(34,plain,(subset(set_intersection2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(36,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(38, plain,![X3]:![X4]:set_intersection2(X3,X3)=X3,inference(variable_rename,[status(thm)],[9])).
% cnf(39,plain,(set_intersection2(X1,X1)=X1),inference(split_conjunct,[status(thm)],[38])).
% fof(46, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))&(~(cartesian_product2(X1,X2)=empty_set)&(~(subset(X1,X3))|~(subset(X2,X4))))),inference(fof_nnf,[status(thm)],[13])).
% fof(47, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(subset(cartesian_product2(X5,X6),cartesian_product2(X7,X8))&(~(cartesian_product2(X5,X6)=empty_set)&(~(subset(X5,X7))|~(subset(X6,X8))))),inference(variable_rename,[status(thm)],[46])).
% fof(48, negated_conjecture,(subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))&(~(cartesian_product2(esk3_0,esk4_0)=empty_set)&(~(subset(esk3_0,esk5_0))|~(subset(esk4_0,esk6_0))))),inference(skolemize,[status(esa)],[47])).
% cnf(49,negated_conjecture,(~subset(esk4_0,esk6_0)|~subset(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,negated_conjecture,(cartesian_product2(esk3_0,esk4_0)!=empty_set),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,negated_conjecture,(subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))),inference(split_conjunct,[status(thm)],[48])).
% cnf(55,plain,(subset(set_intersection2(X2,X1),X1)),inference(spm,[status(thm)],[34,36,theory(equality)])).
% cnf(61,negated_conjecture,(set_intersection2(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))=cartesian_product2(esk3_0,esk4_0)),inference(spm,[status(thm)],[32,51,theory(equality)])).
% cnf(64,plain,(cartesian_product2(X1,empty_set)=empty_set),inference(er,[status(thm)],[20,theory(equality)])).
% cnf(65,plain,(cartesian_product2(empty_set,X1)=empty_set),inference(er,[status(thm)],[21,theory(equality)])).
% cnf(70,plain,(empty_set=set_intersection2(X1,X2)|empty_set=set_intersection2(X3,X4)|set_intersection2(cartesian_product2(X3,X1),cartesian_product2(X4,X2))!=empty_set),inference(spm,[status(thm)],[22,29,theory(equality)])).
% cnf(73,plain,(cartesian_product2(set_intersection2(X1,X2),X3)=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X3))),inference(spm,[status(thm)],[29,39,theory(equality)])).
% cnf(74,plain,(cartesian_product2(set_intersection2(X1,X2),set_intersection2(X4,X3))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),inference(spm,[status(thm)],[29,36,theory(equality)])).
% cnf(76,plain,(cartesian_product2(X1,set_intersection2(X2,X3))=set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X1,X3))),inference(spm,[status(thm)],[29,39,theory(equality)])).
% cnf(79,plain,(set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X2,X3))=set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4))),inference(rw,[status(thm)],[74,29,theory(equality)])).
% cnf(96,negated_conjecture,(cartesian_product2(cartesian_product2(esk3_0,esk4_0),set_intersection2(X1,X2))=set_intersection2(cartesian_product2(cartesian_product2(esk3_0,esk4_0),X1),cartesian_product2(cartesian_product2(esk5_0,esk6_0),X2))),inference(spm,[status(thm)],[29,61,theory(equality)])).
% cnf(290,plain,(set_intersection2(X1,X2)=empty_set|set_intersection2(X3,X4)=empty_set|set_intersection2(cartesian_product2(X2,X4),cartesian_product2(X1,X3))!=empty_set),inference(spm,[status(thm)],[70,36,theory(equality)])).
% cnf(851,plain,(subset(set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X3,X2)),cartesian_product2(X1,X2))),inference(spm,[status(thm)],[34,79,theory(equality)])).
% cnf(854,plain,(subset(set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X3,X2)),cartesian_product2(X3,X4))),inference(spm,[status(thm)],[55,79,theory(equality)])).
% cnf(1088,negated_conjecture,(set_intersection2(X1,X2)=empty_set|set_intersection2(cartesian_product2(esk5_0,esk6_0),cartesian_product2(esk3_0,esk4_0))=empty_set|cartesian_product2(cartesian_product2(esk3_0,esk4_0),set_intersection2(X2,X1))!=empty_set),inference(spm,[status(thm)],[290,96,theory(equality)])).
% cnf(1104,negated_conjecture,(set_intersection2(X1,X2)=empty_set|cartesian_product2(esk3_0,esk4_0)=empty_set|cartesian_product2(cartesian_product2(esk3_0,esk4_0),set_intersection2(X2,X1))!=empty_set),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1088,36,theory(equality)]),61,theory(equality)])).
% cnf(1105,negated_conjecture,(set_intersection2(X1,X2)=empty_set|cartesian_product2(cartesian_product2(esk3_0,esk4_0),set_intersection2(X2,X1))!=empty_set),inference(sr,[status(thm)],[1104,50,theory(equality)])).
% cnf(1178,negated_conjecture,(subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk3_0,esk6_0))),inference(spm,[status(thm)],[851,61,theory(equality)])).
% cnf(1197,negated_conjecture,(set_intersection2(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk3_0,esk6_0))=cartesian_product2(esk3_0,esk4_0)),inference(spm,[status(thm)],[32,1178,theory(equality)])).
% cnf(1198,negated_conjecture,(cartesian_product2(esk3_0,set_intersection2(esk4_0,esk6_0))=cartesian_product2(esk3_0,esk4_0)),inference(rw,[status(thm)],[1197,76,theory(equality)])).
% cnf(1215,negated_conjecture,(empty_set=X1|empty_set=X2|X2=set_intersection2(esk4_0,esk6_0)|cartesian_product2(X1,X2)!=cartesian_product2(esk3_0,esk4_0)),inference(spm,[status(thm)],[26,1198,theory(equality)])).
% cnf(1245,negated_conjecture,(set_intersection2(cartesian_product2(esk5_0,esk6_0),cartesian_product2(esk3_0,esk4_0))=empty_set|cartesian_product2(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk3_0,esk4_0))!=empty_set),inference(spm,[status(thm)],[1105,61,theory(equality)])).
% cnf(1261,negated_conjecture,(cartesian_product2(esk3_0,esk4_0)=empty_set|cartesian_product2(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk3_0,esk4_0))!=empty_set),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1245,36,theory(equality)]),61,theory(equality)])).
% cnf(1262,negated_conjecture,(cartesian_product2(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk3_0,esk4_0))!=empty_set),inference(sr,[status(thm)],[1261,50,theory(equality)])).
% cnf(1562,negated_conjecture,(subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk4_0))),inference(spm,[status(thm)],[854,61,theory(equality)])).
% cnf(1590,negated_conjecture,(set_intersection2(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk4_0))=cartesian_product2(esk3_0,esk4_0)),inference(spm,[status(thm)],[32,1562,theory(equality)])).
% cnf(1591,negated_conjecture,(cartesian_product2(set_intersection2(esk3_0,esk5_0),esk4_0)=cartesian_product2(esk3_0,esk4_0)),inference(rw,[status(thm)],[1590,73,theory(equality)])).
% cnf(1602,negated_conjecture,(empty_set=X1|empty_set=X2|X1=set_intersection2(esk3_0,esk5_0)|cartesian_product2(X1,X2)!=cartesian_product2(esk3_0,esk4_0)),inference(spm,[status(thm)],[27,1591,theory(equality)])).
% cnf(23082,negated_conjecture,(esk4_0=set_intersection2(esk4_0,esk6_0)|empty_set=esk4_0|empty_set=esk3_0),inference(er,[status(thm)],[1215,theory(equality)])).
% cnf(23136,negated_conjecture,(esk3_0=set_intersection2(esk3_0,esk5_0)|empty_set=esk4_0|empty_set=esk3_0),inference(er,[status(thm)],[1602,theory(equality)])).
% cnf(23172,negated_conjecture,(subset(esk4_0,esk6_0)|esk3_0=empty_set|esk4_0=empty_set),inference(spm,[status(thm)],[55,23082,theory(equality)])).
% cnf(23373,negated_conjecture,(subset(esk3_0,esk5_0)|esk3_0=empty_set|esk4_0=empty_set),inference(spm,[status(thm)],[55,23136,theory(equality)])).
% cnf(23586,negated_conjecture,(esk4_0=empty_set|esk3_0=empty_set|~subset(esk4_0,esk6_0)),inference(spm,[status(thm)],[49,23373,theory(equality)])).
% cnf(26916,negated_conjecture,(esk4_0=empty_set|esk3_0=empty_set),inference(csr,[status(thm)],[23586,23172])).
% cnf(26917,negated_conjecture,(esk3_0=empty_set|cartesian_product2(esk3_0,empty_set)!=empty_set),inference(spm,[status(thm)],[50,26916,theory(equality)])).
% cnf(27084,negated_conjecture,(esk3_0=empty_set|$false),inference(rw,[status(thm)],[26917,64,theory(equality)])).
% cnf(27085,negated_conjecture,(esk3_0=empty_set),inference(cn,[status(thm)],[27084,theory(equality)])).
% cnf(27574,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1262,27085,theory(equality)]),65,theory(equality)]),27085,theory(equality)]),65,theory(equality)]),65,theory(equality)])).
% cnf(27575,negated_conjecture,($false),inference(cn,[status(thm)],[27574,theory(equality)])).
% cnf(27576,negated_conjecture,($false),27575,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1286
% # ...of these trivial : 456
% # ...subsumed : 512
% # ...remaining for further processing: 318
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 204
% # Generated clauses : 16639
% # ...of the previous two non-trivial : 11928
% # Contextual simplify-reflections : 25
% # Paramodulations : 16584
% # Factorizations : 0
% # Equation resolutions : 18
% # Current number of processed clauses: 101
% # Positive orientable unit clauses: 55
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 3
% # Non-unit-clauses : 40
% # Current number of unprocessed clauses: 1586
% # ...number of literals in the above : 3479
% # Clause-clause subsumption calls (NU) : 2173
% # Rec. Clause-clause subsumption calls : 2007
% # Unit Clause-clause subsumption calls : 58
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 785
% # Indexed BW rewrite successes : 66
% # Backwards rewriting index: 57 leaves, 3.32+/-5.417 terms/leaf
% # Paramod-from index: 34 leaves, 1.76+/-1.139 terms/leaf
% # Paramod-into index: 53 leaves, 3.21+/-5.371 terms/leaf
% # -------------------------------------------------
% # User time : 0.465 s
% # System time : 0.016 s
% # Total time : 0.481 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.92 CPU 0.99 WC
% FINAL PrfWatch: 0.92 CPU 0.99 WC
% SZS output end Solution for /tmp/SystemOnTPTP6692/SET984+1.tptp
%
%------------------------------------------------------------------------------