TSTP Solution File: KRS157+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KRS157+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art04.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 : Wed Dec 29 08:38:45 EST 2010

% Result   : Theorem 2.66s
% Output   : Solution 2.66s
% 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/SystemOnTPTP11565/KRS157+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP11565/KRS157+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11565/KRS157+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 11661
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.047 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),file('/tmp/SRASS.s.p', axiom_0)).
% fof(2, axiom,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),file('/tmp/SRASS.s.p', axiom_1)).
% fof(3, axiom,![X1]:(cC30(X1)<=>(cC28(X1)&cC14(X1))),file('/tmp/SRASS.s.p', axiom_132)).
% fof(4, axiom,![X1]:(cC46(X1)<=>(cC30(X1)&cC44(X1))),file('/tmp/SRASS.s.p', axiom_148)).
% fof(6, axiom,![X1]:(cC216(X1)<=>(cC64(X1)&cC214xcomp(X1))),file('/tmp/SRASS.s.p', axiom_121)).
% fof(7, axiom,![X1]:(cTEST(X1)<=>(cC216(X1)&cC46(X1))),file('/tmp/SRASS.s.p', axiom_201)).
% fof(11, axiom,cTEST(iV3102),file('/tmp/SRASS.s.p', axiom_202)).
% fof(220, conjecture,(((((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC14(iV3102))&cC44(iV3102))&cC216(iV3102))&cC64(iV3102))&cC46(iV3102))&cC28(iV3102))&cowlThing(iV3102))&cC30(iV3102)),file('/tmp/SRASS.s.p', the_axiom)).
% fof(221, negated_conjecture,~((((((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC14(iV3102))&cC44(iV3102))&cC216(iV3102))&cC64(iV3102))&cC46(iV3102))&cC28(iV3102))&cowlThing(iV3102))&cC30(iV3102))),inference(assume_negation,[status(cth)],[220])).
% fof(222, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(223, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(224, negated_conjecture,~((((((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC14(iV3102))&cC44(iV3102))&cC216(iV3102))&cC64(iV3102))&cC46(iV3102))&cC28(iV3102))&cowlThing(iV3102))&cC30(iV3102))),inference(fof_simplification,[status(thm)],[221,theory(equality)])).
% fof(225, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[222])).
% cnf(226,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[225])).
% cnf(227,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[225])).
% fof(228, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[223])).
% fof(229, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[228])).
% cnf(230,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[229])).
% cnf(231,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[229])).
% fof(232, plain,![X1]:((~(cC30(X1))|(cC28(X1)&cC14(X1)))&((~(cC28(X1))|~(cC14(X1)))|cC30(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(233, plain,![X2]:((~(cC30(X2))|(cC28(X2)&cC14(X2)))&((~(cC28(X2))|~(cC14(X2)))|cC30(X2))),inference(variable_rename,[status(thm)],[232])).
% fof(234, plain,![X2]:(((cC28(X2)|~(cC30(X2)))&(cC14(X2)|~(cC30(X2))))&((~(cC28(X2))|~(cC14(X2)))|cC30(X2))),inference(distribute,[status(thm)],[233])).
% cnf(236,plain,(cC14(X1)|~cC30(X1)),inference(split_conjunct,[status(thm)],[234])).
% cnf(237,plain,(cC28(X1)|~cC30(X1)),inference(split_conjunct,[status(thm)],[234])).
% fof(238, plain,![X1]:((~(cC46(X1))|(cC30(X1)&cC44(X1)))&((~(cC30(X1))|~(cC44(X1)))|cC46(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(239, plain,![X2]:((~(cC46(X2))|(cC30(X2)&cC44(X2)))&((~(cC30(X2))|~(cC44(X2)))|cC46(X2))),inference(variable_rename,[status(thm)],[238])).
% fof(240, plain,![X2]:(((cC30(X2)|~(cC46(X2)))&(cC44(X2)|~(cC46(X2))))&((~(cC30(X2))|~(cC44(X2)))|cC46(X2))),inference(distribute,[status(thm)],[239])).
% cnf(242,plain,(cC44(X1)|~cC46(X1)),inference(split_conjunct,[status(thm)],[240])).
% cnf(243,plain,(cC30(X1)|~cC46(X1)),inference(split_conjunct,[status(thm)],[240])).
% fof(245, plain,![X1]:((~(cC216(X1))|(cC64(X1)&cC214xcomp(X1)))&((~(cC64(X1))|~(cC214xcomp(X1)))|cC216(X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(246, plain,![X2]:((~(cC216(X2))|(cC64(X2)&cC214xcomp(X2)))&((~(cC64(X2))|~(cC214xcomp(X2)))|cC216(X2))),inference(variable_rename,[status(thm)],[245])).
% fof(247, plain,![X2]:(((cC64(X2)|~(cC216(X2)))&(cC214xcomp(X2)|~(cC216(X2))))&((~(cC64(X2))|~(cC214xcomp(X2)))|cC216(X2))),inference(distribute,[status(thm)],[246])).
% cnf(250,plain,(cC64(X1)|~cC216(X1)),inference(split_conjunct,[status(thm)],[247])).
% fof(251, plain,![X1]:((~(cTEST(X1))|(cC216(X1)&cC46(X1)))&((~(cC216(X1))|~(cC46(X1)))|cTEST(X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(252, plain,![X2]:((~(cTEST(X2))|(cC216(X2)&cC46(X2)))&((~(cC216(X2))|~(cC46(X2)))|cTEST(X2))),inference(variable_rename,[status(thm)],[251])).
% fof(253, plain,![X2]:(((cC216(X2)|~(cTEST(X2)))&(cC46(X2)|~(cTEST(X2))))&((~(cC216(X2))|~(cC46(X2)))|cTEST(X2))),inference(distribute,[status(thm)],[252])).
% cnf(255,plain,(cC46(X1)|~cTEST(X1)),inference(split_conjunct,[status(thm)],[253])).
% cnf(256,plain,(cC216(X1)|~cTEST(X1)),inference(split_conjunct,[status(thm)],[253])).
% cnf(260,plain,(cTEST(iV3102)),inference(split_conjunct,[status(thm)],[11])).
% fof(1567, negated_conjecture,(((((((((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|~(cC14(iV3102)))|~(cC44(iV3102)))|~(cC216(iV3102)))|~(cC64(iV3102)))|~(cC46(iV3102)))|~(cC28(iV3102)))|~(cowlThing(iV3102)))|~(cC30(iV3102))),inference(fof_nnf,[status(thm)],[224])).
% fof(1568, negated_conjecture,(((((((((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|~(cC14(iV3102)))|~(cC44(iV3102)))|~(cC216(iV3102)))|~(cC64(iV3102)))|~(cC46(iV3102)))|~(cC28(iV3102)))|~(cowlThing(iV3102)))|~(cC30(iV3102))),inference(variable_rename,[status(thm)],[1567])).
% fof(1569, negated_conjecture,((((((((((~(cowlThing(esk149_0))|cowlNothing(esk149_0))|((~(xsd_string(esk150_0))|xsd_integer(esk150_0))&(xsd_string(esk150_0)|~(xsd_integer(esk150_0)))))|~(cC14(iV3102)))|~(cC44(iV3102)))|~(cC216(iV3102)))|~(cC64(iV3102)))|~(cC46(iV3102)))|~(cC28(iV3102)))|~(cowlThing(iV3102)))|~(cC30(iV3102))),inference(skolemize,[status(esa)],[1568])).
% fof(1570, negated_conjecture,(((((((((((~(xsd_string(esk150_0))|xsd_integer(esk150_0))|(~(cowlThing(esk149_0))|cowlNothing(esk149_0)))|~(cC14(iV3102)))|~(cC44(iV3102)))|~(cC216(iV3102)))|~(cC64(iV3102)))|~(cC46(iV3102)))|~(cC28(iV3102)))|~(cowlThing(iV3102)))|~(cC30(iV3102)))&((((((((((xsd_string(esk150_0)|~(xsd_integer(esk150_0)))|(~(cowlThing(esk149_0))|cowlNothing(esk149_0)))|~(cC14(iV3102)))|~(cC44(iV3102)))|~(cC216(iV3102)))|~(cC64(iV3102)))|~(cC46(iV3102)))|~(cC28(iV3102)))|~(cowlThing(iV3102)))|~(cC30(iV3102)))),inference(distribute,[status(thm)],[1569])).
% cnf(1571,negated_conjecture,(cowlNothing(esk149_0)|xsd_string(esk150_0)|~cC30(iV3102)|~cowlThing(iV3102)|~cC28(iV3102)|~cC46(iV3102)|~cC64(iV3102)|~cC216(iV3102)|~cC44(iV3102)|~cC14(iV3102)|~cowlThing(esk149_0)|~xsd_integer(esk150_0)),inference(split_conjunct,[status(thm)],[1570])).
% cnf(1572,negated_conjecture,(cowlNothing(esk149_0)|xsd_integer(esk150_0)|~cC30(iV3102)|~cowlThing(iV3102)|~cC28(iV3102)|~cC46(iV3102)|~cC64(iV3102)|~cC216(iV3102)|~cC44(iV3102)|~cC14(iV3102)|~cowlThing(esk149_0)|~xsd_string(esk150_0)),inference(split_conjunct,[status(thm)],[1570])).
% cnf(1574,negated_conjecture,(cowlNothing(esk149_0)|xsd_string(esk150_0)|$false|$false|~xsd_integer(esk150_0)|~cC30(iV3102)|~cC28(iV3102)|~cC14(iV3102)|~cC46(iV3102)|~cC44(iV3102)|~cC216(iV3102)|~cC64(iV3102)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1571,227,theory(equality)]),227,theory(equality)]),['unfolding']).
% cnf(1575,negated_conjecture,(cowlNothing(esk149_0)|xsd_integer(esk150_0)|$false|$false|~xsd_string(esk150_0)|~cC30(iV3102)|~cC28(iV3102)|~cC14(iV3102)|~cC46(iV3102)|~cC44(iV3102)|~cC216(iV3102)|~cC64(iV3102)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1572,227,theory(equality)]),227,theory(equality)]),['unfolding']).
% cnf(1576,negated_conjecture,(xsd_string(esk150_0)|~xsd_integer(esk150_0)|~cC30(iV3102)|~cC28(iV3102)|~cC14(iV3102)|~cC46(iV3102)|~cC44(iV3102)|~cC216(iV3102)|~cC64(iV3102)),inference(sr,[status(thm)],[1574,226,theory(equality)])).
% cnf(1577,negated_conjecture,(xsd_string(esk150_0)|~cC216(iV3102)|~cC44(iV3102)|~cC46(iV3102)|~cC14(iV3102)|~cC28(iV3102)|~cC30(iV3102)|~xsd_integer(esk150_0)),inference(csr,[status(thm)],[1576,250])).
% cnf(1578,negated_conjecture,(xsd_string(esk150_0)|~cC216(iV3102)|~cC46(iV3102)|~cC14(iV3102)|~cC28(iV3102)|~cC30(iV3102)|~xsd_integer(esk150_0)),inference(csr,[status(thm)],[1577,242])).
% cnf(1579,negated_conjecture,(xsd_string(esk150_0)|~cC216(iV3102)|~cC46(iV3102)|~cC28(iV3102)|~cC30(iV3102)|~xsd_integer(esk150_0)),inference(csr,[status(thm)],[1578,236])).
% cnf(1580,negated_conjecture,(xsd_string(esk150_0)|~cC216(iV3102)|~cC46(iV3102)|~cC30(iV3102)|~xsd_integer(esk150_0)),inference(csr,[status(thm)],[1579,237])).
% cnf(1581,negated_conjecture,(xsd_string(esk150_0)|~cC216(iV3102)|~cC46(iV3102)|~xsd_integer(esk150_0)),inference(csr,[status(thm)],[1580,243])).
% cnf(1582,negated_conjecture,(xsd_string(esk150_0)|~cC216(iV3102)|~cC46(iV3102)),inference(csr,[status(thm)],[1581,230])).
% cnf(1583,negated_conjecture,(xsd_integer(esk150_0)|~xsd_string(esk150_0)|~cC30(iV3102)|~cC28(iV3102)|~cC14(iV3102)|~cC46(iV3102)|~cC44(iV3102)|~cC216(iV3102)|~cC64(iV3102)),inference(sr,[status(thm)],[1575,226,theory(equality)])).
% cnf(1584,negated_conjecture,(xsd_integer(esk150_0)|~cC216(iV3102)|~cC44(iV3102)|~cC46(iV3102)|~cC14(iV3102)|~cC28(iV3102)|~cC30(iV3102)|~xsd_string(esk150_0)),inference(csr,[status(thm)],[1583,250])).
% cnf(1585,negated_conjecture,(xsd_integer(esk150_0)|~cC216(iV3102)|~cC46(iV3102)|~cC14(iV3102)|~cC28(iV3102)|~cC30(iV3102)|~xsd_string(esk150_0)),inference(csr,[status(thm)],[1584,242])).
% cnf(1586,negated_conjecture,(xsd_integer(esk150_0)|~cC216(iV3102)|~cC46(iV3102)|~cC28(iV3102)|~cC30(iV3102)|~xsd_string(esk150_0)),inference(csr,[status(thm)],[1585,236])).
% cnf(1587,negated_conjecture,(xsd_integer(esk150_0)|~cC216(iV3102)|~cC46(iV3102)|~cC30(iV3102)|~xsd_string(esk150_0)),inference(csr,[status(thm)],[1586,237])).
% cnf(1588,negated_conjecture,(xsd_integer(esk150_0)|~cC216(iV3102)|~cC46(iV3102)|~xsd_string(esk150_0)),inference(csr,[status(thm)],[1587,243])).
% cnf(1589,negated_conjecture,(xsd_integer(esk150_0)|~cC216(iV3102)|~cC46(iV3102)),inference(csr,[status(thm)],[1588,1582])).
% cnf(1590,negated_conjecture,(~xsd_string(esk150_0)|~cC216(iV3102)|~cC46(iV3102)),inference(spm,[status(thm)],[231,1589,theory(equality)])).
% cnf(1592,plain,(cC46(iV3102)),inference(spm,[status(thm)],[255,260,theory(equality)])).
% cnf(1596,plain,(cC216(iV3102)),inference(spm,[status(thm)],[256,260,theory(equality)])).
% cnf(4808,negated_conjecture,(~cC216(iV3102)|~cC46(iV3102)),inference(csr,[status(thm)],[1590,1582])).
% cnf(4811,negated_conjecture,(~cC216(iV3102)|$false),inference(rw,[status(thm)],[4808,1592,theory(equality)])).
% cnf(4812,negated_conjecture,(~cC216(iV3102)),inference(cn,[status(thm)],[4811,theory(equality)])).
% cnf(4815,negated_conjecture,($false),inference(rw,[status(thm)],[4812,1596,theory(equality)])).
% cnf(4816,negated_conjecture,($false),inference(cn,[status(thm)],[4815,theory(equality)])).
% cnf(4817,negated_conjecture,($false),4816,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1061
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 1061
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 1
% # Generated clauses                  : 3213
% # ...of the previous two non-trivial : 3005
% # Contextual simplify-reflections    : 13
% # Paramodulations                    : 3213
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 530
% #    Positive orientable unit clauses: 14
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 514
% # Current number of unprocessed clauses: 2998
% # ...number of literals in the above : 8854
% # Clause-clause subsumption calls (NU) : 192504
% # Rec. Clause-clause subsumption calls : 177770
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 1
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:   576 leaves,   1.07+/-0.254 terms/leaf
% # Paramod-from index:          285 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:          516 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.210 s
% # System time            : 0.009 s
% # Total time             : 0.219 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.37 CPU 0.46 WC
% FINAL PrfWatch: 0.37 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP11565/KRS157+1.tptp
% 
%------------------------------------------------------------------------------