TSTP Solution File: MGT059+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : MGT059+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art05.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 16:10:44 EST 2010

% Result   : Theorem 0.88s
% Output   : Solution 0.88s
% 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/SystemOnTPTP9804/MGT059+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP9804/MGT059+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9804/MGT059+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC  time limit is 120s
% TreeLimitedRun: PID is 9900
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X4]:(organization(X1)=>((has_immunity(X1,X4)=>hazard_of_mortality(X1,X4)=very_low)&(~(has_immunity(X1,X4))=>(((((is_aligned(X1,X4)&positional_advantage(X1,X4))=>hazard_of_mortality(X1,X4)=low)&((~(is_aligned(X1,X4))&positional_advantage(X1,X4))=>hazard_of_mortality(X1,X4)=mod1))&((is_aligned(X1,X4)&~(positional_advantage(X1,X4)))=>hazard_of_mortality(X1,X4)=mod2))&((~(is_aligned(X1,X4))&~(positional_advantage(X1,X4)))=>hazard_of_mortality(X1,X4)=high))))),file('/tmp/SRASS.s.p', assumption_17)).
% fof(8, conjecture,![X1]:![X5]:![X4]:(((organization(X1)&has_immunity(X1,X5))&has_immunity(X1,X4))=>hazard_of_mortality(X1,X5)=hazard_of_mortality(X1,X4)),file('/tmp/SRASS.s.p', assumption_2)).
% fof(9, negated_conjecture,~(![X1]:![X5]:![X4]:(((organization(X1)&has_immunity(X1,X5))&has_immunity(X1,X4))=>hazard_of_mortality(X1,X5)=hazard_of_mortality(X1,X4))),inference(assume_negation,[status(cth)],[8])).
% fof(10, plain,![X1]:![X4]:(organization(X1)=>((has_immunity(X1,X4)=>hazard_of_mortality(X1,X4)=very_low)&(~(has_immunity(X1,X4))=>(((((is_aligned(X1,X4)&positional_advantage(X1,X4))=>hazard_of_mortality(X1,X4)=low)&((~(is_aligned(X1,X4))&positional_advantage(X1,X4))=>hazard_of_mortality(X1,X4)=mod1))&((is_aligned(X1,X4)&~(positional_advantage(X1,X4)))=>hazard_of_mortality(X1,X4)=mod2))&((~(is_aligned(X1,X4))&~(positional_advantage(X1,X4)))=>hazard_of_mortality(X1,X4)=high))))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(11, plain,![X4]:![X1]:(epred1_2(X1,X4)=>(((((is_aligned(X1,X4)&positional_advantage(X1,X4))=>hazard_of_mortality(X1,X4)=low)&((~(is_aligned(X1,X4))&positional_advantage(X1,X4))=>hazard_of_mortality(X1,X4)=mod1))&((is_aligned(X1,X4)&~(positional_advantage(X1,X4)))=>hazard_of_mortality(X1,X4)=mod2))&((~(is_aligned(X1,X4))&~(positional_advantage(X1,X4)))=>hazard_of_mortality(X1,X4)=high))),introduced(definition)).
% fof(12, plain,![X1]:![X4]:(organization(X1)=>((has_immunity(X1,X4)=>hazard_of_mortality(X1,X4)=very_low)&(~(has_immunity(X1,X4))=>epred1_2(X1,X4)))),inference(apply_def,[status(esa)],[10,11,theory(equality)])).
% fof(25, plain,![X1]:![X4]:(~(organization(X1))|((~(has_immunity(X1,X4))|hazard_of_mortality(X1,X4)=very_low)&(has_immunity(X1,X4)|epred1_2(X1,X4)))),inference(fof_nnf,[status(thm)],[12])).
% fof(26, plain,![X5]:![X6]:(~(organization(X5))|((~(has_immunity(X5,X6))|hazard_of_mortality(X5,X6)=very_low)&(has_immunity(X5,X6)|epred1_2(X5,X6)))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X5]:![X6]:(((~(has_immunity(X5,X6))|hazard_of_mortality(X5,X6)=very_low)|~(organization(X5)))&((has_immunity(X5,X6)|epred1_2(X5,X6))|~(organization(X5)))),inference(distribute,[status(thm)],[26])).
% cnf(29,plain,(hazard_of_mortality(X1,X2)=very_low|~organization(X1)|~has_immunity(X1,X2)),inference(split_conjunct,[status(thm)],[27])).
% fof(42, negated_conjecture,?[X1]:?[X5]:?[X4]:(((organization(X1)&has_immunity(X1,X5))&has_immunity(X1,X4))&~(hazard_of_mortality(X1,X5)=hazard_of_mortality(X1,X4))),inference(fof_nnf,[status(thm)],[9])).
% fof(43, negated_conjecture,?[X6]:?[X7]:?[X8]:(((organization(X6)&has_immunity(X6,X7))&has_immunity(X6,X8))&~(hazard_of_mortality(X6,X7)=hazard_of_mortality(X6,X8))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(((organization(esk1_0)&has_immunity(esk1_0,esk2_0))&has_immunity(esk1_0,esk3_0))&~(hazard_of_mortality(esk1_0,esk2_0)=hazard_of_mortality(esk1_0,esk3_0))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(hazard_of_mortality(esk1_0,esk2_0)!=hazard_of_mortality(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(has_immunity(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,negated_conjecture,(has_immunity(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(48,negated_conjecture,(organization(esk1_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(58,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=very_low|~organization(esk1_0)),inference(spm,[status(thm)],[29,46,theory(equality)])).
% cnf(59,negated_conjecture,(hazard_of_mortality(esk1_0,esk2_0)=very_low|~organization(esk1_0)),inference(spm,[status(thm)],[29,47,theory(equality)])).
% cnf(60,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=very_low|$false),inference(rw,[status(thm)],[58,48,theory(equality)])).
% cnf(61,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=very_low),inference(cn,[status(thm)],[60,theory(equality)])).
% cnf(62,negated_conjecture,(hazard_of_mortality(esk1_0,esk2_0)=very_low|$false),inference(rw,[status(thm)],[59,48,theory(equality)])).
% cnf(63,negated_conjecture,(hazard_of_mortality(esk1_0,esk2_0)=very_low),inference(cn,[status(thm)],[62,theory(equality)])).
% cnf(73,negated_conjecture,(very_low!=hazard_of_mortality(esk1_0,esk2_0)),inference(rw,[status(thm)],[45,61,theory(equality)])).
% cnf(74,negated_conjecture,($false),inference(sr,[status(thm)],[63,73,theory(equality)])).
% cnf(75,negated_conjecture,($false),74,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 47
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 47
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 1
% # Generated clauses                  : 13
% # ...of the previous two non-trivial : 9
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 11
% # Factorizations                     : 0
% # Equation resolutions               : 2
% # Current number of processed clauses: 22
% #    Positive orientable unit clauses: 6
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 15
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 13
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 3
% # Indexed BW rewrite successes       : 1
% # Backwards rewriting index:    24 leaves,   1.25+/-0.661 terms/leaf
% # Paramod-from index:            8 leaves,   1.25+/-0.433 terms/leaf
% # Paramod-into index:           15 leaves,   1.27+/-0.442 terms/leaf
% # -------------------------------------------------
% # User time              : 0.012 s
% # System time            : 0.004 s
% # Total time             : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP9804/MGT059+1.tptp
% 
%------------------------------------------------------------------------------