TSTP Solution File: KRS130+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS130+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 : art07.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:35:56 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP20396/KRS130+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP20396/KRS130+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20396/KRS130+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 20492
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 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]:(cNothing(X1)=>~(?[X2]:rp(X1,X2))),file('/tmp/SRASS.s.p', axiom_2)).
% fof(4, axiom,![X1]:(cNothing(X1)=>?[X3]:rp(X1,X3)),file('/tmp/SRASS.s.p', axiom_3)).
% fof(5, conjecture,((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cNothing(X1)<=>cowlNothing(X1))),file('/tmp/SRASS.s.p', the_axiom)).
% fof(6, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cNothing(X1)<=>cowlNothing(X1)))),inference(assume_negation,[status(cth)],[5])).
% fof(7, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(8, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(9, negated_conjecture,~(((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&![X1]:(cNothing(X1)<=>cowlNothing(X1)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(10, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[7])).
% cnf(11,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[10])).
% cnf(12,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[10])).
% fof(13, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(14, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[13])).
% cnf(15,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[14])).
% fof(17, plain,![X1]:(~(cNothing(X1))|![X2]:~(rp(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(18, plain,![X3]:(~(cNothing(X3))|![X4]:~(rp(X3,X4))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:(~(rp(X3,X4))|~(cNothing(X3))),inference(shift_quantors,[status(thm)],[18])).
% cnf(20,plain,(~cNothing(X1)|~rp(X1,X2)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X1]:(~(cNothing(X1))|?[X3]:rp(X1,X3)),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X4]:(~(cNothing(X4))|?[X5]:rp(X4,X5)),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X4]:(~(cNothing(X4))|rp(X4,esk1_1(X4))),inference(skolemize,[status(esa)],[22])).
% cnf(24,plain,(rp(X1,esk1_1(X1))|~cNothing(X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, negated_conjecture,((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|?[X1]:((~(cNothing(X1))|~(cowlNothing(X1)))&(cNothing(X1)|cowlNothing(X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(26, negated_conjecture,((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|?[X4]:((~(cNothing(X4))|~(cowlNothing(X4)))&(cNothing(X4)|cowlNothing(X4)))),inference(variable_rename,[status(thm)],[25])).
% fof(27, negated_conjecture,(((~(cowlThing(esk2_0))|cowlNothing(esk2_0))|((~(xsd_string(esk3_0))|xsd_integer(esk3_0))&(xsd_string(esk3_0)|~(xsd_integer(esk3_0)))))|((~(cNothing(esk4_0))|~(cowlNothing(esk4_0)))&(cNothing(esk4_0)|cowlNothing(esk4_0)))),inference(skolemize,[status(esa)],[26])).
% fof(28, negated_conjecture,((((~(cNothing(esk4_0))|~(cowlNothing(esk4_0)))|((~(xsd_string(esk3_0))|xsd_integer(esk3_0))|(~(cowlThing(esk2_0))|cowlNothing(esk2_0))))&((cNothing(esk4_0)|cowlNothing(esk4_0))|((~(xsd_string(esk3_0))|xsd_integer(esk3_0))|(~(cowlThing(esk2_0))|cowlNothing(esk2_0)))))&(((~(cNothing(esk4_0))|~(cowlNothing(esk4_0)))|((xsd_string(esk3_0)|~(xsd_integer(esk3_0)))|(~(cowlThing(esk2_0))|cowlNothing(esk2_0))))&((cNothing(esk4_0)|cowlNothing(esk4_0))|((xsd_string(esk3_0)|~(xsd_integer(esk3_0)))|(~(cowlThing(esk2_0))|cowlNothing(esk2_0)))))),inference(distribute,[status(thm)],[27])).
% cnf(29,negated_conjecture,(cowlNothing(esk2_0)|xsd_string(esk3_0)|cowlNothing(esk4_0)|cNothing(esk4_0)|~cowlThing(esk2_0)|~xsd_integer(esk3_0)),inference(split_conjunct,[status(thm)],[28])).
% cnf(31,negated_conjecture,(cowlNothing(esk2_0)|xsd_integer(esk3_0)|cowlNothing(esk4_0)|cNothing(esk4_0)|~cowlThing(esk2_0)|~xsd_string(esk3_0)),inference(split_conjunct,[status(thm)],[28])).
% cnf(33,negated_conjecture,(cowlNothing(esk2_0)|cowlNothing(esk4_0)|xsd_string(esk3_0)|cNothing(esk4_0)|$false|~xsd_integer(esk3_0)),inference(rw,[status(thm)],[29,12,theory(equality)]),['unfolding']).
% cnf(34,negated_conjecture,(cowlNothing(esk2_0)|cowlNothing(esk4_0)|xsd_integer(esk3_0)|cNothing(esk4_0)|$false|~xsd_string(esk3_0)),inference(rw,[status(thm)],[31,12,theory(equality)]),['unfolding']).
% cnf(37,negated_conjecture,(cowlNothing(esk4_0)|xsd_string(esk3_0)|cNothing(esk4_0)|~xsd_integer(esk3_0)),inference(sr,[status(thm)],[33,11,theory(equality)])).
% cnf(38,negated_conjecture,(xsd_string(esk3_0)|cNothing(esk4_0)|~xsd_integer(esk3_0)),inference(sr,[status(thm)],[37,11,theory(equality)])).
% cnf(39,negated_conjecture,(cNothing(esk4_0)|xsd_string(esk3_0)),inference(csr,[status(thm)],[38,15])).
% cnf(40,negated_conjecture,(cowlNothing(esk4_0)|xsd_integer(esk3_0)|cNothing(esk4_0)|~xsd_string(esk3_0)),inference(sr,[status(thm)],[34,11,theory(equality)])).
% cnf(41,negated_conjecture,(xsd_integer(esk3_0)|cNothing(esk4_0)|~xsd_string(esk3_0)),inference(sr,[status(thm)],[40,11,theory(equality)])).
% cnf(42,negated_conjecture,(cNothing(esk4_0)|xsd_integer(esk3_0)),inference(csr,[status(thm)],[41,15])).
% cnf(46,plain,(~cNothing(X1)),inference(csr,[status(thm)],[24,20])).
% cnf(47,negated_conjecture,(xsd_string(esk3_0)),inference(sr,[status(thm)],[39,46,theory(equality)])).
% cnf(48,negated_conjecture,(xsd_integer(esk3_0)),inference(sr,[status(thm)],[42,46,theory(equality)])).
% cnf(51,negated_conjecture,(~xsd_integer(esk3_0)),inference(spm,[status(thm)],[16,47,theory(equality)])).
% cnf(53,negated_conjecture,($false),inference(rw,[status(thm)],[51,48,theory(equality)])).
% cnf(54,negated_conjecture,($false),inference(cn,[status(thm)],[53,theory(equality)])).
% cnf(55,negated_conjecture,($false),54,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 17
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 15
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 4
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 6
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 6
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 2
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 8 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 6 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.003 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP20396/KRS130+1.tptp
%
%------------------------------------------------------------------------------