TSTP Solution File: KRS178+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS178+1 : TPTP v5.3.0. Bugfixed v5.4.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 @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Jun 15 10:45:37 EDT 2012
% Result : Theorem 0.76s
% Output : Solution 0.76s
% 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/SystemOnTPTP12981/KRS178+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12981/KRS178+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12981/KRS178+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.5/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=60 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 13095
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHNFNFFMM21MS
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHNFNFFMM21MS
% # Auto-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% # and selection function SelectNewComplexAHP.
% #
% # No equality, disabling AC handling.
% #
% # Initializing proof state
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 14
% # Removed by relevancy pruning : 0
% # Initial clauses : 36
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 36
% # Processed clauses : 37
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 35
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 18
% # ...of the previous two non-trivial : 17
% # Contextual simplify-reflections : 0
% # Paramodulations : 18
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 34
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 20
% # Current number of unprocessed clauses: 16
% # ...number of literals in the above : 46
% # Clause-clause subsumption calls (NU) : 29
% # Rec. Clause-clause subsumption calls : 23
% # Non-unit clause-clause subsumptions: 2
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 3
% # BW rewrite match successes : 1
% # Backwards rewriting index : 397 nodes, 61 leaves, 1.18+/-0.528 terms/leaf
% # Paramod-from index : 74 nodes, 12 leaves, 1.08+/-0.276 terms/leaf
% # Paramod-into index : 263 nodes, 39 leaves, 1.03+/-0.158 terms/leaf
% # Paramod-neg-atom index : 94 nodes, 15 leaves, 1.20+/-0.542 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(![X3]:![X4]:(status(X3,X4,X1)=>status(X3,X4,X2))<=>isa(X1,X2)),file('/tmp/SRASS.s.p', isa)).
% fof(14, conjecture,![X1]:isa(X1,X1),file('/tmp/SRASS.s.p', isa_reflexive)).
% fof(15, negated_conjecture,~(![X1]:isa(X1,X1)),inference(assume_negation,[status(cth)],[14])).
% fof(26, plain,![X1]:![X2]:((?[X3]:?[X4]:(status(X3,X4,X1)&~(status(X3,X4,X2)))|isa(X1,X2))&(~(isa(X1,X2))|![X3]:![X4]:(~(status(X3,X4,X1))|status(X3,X4,X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(27, plain,(![X1]:![X2]:(?[X3]:?[X4]:(status(X3,X4,X1)&~(status(X3,X4,X2)))|isa(X1,X2))&![X1]:![X2]:(~(isa(X1,X2))|![X3]:![X4]:(~(status(X3,X4,X1))|status(X3,X4,X2)))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,(![X5]:![X6]:(?[X7]:?[X8]:(status(X7,X8,X5)&~(status(X7,X8,X6)))|isa(X5,X6))&![X9]:![X10]:(~(isa(X9,X10))|![X11]:![X12]:(~(status(X11,X12,X9))|status(X11,X12,X10)))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,(![X5]:![X6]:((status(esk1_2(X5,X6),esk2_2(X5,X6),X5)&~(status(esk1_2(X5,X6),esk2_2(X5,X6),X6)))|isa(X5,X6))&![X9]:![X10]:(~(isa(X9,X10))|![X11]:![X12]:(~(status(X11,X12,X9))|status(X11,X12,X10)))),inference(skolemize,[status(esa)],[28])).
% fof(30, plain,![X5]:![X6]:![X9]:![X10]:![X11]:![X12]:(((status(esk1_2(X5,X6),esk2_2(X5,X6),X5)&~(status(esk1_2(X5,X6),esk2_2(X5,X6),X6)))|isa(X5,X6))&(~(isa(X9,X10))|(~(status(X11,X12,X9))|status(X11,X12,X10)))),inference(shift_quantors,[status(thm)],[29])).
% fof(31, plain,![X5]:![X6]:![X9]:![X10]:![X11]:![X12]:(((status(esk1_2(X5,X6),esk2_2(X5,X6),X5)|isa(X5,X6))&(~(status(esk1_2(X5,X6),esk2_2(X5,X6),X6))|isa(X5,X6)))&(~(isa(X9,X10))|(~(status(X11,X12,X9))|status(X11,X12,X10)))),inference(distribute,[status(thm)],[30])).
% cnf(33,plain,(isa(X1,X2)|~status(esk1_2(X1,X2),esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[31])).
% cnf(34,plain,(isa(X1,X2)|status(esk1_2(X1,X2),esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(114, negated_conjecture,?[X1]:~(isa(X1,X1)),inference(fof_nnf,[status(thm)],[15])).
% fof(115, negated_conjecture,?[X2]:~(isa(X2,X2)),inference(variable_rename,[status(thm)],[114])).
% fof(116, negated_conjecture,~(isa(esk30_0,esk30_0)),inference(skolemize,[status(esa)],[115])).
% cnf(117,negated_conjecture,(~isa(esk30_0,esk30_0)),inference(split_conjunct,[status(thm)],[116])).
% cnf(120,plain,(isa(X1,X1)),inference(spm,[status(thm)],[33,34,theory(equality)])).
% cnf(136,negated_conjecture,($false),inference(rw,[status(thm)],[117,120,theory(equality)])).
% cnf(137,negated_conjecture,($false),inference(cn,[status(thm)],[136,theory(equality)])).
% cnf(138,negated_conjecture,($false),137,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.05 CPU 0.19 WC
% FINAL PrfWatch: 0.05 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP12981/KRS178+1.tptp
% WARNING: TreeLimitedRun lost 0.13s, total lost is 0.13s
%
%------------------------------------------------------------------------------