TSTP Solution File: SET949+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET949+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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 00:22:29 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP9509/SET949+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP9509/SET949+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9509/SET949+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 9605
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(X3=cartesian_product2(X1,X2)<=>![X4]:(in(X4,X3)<=>?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6)))),file('/tmp/SRASS.s.p', d2_zfmisc_1)).
% fof(6, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(7, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(8, conjecture,![X1]:![X2]:![X3]:~((in(X1,cartesian_product2(X2,X3))&![X4]:![X5]:~(ordered_pair(X4,X5)=X1))),file('/tmp/SRASS.s.p', t102_zfmisc_1)).
% fof(9, negated_conjecture,~(![X1]:![X2]:![X3]:~((in(X1,cartesian_product2(X2,X3))&![X4]:![X5]:~(ordered_pair(X4,X5)=X1)))),inference(assume_negation,[status(cth)],[8])).
% fof(16, plain,![X1]:![X2]:![X3]:((~(X3=cartesian_product2(X1,X2))|![X4]:((~(in(X4,X3))|?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6)))&(![X5]:![X6]:((~(in(X5,X1))|~(in(X6,X2)))|~(X4=ordered_pair(X5,X6)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|![X5]:![X6]:((~(in(X5,X1))|~(in(X6,X2)))|~(X4=ordered_pair(X5,X6))))&(in(X4,X3)|?[X5]:?[X6]:((in(X5,X1)&in(X6,X2))&X4=ordered_pair(X5,X6))))|X3=cartesian_product2(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(17, plain,![X7]:![X8]:![X9]:((~(X9=cartesian_product2(X7,X8))|![X10]:((~(in(X10,X9))|?[X11]:?[X12]:((in(X11,X7)&in(X12,X8))&X10=ordered_pair(X11,X12)))&(![X13]:![X14]:((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))))&(?[X15]:((~(in(X15,X9))|![X16]:![X17]:((~(in(X16,X7))|~(in(X17,X8)))|~(X15=ordered_pair(X16,X17))))&(in(X15,X9)|?[X18]:?[X19]:((in(X18,X7)&in(X19,X8))&X15=ordered_pair(X18,X19))))|X9=cartesian_product2(X7,X8))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X7]:![X8]:![X9]:((~(X9=cartesian_product2(X7,X8))|![X10]:((~(in(X10,X9))|((in(esk1_4(X7,X8,X9,X10),X7)&in(esk2_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))))&(![X13]:![X14]:((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))))&(((~(in(esk3_3(X7,X8,X9),X9))|![X16]:![X17]:((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17))))&(in(esk3_3(X7,X8,X9),X9)|((in(esk4_3(X7,X8,X9),X7)&in(esk5_3(X7,X8,X9),X8))&esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9)))))|X9=cartesian_product2(X7,X8))),inference(skolemize,[status(esa)],[17])).
% fof(19, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk3_3(X7,X8,X9),X9)))&(in(esk3_3(X7,X8,X9),X9)|((in(esk4_3(X7,X8,X9),X7)&in(esk5_3(X7,X8,X9),X8))&esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9)))))|X9=cartesian_product2(X7,X8))&(((((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))&(~(in(X10,X9))|((in(esk1_4(X7,X8,X9,X10),X7)&in(esk2_4(X7,X8,X9,X10),X8))&X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10)))))|~(X9=cartesian_product2(X7,X8)))),inference(shift_quantors,[status(thm)],[18])).
% fof(20, plain,![X7]:![X8]:![X9]:![X10]:![X13]:![X14]:![X16]:![X17]:((((((~(in(X16,X7))|~(in(X17,X8)))|~(esk3_3(X7,X8,X9)=ordered_pair(X16,X17)))|~(in(esk3_3(X7,X8,X9),X9)))|X9=cartesian_product2(X7,X8))&((((in(esk4_3(X7,X8,X9),X7)|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8))&((in(esk5_3(X7,X8,X9),X8)|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8)))&((esk3_3(X7,X8,X9)=ordered_pair(esk4_3(X7,X8,X9),esk5_3(X7,X8,X9))|in(esk3_3(X7,X8,X9),X9))|X9=cartesian_product2(X7,X8))))&(((((~(in(X13,X7))|~(in(X14,X8)))|~(X10=ordered_pair(X13,X14)))|in(X10,X9))|~(X9=cartesian_product2(X7,X8)))&((((in(esk1_4(X7,X8,X9,X10),X7)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))&((in(esk2_4(X7,X8,X9,X10),X8)|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8))))&((X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))|~(in(X10,X9)))|~(X9=cartesian_product2(X7,X8)))))),inference(distribute,[status(thm)],[19])).
% cnf(21,plain,(X4=ordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4))|X1!=cartesian_product2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(37, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(38,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[7])).
% cnf(40,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[39])).
% fof(41, negated_conjecture,?[X1]:?[X2]:?[X3]:(in(X1,cartesian_product2(X2,X3))&![X4]:![X5]:~(ordered_pair(X4,X5)=X1)),inference(fof_nnf,[status(thm)],[9])).
% fof(42, negated_conjecture,?[X6]:?[X7]:?[X8]:(in(X6,cartesian_product2(X7,X8))&![X9]:![X10]:~(ordered_pair(X9,X10)=X6)),inference(variable_rename,[status(thm)],[41])).
% fof(43, negated_conjecture,(in(esk8_0,cartesian_product2(esk9_0,esk10_0))&![X9]:![X10]:~(ordered_pair(X9,X10)=esk8_0)),inference(skolemize,[status(esa)],[42])).
% fof(44, negated_conjecture,![X9]:![X10]:(~(ordered_pair(X9,X10)=esk8_0)&in(esk8_0,cartesian_product2(esk9_0,esk10_0))),inference(shift_quantors,[status(thm)],[43])).
% cnf(45,negated_conjecture,(in(esk8_0,cartesian_product2(esk9_0,esk10_0))),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(ordered_pair(X1,X2)!=esk8_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(48,plain,(unordered_pair(unordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4)),singleton(esk1_4(X2,X3,X1,X4)))=X4|cartesian_product2(X2,X3)!=X1|~in(X4,X1)),inference(rw,[status(thm)],[21,40,theory(equality)]),['unfolding']).
% cnf(51,negated_conjecture,(unordered_pair(unordered_pair(X1,X2),singleton(X1))!=esk8_0),inference(rw,[status(thm)],[46,40,theory(equality)]),['unfolding']).
% cnf(53,plain,(unordered_pair(singleton(esk1_4(X2,X3,X1,X4)),unordered_pair(esk1_4(X2,X3,X1,X4),esk2_4(X2,X3,X1,X4)))=X4|cartesian_product2(X2,X3)!=X1|~in(X4,X1)),inference(rw,[status(thm)],[48,38,theory(equality)])).
% cnf(57,negated_conjecture,(unordered_pair(singleton(X1),unordered_pair(X1,X2))!=esk8_0),inference(spm,[status(thm)],[51,38,theory(equality)])).
% cnf(117,negated_conjecture,(X4!=esk8_0|cartesian_product2(X1,X2)!=X3|~in(X4,X3)),inference(spm,[status(thm)],[57,53,theory(equality)])).
% cnf(169,negated_conjecture,(X1!=esk8_0|~in(X1,cartesian_product2(X2,X3))),inference(er,[status(thm)],[117,theory(equality)])).
% cnf(170,negated_conjecture,($false),inference(spm,[status(thm)],[169,45,theory(equality)])).
% cnf(182,negated_conjecture,($false),170,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 94
% # ...of these trivial : 0
% # ...subsumed : 39
% # ...remaining for further processing: 55
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 127
% # ...of the previous two non-trivial : 115
% # Contextual simplify-reflections : 0
% # Paramodulations : 123
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 40
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 11
% # Non-unit-clauses : 26
% # Current number of unprocessed clauses: 51
% # ...number of literals in the above : 195
% # Clause-clause subsumption calls (NU) : 114
% # Rec. Clause-clause subsumption calls : 108
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 46 leaves, 1.65+/-1.808 terms/leaf
% # Paramod-from index: 12 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-into index: 43 leaves, 1.33+/-0.706 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.002 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP9509/SET949+1.tptp
%
%------------------------------------------------------------------------------