%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU275+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 : art05.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:51:59 EST 2010
% Result : Theorem 6.85s
% Output : Solution 6.85s
% 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/SystemOnTPTP26907/SEU275+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26907/SEU275+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26907/SEU275+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 27039
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.086 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(ordinal(X1)=>connected(inclusion_relation(X1))),file('/tmp/SRASS.s.p', t4_wellord2)).
% fof(2, axiom,![X1]:(ordinal(X1)=>well_founded_relation(inclusion_relation(X1))),file('/tmp/SRASS.s.p', t6_wellord2)).
% fof(3, axiom,![X1]:relation(inclusion_relation(X1)),file('/tmp/SRASS.s.p', dt_k1_wellord2)).
% fof(9, axiom,![X1]:reflexive(inclusion_relation(X1)),file('/tmp/SRASS.s.p', t2_wellord2)).
% fof(11, axiom,![X1]:transitive(inclusion_relation(X1)),file('/tmp/SRASS.s.p', t3_wellord2)).
% fof(12, axiom,![X1]:antisymmetric(inclusion_relation(X1)),file('/tmp/SRASS.s.p', t5_wellord2)).
% fof(311, axiom,![X1]:(relation(X1)=>(well_ordering(X1)<=>((((reflexive(X1)&transitive(X1))&antisymmetric(X1))&connected(X1))&well_founded_relation(X1)))),file('/tmp/SRASS.s.p', d4_wellord1)).
% fof(353, conjecture,![X1]:(ordinal(X1)=>well_ordering(inclusion_relation(X1))),file('/tmp/SRASS.s.p', t7_wellord2)).
% fof(354, negated_conjecture,~(![X1]:(ordinal(X1)=>well_ordering(inclusion_relation(X1)))),inference(assume_negation,[status(cth)],[353])).
% fof(394, plain,![X1]:(~(ordinal(X1))|connected(inclusion_relation(X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(395, plain,![X2]:(~(ordinal(X2))|connected(inclusion_relation(X2))),inference(variable_rename,[status(thm)],[394])).
% cnf(396,plain,(connected(inclusion_relation(X1))|~ordinal(X1)),inference(split_conjunct,[status(thm)],[395])).
% fof(397, plain,![X1]:(~(ordinal(X1))|well_founded_relation(inclusion_relation(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(398, plain,![X2]:(~(ordinal(X2))|well_founded_relation(inclusion_relation(X2))),inference(variable_rename,[status(thm)],[397])).
% cnf(399,plain,(well_founded_relation(inclusion_relation(X1))|~ordinal(X1)),inference(split_conjunct,[status(thm)],[398])).
% fof(400, plain,![X2]:relation(inclusion_relation(X2)),inference(variable_rename,[status(thm)],[3])).
% cnf(401,plain,(relation(inclusion_relation(X1))),inference(split_conjunct,[status(thm)],[400])).
% fof(416, plain,![X2]:reflexive(inclusion_relation(X2)),inference(variable_rename,[status(thm)],[9])).
% cnf(417,plain,(reflexive(inclusion_relation(X1))),inference(split_conjunct,[status(thm)],[416])).
% fof(421, plain,![X2]:transitive(inclusion_relation(X2)),inference(variable_rename,[status(thm)],[11])).
% cnf(422,plain,(transitive(inclusion_relation(X1))),inference(split_conjunct,[status(thm)],[421])).
% fof(423, plain,![X2]:antisymmetric(inclusion_relation(X2)),inference(variable_rename,[status(thm)],[12])).
% cnf(424,plain,(antisymmetric(inclusion_relation(X1))),inference(split_conjunct,[status(thm)],[423])).
% fof(1960, plain,![X1]:(~(relation(X1))|((~(well_ordering(X1))|((((reflexive(X1)&transitive(X1))&antisymmetric(X1))&connected(X1))&well_founded_relation(X1)))&(((((~(reflexive(X1))|~(transitive(X1)))|~(antisymmetric(X1)))|~(connected(X1)))|~(well_founded_relation(X1)))|well_ordering(X1)))),inference(fof_nnf,[status(thm)],[311])).
% fof(1961, plain,![X2]:(~(relation(X2))|((~(well_ordering(X2))|((((reflexive(X2)&transitive(X2))&antisymmetric(X2))&connected(X2))&well_founded_relation(X2)))&(((((~(reflexive(X2))|~(transitive(X2)))|~(antisymmetric(X2)))|~(connected(X2)))|~(well_founded_relation(X2)))|well_ordering(X2)))),inference(variable_rename,[status(thm)],[1960])).
% fof(1962, plain,![X2]:(((((((reflexive(X2)|~(well_ordering(X2)))|~(relation(X2)))&((transitive(X2)|~(well_ordering(X2)))|~(relation(X2))))&((antisymmetric(X2)|~(well_ordering(X2)))|~(relation(X2))))&((connected(X2)|~(well_ordering(X2)))|~(relation(X2))))&((well_founded_relation(X2)|~(well_ordering(X2)))|~(relation(X2))))&((((((~(reflexive(X2))|~(transitive(X2)))|~(antisymmetric(X2)))|~(connected(X2)))|~(well_founded_relation(X2)))|well_ordering(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[1961])).
% cnf(1963,plain,(well_ordering(X1)|~relation(X1)|~well_founded_relation(X1)|~connected(X1)|~antisymmetric(X1)|~transitive(X1)|~reflexive(X1)),inference(split_conjunct,[status(thm)],[1962])).
% fof(2070, negated_conjecture,?[X1]:(ordinal(X1)&~(well_ordering(inclusion_relation(X1)))),inference(fof_nnf,[status(thm)],[354])).
% fof(2071, negated_conjecture,?[X2]:(ordinal(X2)&~(well_ordering(inclusion_relation(X2)))),inference(variable_rename,[status(thm)],[2070])).
% fof(2072, negated_conjecture,(ordinal(esk146_0)&~(well_ordering(inclusion_relation(esk146_0)))),inference(skolemize,[status(esa)],[2071])).
% cnf(2073,negated_conjecture,(~well_ordering(inclusion_relation(esk146_0))),inference(split_conjunct,[status(thm)],[2072])).
% cnf(2074,negated_conjecture,(ordinal(esk146_0)),inference(split_conjunct,[status(thm)],[2072])).
% cnf(3092,plain,(well_ordering(inclusion_relation(X1))|~antisymmetric(inclusion_relation(X1))|~transitive(inclusion_relation(X1))|~relation(inclusion_relation(X1))|~well_founded_relation(inclusion_relation(X1))|~connected(inclusion_relation(X1))),inference(spm,[status(thm)],[1963,417,theory(equality)])).
% cnf(3094,plain,(well_ordering(inclusion_relation(X1))|$false|~transitive(inclusion_relation(X1))|~relation(inclusion_relation(X1))|~well_founded_relation(inclusion_relation(X1))|~connected(inclusion_relation(X1))),inference(rw,[status(thm)],[3092,424,theory(equality)])).
% cnf(3095,plain,(well_ordering(inclusion_relation(X1))|$false|$false|~relation(inclusion_relation(X1))|~well_founded_relation(inclusion_relation(X1))|~connected(inclusion_relation(X1))),inference(rw,[status(thm)],[3094,422,theory(equality)])).
% cnf(3096,plain,(well_ordering(inclusion_relation(X1))|$false|$false|$false|~well_founded_relation(inclusion_relation(X1))|~connected(inclusion_relation(X1))),inference(rw,[status(thm)],[3095,401,theory(equality)])).
% cnf(3097,plain,(well_ordering(inclusion_relation(X1))|~well_founded_relation(inclusion_relation(X1))|~connected(inclusion_relation(X1))),inference(cn,[status(thm)],[3096,theory(equality)])).
% cnf(18288,negated_conjecture,(~well_founded_relation(inclusion_relation(esk146_0))|~connected(inclusion_relation(esk146_0))),inference(spm,[status(thm)],[2073,3097,theory(equality)])).
% cnf(18314,negated_conjecture,(~connected(inclusion_relation(esk146_0))|~ordinal(esk146_0)),inference(spm,[status(thm)],[18288,399,theory(equality)])).
% cnf(18315,negated_conjecture,(~connected(inclusion_relation(esk146_0))|$false),inference(rw,[status(thm)],[18314,2074,theory(equality)])).
% cnf(18316,negated_conjecture,(~connected(inclusion_relation(esk146_0))),inference(cn,[status(thm)],[18315,theory(equality)])).
% cnf(18319,negated_conjecture,(~ordinal(esk146_0)),inference(spm,[status(thm)],[18316,396,theory(equality)])).
% cnf(18320,negated_conjecture,($false),inference(rw,[status(thm)],[18319,2074,theory(equality)])).
% cnf(18321,negated_conjecture,($false),inference(cn,[status(thm)],[18320,theory(equality)])).
% cnf(18322,negated_conjecture,($false),18321,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1608
% # ...of these trivial : 19
% # ...subsumed : 74
% # ...remaining for further processing: 1515
% # Other redundant clauses eliminated : 119
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 18
% # Generated clauses : 14661
% # ...of the previous two non-trivial : 14238
% # Contextual simplify-reflections : 37
% # Paramodulations : 14489
% # Factorizations : 14
% # Equation resolutions : 167
% # Current number of processed clauses: 761
% # Positive orientable unit clauses: 86
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 19
% # Non-unit-clauses : 653
% # Current number of unprocessed clauses: 14023
% # ...number of literals in the above : 77006
% # Clause-clause subsumption calls (NU) : 64919
% # Rec. Clause-clause subsumption calls : 15547
% # Unit Clause-clause subsumption calls : 1156
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 64
% # Indexed BW rewrite successes : 55
% # Backwards rewriting index: 789 leaves, 1.54+/-3.252 terms/leaf
% # Paramod-from index: 325 leaves, 1.15+/-1.633 terms/leaf
% # Paramod-into index: 691 leaves, 1.38+/-2.844 terms/leaf
% # -------------------------------------------------
% # User time : 0.893 s
% # System time : 0.029 s
% # Total time : 0.922 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.41 CPU 1.50 WC
% FINAL PrfWatch: 1.41 CPU 1.50 WC
% SZS output end Solution for /tmp/SystemOnTPTP26907/SEU275+2.tptp
%
%------------------------------------------------------------------------------