TSTP Solution File: KRS148+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS148+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:37:45 EST 2010
% Result : Theorem 1.42s
% Output : Solution 1.42s
% 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/SystemOnTPTP29818/KRS148+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29818/KRS148+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29818/KRS148+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 29914
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.028 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(4, axiom,![X1]:(cC140(X1)<=>(cTOP(X1)&cC138(X1))),file('/tmp/SRASS.s.p', axiom_25)).
% fof(5, axiom,![X1]:(cTEST(X1)<=>(cC140(X1)&cC116(X1))),file('/tmp/SRASS.s.p', axiom_71)).
% fof(7, axiom,cTEST(iV5475),file('/tmp/SRASS.s.p', axiom_72)).
% fof(8, axiom,cTOP(iV5475),file('/tmp/SRASS.s.p', axiom_73)).
% fof(9, axiom,~(cC114(iV5475)),file('/tmp/SRASS.s.p', axiom_76)).
% fof(14, axiom,![X1]:(cC116(X1)<=>(cTOP(X1)&~(cC114(X1)))),file('/tmp/SRASS.s.p', axiom_11)).
% fof(90, conjecture,(((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC138(iV5475))&cowlThing(iV5475))&cC116(iV5475))&cC140(iV5475)),file('/tmp/SRASS.s.p', the_axiom)).
% fof(91, negated_conjecture,~((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC138(iV5475))&cowlThing(iV5475))&cC116(iV5475))&cC140(iV5475))),inference(assume_negation,[status(cth)],[90])).
% fof(92, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(93, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(94, plain,~(cC114(iV5475)),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(96, plain,![X1]:(cC116(X1)<=>(cTOP(X1)&~(cC114(X1)))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(139, negated_conjecture,~((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC138(iV5475))&cowlThing(iV5475))&cC116(iV5475))&cC140(iV5475))),inference(fof_simplification,[status(thm)],[91,theory(equality)])).
% fof(140, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[92])).
% cnf(141,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[140])).
% cnf(142,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[140])).
% fof(143, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[93])).
% fof(144, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[143])).
% cnf(145,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[144])).
% cnf(146,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[144])).
% fof(148, plain,![X1]:((~(cC140(X1))|(cTOP(X1)&cC138(X1)))&((~(cTOP(X1))|~(cC138(X1)))|cC140(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(149, plain,![X2]:((~(cC140(X2))|(cTOP(X2)&cC138(X2)))&((~(cTOP(X2))|~(cC138(X2)))|cC140(X2))),inference(variable_rename,[status(thm)],[148])).
% fof(150, plain,![X2]:(((cTOP(X2)|~(cC140(X2)))&(cC138(X2)|~(cC140(X2))))&((~(cTOP(X2))|~(cC138(X2)))|cC140(X2))),inference(distribute,[status(thm)],[149])).
% cnf(152,plain,(cC138(X1)|~cC140(X1)),inference(split_conjunct,[status(thm)],[150])).
% fof(154, plain,![X1]:((~(cTEST(X1))|(cC140(X1)&cC116(X1)))&((~(cC140(X1))|~(cC116(X1)))|cTEST(X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(155, plain,![X2]:((~(cTEST(X2))|(cC140(X2)&cC116(X2)))&((~(cC140(X2))|~(cC116(X2)))|cTEST(X2))),inference(variable_rename,[status(thm)],[154])).
% fof(156, plain,![X2]:(((cC140(X2)|~(cTEST(X2)))&(cC116(X2)|~(cTEST(X2))))&((~(cC140(X2))|~(cC116(X2)))|cTEST(X2))),inference(distribute,[status(thm)],[155])).
% cnf(159,plain,(cC140(X1)|~cTEST(X1)),inference(split_conjunct,[status(thm)],[156])).
% cnf(161,plain,(cTEST(iV5475)),inference(split_conjunct,[status(thm)],[7])).
% cnf(162,plain,(cTOP(iV5475)),inference(split_conjunct,[status(thm)],[8])).
% cnf(163,plain,(~cC114(iV5475)),inference(split_conjunct,[status(thm)],[94])).
% fof(177, plain,![X1]:((~(cC116(X1))|(cTOP(X1)&~(cC114(X1))))&((~(cTOP(X1))|cC114(X1))|cC116(X1))),inference(fof_nnf,[status(thm)],[96])).
% fof(178, plain,![X2]:((~(cC116(X2))|(cTOP(X2)&~(cC114(X2))))&((~(cTOP(X2))|cC114(X2))|cC116(X2))),inference(variable_rename,[status(thm)],[177])).
% fof(179, plain,![X2]:(((cTOP(X2)|~(cC116(X2)))&(~(cC114(X2))|~(cC116(X2))))&((~(cTOP(X2))|cC114(X2))|cC116(X2))),inference(distribute,[status(thm)],[178])).
% cnf(180,plain,(cC116(X1)|cC114(X1)|~cTOP(X1)),inference(split_conjunct,[status(thm)],[179])).
% fof(668, negated_conjecture,(((((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|~(cC138(iV5475)))|~(cowlThing(iV5475)))|~(cC116(iV5475)))|~(cC140(iV5475))),inference(fof_nnf,[status(thm)],[139])).
% fof(669, negated_conjecture,(((((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|~(cC138(iV5475)))|~(cowlThing(iV5475)))|~(cC116(iV5475)))|~(cC140(iV5475))),inference(variable_rename,[status(thm)],[668])).
% fof(670, negated_conjecture,((((((~(cowlThing(esk39_0))|cowlNothing(esk39_0))|((~(xsd_string(esk40_0))|xsd_integer(esk40_0))&(xsd_string(esk40_0)|~(xsd_integer(esk40_0)))))|~(cC138(iV5475)))|~(cowlThing(iV5475)))|~(cC116(iV5475)))|~(cC140(iV5475))),inference(skolemize,[status(esa)],[669])).
% fof(671, negated_conjecture,(((((((~(xsd_string(esk40_0))|xsd_integer(esk40_0))|(~(cowlThing(esk39_0))|cowlNothing(esk39_0)))|~(cC138(iV5475)))|~(cowlThing(iV5475)))|~(cC116(iV5475)))|~(cC140(iV5475)))&((((((xsd_string(esk40_0)|~(xsd_integer(esk40_0)))|(~(cowlThing(esk39_0))|cowlNothing(esk39_0)))|~(cC138(iV5475)))|~(cowlThing(iV5475)))|~(cC116(iV5475)))|~(cC140(iV5475)))),inference(distribute,[status(thm)],[670])).
% cnf(672,negated_conjecture,(cowlNothing(esk39_0)|xsd_string(esk40_0)|~cC140(iV5475)|~cC116(iV5475)|~cowlThing(iV5475)|~cC138(iV5475)|~cowlThing(esk39_0)|~xsd_integer(esk40_0)),inference(split_conjunct,[status(thm)],[671])).
% cnf(673,negated_conjecture,(cowlNothing(esk39_0)|xsd_integer(esk40_0)|~cC140(iV5475)|~cC116(iV5475)|~cowlThing(iV5475)|~cC138(iV5475)|~cowlThing(esk39_0)|~xsd_string(esk40_0)),inference(split_conjunct,[status(thm)],[671])).
% cnf(677,negated_conjecture,(cowlNothing(esk39_0)|xsd_string(esk40_0)|$false|$false|~xsd_integer(esk40_0)|~cC140(iV5475)|~cC138(iV5475)|~cC116(iV5475)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[672,142,theory(equality)]),142,theory(equality)]),['unfolding']).
% cnf(678,negated_conjecture,(cowlNothing(esk39_0)|xsd_integer(esk40_0)|$false|$false|~xsd_string(esk40_0)|~cC140(iV5475)|~cC138(iV5475)|~cC116(iV5475)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[673,142,theory(equality)]),142,theory(equality)]),['unfolding']).
% cnf(679,negated_conjecture,(xsd_string(esk40_0)|~xsd_integer(esk40_0)|~cC140(iV5475)|~cC138(iV5475)|~cC116(iV5475)),inference(sr,[status(thm)],[677,141,theory(equality)])).
% cnf(680,negated_conjecture,(xsd_string(esk40_0)|~cC116(iV5475)|~cC140(iV5475)|~xsd_integer(esk40_0)),inference(csr,[status(thm)],[679,152])).
% cnf(681,negated_conjecture,(xsd_string(esk40_0)|~cC116(iV5475)|~cC140(iV5475)),inference(csr,[status(thm)],[680,145])).
% cnf(682,negated_conjecture,(xsd_integer(esk40_0)|~xsd_string(esk40_0)|~cC140(iV5475)|~cC138(iV5475)|~cC116(iV5475)),inference(sr,[status(thm)],[678,141,theory(equality)])).
% cnf(683,negated_conjecture,(xsd_integer(esk40_0)|~cC116(iV5475)|~cC140(iV5475)|~xsd_string(esk40_0)),inference(csr,[status(thm)],[682,152])).
% cnf(684,negated_conjecture,(xsd_integer(esk40_0)|~cC116(iV5475)|~cC140(iV5475)),inference(csr,[status(thm)],[683,681])).
% cnf(685,negated_conjecture,(~xsd_string(esk40_0)|~cC116(iV5475)|~cC140(iV5475)),inference(spm,[status(thm)],[146,684,theory(equality)])).
% cnf(687,plain,(cC140(iV5475)),inference(spm,[status(thm)],[159,161,theory(equality)])).
% cnf(694,plain,(cC114(iV5475)|cC116(iV5475)),inference(spm,[status(thm)],[180,162,theory(equality)])).
% cnf(697,plain,(cC116(iV5475)),inference(sr,[status(thm)],[694,163,theory(equality)])).
% cnf(2255,negated_conjecture,(~cC116(iV5475)|~cC140(iV5475)),inference(csr,[status(thm)],[685,681])).
% cnf(2256,negated_conjecture,($false|~cC140(iV5475)),inference(rw,[status(thm)],[2255,697,theory(equality)])).
% cnf(2257,negated_conjecture,(~cC140(iV5475)),inference(cn,[status(thm)],[2256,theory(equality)])).
% cnf(2259,plain,($false),inference(sr,[status(thm)],[687,2257,theory(equality)])).
% cnf(2260,plain,($false),2259,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 464
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 464
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 1
% # Generated clauses : 1569
% # ...of the previous two non-trivial : 1491
% # Contextual simplify-reflections : 5
% # Paramodulations : 1569
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 231
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 217
% # Current number of unprocessed clauses: 1485
% # ...number of literals in the above : 4378
% # Clause-clause subsumption calls (NU) : 15255
% # Rec. Clause-clause subsumption calls : 14526
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 210 leaves, 1.11+/-0.318 terms/leaf
% # Paramod-from index: 97 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 190 leaves, 1.01+/-0.072 terms/leaf
% # -------------------------------------------------
% # User time : 0.079 s
% # System time : 0.008 s
% # Total time : 0.087 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.31 WC
% FINAL PrfWatch: 0.22 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP29818/KRS148+1.tptp
%
%------------------------------------------------------------------------------