TSTP Solution File: MGT060+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT060+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:53 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP10063/MGT060+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10063/MGT060+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10063/MGT060+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 10159
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:((greater(X1,X2)&greater(X2,X3))=>greater(X1,X3)),file('/tmp/SRASS.s.p', meaning_postulate_greater_transitive)).
% fof(4, axiom,greater(mod1,low),file('/tmp/SRASS.s.p', assumption_18b)).
% fof(5, axiom,greater(low,very_low),file('/tmp/SRASS.s.p', assumption_18c)).
% fof(6, axiom,greater(high,mod2),file('/tmp/SRASS.s.p', assumption_18d)).
% fof(7, axiom,greater(mod2,low),file('/tmp/SRASS.s.p', assumption_18e)).
% fof(8, 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(13, conjecture,![X1]:![X5]:![X4]:(((organization(X1)&has_immunity(X1,X5))&~(has_immunity(X1,X4)))=>greater(hazard_of_mortality(X1,X4),hazard_of_mortality(X1,X5))),file('/tmp/SRASS.s.p', assumption_3)).
% fof(14, negated_conjecture,~(![X1]:![X5]:![X4]:(((organization(X1)&has_immunity(X1,X5))&~(has_immunity(X1,X4)))=>greater(hazard_of_mortality(X1,X4),hazard_of_mortality(X1,X5)))),inference(assume_negation,[status(cth)],[13])).
% fof(15, 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)],[8,theory(equality)])).
% fof(16, negated_conjecture,~(![X1]:![X5]:![X4]:(((organization(X1)&has_immunity(X1,X5))&~(has_immunity(X1,X4)))=>greater(hazard_of_mortality(X1,X4),hazard_of_mortality(X1,X5)))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(17, 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(18, 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)],[15,17,theory(equality)])).
% fof(22, plain,![X1]:![X2]:![X3]:((~(greater(X1,X2))|~(greater(X2,X3)))|greater(X1,X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X4]:![X5]:![X6]:((~(greater(X4,X5))|~(greater(X5,X6)))|greater(X4,X6)),inference(variable_rename,[status(thm)],[22])).
% cnf(24,plain,(greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3)),inference(split_conjunct,[status(thm)],[23])).
% cnf(26,plain,(greater(mod1,low)),inference(split_conjunct,[status(thm)],[4])).
% cnf(27,plain,(greater(low,very_low)),inference(split_conjunct,[status(thm)],[5])).
% cnf(28,plain,(greater(high,mod2)),inference(split_conjunct,[status(thm)],[6])).
% cnf(29,plain,(greater(mod2,low)),inference(split_conjunct,[status(thm)],[7])).
% fof(30, 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)],[18])).
% fof(31, 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)],[30])).
% fof(32, 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)],[31])).
% cnf(33,plain,(epred1_2(X1,X2)|has_immunity(X1,X2)|~organization(X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,plain,(hazard_of_mortality(X1,X2)=very_low|~organization(X1)|~has_immunity(X1,X2)),inference(split_conjunct,[status(thm)],[32])).
% fof(53, negated_conjecture,?[X1]:?[X5]:?[X4]:(((organization(X1)&has_immunity(X1,X5))&~(has_immunity(X1,X4)))&~(greater(hazard_of_mortality(X1,X4),hazard_of_mortality(X1,X5)))),inference(fof_nnf,[status(thm)],[16])).
% fof(54, negated_conjecture,?[X6]:?[X7]:?[X8]:(((organization(X6)&has_immunity(X6,X7))&~(has_immunity(X6,X8)))&~(greater(hazard_of_mortality(X6,X8),hazard_of_mortality(X6,X7)))),inference(variable_rename,[status(thm)],[53])).
% fof(55, negated_conjecture,(((organization(esk1_0)&has_immunity(esk1_0,esk2_0))&~(has_immunity(esk1_0,esk3_0)))&~(greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)))),inference(skolemize,[status(esa)],[54])).
% cnf(56,negated_conjecture,(~greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[55])).
% cnf(57,negated_conjecture,(~has_immunity(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[55])).
% cnf(58,negated_conjecture,(has_immunity(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[55])).
% cnf(59,negated_conjecture,(organization(esk1_0)),inference(split_conjunct,[status(thm)],[55])).
% fof(60, 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))),inference(fof_nnf,[status(thm)],[17])).
% fof(61, plain,![X5]:![X6]:(~(epred1_2(X6,X5))|(((((~(is_aligned(X6,X5))|~(positional_advantage(X6,X5)))|hazard_of_mortality(X6,X5)=low)&((is_aligned(X6,X5)|~(positional_advantage(X6,X5)))|hazard_of_mortality(X6,X5)=mod1))&((~(is_aligned(X6,X5))|positional_advantage(X6,X5))|hazard_of_mortality(X6,X5)=mod2))&((is_aligned(X6,X5)|positional_advantage(X6,X5))|hazard_of_mortality(X6,X5)=high))),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X5]:![X6]:((((((~(is_aligned(X6,X5))|~(positional_advantage(X6,X5)))|hazard_of_mortality(X6,X5)=low)|~(epred1_2(X6,X5)))&(((is_aligned(X6,X5)|~(positional_advantage(X6,X5)))|hazard_of_mortality(X6,X5)=mod1)|~(epred1_2(X6,X5))))&(((~(is_aligned(X6,X5))|positional_advantage(X6,X5))|hazard_of_mortality(X6,X5)=mod2)|~(epred1_2(X6,X5))))&(((is_aligned(X6,X5)|positional_advantage(X6,X5))|hazard_of_mortality(X6,X5)=high)|~(epred1_2(X6,X5)))),inference(distribute,[status(thm)],[61])).
% cnf(63,plain,(hazard_of_mortality(X1,X2)=high|positional_advantage(X1,X2)|is_aligned(X1,X2)|~epred1_2(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,plain,(hazard_of_mortality(X1,X2)=mod2|positional_advantage(X1,X2)|~epred1_2(X1,X2)|~is_aligned(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,plain,(hazard_of_mortality(X1,X2)=mod1|is_aligned(X1,X2)|~epred1_2(X1,X2)|~positional_advantage(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(66,plain,(hazard_of_mortality(X1,X2)=low|~epred1_2(X1,X2)|~positional_advantage(X1,X2)|~is_aligned(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(75,negated_conjecture,(hazard_of_mortality(esk1_0,esk2_0)=very_low|~organization(esk1_0)),inference(spm,[status(thm)],[34,58,theory(equality)])).
% cnf(76,negated_conjecture,(hazard_of_mortality(esk1_0,esk2_0)=very_low|$false),inference(rw,[status(thm)],[75,59,theory(equality)])).
% cnf(77,negated_conjecture,(hazard_of_mortality(esk1_0,esk2_0)=very_low),inference(cn,[status(thm)],[76,theory(equality)])).
% cnf(78,plain,(greater(X1,low)|~greater(X1,mod2)),inference(spm,[status(thm)],[24,29,theory(equality)])).
% cnf(79,plain,(greater(X1,very_low)|~greater(X1,low)),inference(spm,[status(thm)],[24,27,theory(equality)])).
% cnf(85,negated_conjecture,(epred1_2(esk1_0,X1)|has_immunity(esk1_0,X1)),inference(spm,[status(thm)],[33,59,theory(equality)])).
% cnf(87,plain,(hazard_of_mortality(X1,X2)=mod1|is_aligned(X1,X2)|hazard_of_mortality(X1,X2)=high|~epred1_2(X1,X2)),inference(spm,[status(thm)],[65,63,theory(equality)])).
% cnf(90,plain,(hazard_of_mortality(X1,X2)=low|hazard_of_mortality(X1,X2)=mod2|~epred1_2(X1,X2)|~is_aligned(X1,X2)),inference(spm,[status(thm)],[66,64,theory(equality)])).
% cnf(91,negated_conjecture,(~greater(hazard_of_mortality(esk1_0,esk3_0),very_low)),inference(rw,[status(thm)],[56,77,theory(equality)])).
% cnf(93,negated_conjecture,(epred1_2(esk1_0,esk3_0)),inference(spm,[status(thm)],[57,85,theory(equality)])).
% cnf(118,plain,(greater(high,low)),inference(spm,[status(thm)],[78,28,theory(equality)])).
% cnf(123,negated_conjecture,(~greater(hazard_of_mortality(esk1_0,esk3_0),low)),inference(spm,[status(thm)],[91,79,theory(equality)])).
% cnf(158,plain,(hazard_of_mortality(X1,X2)=mod2|hazard_of_mortality(X1,X2)=low|hazard_of_mortality(X1,X2)=high|hazard_of_mortality(X1,X2)=mod1|~epred1_2(X1,X2)),inference(spm,[status(thm)],[90,87,theory(equality)])).
% cnf(475,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=mod1|hazard_of_mortality(esk1_0,esk3_0)=high|hazard_of_mortality(esk1_0,esk3_0)=low|hazard_of_mortality(esk1_0,esk3_0)=mod2),inference(spm,[status(thm)],[158,93,theory(equality)])).
% cnf(2572,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=low|hazard_of_mortality(esk1_0,esk3_0)=high|hazard_of_mortality(esk1_0,esk3_0)=mod1|~greater(mod2,low)),inference(spm,[status(thm)],[123,475,theory(equality)])).
% cnf(2598,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=low|hazard_of_mortality(esk1_0,esk3_0)=high|hazard_of_mortality(esk1_0,esk3_0)=mod1|$false),inference(rw,[status(thm)],[2572,29,theory(equality)])).
% cnf(2599,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=low|hazard_of_mortality(esk1_0,esk3_0)=high|hazard_of_mortality(esk1_0,esk3_0)=mod1),inference(cn,[status(thm)],[2598,theory(equality)])).
% cnf(2610,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=high|hazard_of_mortality(esk1_0,esk3_0)=low|~greater(mod1,low)),inference(spm,[status(thm)],[123,2599,theory(equality)])).
% cnf(2636,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=high|hazard_of_mortality(esk1_0,esk3_0)=low|$false),inference(rw,[status(thm)],[2610,26,theory(equality)])).
% cnf(2637,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=high|hazard_of_mortality(esk1_0,esk3_0)=low),inference(cn,[status(thm)],[2636,theory(equality)])).
% cnf(2647,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=low|~greater(high,low)),inference(spm,[status(thm)],[123,2637,theory(equality)])).
% cnf(2674,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=low|$false),inference(rw,[status(thm)],[2647,118,theory(equality)])).
% cnf(2675,negated_conjecture,(hazard_of_mortality(esk1_0,esk3_0)=low),inference(cn,[status(thm)],[2674,theory(equality)])).
% cnf(2751,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[91,2675,theory(equality)]),27,theory(equality)])).
% cnf(2752,negated_conjecture,($false),inference(cn,[status(thm)],[2751,theory(equality)])).
% cnf(2753,negated_conjecture,($false),2752,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 501
% # ...of these trivial : 0
% # ...subsumed : 311
% # ...remaining for further processing: 190
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 33
% # Generated clauses : 1902
% # ...of the previous two non-trivial : 1458
% # Contextual simplify-reflections : 133
% # Paramodulations : 1874
% # Factorizations : 26
% # Equation resolutions : 2
% # Current number of processed clauses: 125
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 102
% # Current number of unprocessed clauses: 661
% # ...number of literals in the above : 3241
% # Clause-clause subsumption calls (NU) : 2939
% # Rec. Clause-clause subsumption calls : 2508
% # Unit Clause-clause subsumption calls : 128
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 56 leaves, 1.25+/-0.634 terms/leaf
% # Paramod-from index: 30 leaves, 1.30+/-0.640 terms/leaf
% # Paramod-into index: 53 leaves, 1.25+/-0.546 terms/leaf
% # -------------------------------------------------
% # User time : 0.076 s
% # System time : 0.005 s
% # Total time : 0.081 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP10063/MGT060+1.tptp
%
%------------------------------------------------------------------------------