TSTP Solution File: KRS150+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS150+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 : art06.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:37:59 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP17575/KRS150+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP17575/KRS150+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17575/KRS150+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 17671
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 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]:(cC16(X1)<=>(cC14(X1)&cC8(X1))),file('/tmp/SRASS.s.p', axiom_5)).
% fof(11, axiom,![X1]:(cC18(X1)<=>(cTOP(X1)&cC16(X1))),file('/tmp/SRASS.s.p', axiom_6)).
% fof(12, axiom,~(cC2(iV16561)),file('/tmp/SRASS.s.p', axiom_19)).
% fof(13, axiom,~(cC2(iV16562)),file('/tmp/SRASS.s.p', axiom_21)).
% fof(15, axiom,~(cC4(iV16561)),file('/tmp/SRASS.s.p', axiom_16)).
% fof(16, axiom,~(cC10(iV16562)),file('/tmp/SRASS.s.p', axiom_20)).
% fof(17, axiom,cTEST(iV16560),file('/tmp/SRASS.s.p', axiom_12)).
% fof(18, axiom,![X1]:(cC12(X1)<=>(~(cC2(X1))&~(cC10(X1)))),file('/tmp/SRASS.s.p', axiom_3)).
% fof(19, axiom,![X1]:(cC6(X1)<=>(~(cC2(X1))&~(cC4(X1)))),file('/tmp/SRASS.s.p', axiom_8)).
% fof(22, axiom,![X1]:(cTEST(X1)<=>(cC18(X1)&cTOP(X1))),file('/tmp/SRASS.s.p', axiom_10)).
% fof(25, conjecture,((((((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC18(iV16560))&cC16(iV16560))&cowlThing(iV16560))&cC14(iV16560))&cC8(iV16560))&cowlThing(iV16561))&cC6(iV16561))&cowlThing(iV16562))&cC12(iV16562)),file('/tmp/SRASS.s.p', the_axiom)).
% fof(26, negated_conjecture,~(((((((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC18(iV16560))&cC16(iV16560))&cowlThing(iV16560))&cC14(iV16560))&cC8(iV16560))&cowlThing(iV16561))&cC6(iV16561))&cowlThing(iV16562))&cC12(iV16562))),inference(assume_negation,[status(cth)],[25])).
% fof(27, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(28, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(29, plain,~(cC2(iV16561)),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(30, plain,~(cC2(iV16562)),inference(fof_simplification,[status(thm)],[13,theory(equality)])).
% fof(31, plain,~(cC4(iV16561)),inference(fof_simplification,[status(thm)],[15,theory(equality)])).
% fof(32, plain,~(cC10(iV16562)),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(33, plain,![X1]:(cC12(X1)<=>(~(cC2(X1))&~(cC10(X1)))),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(34, plain,![X1]:(cC6(X1)<=>(~(cC2(X1))&~(cC4(X1)))),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(37, negated_conjecture,~(((((((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC18(iV16560))&cC16(iV16560))&cowlThing(iV16560))&cC14(iV16560))&cC8(iV16560))&cowlThing(iV16561))&cC6(iV16561))&cowlThing(iV16562))&cC12(iV16562))),inference(fof_simplification,[status(thm)],[26,theory(equality)])).
% fof(38, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[27])).
% cnf(39,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[38])).
% cnf(40,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(41, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[28])).
% fof(42, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(45, plain,![X1]:((~(cC16(X1))|(cC14(X1)&cC8(X1)))&((~(cC14(X1))|~(cC8(X1)))|cC16(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(46, plain,![X2]:((~(cC16(X2))|(cC14(X2)&cC8(X2)))&((~(cC14(X2))|~(cC8(X2)))|cC16(X2))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X2]:(((cC14(X2)|~(cC16(X2)))&(cC8(X2)|~(cC16(X2))))&((~(cC14(X2))|~(cC8(X2)))|cC16(X2))),inference(distribute,[status(thm)],[46])).
% cnf(49,plain,(cC8(X1)|~cC16(X1)),inference(split_conjunct,[status(thm)],[47])).
% cnf(50,plain,(cC14(X1)|~cC16(X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(72, plain,![X1]:((~(cC18(X1))|(cTOP(X1)&cC16(X1)))&((~(cTOP(X1))|~(cC16(X1)))|cC18(X1))),inference(fof_nnf,[status(thm)],[11])).
% fof(73, plain,![X2]:((~(cC18(X2))|(cTOP(X2)&cC16(X2)))&((~(cTOP(X2))|~(cC16(X2)))|cC18(X2))),inference(variable_rename,[status(thm)],[72])).
% fof(74, plain,![X2]:(((cTOP(X2)|~(cC18(X2)))&(cC16(X2)|~(cC18(X2))))&((~(cTOP(X2))|~(cC16(X2)))|cC18(X2))),inference(distribute,[status(thm)],[73])).
% cnf(76,plain,(cC16(X1)|~cC18(X1)),inference(split_conjunct,[status(thm)],[74])).
% cnf(78,plain,(~cC2(iV16561)),inference(split_conjunct,[status(thm)],[29])).
% cnf(79,plain,(~cC2(iV16562)),inference(split_conjunct,[status(thm)],[30])).
% cnf(81,plain,(~cC4(iV16561)),inference(split_conjunct,[status(thm)],[31])).
% cnf(82,plain,(~cC10(iV16562)),inference(split_conjunct,[status(thm)],[32])).
% cnf(83,plain,(cTEST(iV16560)),inference(split_conjunct,[status(thm)],[17])).
% fof(84, plain,![X1]:((~(cC12(X1))|(~(cC2(X1))&~(cC10(X1))))&((cC2(X1)|cC10(X1))|cC12(X1))),inference(fof_nnf,[status(thm)],[33])).
% fof(85, plain,![X2]:((~(cC12(X2))|(~(cC2(X2))&~(cC10(X2))))&((cC2(X2)|cC10(X2))|cC12(X2))),inference(variable_rename,[status(thm)],[84])).
% fof(86, plain,![X2]:(((~(cC2(X2))|~(cC12(X2)))&(~(cC10(X2))|~(cC12(X2))))&((cC2(X2)|cC10(X2))|cC12(X2))),inference(distribute,[status(thm)],[85])).
% cnf(87,plain,(cC12(X1)|cC10(X1)|cC2(X1)),inference(split_conjunct,[status(thm)],[86])).
% fof(90, plain,![X1]:((~(cC6(X1))|(~(cC2(X1))&~(cC4(X1))))&((cC2(X1)|cC4(X1))|cC6(X1))),inference(fof_nnf,[status(thm)],[34])).
% fof(91, plain,![X2]:((~(cC6(X2))|(~(cC2(X2))&~(cC4(X2))))&((cC2(X2)|cC4(X2))|cC6(X2))),inference(variable_rename,[status(thm)],[90])).
% fof(92, plain,![X2]:(((~(cC2(X2))|~(cC6(X2)))&(~(cC4(X2))|~(cC6(X2))))&((cC2(X2)|cC4(X2))|cC6(X2))),inference(distribute,[status(thm)],[91])).
% cnf(93,plain,(cC6(X1)|cC4(X1)|cC2(X1)),inference(split_conjunct,[status(thm)],[92])).
% fof(102, plain,![X1]:((~(cTEST(X1))|(cC18(X1)&cTOP(X1)))&((~(cC18(X1))|~(cTOP(X1)))|cTEST(X1))),inference(fof_nnf,[status(thm)],[22])).
% fof(103, plain,![X2]:((~(cTEST(X2))|(cC18(X2)&cTOP(X2)))&((~(cC18(X2))|~(cTOP(X2)))|cTEST(X2))),inference(variable_rename,[status(thm)],[102])).
% fof(104, plain,![X2]:(((cC18(X2)|~(cTEST(X2)))&(cTOP(X2)|~(cTEST(X2))))&((~(cC18(X2))|~(cTOP(X2)))|cTEST(X2))),inference(distribute,[status(thm)],[103])).
% cnf(107,plain,(cC18(X1)|~cTEST(X1)),inference(split_conjunct,[status(thm)],[104])).
% fof(124, negated_conjecture,((((((((((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|~(cC18(iV16560)))|~(cC16(iV16560)))|~(cowlThing(iV16560)))|~(cC14(iV16560)))|~(cC8(iV16560)))|~(cowlThing(iV16561)))|~(cC6(iV16561)))|~(cowlThing(iV16562)))|~(cC12(iV16562))),inference(fof_nnf,[status(thm)],[37])).
% fof(125, negated_conjecture,((((((((((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|~(cC18(iV16560)))|~(cC16(iV16560)))|~(cowlThing(iV16560)))|~(cC14(iV16560)))|~(cC8(iV16560)))|~(cowlThing(iV16561)))|~(cC6(iV16561)))|~(cowlThing(iV16562)))|~(cC12(iV16562))),inference(variable_rename,[status(thm)],[124])).
% fof(126, negated_conjecture,(((((((((((~(cowlThing(esk5_0))|cowlNothing(esk5_0))|((~(xsd_string(esk6_0))|xsd_integer(esk6_0))&(xsd_string(esk6_0)|~(xsd_integer(esk6_0)))))|~(cC18(iV16560)))|~(cC16(iV16560)))|~(cowlThing(iV16560)))|~(cC14(iV16560)))|~(cC8(iV16560)))|~(cowlThing(iV16561)))|~(cC6(iV16561)))|~(cowlThing(iV16562)))|~(cC12(iV16562))),inference(skolemize,[status(esa)],[125])).
% fof(127, negated_conjecture,((((((((((((~(xsd_string(esk6_0))|xsd_integer(esk6_0))|(~(cowlThing(esk5_0))|cowlNothing(esk5_0)))|~(cC18(iV16560)))|~(cC16(iV16560)))|~(cowlThing(iV16560)))|~(cC14(iV16560)))|~(cC8(iV16560)))|~(cowlThing(iV16561)))|~(cC6(iV16561)))|~(cowlThing(iV16562)))|~(cC12(iV16562)))&(((((((((((xsd_string(esk6_0)|~(xsd_integer(esk6_0)))|(~(cowlThing(esk5_0))|cowlNothing(esk5_0)))|~(cC18(iV16560)))|~(cC16(iV16560)))|~(cowlThing(iV16560)))|~(cC14(iV16560)))|~(cC8(iV16560)))|~(cowlThing(iV16561)))|~(cC6(iV16561)))|~(cowlThing(iV16562)))|~(cC12(iV16562)))),inference(distribute,[status(thm)],[126])).
% cnf(128,negated_conjecture,(cowlNothing(esk5_0)|xsd_string(esk6_0)|~cC12(iV16562)|~cowlThing(iV16562)|~cC6(iV16561)|~cowlThing(iV16561)|~cC8(iV16560)|~cC14(iV16560)|~cowlThing(iV16560)|~cC16(iV16560)|~cC18(iV16560)|~cowlThing(esk5_0)|~xsd_integer(esk6_0)),inference(split_conjunct,[status(thm)],[127])).
% cnf(129,negated_conjecture,(cowlNothing(esk5_0)|xsd_integer(esk6_0)|~cC12(iV16562)|~cowlThing(iV16562)|~cC6(iV16561)|~cowlThing(iV16561)|~cC8(iV16560)|~cC14(iV16560)|~cowlThing(iV16560)|~cC16(iV16560)|~cC18(iV16560)|~cowlThing(esk5_0)|~xsd_string(esk6_0)),inference(split_conjunct,[status(thm)],[127])).
% cnf(133,negated_conjecture,(cowlNothing(esk5_0)|xsd_string(esk6_0)|$false|$false|$false|$false|~xsd_integer(esk6_0)|~cC16(iV16560)|~cC14(iV16560)|~cC8(iV16560)|~cC12(iV16562)|~cC6(iV16561)|~cC18(iV16560)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[128,40,theory(equality)]),40,theory(equality)]),40,theory(equality)]),40,theory(equality)]),['unfolding']).
% cnf(134,negated_conjecture,(cowlNothing(esk5_0)|xsd_integer(esk6_0)|$false|$false|$false|$false|~xsd_string(esk6_0)|~cC16(iV16560)|~cC14(iV16560)|~cC8(iV16560)|~cC12(iV16562)|~cC6(iV16561)|~cC18(iV16560)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[129,40,theory(equality)]),40,theory(equality)]),40,theory(equality)]),40,theory(equality)]),['unfolding']).
% cnf(135,negated_conjecture,(xsd_string(esk6_0)|~xsd_integer(esk6_0)|~cC16(iV16560)|~cC14(iV16560)|~cC8(iV16560)|~cC12(iV16562)|~cC6(iV16561)|~cC18(iV16560)),inference(sr,[status(thm)],[133,39,theory(equality)])).
% cnf(136,negated_conjecture,(xsd_string(esk6_0)|~cC18(iV16560)|~cC6(iV16561)|~cC12(iV16562)|~cC14(iV16560)|~cC16(iV16560)|~xsd_integer(esk6_0)),inference(csr,[status(thm)],[135,49])).
% cnf(137,negated_conjecture,(xsd_string(esk6_0)|~cC18(iV16560)|~cC6(iV16561)|~cC12(iV16562)|~cC16(iV16560)|~xsd_integer(esk6_0)),inference(csr,[status(thm)],[136,50])).
% cnf(138,negated_conjecture,(xsd_string(esk6_0)|~cC18(iV16560)|~cC6(iV16561)|~cC12(iV16562)|~xsd_integer(esk6_0)),inference(csr,[status(thm)],[137,76])).
% cnf(139,negated_conjecture,(xsd_string(esk6_0)|~cC18(iV16560)|~cC6(iV16561)|~cC12(iV16562)),inference(csr,[status(thm)],[138,43])).
% cnf(140,negated_conjecture,(xsd_integer(esk6_0)|~xsd_string(esk6_0)|~cC16(iV16560)|~cC14(iV16560)|~cC8(iV16560)|~cC12(iV16562)|~cC6(iV16561)|~cC18(iV16560)),inference(sr,[status(thm)],[134,39,theory(equality)])).
% cnf(141,negated_conjecture,(xsd_integer(esk6_0)|~cC18(iV16560)|~cC6(iV16561)|~cC12(iV16562)|~cC14(iV16560)|~cC16(iV16560)|~xsd_string(esk6_0)),inference(csr,[status(thm)],[140,49])).
% cnf(142,negated_conjecture,(xsd_integer(esk6_0)|~cC18(iV16560)|~cC6(iV16561)|~cC12(iV16562)|~cC16(iV16560)|~xsd_string(esk6_0)),inference(csr,[status(thm)],[141,50])).
% cnf(143,negated_conjecture,(xsd_integer(esk6_0)|~cC18(iV16560)|~cC6(iV16561)|~cC12(iV16562)|~xsd_string(esk6_0)),inference(csr,[status(thm)],[142,76])).
% cnf(144,negated_conjecture,(xsd_integer(esk6_0)|~cC18(iV16560)|~cC6(iV16561)|~cC12(iV16562)),inference(csr,[status(thm)],[143,43])).
% cnf(149,plain,(cC18(iV16560)),inference(spm,[status(thm)],[107,83,theory(equality)])).
% cnf(152,plain,(cC2(iV16562)|cC12(iV16562)),inference(spm,[status(thm)],[82,87,theory(equality)])).
% cnf(153,plain,(cC12(iV16562)),inference(sr,[status(thm)],[152,79,theory(equality)])).
% cnf(159,plain,(cC2(iV16561)|cC6(iV16561)),inference(spm,[status(thm)],[81,93,theory(equality)])).
% cnf(161,plain,(cC6(iV16561)),inference(sr,[status(thm)],[159,78,theory(equality)])).
% cnf(201,negated_conjecture,(xsd_integer(esk6_0)|~cC18(iV16560)|~cC6(iV16561)|$false),inference(rw,[status(thm)],[144,153,theory(equality)])).
% cnf(202,negated_conjecture,(xsd_integer(esk6_0)|~cC18(iV16560)|~cC6(iV16561)),inference(cn,[status(thm)],[201,theory(equality)])).
% cnf(203,negated_conjecture,(xsd_string(esk6_0)|~cC18(iV16560)|~cC6(iV16561)|$false),inference(rw,[status(thm)],[139,153,theory(equality)])).
% cnf(204,negated_conjecture,(xsd_string(esk6_0)|~cC18(iV16560)|~cC6(iV16561)),inference(cn,[status(thm)],[203,theory(equality)])).
% cnf(207,negated_conjecture,(xsd_integer(esk6_0)|$false|~cC6(iV16561)),inference(rw,[status(thm)],[202,149,theory(equality)])).
% cnf(208,negated_conjecture,(xsd_integer(esk6_0)|$false|$false),inference(rw,[status(thm)],[207,161,theory(equality)])).
% cnf(209,negated_conjecture,(xsd_integer(esk6_0)),inference(cn,[status(thm)],[208,theory(equality)])).
% cnf(210,negated_conjecture,(~xsd_string(esk6_0)),inference(spm,[status(thm)],[44,209,theory(equality)])).
% cnf(211,negated_conjecture,(xsd_string(esk6_0)|$false|~cC6(iV16561)),inference(rw,[status(thm)],[204,149,theory(equality)])).
% cnf(212,negated_conjecture,(xsd_string(esk6_0)|$false|$false),inference(rw,[status(thm)],[211,161,theory(equality)])).
% cnf(213,negated_conjecture,(xsd_string(esk6_0)),inference(cn,[status(thm)],[212,theory(equality)])).
% cnf(214,negated_conjecture,($false),inference(rw,[status(thm)],[210,213,theory(equality)])).
% cnf(215,negated_conjecture,($false),inference(cn,[status(thm)],[214,theory(equality)])).
% cnf(216,negated_conjecture,($false),215,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 91
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 91
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 51
% # ...of the previous two non-trivial : 42
% # Contextual simplify-reflections : 9
% # Paramodulations : 51
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 46
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 34
% # ...number of literals in the above : 74
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 9
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 48 leaves, 1.06+/-0.242 terms/leaf
% # Paramod-from index: 23 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 44 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.004 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP17575/KRS150+1.tptp
%
%------------------------------------------------------------------------------