TSTP Solution File: SEU239+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU239+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 : art09.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 02:21:51 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.93s
% 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/SystemOnTPTP27704/SEU239+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP27704/SEU239+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27704/SEU239+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 27800
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(relation(X1)=>(reflexive(X1)<=>is_reflexive_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', d9_relat_2)).
% fof(3, axiom,![X1]:(relation(X1)=>![X2]:(is_reflexive_in(X1,X2)<=>![X3]:(in(X3,X2)=>in(ordered_pair(X3,X3),X1)))),file('/tmp/SRASS.s.p', d1_relat_2)).
% fof(18, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(26, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(36, conjecture,![X1]:(relation(X1)=>(reflexive(X1)<=>![X2]:(in(X2,relation_field(X1))=>in(ordered_pair(X2,X2),X1)))),file('/tmp/SRASS.s.p', l1_wellord1)).
% fof(37, negated_conjecture,~(![X1]:(relation(X1)=>(reflexive(X1)<=>![X2]:(in(X2,relation_field(X1))=>in(ordered_pair(X2,X2),X1))))),inference(assume_negation,[status(cth)],[36])).
% fof(46, plain,![X1]:(~(relation(X1))|((~(reflexive(X1))|is_reflexive_in(X1,relation_field(X1)))&(~(is_reflexive_in(X1,relation_field(X1)))|reflexive(X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(47, plain,![X2]:(~(relation(X2))|((~(reflexive(X2))|is_reflexive_in(X2,relation_field(X2)))&(~(is_reflexive_in(X2,relation_field(X2)))|reflexive(X2)))),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,![X2]:(((~(reflexive(X2))|is_reflexive_in(X2,relation_field(X2)))|~(relation(X2)))&((~(is_reflexive_in(X2,relation_field(X2)))|reflexive(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[47])).
% cnf(49,plain,(reflexive(X1)|~relation(X1)|~is_reflexive_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,plain,(is_reflexive_in(X1,relation_field(X1))|~relation(X1)|~reflexive(X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(51, plain,![X1]:(~(relation(X1))|![X2]:((~(is_reflexive_in(X1,X2))|![X3]:(~(in(X3,X2))|in(ordered_pair(X3,X3),X1)))&(?[X3]:(in(X3,X2)&~(in(ordered_pair(X3,X3),X1)))|is_reflexive_in(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(52, plain,![X4]:(~(relation(X4))|![X5]:((~(is_reflexive_in(X4,X5))|![X6]:(~(in(X6,X5))|in(ordered_pair(X6,X6),X4)))&(?[X7]:(in(X7,X5)&~(in(ordered_pair(X7,X7),X4)))|is_reflexive_in(X4,X5)))),inference(variable_rename,[status(thm)],[51])).
% fof(53, plain,![X4]:(~(relation(X4))|![X5]:((~(is_reflexive_in(X4,X5))|![X6]:(~(in(X6,X5))|in(ordered_pair(X6,X6),X4)))&((in(esk1_2(X4,X5),X5)&~(in(ordered_pair(esk1_2(X4,X5),esk1_2(X4,X5)),X4)))|is_reflexive_in(X4,X5)))),inference(skolemize,[status(esa)],[52])).
% fof(54, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|in(ordered_pair(X6,X6),X4))|~(is_reflexive_in(X4,X5)))&((in(esk1_2(X4,X5),X5)&~(in(ordered_pair(esk1_2(X4,X5),esk1_2(X4,X5)),X4)))|is_reflexive_in(X4,X5)))|~(relation(X4))),inference(shift_quantors,[status(thm)],[53])).
% fof(55, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|in(ordered_pair(X6,X6),X4))|~(is_reflexive_in(X4,X5)))|~(relation(X4)))&(((in(esk1_2(X4,X5),X5)|is_reflexive_in(X4,X5))|~(relation(X4)))&((~(in(ordered_pair(esk1_2(X4,X5),esk1_2(X4,X5)),X4))|is_reflexive_in(X4,X5))|~(relation(X4))))),inference(distribute,[status(thm)],[54])).
% cnf(56,plain,(is_reflexive_in(X1,X2)|~relation(X1)|~in(ordered_pair(esk1_2(X1,X2),esk1_2(X1,X2)),X1)),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,plain,(is_reflexive_in(X1,X2)|in(esk1_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status
% (thm)],[55])).
% cnf(58,plain,(in(ordered_pair(X3,X3),X1)|~relation(X1)|~is_reflexive_in(X1,X2)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[55])).
% fof(107, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[18])).
% cnf(108,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[107])).
% fof(126, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[26])).
% cnf(127,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[126])).
% fof(137, negated_conjecture,?[X1]:(relation(X1)&((~(reflexive(X1))|?[X2]:(in(X2,relation_field(X1))&~(in(ordered_pair(X2,X2),X1))))&(reflexive(X1)|![X2]:(~(in(X2,relation_field(X1)))|in(ordered_pair(X2,X2),X1))))),inference(fof_nnf,[status(thm)],[37])).
% fof(138, negated_conjecture,?[X3]:(relation(X3)&((~(reflexive(X3))|?[X4]:(in(X4,relation_field(X3))&~(in(ordered_pair(X4,X4),X3))))&(reflexive(X3)|![X5]:(~(in(X5,relation_field(X3)))|in(ordered_pair(X5,X5),X3))))),inference(variable_rename,[status(thm)],[137])).
% fof(139, negated_conjecture,(relation(esk8_0)&((~(reflexive(esk8_0))|(in(esk9_0,relation_field(esk8_0))&~(in(ordered_pair(esk9_0,esk9_0),esk8_0))))&(reflexive(esk8_0)|![X5]:(~(in(X5,relation_field(esk8_0)))|in(ordered_pair(X5,X5),esk8_0))))),inference(skolemize,[status(esa)],[138])).
% fof(140, negated_conjecture,![X5]:((((~(in(X5,relation_field(esk8_0)))|in(ordered_pair(X5,X5),esk8_0))|reflexive(esk8_0))&(~(reflexive(esk8_0))|(in(esk9_0,relation_field(esk8_0))&~(in(ordered_pair(esk9_0,esk9_0),esk8_0)))))&relation(esk8_0)),inference(shift_quantors,[status(thm)],[139])).
% fof(141, negated_conjecture,![X5]:((((~(in(X5,relation_field(esk8_0)))|in(ordered_pair(X5,X5),esk8_0))|reflexive(esk8_0))&((in(esk9_0,relation_field(esk8_0))|~(reflexive(esk8_0)))&(~(in(ordered_pair(esk9_0,esk9_0),esk8_0))|~(reflexive(esk8_0)))))&relation(esk8_0)),inference(distribute,[status(thm)],[140])).
% cnf(142,negated_conjecture,(relation(esk8_0)),inference(split_conjunct,[status(thm)],[141])).
% cnf(143,negated_conjecture,(~reflexive(esk8_0)|~in(ordered_pair(esk9_0,esk9_0),esk8_0)),inference(split_conjunct,[status(thm)],[141])).
% cnf(144,negated_conjecture,(in(esk9_0,relation_field(esk8_0))|~reflexive(esk8_0)),inference(split_conjunct,[status(thm)],[141])).
% cnf(145,negated_conjecture,(reflexive(esk8_0)|in(ordered_pair(X1,X1),esk8_0)|~in(X1,relation_field(esk8_0))),inference(split_conjunct,[status(thm)],[141])).
% cnf(146,negated_conjecture,(reflexive(esk8_0)|in(unordered_pair(unordered_pair(X1,X1),singleton(X1)),esk8_0)|~in(X1,relation_field(esk8_0))),inference(rw,[status(thm)],[145,108,theory(equality)]),['unfolding']).
% cnf(147,plain,(is_reflexive_in(X1,X2)|~relation(X1)|~in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2)),singleton(esk1_2(X1,X2))),X1)),inference(rw,[status(thm)],[56,108,theory(equality)]),['unfolding']).
% cnf(148,plain,(in(unordered_pair(unordered_pair(X3,X3),singleton(X3)),X1)|~relation(X1)|~in(X3,X2)|~is_reflexive_in(X1,X2)),inference(rw,[status(thm)],[58,108,theory(equality)]),['unfolding']).
% cnf(150,negated_conjecture,(~reflexive(esk8_0)|~in(unordered_pair(unordered_pair(esk9_0,esk9_0),singleton(esk9_0)),esk8_0)),inference(rw,[status(thm)],[143,108,theory(equality)]),['unfolding']).
% cnf(192,negated_conjecture,(reflexive(esk8_0)|in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),esk8_0)|~in(X1,relation_field(esk8_0))),inference(spm,[status(thm)],[146,127,theory(equality)])).
% cnf(194,plain,(in(unordered_pair(unordered_pair(X1,X1),singleton(X1)),X2)|~relation(X2)|~in(X1,relation_field(X2))|~reflexive(X2)),inference(spm,[status(thm)],[148,50,theory(equality)])).
% cnf(195,plain,(is_reflexive_in(X1,X2)|~relation(X1)|~in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2))),X1)),inference(rw,[status(thm)],[147,127,theory(equality)])).
% cnf(273,negated_conjecture,(is_reflexive_in(esk8_0,X1)|reflexive(esk8_0)|~relation(esk8_0)|~in(esk1_2(esk8_0,X1),relation_field(esk8_0))),inference(spm,[status(thm)],[195,192,theory(equality)])).
% cnf(278,negated_conjecture,(is_reflexive_in(esk8_0,X1)|reflexive(esk8_0)|$false|~in(esk1_2(esk8_0,X1),relation_field(esk8_0))),inference(rw,[status(thm)],[273,142,theory(equality)])).
% cnf(279,negated_conjecture,(is_reflexive_in(esk8_0,X1)|reflexive(esk8_0)|~in(esk1_2(esk8_0,X1),relation_field(esk8_0))),inference(cn,[status(thm)],[278,theory(equality)])).
% cnf(281,negated_conjecture,(is_reflexive_in(esk8_0,relation_field(esk8_0))|reflexive(esk8_0)|~relation(esk8_0)),inference(spm,[status(thm)],[279,57,theory(equality)])).
% cnf(282,negated_conjecture,(is_reflexive_in(esk8_0,relation_field(esk8_0))|reflexive(esk8_0)|$false),inference(rw,[status(thm)],[281,142,theory(equality)])).
% cnf(283,negated_conjecture,(is_reflexive_in(esk8_0,relation_field(esk8_0))|reflexive(esk8_0)),inference(cn,[status(thm)],[282,theory(equality)])).
% cnf(285,negated_conjecture,(reflexive(esk8_0)|~relation(esk8_0)),inference(spm,[status(thm)],[49,283,theory(equality)])).
% cnf(288,negated_conjecture,(reflexive(esk8_0)|$false),inference(rw,[status(thm)],[285,142,theory(equality)])).
% cnf(289,negated_conjecture,(reflexive(esk8_0)),inference(cn,[status(thm)],[288,theory(equality)])).
% cnf(299,negated_conjecture,($false|~in(unordered_pair(unordered_pair(esk9_0,esk9_0),singleton(esk9_0)),esk8_0)),inference(rw,[status(thm)],[150,289,theory(equality)])).
% cnf(300,negated_conjecture,(~in(unordered_pair(unordered_pair(esk9_0,esk9_0),singleton(esk9_0)),esk8_0)),inference(cn,[status(thm)],[299,theory(equality)])).
% cnf(302,negated_conjecture,(in(esk9_0,relation_field(esk8_0))|$false),inference(rw,[status(thm)],[144,289,theory(equality)])).
% cnf(303,negated_conjecture,(in(esk9_0,relation_field(esk8_0))),inference(cn,[status(thm)],[302,theory(equality)])).
% cnf(312,negated_conjecture,(~reflexive(esk8_0)|~relation(esk8_0)|~in(esk9_0,relation_field(esk8_0))),inference(spm,[status(thm)],[300,194,theory(equality)])).
% cnf(318,negated_conjecture,($false|~relation(esk8_0)|~in(esk9_0,relation_field(esk8_0))),inference(rw,[status(thm)],[312,289,theory(equality)])).
% cnf(319,negated_conjecture,($false|$false|~in(esk9_0,relation_field(esk8_0))),inference(rw,[status(thm)],[318,142,theory(equality)])).
% cnf(320,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[319,303,theory(equality)])).
% cnf(321,negated_conjecture,($false),inference(cn,[status(thm)],[320,theory(equality)])).
% cnf(322,negated_conjecture,($false),321,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 114
% # ...of these trivial : 1
% # ...subsumed : 38
% # ...remaining for further processing: 75
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 15
% # Generated clauses : 121
% # ...of the previous two non-trivial : 103
% # Contextual simplify-reflections : 4
% # Paramodulations : 121
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 57
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 8
% # Non-unit-clauses : 30
% # Current number of unprocessed clauses: 15
% # ...number of literals in the above : 54
% # Clause-clause subsumption calls (NU) : 106
% # Rec. Clause-clause subsumption calls : 105
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 67 leaves, 1.33+/-0.583 terms/leaf
% # Paramod-from index: 31 leaves, 1.10+/-0.390 terms/leaf
% # Paramod-into index: 63 leaves, 1.24+/-0.526 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.003 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP27704/SEU239+1.tptp
%
%------------------------------------------------------------------------------