TSTP Solution File: SET705+4 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET705+4 : TPTP v5.0.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art02.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:33:08 EST 2010

% Result   : Theorem 0.88s
% Output   : Solution 0.88s
% 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/SystemOnTPTP10824/SET705+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP10824/SET705+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10824/SET705+4.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 10920
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(member(X1,power_set(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', power_set)).
% fof(2, axiom,![X2]:![X3]:(subset(X2,X3)<=>![X1]:(member(X1,X2)=>member(X1,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(12, conjecture,![X2]:member(X2,power_set(X2)),file('/tmp/SRASS.s.p', thI48)).
% fof(13, negated_conjecture,~(![X2]:member(X2,power_set(X2))),inference(assume_negation,[status(cth)],[12])).
% fof(16, plain,![X1]:![X2]:((~(member(X1,power_set(X2)))|subset(X1,X2))&(~(subset(X1,X2))|member(X1,power_set(X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(17, plain,![X3]:![X4]:((~(member(X3,power_set(X4)))|subset(X3,X4))&(~(subset(X3,X4))|member(X3,power_set(X4)))),inference(variable_rename,[status(thm)],[16])).
% cnf(18,plain,(member(X1,power_set(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[17])).
% fof(20, plain,![X2]:![X3]:((~(subset(X2,X3))|![X1]:(~(member(X1,X2))|member(X1,X3)))&(?[X1]:(member(X1,X2)&~(member(X1,X3)))|subset(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% 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(esk1_2(X4,X5),X4)&~(member(esk1_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(esk1_2(X4,X5),X4)&~(member(esk1_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(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(80, negated_conjecture,?[X2]:~(member(X2,power_set(X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X3]:~(member(X3,power_set(X3))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,~(member(esk4_0,power_set(esk4_0))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(~member(esk4_0,power_set(esk4_0))),inference(split_conjunct,[status(thm)],[82])).
% cnf(87,negated_conjecture,(~subset(esk4_0,esk4_0)),inference(spm,[status(thm)],[83,18,theory(equality)])).
% cnf(100,plain,(subset(X1,X1)),inference(spm,[status(thm)],[25,26,theory(equality)])).
% cnf(152,negated_conjecture,($false),inference(rw,[status(thm)],[87,100,theory(equality)])).
% cnf(153,negated_conjecture,($false),inference(cn,[status(thm)],[152,theory(equality)])).
% cnf(154,negated_conjecture,($false),153,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 68
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 68
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 67
% # ...of the previous two non-trivial : 56
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 64
% # Factorizations                     : 0
% # Equation resolutions               : 3
% # Current number of processed clauses: 34
% #    Positive orientable unit clauses: 7
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 25
% # Current number of unprocessed clauses: 48
% # ...number of literals in the above : 117
% # Clause-clause subsumption calls (NU) : 26
% # Rec. Clause-clause subsumption calls : 26
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 11
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:    37 leaves,   1.49+/-0.826 terms/leaf
% # Paramod-from index:           15 leaves,   1.07+/-0.249 terms/leaf
% # Paramod-into index:           34 leaves,   1.32+/-0.580 terms/leaf
% # -------------------------------------------------
% # User time              : 0.014 s
% # System time            : 0.005 s
% # Total time             : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP10824/SET705+4.tptp
% 
%------------------------------------------------------------------------------