TSTP Solution File: SEU165+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU165+3 : TPTP v5.0.0. Released v3.2.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:23:27 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/SystemOnTPTP22306/SEU165+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP22306/SEU165+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22306/SEU165+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 22402
% 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(2, axiom,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4))),file('/tmp/SRASS.s.p', l55_zfmisc_1)).
% 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]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4))),file('/tmp/SRASS.s.p', t106_zfmisc_1)).
% fof(9, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4)))),inference(assume_negation,[status(cth)],[8])).
% fof(16, plain,![X1]:![X2]:![X3]:![X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(in(X1,X3)&in(X2,X4)))&((~(in(X1,X3))|~(in(X2,X4)))|in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))),inference(fof_nnf,[status(thm)],[2])).
% fof(17, plain,![X5]:![X6]:![X7]:![X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(in(X5,X7)&in(X6,X8)))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X5]:![X6]:![X7]:![X8]:(((in(X5,X7)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))))&(in(X6,X8)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(in(X2,X4)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[18])).
% cnf(21,plain,(in(X1,X3)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[18])).
% fof(32, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(~(in(X1,X3))|~(in(X2,X4))))&(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|(in(X1,X3)&in(X2,X4)))),inference(fof_nnf,[status(thm)],[9])).
% fof(35, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(~(in(X5,X7))|~(in(X6,X8))))&(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))|(in(X5,X7)&in(X6,X8)))),inference(variable_rename,[status(thm)],[34])).
% fof(36, negated_conjecture,((~(in(ordered_pair(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0)))|(~(in(esk3_0,esk5_0))|~(in(esk4_0,esk6_0))))&(in(ordered_pair(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))|(in(esk3_0,esk5_0)&in(esk4_0,esk6_0)))),inference(skolemize,[status(esa)],[35])).
% fof(37, negated_conjecture,((~(in(ordered_pair(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0)))|(~(in(esk3_0,esk5_0))|~(in(esk4_0,esk6_0))))&((in(esk3_0,esk5_0)|in(ordered_pair(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0)))&(in(esk4_0,esk6_0)|in(ordered_pair(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))))),inference(distribute,[status(thm)],[36])).
% cnf(38,negated_conjecture,(in(ordered_pair(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))|in(esk4_0,esk6_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,negated_conjecture,(in(ordered_pair(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))|in(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(40,negated_conjecture,(~in(esk4_0,esk6_0)|~in(esk3_0,esk5_0)|~in(ordered_pair(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))),inference(split_conjunct,[status(thm)],[37])).
% cnf(41,negated_conjecture,(in(esk3_0,esk5_0)|in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))),inference(rw,[status(thm)],[39,33,theory(equality)]),['unfolding']).
% cnf(42,negated_conjecture,(in(esk4_0,esk6_0)|in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))),inference(rw,[status(thm)],[38,33,theory(equality)]),['unfolding']).
% cnf(43,plain,(in(X2,X4)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[20,33,theory(equality)]),['unfolding']).
% cnf(44,plain,(in(X1,X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[21,33,theory(equality)]),['unfolding']).
% cnf(45,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(rw,[status(thm)],[19,33,theory(equality)]),['unfolding']).
% cnf(47,negated_conjecture,(~in(esk3_0,esk5_0)|~in(esk4_0,esk6_0)|~in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))),inference(rw,[status(thm)],[40,33,theory(equality)]),['unfolding']).
% cnf(48,negated_conjecture,(~in(esk3_0,esk5_0)|~in(esk4_0,esk6_0)),inference(csr,[status(thm)],[47,45])).
% cnf(60,negated_conjecture,(in(esk4_0,esk6_0)),inference(spm,[status(thm)],[43,42,theory(equality)])).
% cnf(65,negated_conjecture,(in(esk3_0,esk5_0)),inference(spm,[status(thm)],[44,41,theory(equality)])).
% cnf(75,negated_conjecture,(~in(esk3_0,esk5_0)|$false),inference(rw,[status(thm)],[48,60,theory(equality)])).
% cnf(76,negated_conjecture,(~in(esk3_0,esk5_0)),inference(cn,[status(thm)],[75,theory(equality)])).
% cnf(85,negated_conjecture,($false),inference(rw,[status(thm)],[76,65,theory(equality)])).
% cnf(86,negated_conjecture,($false),inference(cn,[status(thm)],[85,theory(equality)])).
% cnf(87,negated_conjecture,($false),86,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 26
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 26
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 32
% # ...of the previous two non-trivial : 30
% # Contextual simplify-reflections : 1
% # Paramodulations : 32
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 11
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 22
% # ...number of literals in the above : 43
% # Clause-clause subsumption calls (NU) : 21
% # Rec. Clause-clause subsumption calls : 21
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 18 leaves, 1.83+/-1.258 terms/leaf
% # Paramod-from index: 5 leaves, 1.20+/-0.400 terms/leaf
% # Paramod-into index: 17 leaves, 1.71+/-1.176 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.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP22306/SEU165+3.tptp
%
%------------------------------------------------------------------------------