TSTP Solution File: SET054+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET054+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 : antietam.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:55 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/SystemOnTPTP11789/SET054+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP11789/SET054+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11789/SET054+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 11887
% 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 : 83
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 83
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 201
% # ...of the previous two non-trivial : 183
% # Contextual simplify-reflections : 0
% # Paramodulations : 194
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 78
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 66
% # Current number of unprocessed clauses: 182
% # ...number of literals in the above : 491
% # Clause-clause subsumption calls (NU) : 800
% # Rec. Clause-clause subsumption calls : 744
% # Non-unit clause-clause subsumptions: 0
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 14
% # BW rewrite match successes : 1
% # Backwards rewriting index : 635 nodes, 111 leaves, 1.83+/-1.621 terms/leaf
% # Paramod-from index : 210 nodes, 35 leaves, 1.03+/-0.167 terms/leaf
% # Paramod-into index : 491 nodes, 83 leaves, 1.67+/-1.553 terms/leaf
% # Paramod-neg-atom index : 134 nodes, 25 leaves, 1.32+/-0.466 terms/leaf
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(X1=X2<=>(subclass(X1,X2)&subclass(X2,X1))),file('/tmp/SRASS.s.p', extensionality)).
% fof(44, conjecture,![X1]:subclass(X1,X1),file('/tmp/SRASS.s.p', reflexivity_of_subclass)).
% fof(45, negated_conjecture,~(![X1]:subclass(X1,X1)),inference(assume_negation,[status(cth)],[44])).
% fof(59, plain,![X1]:![X2]:((~(X1=X2)|(subclass(X1,X2)&subclass(X2,X1)))&((~(subclass(X1,X2))|~(subclass(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[3])).
% fof(60, plain,(![X1]:![X2]:(~(X1=X2)|(subclass(X1,X2)&subclass(X2,X1)))&![X1]:![X2]:((~(subclass(X1,X2))|~(subclass(X2,X1)))|X1=X2)),inference(shift_quantors,[status(thm)],[59])).
% fof(61, plain,(![X3]:![X4]:(~(X3=X4)|(subclass(X3,X4)&subclass(X4,X3)))&![X5]:![X6]:((~(subclass(X5,X6))|~(subclass(X6,X5)))|X5=X6)),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X3]:![X4]:![X5]:![X6]:((~(X3=X4)|(subclass(X3,X4)&subclass(X4,X3)))&((~(subclass(X5,X6))|~(subclass(X6,X5)))|X5=X6)),inference(shift_quantors,[status(thm)],[61])).
% fof(63, plain,![X3]:![X4]:![X5]:![X6]:(((subclass(X3,X4)|~(X3=X4))&(subclass(X4,X3)|~(X3=X4)))&((~(subclass(X5,X6))|~(subclass(X6,X5)))|X5=X6)),inference(distribute,[status(thm)],[62])).
% cnf(65,plain,(subclass(X2,X1)|X1!=X2),inference(split_conjunct,[status(thm)],[63])).
% fof(273, negated_conjecture,?[X1]:~(subclass(X1,X1)),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X2]:~(subclass(X2,X2)),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,~(subclass(esk8_0,esk8_0)),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,(~subclass(esk8_0,esk8_0)),inference(split_conjunct,[status(thm)],[275])).
% cnf(329,plain,(subclass(X1,X1)),inference(er,[status(thm)],[65,theory(equality)])).
% cnf(541,negated_conjecture,($false),inference(rw,[status(thm)],[276,329,theory(equality)])).
% cnf(542,negated_conjecture,($false),inference(cn,[status(thm)],[541,theory(equality)])).
% cnf(543,negated_conjecture,($false),542,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.02 CPU 0.06 WC
% FINAL PrfWatch: 0.02 CPU 0.06 WC
% SZS output end Solution for /tmp/SystemOnTPTP11789/SET054+1.tptp
%
%------------------------------------------------------------------------------