TSTP Solution File: KRS156+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS156+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 : art09.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:39 EST 2010
% Result : Theorem 1.66s
% Output : Solution 1.66s
% 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/SystemOnTPTP794/KRS156+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP794/KRS156+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP794/KRS156+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 890
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.034 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_49)).
% fof(5, axiom,![X1]:(cTEST(X1)<=>(cC140(X1)&cC116(X1))),file('/tmp/SRASS.s.p', axiom_127)).
% fof(10, axiom,cTEST(iV5475),file('/tmp/SRASS.s.p', axiom_131)).
% fof(146, conjecture,(((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC116(iV5475))&cC140(iV5475))&cowlThing(iV5475))&cC138(iV5475)),file('/tmp/SRASS.s.p', the_axiom)).
% fof(147, negated_conjecture,~((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC116(iV5475))&cC140(iV5475))&cowlThing(iV5475))&cC138(iV5475))),inference(assume_negation,[status(cth)],[146])).
% fof(148, plain,![X1]:(cowlThing(X1)&~(cowlNothing(X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(149, plain,![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(150, negated_conjecture,~((((((![X1]:(cowlThing(X1)&~(cowlNothing(X1)))&![X1]:(xsd_string(X1)<=>~(xsd_integer(X1))))&cC116(iV5475))&cC140(iV5475))&cowlThing(iV5475))&cC138(iV5475))),inference(fof_simplification,[status(thm)],[147,theory(equality)])).
% fof(151, plain,![X2]:(cowlThing(X2)&~(cowlNothing(X2))),inference(variable_rename,[status(thm)],[148])).
% cnf(152,plain,(~cowlNothing(X1)),inference(split_conjunct,[status(thm)],[151])).
% cnf(153,plain,(cowlThing(X1)),inference(split_conjunct,[status(thm)],[151])).
% fof(154, plain,![X1]:((~(xsd_string(X1))|~(xsd_integer(X1)))&(xsd_integer(X1)|xsd_string(X1))),inference(fof_nnf,[status(thm)],[149])).
% fof(155, plain,![X2]:((~(xsd_string(X2))|~(xsd_integer(X2)))&(xsd_integer(X2)|xsd_string(X2))),inference(variable_rename,[status(thm)],[154])).
% cnf(156,plain,(xsd_string(X1)|xsd_integer(X1)),inference(split_conjunct,[status(thm)],[155])).
% cnf(157,plain,(~xsd_integer(X1)|~xsd_string(X1)),inference(split_conjunct,[status(thm)],[155])).
% fof(159, plain,![X1]:((~(cC140(X1))|(cTOP(X1)&cC138(X1)))&((~(cTOP(X1))|~(cC138(X1)))|cC140(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(160, plain,![X2]:((~(cC140(X2))|(cTOP(X2)&cC138(X2)))&((~(cTOP(X2))|~(cC138(X2)))|cC140(X2))),inference(variable_rename,[status(thm)],[159])).
% fof(161, plain,![X2]:(((cTOP(X2)|~(cC140(X2)))&(cC138(X2)|~(cC140(X2))))&((~(cTOP(X2))|~(cC138(X2)))|cC140(X2))),inference(distribute,[status(thm)],[160])).
% cnf(163,plain,(cC138(X1)|~cC140(X1)),inference(split_conjunct,[status(thm)],[161])).
% fof(165, plain,![X1]:((~(cTEST(X1))|(cC140(X1)&cC116(X1)))&((~(cC140(X1))|~(cC116(X1)))|cTEST(X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(166, plain,![X2]:((~(cTEST(X2))|(cC140(X2)&cC116(X2)))&((~(cC140(X2))|~(cC116(X2)))|cTEST(X2))),inference(variable_rename,[status(thm)],[165])).
% fof(167, plain,![X2]:(((cC140(X2)|~(cTEST(X2)))&(cC116(X2)|~(cTEST(X2))))&((~(cC140(X2))|~(cC116(X2)))|cTEST(X2))),inference(distribute,[status(thm)],[166])).
% cnf(169,plain,(cC116(X1)|~cTEST(X1)),inference(split_conjunct,[status(thm)],[167])).
% cnf(170,plain,(cC140(X1)|~cTEST(X1)),inference(split_conjunct,[status(thm)],[167])).
% cnf(175,plain,(cTEST(iV5475)),inference(split_conjunct,[status(thm)],[10])).
% fof(1015, negated_conjecture,(((((?[X1]:(~(cowlThing(X1))|cowlNothing(X1))|?[X1]:((~(xsd_string(X1))|xsd_integer(X1))&(xsd_string(X1)|~(xsd_integer(X1)))))|~(cC116(iV5475)))|~(cC140(iV5475)))|~(cowlThing(iV5475)))|~(cC138(iV5475))),inference(fof_nnf,[status(thm)],[150])).
% fof(1016, negated_conjecture,(((((?[X2]:(~(cowlThing(X2))|cowlNothing(X2))|?[X3]:((~(xsd_string(X3))|xsd_integer(X3))&(xsd_string(X3)|~(xsd_integer(X3)))))|~(cC116(iV5475)))|~(cC140(iV5475)))|~(cowlThing(iV5475)))|~(cC138(iV5475))),inference(variable_rename,[status(thm)],[1015])).
% fof(1017, negated_conjecture,((((((~(cowlThing(esk95_0))|cowlNothing(esk95_0))|((~(xsd_string(esk96_0))|xsd_integer(esk96_0))&(xsd_string(esk96_0)|~(xsd_integer(esk96_0)))))|~(cC116(iV5475)))|~(cC140(iV5475)))|~(cowlThing(iV5475)))|~(cC138(iV5475))),inference(skolemize,[status(esa)],[1016])).
% fof(1018, negated_conjecture,(((((((~(xsd_string(esk96_0))|xsd_integer(esk96_0))|(~(cowlThing(esk95_0))|cowlNothing(esk95_0)))|~(cC116(iV5475)))|~(cC140(iV5475)))|~(cowlThing(iV5475)))|~(cC138(iV5475)))&((((((xsd_string(esk96_0)|~(xsd_integer(esk96_0)))|(~(cowlThing(esk95_0))|cowlNothing(esk95_0)))|~(cC116(iV5475)))|~(cC140(iV5475)))|~(cowlThing(iV5475)))|~(cC138(iV5475)))),inference(distribute,[status(thm)],[1017])).
% cnf(1019,negated_conjecture,(cowlNothing(esk95_0)|xsd_string(esk96_0)|~cC138(iV5475)|~cowlThing(iV5475)|~cC140(iV5475)|~cC116(iV5475)|~cowlThing(esk95_0)|~xsd_integer(esk96_0)),inference(split_conjunct,[status(thm)],[1018])).
% cnf(1020,negated_conjecture,(cowlNothing(esk95_0)|xsd_integer(esk96_0)|~cC138(iV5475)|~cowlThing(iV5475)|~cC140(iV5475)|~cC116(iV5475)|~cowlThing(esk95_0)|~xsd_string(esk96_0)),inference(split_conjunct,[status(thm)],[1018])).
% cnf(1024,negated_conjecture,(cowlNothing(esk95_0)|xsd_string(esk96_0)|$false|$false|~xsd_integer(esk96_0)|~cC140(iV5475)|~cC138(iV5475)|~cC116(iV5475)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1019,153,theory(equality)]),153,theory(equality)]),['unfolding']).
% cnf(1025,negated_conjecture,(cowlNothing(esk95_0)|xsd_integer(esk96_0)|$false|$false|~xsd_string(esk96_0)|~cC140(iV5475)|~cC138(iV5475)|~cC116(iV5475)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1020,153,theory(equality)]),153,theory(equality)]),['unfolding']).
% cnf(1026,negated_conjecture,(xsd_string(esk96_0)|~xsd_integer(esk96_0)|~cC140(iV5475)|~cC138(iV5475)|~cC116(iV5475)),inference(sr,[status(thm)],[1024,152,theory(equality)])).
% cnf(1027,negated_conjecture,(xsd_string(esk96_0)|~cC116(iV5475)|~cC140(iV5475)|~xsd_integer(esk96_0)),inference(csr,[status(thm)],[1026,163])).
% cnf(1028,negated_conjecture,(xsd_string(esk96_0)|~cC116(iV5475)|~cC140(iV5475)),inference(csr,[status(thm)],[1027,156])).
% cnf(1029,negated_conjecture,(xsd_integer(esk96_0)|~xsd_string(esk96_0)|~cC140(iV5475)|~cC138(iV5475)|~cC116(iV5475)),inference(sr,[status(thm)],[1025,152,theory(equality)])).
% cnf(1030,negated_conjecture,(xsd_integer(esk96_0)|~cC116(iV5475)|~cC140(iV5475)|~xsd_string(esk96_0)),inference(csr,[status(thm)],[1029,163])).
% cnf(1031,negated_conjecture,(xsd_integer(esk96_0)|~cC116(iV5475)|~cC140(iV5475)),inference(csr,[status(thm)],[1030,1028])).
% cnf(1034,plain,(cC140(iV5475)),inference(spm,[status(thm)],[170,175,theory(equality)])).
% cnf(1035,plain,(cC116(iV5475)),inference(spm,[status(thm)],[169,175,theory(equality)])).
% cnf(2686,negated_conjecture,(xsd_integer(esk96_0)|~cC116(iV5475)|$false),inference(rw,[status(thm)],[1031,1034,theory(equality)])).
% cnf(2687,negated_conjecture,(xsd_integer(esk96_0)|~cC116(iV5475)),inference(cn,[status(thm)],[2686,theory(equality)])).
% cnf(2688,negated_conjecture,(xsd_string(esk96_0)|~cC116(iV5475)|$false),inference(rw,[status(thm)],[1028,1034,theory(equality)])).
% cnf(2689,negated_conjecture,(xsd_string(esk96_0)|~cC116(iV5475)),inference(cn,[status(thm)],[2688,theory(equality)])).
% cnf(2690,negated_conjecture,(~xsd_string(esk96_0)|~cC116(iV5475)),inference(spm,[status(thm)],[157,2687,theory(equality)])).
% cnf(2691,negated_conjecture,(~cC116(iV5475)),inference(csr,[status(thm)],[2690,2689])).
% cnf(2693,plain,($false),inference(sr,[status(thm)],[1035,2691,theory(equality)])).
% cnf(2694,plain,($false),2693,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 689
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 689
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 1654
% # ...of the previous two non-trivial : 1525
% # Contextual simplify-reflections : 5
% # Paramodulations : 1654
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 345
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 332
% # Current number of unprocessed clauses: 1517
% # ...number of literals in the above : 4440
% # Clause-clause subsumption calls (NU) : 76787
% # Rec. Clause-clause subsumption calls : 70725
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 379 leaves, 1.06+/-0.244 terms/leaf
% # Paramod-from index: 187 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 338 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.120 s
% # System time : 0.004 s
% # Total time : 0.124 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.32 WC
% FINAL PrfWatch: 0.24 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP794/KRS156+1.tptp
%
%------------------------------------------------------------------------------