TSTP Solution File: SEU127+2 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU127+2 : TPTP v5.0.0. Released v3.3.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 : Thu Dec 30 01:11:28 EST 2010

% Result   : Theorem 0.98s
% Output   : Solution 0.98s
% 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/SystemOnTPTP15939/SEU127+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP15939/SEU127+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15939/SEU127+2.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 16035
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time     : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(15, axiom,![X1]:![X2]:![X3]:(X3=set_intersection2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&in(X4,X2)))),file('/tmp/SRASS.s.p', d3_xboole_0)).
% fof(35, conjecture,![X1]:![X2]:subset(set_intersection2(X1,X2),X1),file('/tmp/SRASS.s.p', t17_xboole_1)).
% fof(36, negated_conjecture,~(![X1]:![X2]:subset(set_intersection2(X1,X2),X1)),inference(assume_negation,[status(cth)],[35])).
% fof(67, 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)],[9])).
% fof(68, 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)],[67])).
% fof(69, 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)],[68])).
% fof(70, 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)],[69])).
% fof(71, 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)],[70])).
% cnf(72,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[71])).
% cnf(73,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[71])).
% fof(92, plain,![X1]:![X2]:![X3]:((~(X3=set_intersection2(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&in(X4,X2)))&((~(in(X4,X1))|~(in(X4,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|~(in(X4,X2))))&(in(X4,X3)|(in(X4,X1)&in(X4,X2))))|X3=set_intersection2(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(93, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|~(in(X9,X6))))&(in(X9,X7)|(in(X9,X5)&in(X9,X6))))|X7=set_intersection2(X5,X6))),inference(variable_rename,[status(thm)],[92])).
% fof(94, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk5_3(X5,X6,X7),X7))|(~(in(esk5_3(X5,X6,X7),X5))|~(in(esk5_3(X5,X6,X7),X6))))&(in(esk5_3(X5,X6,X7),X7)|(in(esk5_3(X5,X6,X7),X5)&in(esk5_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(skolemize,[status(esa)],[93])).
% fof(95, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&(((~(in(esk5_3(X5,X6,X7),X7))|(~(in(esk5_3(X5,X6,X7),X5))|~(in(esk5_3(X5,X6,X7),X6))))&(in(esk5_3(X5,X6,X7),X7)|(in(esk5_3(X5,X6,X7),X5)&in(esk5_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(shift_quantors,[status(thm)],[94])).
% fof(96, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&((in(X8,X6)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6))))&(((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))|~(X7=set_intersection2(X5,X6))))&(((~(in(esk5_3(X5,X6,X7),X7))|(~(in(esk5_3(X5,X6,X7),X5))|~(in(esk5_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))&(((in(esk5_3(X5,X6,X7),X5)|in(esk5_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))&((in(esk5_3(X5,X6,X7),X6)|in(esk5_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))))),inference(distribute,[status(thm)],[95])).
% cnf(102,plain,(in(X4,X2)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[96])).
% fof(165, negated_conjecture,?[X1]:?[X2]:~(subset(set_intersection2(X1,X2),X1)),inference(fof_nnf,[status(thm)],[36])).
% fof(166, negated_conjecture,?[X3]:?[X4]:~(subset(set_intersection2(X3,X4),X3)),inference(variable_rename,[status(thm)],[165])).
% fof(167, negated_conjecture,~(subset(set_intersection2(esk9_0,esk10_0),esk9_0)),inference(skolemize,[status(esa)],[166])).
% cnf(168,negated_conjecture,(~subset(set_intersection2(esk9_0,esk10_0),esk9_0)),inference(split_conjunct,[status(thm)],[167])).
% cnf(212,negated_conjecture,(in(esk1_2(set_intersection2(esk9_0,esk10_0),esk9_0),set_intersection2(esk9_0,esk10_0))),inference(spm,[status(thm)],[168,73,theory(equality)])).
% cnf(217,negated_conjecture,(~in(esk1_2(set_intersection2(esk9_0,esk10_0),esk9_0),esk9_0)),inference(spm,[status(thm)],[168,72,theory(equality)])).
% cnf(282,plain,(in(X1,X2)|~in(X1,set_intersection2(X2,X3))),inference(er,[status(thm)],[102,theory(equality)])).
% cnf(2043,negated_conjecture,(in(esk1_2(set_intersection2(esk9_0,esk10_0),esk9_0),esk9_0)),inference(spm,[status(thm)],[282,212,theory(equality)])).
% cnf(2045,negated_conjecture,($false),inference(sr,[status(thm)],[2043,217,theory(equality)])).
% cnf(2046,negated_conjecture,($false),2045,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 450
% # ...of these trivial                : 7
% # ...subsumed                        : 252
% # ...remaining for further processing: 191
% # Other redundant clauses eliminated : 32
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 1502
% # ...of the previous two non-trivial : 1227
% # Contextual simplify-reflections    : 2
% # Paramodulations                    : 1456
% # Factorizations                     : 6
% # Equation resolutions               : 40
% # Current number of processed clauses: 139
% #    Positive orientable unit clauses: 20
% #    Positive unorientable unit clauses: 2
% #    Negative unit clauses           : 13
% #    Non-unit-clauses                : 104
% # Current number of unprocessed clauses: 876
% # ...number of literals in the above : 2884
% # Clause-clause subsumption calls (NU) : 946
% # Rec. Clause-clause subsumption calls : 932
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 27
% # Indexed BW rewrite successes       : 25
% # Backwards rewriting index:    71 leaves,   1.77+/-1.567 terms/leaf
% # Paramod-from index:           36 leaves,   1.39+/-0.718 terms/leaf
% # Paramod-into index:           69 leaves,   1.65+/-1.272 terms/leaf
% # -------------------------------------------------
% # User time              : 0.054 s
% # System time            : 0.007 s
% # Total time             : 0.061 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP15939/SEU127+2.tptp
% 
%------------------------------------------------------------------------------