TSTP Solution File: KRS152+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS152+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 : art01.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:12 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP30080/KRS152+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30080/KRS152+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30080/KRS152+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 30176
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.013 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(9, axiom,cC2(iV21081),file('/tmp/SRASS.s.p', axiom_14)).
% fof(10, axiom,cC4(iV21081),file('/tmp/SRASS.s.p', axiom_15)).
% fof(11, axiom,cTEST(iV21080),file('/tmp/SRASS.s.p', axiom_7)).
% fof(12, axiom,![X1]:(cC10(X1)<=>(cC2(X1)&cC4(X1))),file('/tmp/SRASS.s.p', axiom_2)).
% fof(14, axiom,![X1]:(cTEST(X1)<=>(cC12(X1)&~(cC8(X1)))),file('/tmp/SRASS.s.p', axiom_6)).
% fof(17, conjecture,(((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cowlThing(iV21080))&cC12(iV21080))&cC10(iV21081))&cowlThing(iV21081)),file('/tmp/SRASS.s.p', the_axiom)).
% fof(18, negated_conjecture,~((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cowlThing(iV21080))&cC12(iV21080))&cC10(iV21081))&cowlThing(iV21081))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(20, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(24, plain,![X1]:(cTEST(X1)<=>(cC12(X1)&~(cC8(X1)))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(26, negated_conjecture,~((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cowlThing(iV21080))&cC12(iV21080))&cC10(iV21081))&cowlThing(iV21081))),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(27, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[19])).
% cnf(28,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(30, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[20])).
% fof(31, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[31])).
% cnf(33,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[31])).
% cnf(47,plain,(cC2(iV21081)),inference(split_conjunct,[status(thm)],[9])).
% cnf(48,plain,(cC4(iV21081)),inference(split_conjunct,[status(thm)],[10])).
% cnf(49,plain,(cTEST(iV21080)),inference(split_conjunct,[status(thm)],[11])).
% fof(50, plain,![X1]:((~(cC10(X1))|(cC2(X1)&cC4(X1)))&((~(cC2(X1))|~(cC4(X1)))|cC10(X1))),inference(fof_nnf,[status(thm)],[12])).
% fof(51, plain,![X2]:((~(cC10(X2))|(cC2(X2)&cC4(X2)))&((~(cC2(X2))|~(cC4(X2)))|cC10(X2))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X2]:(((cC2(X2)|~(cC10(X2)))&(cC4(X2)|~(cC10(X2))))&((~(cC2(X2))|~(cC4(X2)))|cC10(X2))),inference(distribute,[status(thm)],[51])).
% cnf(53,plain,(cC10(X1)|~cC4(X1)|~cC2(X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(62, plain,![X1]:((~(cTEST(X1))|(cC12(X1)&~(cC8(X1))))&((~(cC12(X1))|cC8(X1))|cTEST(X1))),inference(fof_nnf,[status(thm)],[24])).
% fof(63, plain,![X2]:((~(cTEST(X2))|(cC12(X2)&~(cC8(X2))))&((~(cC12(X2))|cC8(X2))|cTEST(X2))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X2]:(((cC12(X2)|~(cTEST(X2)))&(~(cC8(X2))|~(cTEST(X2))))&((~(cC12(X2))|cC8(X2))|cTEST(X2))),inference(distribute,[status(thm)],[63])).
% cnf(67,plain,(cC12(X1)|~cTEST(X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(79, negated_conjecture,(((((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|~(cowlThing(iV21080)))|~(cC12(iV21080)))|~(cC10(iV21081)))|~(cowlThing(iV21081))),inference(fof_nnf,[status(thm)],[26])).
% fof(80, negated_conjecture,(((((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|~(cowlThing(iV21080)))|~(cC12(iV21080)))|~(cC10(iV21081)))|~(cowlThing(iV21081))),inference(variable_rename,[status(thm)],[79])).
% fof(81, negated_conjecture,((((((~(cowlThing(esk3_0))|cowlNothing(esk3_0))|((~(xsd_string(esk4_0))|xsd_integer(esk4_0))&(xsd_string(esk4_0)|~(xsd_integer(esk4_0)))))|~(cowlThing(iV21080)))|~(cC12(iV21080)))|~(cC10(iV21081)))|~(cowlThing(iV21081))),inference(skolemize,[status(esa)],[80])).
% fof(82, negated_conjecture,(((((((~(xsd_string(esk4_0))|xsd_integer(esk4_0))|(~(cowlThing(esk3_0))|cowlNothing(esk3_0)))|~(cowlThing(iV21080)))|~(cC12(iV21080)))|~(cC10(iV21081)))|~(cowlThing(iV21081)))&((((((xsd_string(esk4_0)|~(xsd_integer(esk4_0)))|(~(cowlThing(esk3_0))|cowlNothing(esk3_0)))|~(cowlThing(iV21080)))|~(cC12(iV21080)))|~(cC10(iV21081)))|~(cowlThing(iV21081)))),inference(distribute,[status(thm)],[81])).
% cnf(83,negated_conjecture,(cowlNothing(esk3_0)|xsd_string(esk4_0)|~cowlThing(iV21081)|~cC10(iV21081)|~cC12(iV21080)|~cowlThing(iV21080)|~cowlThing(esk3_0)|~xsd_integer(esk4_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(cowlNothing(esk3_0)|xsd_integer(esk4_0)|~cowlThing(iV21081)|~cC10(iV21081)|~cC12(iV21080)|~cowlThing(iV21080)|~cowlThing(esk3_0)|~xsd_string(esk4_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(87,negated_conjecture,(cowlNothing(esk3_0)|xsd_string(esk4_0)|$false|$false|$false|~xsd_integer(esk4_0)|~cC12(iV21080)|~cC10(iV21081)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[83,29,theory(equality)]),29,theory(equality)]),29,theory(equality)]),['unfolding']).
% cnf(88,negated_conjecture,(cowlNothing(esk3_0)|xsd_integer(esk4_0)|$false|$false|$false|~xsd_string(esk4_0)|~cC12(iV21080)|~cC10(iV21081)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[84,29,theory(equality)]),29,theory(equality)]),29,theory(equality)]),['unfolding']).
% cnf(89,negated_conjecture,(xsd_string(esk4_0)|~xsd_integer(esk4_0)|~cC12(iV21080)|~cC10(iV21081)),inference(sr,[status(thm)],[87,28,theory(equality)])).
% cnf(90,negated_conjecture,(xsd_string(esk4_0)|~cC10(iV21081)|~cC12(iV21080)),inference(csr,[status(thm)],[89,32])).
% cnf(91,negated_conjecture,(xsd_integer(esk4_0)|~xsd_string(esk4_0)|~cC12(iV21080)|~cC10(iV21081)),inference(sr,[status(thm)],[88,28,theory(equality)])).
% cnf(92,negated_conjecture,(xsd_integer(esk4_0)|~cC10(iV21081)|~cC12(iV21080)),inference(csr,[status(thm)],[91,32])).
% cnf(95,plain,(cC12(iV21080)),inference(spm,[status(thm)],[67,49,theory(equality)])).
% cnf(102,plain,(cC10(iV21081)|~cC2(iV21081)),inference(spm,[status(thm)],[53,48,theory(equality)])).
% cnf(105,plain,(cC10(iV21081)|$false),inference(rw,[status(thm)],[102,47,theory(equality)])).
% cnf(106,plain,(cC10(iV21081)),inference(cn,[status(thm)],[105,theory(equality)])).
% cnf(120,negated_conjecture,(xsd_integer(esk4_0)|~cC10(iV21081)|$false),inference(rw,[status(thm)],[92,95,theory(equality)])).
% cnf(121,negated_conjecture,(xsd_integer(esk4_0)|~cC10(iV21081)),inference(cn,[status(thm)],[120,theory(equality)])).
% cnf(122,negated_conjecture,(xsd_string(esk4_0)|~cC10(iV21081)|$false),inference(rw,[status(thm)],[90,95,theory(equality)])).
% cnf(123,negated_conjecture,(xsd_string(esk4_0)|~cC10(iV21081)),inference(cn,[status(thm)],[122,theory(equality)])).
% cnf(127,negated_conjecture,(xsd_integer(esk4_0)|$false),inference(rw,[status(thm)],[121,106,theory(equality)])).
% cnf(128,negated_conjecture,(xsd_integer(esk4_0)),inference(cn,[status(thm)],[127,theory(equality)])).
% cnf(129,negated_conjecture,(~xsd_string(esk4_0)),inference(spm,[status(thm)],[33,128,theory(equality)])).
% cnf(130,negated_conjecture,(xsd_string(esk4_0)|$false),inference(rw,[status(thm)],[123,106,theory(equality)])).
% cnf(131,negated_conjecture,(xsd_string(esk4_0)),inference(cn,[status(thm)],[130,theory(equality)])).
% cnf(132,negated_conjecture,($false),inference(rw,[status(thm)],[129,131,theory(equality)])).
% cnf(133,negated_conjecture,($false),inference(cn,[status(thm)],[132,theory(equality)])).
% cnf(134,negated_conjecture,($false),133,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 64
% # ...of these trivial : 1
% # ...subsumed : 4
% # ...remaining for further processing: 59
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 24
% # ...of the previous two non-trivial : 18
% # Contextual simplify-reflections : 2
% # Paramodulations : 24
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 18
% # Current number of unprocessed clauses: 7
% # ...number of literals in the above : 18
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # 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: 32 leaves, 1.06+/-0.242 terms/leaf
% # Paramod-from index: 16 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 26 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.005 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.22 WC
% FINAL PrfWatch: 0.11 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP30080/KRS152+1.tptp
%
%------------------------------------------------------------------------------