TSTP Solution File: SET625+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET625+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 : art04.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:18:29 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP29935/SET625+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP29935/SET625+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29935/SET625+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 30031
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(intersect(X1,X2)<=>?[X3]:(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersect_defn)).
% fof(4, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(5, conjecture,![X1]:![X2]:![X3]:((intersect(X1,X2)&subset(X2,X3))=>intersect(X1,X3)),file('/tmp/SRASS.s.p', prove_th101)).
% fof(6, negated_conjecture,~(![X1]:![X2]:![X3]:((intersect(X1,X2)&subset(X2,X3))=>intersect(X1,X3))),inference(assume_negation,[status(cth)],[5])).
% fof(12, plain,![X1]:![X2]:((~(intersect(X1,X2))|?[X3]:(member(X3,X1)&member(X3,X2)))&(![X3]:(~(member(X3,X1))|~(member(X3,X2)))|intersect(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(13, plain,![X4]:![X5]:((~(intersect(X4,X5))|?[X6]:(member(X6,X4)&member(X6,X5)))&(![X7]:(~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X4]:![X5]:((~(intersect(X4,X5))|(member(esk1_2(X4,X5),X4)&member(esk1_2(X4,X5),X5)))&(![X7]:(~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))),inference(skolemize,[status(esa)],[13])).
% fof(15, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&(~(intersect(X4,X5))|(member(esk1_2(X4,X5),X4)&member(esk1_2(X4,X5),X5)))),inference(shift_quantors,[status(thm)],[14])).
% fof(16, plain,![X4]:![X5]:![X7]:(((~(member(X7,X4))|~(member(X7,X5)))|intersect(X4,X5))&((member(esk1_2(X4,X5),X4)|~(intersect(X4,X5)))&(member(esk1_2(X4,X5),X5)|~(intersect(X4,X5))))),inference(distribute,[status(thm)],[15])).
% cnf(17,plain,(member(esk1_2(X1,X2),X2)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(member(esk1_2(X1,X2),X1)|~intersect(X1,X2)),inference(split_conjunct,[status(thm)],[16])).
% cnf(19,plain,(intersect(X1,X2)|~member(X3,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(20, 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)],[4])).
% fof(21, 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)],[20])).
% fof(22, 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)],[21])).
% fof(23, 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)],[22])).
% fof(24, 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)],[23])).
% cnf(27,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(28, negated_conjecture,?[X1]:?[X2]:?[X3]:((intersect(X1,X2)&subset(X2,X3))&~(intersect(X1,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(29, negated_conjecture,?[X4]:?[X5]:?[X6]:((intersect(X4,X5)&subset(X5,X6))&~(intersect(X4,X6))),inference(variable_rename,[status(thm)],[28])).
% fof(30, negated_conjecture,((intersect(esk3_0,esk4_0)&subset(esk4_0,esk5_0))&~(intersect(esk3_0,esk5_0))),inference(skolemize,[status(esa)],[29])).
% cnf(31,negated_conjecture,(~intersect(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,negated_conjecture,(subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[30])).
% cnf(33,negated_conjecture,(intersect(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[30])).
% cnf(40,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[27,32,theory(equality)])).
% cnf(45,negated_conjecture,(intersect(X1,esk5_0)|~member(X2,X1)|~member(X2,esk4_0)),inference(spm,[status(thm)],[19,40,theory(equality)])).
% cnf(49,negated_conjecture,(intersect(X1,esk5_0)|~member(esk1_2(X2,esk4_0),X1)|~intersect(X2,esk4_0)),inference(spm,[status(thm)],[45,17,theory(equality)])).
% cnf(62,negated_conjecture,(intersect(X1,esk5_0)|~intersect(X1,esk4_0)),inference(spm,[status(thm)],[49,18,theory(equality)])).
% cnf(63,negated_conjecture,(~intersect(esk3_0,esk4_0)),inference(spm,[status(thm)],[31,62,theory(equality)])).
% cnf(65,negated_conjecture,($false),inference(rw,[status(thm)],[63,33,theory(equality)])).
% cnf(66,negated_conjecture,($false),inference(cn,[status(thm)],[65,theory(equality)])).
% cnf(67,negated_conjecture,($false),66,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 34
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 33
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 27
% # ...of the previous two non-trivial : 21
% # Contextual simplify-reflections : 1
% # Paramodulations : 27
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 22
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 9
% # ...number of literals in the above : 26
% # Clause-clause subsumption calls (NU) : 31
% # Rec. Clause-clause subsumption calls : 28
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 29 leaves, 1.52+/-1.004 terms/leaf
% # Paramod-from index: 10 leaves, 1.20+/-0.400 terms/leaf
% # Paramod-into index: 24 leaves, 1.25+/-0.595 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.002 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP29935/SET625+3.tptp
%
%------------------------------------------------------------------------------