↑ Up

SRASS---0.1.THM-Sol.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET055+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 : merrimac.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:57 EDT 2012

% Result   : Theorem 0.32s
% Output   : Solution 0.32s
% 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/SystemOnTPTP31675/SET055+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP31675/SET055+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31675/SET055+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 31773
% 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                    : 90
% # Removed in clause preprocessing    : 8
% # Initial clauses in saturation      : 82
% # Processed clauses                  : 1
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 0
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 0
% #    Positive orientable unit clauses: 0
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 0
% # Current number of unprocessed clauses: 81
% # ...number of literals in the above : 177
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Non-unit clause-clause subsumptions: 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # BW rewrite match attempts          : 0
% # BW rewrite match successes         : 0
% # Backwards rewriting index :     1 nodes,     0 leaves,   0.00+/-0.000 terms/leaf
% # Paramod-from index      :     1 nodes,     0 leaves,   0.00+/-0.000 terms/leaf
% # Paramod-into index      :     1 nodes,     0 leaves,   0.00+/-0.000 terms/leaf
% # Paramod-neg-atom index  :     1 nodes,     0 leaves,   0.00+/-0.000 terms/leaf
% # SZS output start CNFRefutation.
% fof(44, conjecture,![X1]:X1=X1,file('/tmp/SRASS.s.p', reflexivity)).
% fof(45, negated_conjecture,~(![X1]:X1=X1),inference(assume_negation,[status(cth)],[44])).
% fof(273, negated_conjecture,?[X1]:~(X1=X1),inference(fof_nnf,[status(thm)],[45])).
% fof(274, negated_conjecture,?[X2]:~(X2=X2),inference(variable_rename,[status(thm)],[273])).
% fof(275, negated_conjecture,~(esk8_0=esk8_0),inference(skolemize,[status(esa)],[274])).
% cnf(276,negated_conjecture,($false),inference(split_conjunct,[status(thm)],[275])).
% cnf(329,negated_conjecture,($false),276,['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/SystemOnTPTP31675/SET055+1.tptp
% 
%------------------------------------------------------------------------------