TSTP Solution File: SET062+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET062+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 : sharpsburg.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:05:31 EDT 2012
% Result : Theorem 0.33s
% Output : Solution 0.33s
% 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/SystemOnTPTP31870/SET062+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31870/SET062+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31870/SET062+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 31968
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFMS21MD
% # 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 GHSMNFFMS21MD
% # Auto-Mode selected heuristic G_E___103_C18_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 : 90
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 82
% # Processed clauses : 86
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 84
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 203
% # ...of the previous two non-trivial : 183
% # Contextual simplify-reflections : 0
% # Paramodulations : 196
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 79
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 179
% # ...number of literals in the above : 488
% # Clause-clause subsumption calls (NU) : 635
% # Rec. Clause-clause subsumption calls : 582
% # Non-unit clause-clause subsumptions: 0
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 15
% # BW rewrite match successes : 1
% # Backwards rewriting index : 641 nodes, 112 leaves, 1.82+/-1.616 terms/leaf
% # Paramod-from index : 216 nodes, 36 leaves, 1.03+/-0.164 terms/leaf
% # Paramod-into index : 497 nodes, 84 leaves, 1.67+/-1.546 terms/leaf
% # Paramod-neg-atom index : 134 nodes, 25 leaves, 1.32+/-0.466 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(member(X1,null_class)),file('/tmp/SRASS.s.p', null_class_defn)).
% fof(2, axiom,![X1]:![X2]:(subclass(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subclass_defn)).
% fof(44, conjecture,![X1]:subclass(null_class,X1),file('/tmp/SRASS.s.p', null_class_is_subclass)).
% fof(45, negated_conjecture,~(![X1]:subclass(null_class,X1)),inference(assume_negation,[status(cth)],[44])).
% fof(46, plain,![X1]:~(member(X1,null_class)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(48, plain,![X2]:~(member(X2,null_class)),inference(variable_rename,[status(thm)],[46])).
% cnf(49,plain,(~member(X1,null_class)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, 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)],[2])).
% fof(51, 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)],[50])).
% fof(52, 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)],[51])).
% fof(53, 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)],[52])).
% fof(54, 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)],[53])).
% fof(55, 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)],[54])).
% cnf(57,plain,(subclass(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[55])).
% fof(273, negated_conjecture,?[X1]:~(subclass(null_class,X1)),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X2]:~(subclass(null_class,X2)),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,~(subclass(null_class,esk8_0)),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(~subclass(null_class,esk8_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(355,plain,(subclass(null_class,X1)),inference(spm,[status(thm)],[49,57,theory(equality)])).
% cnf(545,negated_conjecture,($false),inference(rw,[status(thm)],[276,355,theory(equality)])).
% cnf(546,negated_conjecture,($false),inference(cn,[status(thm)],[545,theory(equality)])).
% cnf(547,negated_conjecture,($false),546,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.03 CPU 0.06 WC
% FINAL PrfWatch: 0.03 CPU 0.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP31870/SET062+1.tptp
%
%------------------------------------------------------------------------------