TSTP Solution File: SET578+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET578+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:16:02 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP10246/SET578+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10246/SET578+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10246/SET578+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 10378
% 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(1, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(2, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(4, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(5, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(7, conjecture,![X1]:![X2]:![X3]:(![X4]:(member(X4,X1)<=>(member(X4,X2)&member(X4,X3)))=>X1=intersection(X2,X3)),file('/tmp/SRASS.s.p', prove_th19)).
% fof(8, negated_conjecture,~(![X1]:![X2]:![X3]:(![X4]:(member(X4,X1)<=>(member(X4,X2)&member(X4,X3)))=>X1=intersection(X2,X3))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:![X2]:![X3]:((~(member(X3,intersection(X1,X2)))|(member(X3,X1)&member(X3,X2)))&((~(member(X3,X1))|~(member(X3,X2)))|member(X3,intersection(X1,X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(10, plain,![X4]:![X5]:![X6]:((~(member(X6,intersection(X4,X5)))|(member(X6,X4)&member(X6,X5)))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(variable_rename,[status(thm)],[9])).
% fof(11, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,intersection(X4,X5))))&(member(X6,X5)|~(member(X6,intersection(X4,X5)))))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(distribute,[status(thm)],[10])).
% cnf(12,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[11])).
% cnf(13,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[11])).
% cnf(14,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[11])).
% fof(15, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(16,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(26, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[4])).
% fof(27, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[26])).
% fof(28, 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)],[27])).
% cnf(29,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(33, 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)],[32])).
% fof(34, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[35])).
% cnf(37,plain,(subset(X1,X2)|~member(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[36])).
% cnf(39,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(42, negated_conjecture,?[X1]:?[X2]:?[X3]:(![X4]:((~(member(X4,X1))|(member(X4,X2)&member(X4,X3)))&((~(member(X4,X2))|~(member(X4,X3)))|member(X4,X1)))&~(X1=intersection(X2,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(43, negated_conjecture,?[X5]:?[X6]:?[X7]:(![X8]:((~(member(X8,X5))|(member(X8,X6)&member(X8,X7)))&((~(member(X8,X6))|~(member(X8,X7)))|member(X8,X5)))&~(X5=intersection(X6,X7))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(![X8]:((~(member(X8,esk3_0))|(member(X8,esk4_0)&member(X8,esk5_0)))&((~(member(X8,esk4_0))|~(member(X8,esk5_0)))|member(X8,esk3_0)))&~(esk3_0=intersection(esk4_0,esk5_0))),inference(skolemize,[status(esa)],[43])).
% fof(45, negated_conjecture,![X8]:(((~(member(X8,esk3_0))|(member(X8,esk4_0)&member(X8,esk5_0)))&((~(member(X8,esk4_0))|~(member(X8,esk5_0)))|member(X8,esk3_0)))&~(esk3_0=intersection(esk4_0,esk5_0))),inference(shift_quantors,[status(thm)],[44])).
% fof(46, negated_conjecture,![X8]:((((member(X8,esk4_0)|~(member(X8,esk3_0)))&(member(X8,esk5_0)|~(member(X8,esk3_0))))&((~(member(X8,esk4_0))|~(member(X8,esk5_0)))|member(X8,esk3_0)))&~(esk3_0=intersection(esk4_0,esk5_0))),inference(distribute,[status(thm)],[45])).
% cnf(47,negated_conjecture,(esk3_0!=intersection(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[46])).
% cnf(48,negated_conjecture,(member(X1,esk3_0)|~member(X1,esk5_0)|~member(X1,esk4_0)),inference(split_conjunct,[status(thm)],[46])).
% cnf(49,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk3_0)),inference(split_conjunct,[status(thm)],[46])).
% cnf(50,negated_conjecture,(member(X1,esk4_0)|~member(X1,esk3_0)),inference(split_conjunct,[status(thm)],[46])).
% cnf(59,plain,(member(esk2_2(intersection(X1,X2),X3),X2)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[13,38,theory(equality)])).
% cnf(62,plain,(member(esk2_2(intersection(X1,X2),X3),X1)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[14,38,theory(equality)])).
% cnf(63,negated_conjecture,(subset(X1,esk5_0)|~member(esk2_2(X1,esk5_0),esk3_0)),inference(spm,[status(thm)],[37,49,theory(equality)])).
% cnf(64,negated_conjecture,(subset(X1,esk4_0)|~member(esk2_2(X1,esk4_0),esk3_0)),inference(spm,[status(thm)],[37,50,theory(equality)])).
% cnf(68,plain,(subset(X1,intersection(X2,X3))|~member(esk2_2(X1,intersection(X2,X3)),X3)|~member(esk2_2(X1,intersection(X2,X3)),X2)),inference(spm,[status(thm)],[37,12,theory(equality)])).
% cnf(92,negated_conjecture,(member(esk2_2(intersection(X1,esk5_0),X2),esk3_0)|subset(intersection(X1,esk5_0),X2)|~member(esk2_2(intersection(X1,esk5_0),X2),esk4_0)),inference(spm,[status(thm)],[48,59,theory(equality)])).
% cnf(95,negated_conjecture,(subset(intersection(X1,esk3_0),esk5_0)),inference(spm,[status(thm)],[63,59,theory(equality)])).
% cnf(102,negated_conjecture,(subset(intersection(esk3_0,X1),esk5_0)),inference(spm,[status(thm)],[95,16,theory(equality)])).
% cnf(113,negated_conjecture,(member(X1,esk5_0)|~member(X1,intersection(esk3_0,X2))),inference(spm,[status(thm)],[39,102,theory(equality)])).
% cnf(122,negated_conjecture,(subset(intersection(esk3_0,X1),esk4_0)),inference(spm,[status(thm)],[64,62,theory(equality)])).
% cnf(123,plain,(subset(intersection(X1,X2),X1)),inference(spm,[status(thm)],[37,62,theory(equality)])).
% cnf(128,negated_conjecture,(member(X1,esk4_0)|~member(X1,intersection(esk3_0,X2))),inference(spm,[status(thm)],[39,122,theory(equality)])).
% cnf(157,plain,(subset(intersection(X1,X2),intersection(X3,X2))|~member(esk2_2(intersection(X1,X2),intersection(X3,X2)),X3)),inference(spm,[status(thm)],[68,59,theory(equality)])).
% cnf(159,plain,(subset(X1,intersection(X2,X1))|~member(esk2_2(X1,intersection(X2,X1)),X2)),inference(spm,[status(thm)],[68,38,theory(equality)])).
% cnf(178,negated_conjecture,(member(esk2_2(intersection(esk3_0,X1),X2),esk5_0)|subset(intersection(esk3_0,X1),X2)),inference(spm,[status(thm)],[113,38,theory(equality)])).
% cnf(188,negated_conjecture,(member(esk2_2(intersection(esk3_0,X1),X2),esk4_0)|subset(intersection(esk3_0,X1),X2)),inference(spm,[status(thm)],[128,38,theory(equality)])).
% cnf(452,negated_conjecture,(subset(intersection(esk4_0,esk5_0),X1)|member(esk2_2(intersection(esk4_0,esk5_0),X1),esk3_0)),inference(spm,[status(thm)],[92,62,theory(equality)])).
% cnf(455,negated_conjecture,(subset(intersection(esk4_0,esk5_0),esk3_0)),inference(spm,[status(thm)],[37,452,theory(equality)])).
% cnf(460,negated_conjecture,(esk3_0=intersection(esk4_0,esk5_0)|~subset(esk3_0,intersection(esk4_0,esk5_0))),inference(spm,[status(thm)],[29,455,theory(equality)])).
% cnf(462,negated_conjecture,(~subset(esk3_0,intersection(esk4_0,esk5_0))),inference(sr,[status(thm)],[460,47,theory(equality)])).
% cnf(1178,negated_conjecture,(subset(intersection(esk3_0,X1),intersection(esk5_0,X1))),inference(spm,[status(thm)],[157,178,theory(equality)])).
% cnf(1180,negated_conjecture,(subset(intersection(esk3_0,X1),intersection(esk4_0,X1))),inference(spm,[status(thm)],[157,188,theory(equality)])).
% cnf(1333,plain,(subset(X1,intersection(X1,X1))),inference(spm,[status(thm)],[159,38,theory(equality)])).
% cnf(1334,plain,(intersection(X1,X1)=X1|~subset(intersection(X1,X1),X1)),inference(spm,[status(thm)],[29,1333,theory(equality)])).
% cnf(1340,plain,(intersection(X1,X1)=X1|$false),inference(rw,[status(thm)],[1334,123,theory(equality)])).
% cnf(1341,plain,(intersection(X1,X1)=X1),inference(cn,[status(thm)],[1340,theory(equality)])).
% cnf(1367,negated_conjecture,(subset(esk3_0,intersection(esk5_0,esk3_0))),inference(spm,[status(thm)],[1178,1341,theory(equality)])).
% cnf(1520,negated_conjecture,(subset(esk3_0,intersection(esk3_0,esk5_0))),inference(rw,[status(thm)],[1367,16,theory(equality)])).
% cnf(1582,negated_conjecture,(intersection(esk3_0,esk5_0)=esk3_0|~subset(intersection(esk3_0,esk5_0),esk3_0)),inference(spm,[status(thm)],[29,1520,theory(equality)])).
% cnf(1585,negated_conjecture,(intersection(esk3_0,esk5_0)=esk3_0|$false),inference(rw,[status(thm)],[1582,123,theory(equality)])).
% cnf(1586,negated_conjecture,(intersection(esk3_0,esk5_0)=esk3_0),inference(cn,[status(thm)],[1585,theory(equality)])).
% cnf(1636,negated_conjecture,(subset(esk3_0,intersection(esk4_0,esk5_0))),inference(spm,[status(thm)],[1180,1586,theory(equality)])).
% cnf(1668,negated_conjecture,($false),inference(sr,[status(thm)],[1636,462,theory(equality)])).
% cnf(1669,negated_conjecture,($false),1668,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 326
% # ...of these trivial : 23
% # ...subsumed : 155
% # ...remaining for further processing: 148
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 1398
% # ...of the previous two non-trivial : 1217
% # Contextual simplify-reflections : 15
% # Paramodulations : 1382
% # Factorizations : 14
% # Equation resolutions : 2
% # Current number of processed clauses: 139
% # Positive orientable unit clauses: 38
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 98
% # Current number of unprocessed clauses: 887
% # ...number of literals in the above : 2175
% # Clause-clause subsumption calls (NU) : 1675
% # Rec. Clause-clause subsumption calls : 1628
% # Unit Clause-clause subsumption calls : 281
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 148
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 151 leaves, 1.72+/-1.363 terms/leaf
% # Paramod-from index: 46 leaves, 1.74+/-1.131 terms/leaf
% # Paramod-into index: 131 leaves, 1.68+/-1.193 terms/leaf
% # -------------------------------------------------
% # User time : 0.046 s
% # System time : 0.004 s
% # Total time : 0.050 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.23 WC
% FINAL PrfWatch: 0.17 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP10246/SET578+3.tptp
%
%------------------------------------------------------------------------------