%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU368+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 : 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 04:09:45 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP29780/SEU368+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29780/SEU368+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29780/SEU368+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 29876
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:incl_POSet(X1)=rel_str_of(X1,inclusion_order(X1)),file('/tmp/SRASS.s.p', d1_yellow_1)).
% fof(4, axiom,![X1]:(rel_str(X1)=>(strict_rel_str(X1)=>X1=rel_str_of(the_carrier(X1),the_InternalRel(X1)))),file('/tmp/SRASS.s.p', abstractness_v1_orders_2)).
% fof(5, axiom,![X1]:(rel_str(X1)=>relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))),file('/tmp/SRASS.s.p', dt_u1_orders_2)).
% fof(12, axiom,![X1]:(strict_rel_str(incl_POSet(X1))&rel_str(incl_POSet(X1))),file('/tmp/SRASS.s.p', dt_k2_yellow_1)).
% fof(16, axiom,![X1]:![X2]:(relation_of2(X2,X1,X1)=>![X3]:![X4]:(rel_str_of(X1,X2)=rel_str_of(X3,X4)=>(X1=X3&X2=X4))),file('/tmp/SRASS.s.p', free_g1_orders_2)).
% fof(22, axiom,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)<=>relation_of2(X3,X1,X2)),file('/tmp/SRASS.s.p', redefinition_m2_relset_1)).
% fof(37, axiom,![X1]:((((reflexive(inclusion_order(X1))&antisymmetric(inclusion_order(X1)))&transitive(inclusion_order(X1)))&v1_partfun1(inclusion_order(X1),X1,X1))&relation_of2_as_subset(inclusion_order(X1),X1,X1)),file('/tmp/SRASS.s.p', dt_k1_yellow_1)).
% fof(53, conjecture,![X1]:(the_carrier(incl_POSet(X1))=X1&the_InternalRel(incl_POSet(X1))=inclusion_order(X1)),file('/tmp/SRASS.s.p', t1_yellow_1)).
% fof(54, negated_conjecture,~(![X1]:(the_carrier(incl_POSet(X1))=X1&the_InternalRel(incl_POSet(X1))=inclusion_order(X1))),inference(assume_negation,[status(cth)],[53])).
% fof(66, plain,![X2]:incl_POSet(X2)=rel_str_of(X2,inclusion_order(X2)),inference(variable_rename,[status(thm)],[1])).
% cnf(67,plain,(incl_POSet(X1)=rel_str_of(X1,inclusion_order(X1))),inference(split_conjunct,[status(thm)],[66])).
% fof(73, plain,![X1]:(~(rel_str(X1))|(~(strict_rel_str(X1))|X1=rel_str_of(the_carrier(X1),the_InternalRel(X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(74, plain,![X2]:(~(rel_str(X2))|(~(strict_rel_str(X2))|X2=rel_str_of(the_carrier(X2),the_InternalRel(X2)))),inference(variable_rename,[status(thm)],[73])).
% cnf(75,plain,(X1=rel_str_of(the_carrier(X1),the_InternalRel(X1))|~strict_rel_str(X1)|~rel_str(X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(76, plain,![X1]:(~(rel_str(X1))|relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(77, plain,![X2]:(~(rel_str(X2))|relation_of2_as_subset(the_InternalRel(X2),the_carrier(X2),the_carrier(X2))),inference(variable_rename,[status(thm)],[76])).
% cnf(78,plain,(relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))|~rel_str(X1)),inference(split_conjunct,[status(thm)],[77])).
% fof(100, plain,![X2]:(strict_rel_str(incl_POSet(X2))&rel_str(incl_POSet(X2))),inference(variable_rename,[status(thm)],[12])).
% cnf(101,plain,(rel_str(incl_POSet(X1))),inference(split_conjunct,[status(thm)],[100])).
% cnf(102,plain,(strict_rel_str(incl_POSet(X1))),inference(split_conjunct,[status(thm)],[100])).
% fof(110, plain,![X1]:![X2]:(~(relation_of2(X2,X1,X1))|![X3]:![X4]:(~(rel_str_of(X1,X2)=rel_str_of(X3,X4))|(X1=X3&X2=X4))),inference(fof_nnf,[status(thm)],[16])).
% fof(111, plain,![X5]:![X6]:(~(relation_of2(X6,X5,X5))|![X7]:![X8]:(~(rel_str_of(X5,X6)=rel_str_of(X7,X8))|(X5=X7&X6=X8))),inference(variable_rename,[status(thm)],[110])).
% fof(112, plain,![X5]:![X6]:![X7]:![X8]:((~(rel_str_of(X5,X6)=rel_str_of(X7,X8))|(X5=X7&X6=X8))|~(relation_of2(X6,X5,X5))),inference(shift_quantors,[status(thm)],[111])).
% fof(113, plain,![X5]:![X6]:![X7]:![X8]:(((X5=X7|~(rel_str_of(X5,X6)=rel_str_of(X7,X8)))|~(relation_of2(X6,X5,X5)))&((X6=X8|~(rel_str_of(X5,X6)=rel_str_of(X7,X8)))|~(relation_of2(X6,X5,X5)))),inference(distribute,[status(thm)],[112])).
% cnf(114,plain,(X1=X4|~relation_of2(X1,X2,X2)|rel_str_of(X2,X1)!=rel_str_of(X3,X4)),inference(split_conjunct,[status(thm)],[113])).
% cnf(115,plain,(X2=X3|~relation_of2(X1,X2,X2)|rel_str_of(X2,X1)!=rel_str_of(X3,X4)),inference(split_conjunct,[status(thm)],[113])).
% fof(131, plain,![X1]:![X2]:![X3]:((~(relation_of2_as_subset(X3,X1,X2))|relation_of2(X3,X1,X2))&(~(relation_of2(X3,X1,X2))|relation_of2_as_subset(X3,X1,X2))),inference(fof_nnf,[status(thm)],[22])).
% fof(132, plain,![X4]:![X5]:![X6]:((~(relation_of2_as_subset(X6,X4,X5))|relation_of2(X6,X4,X5))&(~(relation_of2(X6,X4,X5))|relation_of2_as_subset(X6,X4,X5))),inference(variable_rename,[status(thm)],[131])).
% cnf(134,plain,(relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[132])).
% fof(188, plain,![X2]:((((reflexive(inclusion_order(X2))&antisymmetric(inclusion_order(X2)))&transitive(inclusion_order(X2)))&v1_partfun1(inclusion_order(X2),X2,X2))&relation_of2_as_subset(inclusion_order(X2),X2,X2)),inference(variable_rename,[status(thm)],[37])).
% cnf(189,plain,(relation_of2_as_subset(inclusion_order(X1),X1,X1)),inference(split_conjunct,[status(thm)],[188])).
% fof(243, negated_conjecture,?[X1]:(~(the_carrier(incl_POSet(X1))=X1)|~(the_InternalRel(incl_POSet(X1))=inclusion_order(X1))),inference(fof_nnf,[status(thm)],[54])).
% fof(244, negated_conjecture,?[X2]:(~(the_carrier(incl_POSet(X2))=X2)|~(the_InternalRel(incl_POSet(X2))=inclusion_order(X2))),inference(variable_rename,[status(thm)],[243])).
% fof(245, negated_conjecture,(~(the_carrier(incl_POSet(esk14_0))=esk14_0)|~(the_InternalRel(incl_POSet(esk14_0))=inclusion_order(esk14_0))),inference(skolemize,[status(esa)],[244])).
% cnf(246,negated_conjecture,(the_InternalRel(incl_POSet(esk14_0))!=inclusion_order(esk14_0)|the_carrier(incl_POSet(esk14_0))!=esk14_0),inference(split_conjunct,[status(thm)],[245])).
% cnf(248,plain,(rel_str(rel_str_of(X1,inclusion_order(X1)))),inference(rw,[status(thm)],[101,67,theory(equality)]),['unfolding']).
% cnf(249,plain,(strict_rel_str(rel_str_of(X1,inclusion_order(X1)))),inference(rw,[status(thm)],[102,67,theory(equality)]),['unfolding']).
% cnf(259,negated_conjecture,(the_carrier(rel_str_of(esk14_0,inclusion_order(esk14_0)))!=esk14_0|the_InternalRel(rel_str_of(esk14_0,inclusion_order(esk14_0)))!=inclusion_order(esk14_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[246,67,theory(equality)]),67,theory(equality)]),['unfolding']).
% cnf(266,plain,(relation_of2(inclusion_order(X1),X1,X1)),inference(spm,[status(thm)],[134,189,theory(equality)])).
% cnf(281,plain,(relation_of2(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))|~rel_str(X1)),inference(spm,[status(thm)],[134,78,theory(equality)])).
% cnf(328,plain,(X1=X2|rel_str_of(X1,inclusion_order(X1))!=rel_str_of(X2,X3)),inference(spm,[status(thm)],[115,266,theory(equality)])).
% cnf(335,plain,(X1=the_carrier(X2)|rel_str_of(X1,inclusion_order(X1))!=X2|~strict_rel_str(X2)|~rel_str(X2)),inference(spm,[status(thm)],[328,75,theory(equality)])).
% cnf(375,plain,(X1=the_carrier(rel_str_of(X1,inclusion_order(X1)))|~strict_rel_str(rel_str_of(X1,inclusion_order(X1)))|~rel_str(rel_str_of(X1,inclusion_order(X1)))),inference(er,[status(thm)],[335,theory(equality)])).
% cnf(376,plain,(X1=the_carrier(rel_str_of(X1,inclusion_order(X1)))|$false|~rel_str(rel_str_of(X1,inclusion_order(X1)))),inference(rw,[status(thm)],[375,249,theory(equality)])).
% cnf(377,plain,(X1=the_carrier(rel_str_of(X1,inclusion_order(X1)))|$false|$false),inference(rw,[status(thm)],[376,248,theory(equality)])).
% cnf(378,plain,(X1=the_carrier(rel_str_of(X1,inclusion_order(X1)))),inference(cn,[status(thm)],[377,theory(equality)])).
% cnf(379,plain,(rel_str_of(X1,the_InternalRel(rel_str_of(X1,inclusion_order(X1))))=rel_str_of(X1,inclusion_order(X1))|~strict_rel_str(rel_str_of(X1,inclusion_order(X1)))|~rel_str(rel_str_of(X1,inclusion_order(X1)))),inference(spm,[status(thm)],[75,378,theory(equality)])).
% cnf(384,negated_conjecture,(the_InternalRel(rel_str_of(esk14_0,inclusion_order(esk14_0)))!=inclusion_order(esk14_0)|$false),inference(rw,[status(thm)],[259,378,theory(equality)])).
% cnf(385,negated_conjecture,(the_InternalRel(rel_str_of(esk14_0,inclusion_order(esk14_0)))!=inclusion_order(esk14_0)),inference(cn,[status(thm)],[384,theory(equality)])).
% cnf(386,plain,(rel_str_of(X1,the_InternalRel(rel_str_of(X1,inclusion_order(X1))))=rel_str_of(X1,inclusion_order(X1))|$false|~rel_str(rel_str_of(X1,inclusion_order(X1)))),inference(rw,[status(thm)],[379,249,theory(equality)])).
% cnf(387,plain,(rel_str_of(X1,the_InternalRel(rel_str_of(X1,inclusion_order(X1))))=rel_str_of(X1,inclusion_order(X1))|$false|$false),inference(rw,[status(thm)],[386,248,theory(equality)])).
% cnf(388,plain,(rel_str_of(X1,the_InternalRel(rel_str_of(X1,inclusion_order(X1))))=rel_str_of(X1,inclusion_order(X1))),inference(cn,[status(thm)],[387,theory(equality)])).
% cnf(404,plain,(the_InternalRel(X1)=X2|rel_str_of(the_carrier(X1),the_InternalRel(X1))!=rel_str_of(X3,X2)|~rel_str(X1)),inference(spm,[status(thm)],[114,281,theory(equality)])).
% cnf(424,plain,(the_InternalRel(rel_str_of(X1,inclusion_order(X1)))=X2|rel_str_of(X1,the_InternalRel(rel_str_of(X1,inclusion_order(X1))))!=rel_str_of(X3,X2)|~rel_str(rel_str_of(X1,inclusion_order(X1)))),inference(spm,[status(thm)],[404,378,theory(equality)])).
% cnf(426,plain,(the_InternalRel(rel_str_of(X1,inclusion_order(X1)))=X2|rel_str_of(X1,inclusion_order(X1))!=rel_str_of(X3,X2)|~rel_str(rel_str_of(X1,inclusion_order(X1)))),inference(rw,[status(thm)],[424,388,theory(equality)])).
% cnf(427,plain,(the_InternalRel(rel_str_of(X1,inclusion_order(X1)))=X2|rel_str_of(X1,inclusion_order(X1))!=rel_str_of(X3,X2)|$false),inference(rw,[status(thm)],[426,248,theory(equality)])).
% cnf(428,plain,(the_InternalRel(rel_str_of(X1,inclusion_order(X1)))=X2|rel_str_of(X1,inclusion_order(X1))!=rel_str_of(X3,X2)),inference(cn,[status(thm)],[427,theory(equality)])).
% cnf(442,plain,(the_InternalRel(rel_str_of(X1,inclusion_order(X1)))=inclusion_order(X1)),inference(er,[status(thm)],[428,theory(equality)])).
% cnf(457,negated_conjecture,($false),inference(rw,[status(thm)],[385,442,theory(equality)])).
% cnf(458,negated_conjecture,($false),inference(cn,[status(thm)],[457,theory(equality)])).
% cnf(459,negated_conjecture,($false),458,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 128
% # ...of these trivial : 5
% # ...subsumed : 12
% # ...remaining for further processing: 111
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 8
% # Generated clauses : 129
% # ...of the previous two non-trivial : 96
% # Contextual simplify-reflections : 7
% # Paramodulations : 116
% # Factorizations : 0
% # Equation resolutions : 13
% # Current number of processed clauses: 101
% # Positive orientable unit clauses: 42
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 53
% # Current number of unprocessed clauses: 34
% # ...number of literals in the above : 112
% # Clause-clause subsumption calls (NU) : 90
% # Rec. Clause-clause subsumption calls : 78
% # Unit Clause-clause subsumption calls : 26
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 118 leaves, 1.17+/-0.717 terms/leaf
% # Paramod-from index: 58 leaves, 1.02+/-0.130 terms/leaf
% # Paramod-into index: 99 leaves, 1.13+/-0.464 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.004 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP29780/SEU368+1.tptp
%
%------------------------------------------------------------------------------