TSTP Solution File: SET201+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET201+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 : art06.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:08:39 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP26643/SET201+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26643/SET201+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26643/SET201+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 26739
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(3, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(6, conjecture,![X1]:![X2]:![X3]:![X4]:((subset(X1,X2)&subset(X3,X4))=>subset(intersection(X1,X3),intersection(X2,X4))),file('/tmp/SRASS.s.p', prove_th41)).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:((subset(X1,X2)&subset(X3,X4))=>subset(intersection(X1,X3),intersection(X2,X4)))),inference(assume_negation,[status(cth)],[6])).
% fof(10, 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)],[2])).
% fof(11, 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)],[10])).
% fof(12, 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)],[11])).
% cnf(13,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[12])).
% cnf(14,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[12])).
% cnf(15,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[12])).
% fof(16, 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)],[3])).
% fof(17, 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)],[16])).
% fof(18, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[19])).
% cnf(21,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(35, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((subset(X1,X2)&subset(X3,X4))&~(subset(intersection(X1,X3),intersection(X2,X4)))),inference(fof_nnf,[status(thm)],[7])).
% fof(36, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((subset(X5,X6)&subset(X7,X8))&~(subset(intersection(X5,X7),intersection(X6,X8)))),inference(variable_rename,[status(thm)],[35])).
% fof(37, negated_conjecture,((subset(esk3_0,esk4_0)&subset(esk5_0,esk6_0))&~(subset(intersection(esk3_0,esk5_0),intersection(esk4_0,esk6_0)))),inference(skolemize,[status(esa)],[36])).
% cnf(38,negated_conjecture,(~subset(intersection(esk3_0,esk5_0),intersection(esk4_0,esk6_0))),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,negated_conjecture,(subset(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(40,negated_conjecture,(subset(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(43,plain,(member(esk1_2(intersection(X1,X2),X3),X2)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[14,22,theory(equality)])).
% cnf(46,plain,(member(esk1_2(intersection(X1,X2),X3),X1)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[15,22,theory(equality)])).
% cnf(47,negated_conjecture,(member(X1,esk6_0)|~member(X1,esk5_0)),inference(spm,[status(thm)],[23,39,theory(equality)])).
% cnf(48,negated_conjecture,(member(X1,esk4_0)|~member(X1,esk3_0)),inference(spm,[status(thm)],[23,40,theory(equality)])).
% cnf(52,plain,(subset(X1,intersection(X2,X3))|~member(esk1_2(X1,intersection(X2,X3)),X3)|~member(esk1_2(X1,intersection(X2,X3)),X2)),inference(spm,[status(thm)],[21,13,theory(equality)])).
% cnf(66,negated_conjecture,(subset(X1,esk6_0)|~member(esk1_2(X1,esk6_0),esk5_0)),inference(spm,[status(thm)],[21,47,theory(equality)])).
% cnf(68,negated_conjecture,(subset(X1,esk4_0)|~member(esk1_2(X1,esk4_0),esk3_0)),inference(spm,[status(thm)],[21,48,theory(equality)])).
% cnf(75,negated_conjecture,(subset(intersection(X1,esk5_0),esk6_0)),inference(spm,[status(thm)],[66,43,theory(equality)])).
% cnf(80,negated_conjecture,(member(X1,esk6_0)|~member(X1,intersection(X2,esk5_0))),inference(spm,[status(thm)],[23,75,theory(equality)])).
% cnf(97,negated_conjecture,(subset(intersection(esk3_0,X1),esk4_0)),inference(spm,[status(thm)],[68,46,theory(equality)])).
% cnf(102,negated_conjecture,(member(X1,esk4_0)|~member(X1,intersection(esk3_0,X2))),inference(spm,[status(thm)],[23,97,theory(equality)])).
% cnf(123,negated_conjecture,(member(esk1_2(intersection(X1,esk5_0),X2),esk6_0)|subset(intersection(X1,esk5_0),X2)),inference(spm,[status(thm)],[80,22,theory(equality)])).
% cnf(155,negated_conjecture,(member(esk1_2(intersection(esk3_0,X1),X2),esk4_0)|subset(intersection(esk3_0,X1),X2)),inference(spm,[status(thm)],[102,22,theory(equality)])).
% cnf(157,negated_conjecture,(subset(intersection(X1,esk5_0),intersection(X2,esk6_0))|~member(esk1_2(intersection(X1,esk5_0),intersection(X2,esk6_0)),X2)),inference(spm,[status(thm)],[52,123,theory(equality)])).
% cnf(1624,negated_conjecture,(subset(intersection(esk3_0,esk5_0),intersection(esk4_0,esk6_0))),inference(spm,[status(thm)],[157,155,theory(equality)])).
% cnf(1630,negated_conjecture,($false),inference(sr,[status(thm)],[1624,38,theory(equality)])).
% cnf(1631,negated_conjecture,($false),1630,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 333
% # ...of these trivial : 49
% # ...subsumed : 126
% # ...remaining for further processing: 158
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1366
% # ...of the previous two non-trivial : 1188
% # Contextual simplify-reflections : 10
% # Paramodulations : 1340
% # Factorizations : 26
% # Equation resolutions : 0
% # Current number of processed clauses: 158
% # Positive orientable unit clauses: 69
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 87
% # Current number of unprocessed clauses: 868
% # ...number of literals in the above : 2043
% # Clause-clause subsumption calls (NU) : 1392
% # Rec. Clause-clause subsumption calls : 1294
% # Unit Clause-clause subsumption calls : 403
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 199
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 177 leaves, 1.87+/-1.623 terms/leaf
% # Paramod-from index: 67 leaves, 1.93+/-1.469 terms/leaf
% # Paramod-into index: 159 leaves, 1.82+/-1.490 terms/leaf
% # -------------------------------------------------
% # User time : 0.052 s
% # System time : 0.004 s
% # Total time : 0.056 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.23 WC
% FINAL PrfWatch: 0.15 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP26643/SET201+3.tptp
%
%------------------------------------------------------------------------------