TSTP Solution File: SET027+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET027+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 : hopewell.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2400MHz
% Memory : 1003MB
% OS : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 11:04:47 EDT 2012
% Result : Theorem 0.35s
% Output : Solution 0.35s
% 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/SystemOnTPTP9926/SET027+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP9926/SET027+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9926/SET027+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 10024
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFMM21MD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreqconjmax>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFMM21MD
% # Auto-Mode selected heuristic G_E___107_C45_F1_PI_AE_Q4_CS_SP_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 44
% # Removed by relevancy pruning : 0
% # Initial clauses : 92
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 84
% # Processed clauses : 149
% # ...of these trivial : 3
% # ...subsumed : 16
% # ...remaining for further processing: 130
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 2
% # Generated clauses : 355
% # ...of the previous two non-trivial : 315
% # Contextual simplify-reflections : 1
% # Paramodulations : 348
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 120
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 96
% # Current number of unprocessed clauses: 220
% # ...number of literals in the above : 637
% # Clause-clause subsumption calls (NU) : 1494
% # Rec. Clause-clause subsumption calls : 1296
% # Non-unit clause-clause subsumptions: 13
% # Unit Clause-clause subsumption calls : 113
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 21
% # BW rewrite match successes : 2
% # Backwards rewriting index : 979 nodes, 178 leaves, 1.53+/-1.362 terms/leaf
% # Paramod-from index : 341 nodes, 58 leaves, 1.02+/-0.130 terms/leaf
% # Paramod-into index : 696 nodes, 120 leaves, 1.48+/-1.335 terms/leaf
% # Paramod-neg-atom index : 224 nodes, 43 leaves, 1.21+/-0.407 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(subclass(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(44, conjecture,![X1]:![X2]:![X8]:((subclass(X1,X2)&subclass(X2,X8))=>subclass(X1,X8)),file('/tmp/SRASS.s.p', transitivity)).
% fof(45, negated_conjecture,~(![X1]:![X2]:![X8]:((subclass(X1,X2)&subclass(X2,X8))=>subclass(X1,X8))),inference(assume_negation,[status(cth)],[44])).
% fof(48, plain,![X1]:![X2]:((~(subclass(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subclass(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(49, plain,(![X1]:![X2]:(~(subclass(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&![X1]:![X2]:(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subclass(X1,X2))),inference(shift_quantors,[status(thm)],[48])).
% fof(50, plain,(![X4]:![X5]:(~(subclass(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&![X7]:![X8]:(?[X9]:(member(X9,X7)&~(member(X9,X8)))|subclass(X7,X8))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,(![X4]:![X5]:(~(subclass(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&![X7]:![X8]:((member(esk1_2(X7,X8),X7)&~(member(esk1_2(X7,X8),X8)))|subclass(X7,X8))),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X7,X8),X7)&~(member(esk1_2(X7,X8),X8)))|subclass(X7,X8))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X4]:![X5]:![X6]:![X7]:![X8]:((~(subclass(X4,X5))|(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X7,X8),X7)|subclass(X7,X8))&(~(member(esk1_2(X7,X8),X8))|subclass(X7,X8)))),inference(distribute,[status(thm)],[52])).
% cnf(54,plain,(subclass(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(subclass(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(member(X1,X2)|~member(X1,X3)|~subclass(X3,X2)),inference(split_conjunct,[status(thm)],[53])).
% fof(273, negated_conjecture,?[X1]:?[X2]:?[X8]:((subclass(X1,X2)&subclass(X2,X8))&~(subclass(X1,X8))),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X9]:?[X10]:?[X11]:((subclass(X9,X10)&subclass(X10,X11))&~(subclass(X9,X11))),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,((subclass(esk8_0,esk9_0)&subclass(esk9_0,esk10_0))&~(subclass(esk8_0,esk10_0))),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(~subclass(esk8_0,esk10_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(277,negated_conjecture,(subclass(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(278,negated_conjecture,(subclass(esk8_0,esk9_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(378,negated_conjecture,(member(X1,esk10_0)|~member(X1,esk9_0)),inference(spm,[status(thm)],[56,277,theory(equality)])).
% cnf(379,negated_conjecture,(member(X1,esk9_0)|~member(X1,esk8_0)),inference(spm,[status(thm)],[56,278,theory(equality)])).
% cnf(569,negated_conjecture,(subclass(X1,esk10_0)|~member(esk1_2(X1,esk10_0),esk9_0)),inference(spm,[status(thm)],[54,378,theory(equality)])).
% cnf(660,negated_conjecture,(subclass(X1,esk10_0)|~member(esk1_2(X1,esk10_0),esk8_0)),inference(spm,[status(thm)],[569,379,theory(equality)])).
% cnf(719,negated_conjecture,(subclass(esk8_0,esk10_0)),inference(spm,[status(thm)],[660,55,theory(equality)])).
% cnf(720,negated_conjecture,($false),inference(sr,[status(thm)],[719,276,theory(equality)])).
% cnf(721,negated_conjecture,($false),720,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.03 CPU 0.07 WC
% FINAL PrfWatch: 0.03 CPU 0.07 WC
% SZS output end Solution for /tmp/SystemOnTPTP9926/SET027+1.tptp
%
%------------------------------------------------------------------------------