TSTP Solution File: SEU121+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU121+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art07.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 : Thu Dec 30 01:09:53 EST 2010

% Result   : Theorem 0.86s
% Output   : Solution 0.86s
% 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/SystemOnTPTP15794/SEU121+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP15794/SEU121+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15794/SEU121+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 15890
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(11, conjecture,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(12, negated_conjecture,~(![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3))),inference(assume_negation,[status(cth)],[11])).
% fof(17, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(18, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[20])).
% cnf(22,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[21])).
% cnf(24,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(45, negated_conjecture,?[X1]:?[X2]:?[X3]:((subset(X1,X2)&subset(X2,X3))&~(subset(X1,X3))),inference(fof_nnf,[status(thm)],[12])).
% fof(46, negated_conjecture,?[X4]:?[X5]:?[X6]:((subset(X4,X5)&subset(X5,X6))&~(subset(X4,X6))),inference(variable_rename,[status(thm)],[45])).
% fof(47, negated_conjecture,((subset(esk4_0,esk5_0)&subset(esk5_0,esk6_0))&~(subset(esk4_0,esk6_0))),inference(skolemize,[status(esa)],[46])).
% cnf(48,negated_conjecture,(~subset(esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[47])).
% cnf(49,negated_conjecture,(subset(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[47])).
% cnf(50,negated_conjecture,(subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[47])).
% cnf(58,negated_conjecture,(in(X1,esk6_0)|~in(X1,esk5_0)),inference(spm,[status(thm)],[24,49,theory(equality)])).
% cnf(59,negated_conjecture,(in(X1,esk5_0)|~in(X1,esk4_0)),inference(spm,[status(thm)],[24,50,theory(equality)])).
% cnf(64,negated_conjecture,(subset(X1,esk6_0)|~in(esk1_2(X1,esk6_0),esk5_0)),inference(spm,[status(thm)],[22,58,theory(equality)])).
% cnf(76,negated_conjecture,(subset(X1,esk6_0)|~in(esk1_2(X1,esk6_0),esk4_0)),inference(spm,[status(thm)],[64,59,theory(equality)])).
% cnf(81,negated_conjecture,(subset(esk4_0,esk6_0)),inference(spm,[status(thm)],[76,23,theory(equality)])).
% cnf(82,negated_conjecture,($false),inference(sr,[status(thm)],[81,48,theory(equality)])).
% cnf(83,negated_conjecture,($false),82,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 43
% # ...of these trivial                : 0
% # ...subsumed                        : 1
% # ...remaining for further processing: 42
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 27
% # ...of the previous two non-trivial : 22
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 27
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 27
% #    Positive orientable unit clauses: 5
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 4
% #    Non-unit-clauses                : 18
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 15
% # Clause-clause subsumption calls (NU) : 23
% # Rec. Clause-clause subsumption calls : 23
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 6
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:    33 leaves,   1.18+/-0.520 terms/leaf
% # Paramod-from index:           10 leaves,   1.10+/-0.300 terms/leaf
% # Paramod-into index:           29 leaves,   1.17+/-0.460 terms/leaf
% # -------------------------------------------------
% # User time              : 0.013 s
% # System time            : 0.001 s
% # Total time             : 0.014 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/SystemOnTPTP15794/SEU121+1.tptp
% 
%------------------------------------------------------------------------------