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