TSTP Solution File: MGT003+1 by ePrincess---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ePrincess---1.0
% Problem  : MGT003+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : ePrincess-casc -timeout=%d %s

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sun Jul 17 22:06:54 EDT 2022

% Result   : Theorem 1.92s 1.07s
% Output   : Proof 2.58s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : MGT003+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12  % Command  : ePrincess-casc -timeout=%d %s
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun  9 09:24:53 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.51/0.57          ____       _                          
% 0.51/0.57    ___  / __ \_____(_)___  ________  __________
% 0.51/0.57   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.51/0.57  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.51/0.57  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.51/0.57  
% 0.51/0.57  A Theorem Prover for First-Order Logic
% 0.51/0.57  (ePrincess v.1.0)
% 0.51/0.57  
% 0.51/0.57  (c) Philipp Rümmer, 2009-2015
% 0.51/0.57  (c) Peter Backeman, 2014-2015
% 0.51/0.57  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.51/0.57  Free software under GNU Lesser General Public License (LGPL).
% 0.51/0.57  Bug reports to peter@backeman.se
% 0.51/0.57  
% 0.51/0.57  For more information, visit http://user.uu.se/~petba168/breu/
% 0.51/0.57  
% 0.51/0.57  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.51/0.62  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.40/0.87  Prover 0: Preprocessing ...
% 1.59/0.97  Prover 0: Constructing countermodel ...
% 1.92/1.07  Prover 0: proved (454ms)
% 1.92/1.07  
% 1.92/1.07  No countermodel exists, formula is valid
% 1.92/1.07  % SZS status Theorem for theBenchmark
% 1.92/1.07  
% 1.92/1.07  Generating proof ... found it (size 11)
% 2.36/1.23  
% 2.36/1.23  % SZS output start Proof for theBenchmark
% 2.36/1.23  Assumed formulas after preprocessing and simplification: 
% 2.36/1.23  | (0)  ? [v0] :  ? [v1] :  ? [v2] :  ? [v3] :  ? [v4] : (greater(v4, v3) & survival_chance(v0, v2, v4) & survival_chance(v0, v1, v3) & organization(v0, v4) & organization(v0, v3) & reorganization_free(v0, v3, v4) &  ~ greater(v2, v1) &  ! [v5] :  ! [v6] :  ! [v7] :  ! [v8] :  ! [v9] :  ! [v10] :  ! [v11] :  ! [v12] : ( ~ greater(v10, v9) |  ~ survival_chance(v6, v12, v8) |  ~ survival_chance(v5, v11, v7) |  ~ inertia(v6, v10, v8) |  ~ inertia(v5, v9, v7) |  ~ organization(v6, v8) |  ~ organization(v5, v7) |  ~ reorganization_free(v6, v8, v8) |  ~ reorganization_free(v5, v7, v7) | greater(v12, v11)) &  ! [v5] :  ! [v6] :  ! [v7] :  ! [v8] :  ! [v9] : ( ~ greater(v9, v8) |  ~ inertia(v5, v7, v9) |  ~ inertia(v5, v6, v8) |  ~ organization(v5, v9) |  ~ organization(v5, v8) |  ~ reorganization_free(v5, v8, v9) | greater(v7, v6)) &  ! [v5] :  ! [v6] :  ! [v7] : ( ~ reorganization_free(v5, v6, v7) | reorganization_free(v5, v7, v7)) &  ! [v5] :  ! [v6] :  ! [v7] : ( ~ reorganization_free(v5, v6, v7) | reorganization_free(v5, v6, v6)) &  ! [v5] :  ! [v6] : ( ~ organization(v5, v6) |  ? [v7] : inertia(v5, v7, v6)))
% 2.58/1.24  | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4 yields:
% 2.58/1.24  | (1) greater(all_0_0_0, all_0_1_1) & survival_chance(all_0_4_4, all_0_2_2, all_0_0_0) & survival_chance(all_0_4_4, all_0_3_3, all_0_1_1) & organization(all_0_4_4, all_0_0_0) & organization(all_0_4_4, all_0_1_1) & reorganization_free(all_0_4_4, all_0_1_1, all_0_0_0) &  ~ greater(all_0_2_2, all_0_3_3) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] :  ! [v5] :  ! [v6] :  ! [v7] : ( ~ greater(v5, v4) |  ~ survival_chance(v1, v7, v3) |  ~ survival_chance(v0, v6, v2) |  ~ inertia(v1, v5, v3) |  ~ inertia(v0, v4, v2) |  ~ organization(v1, v3) |  ~ organization(v0, v2) |  ~ reorganization_free(v1, v3, v3) |  ~ reorganization_free(v0, v2, v2) | greater(v7, v6)) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] : ( ~ greater(v4, v3) |  ~ inertia(v0, v2, v4) |  ~ inertia(v0, v1, v3) |  ~ organization(v0, v4) |  ~ organization(v0, v3) |  ~ reorganization_free(v0, v3, v4) | greater(v2, v1)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, v2, v2)) &  ! [v0] :  ! [v1] :  ! [v2] : ( ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, v1, v1)) &  ! [v0] :  ! [v1] : ( ~ organization(v0, v1) |  ? [v2] : inertia(v0, v2, v1))
% 2.58/1.25  |
% 2.58/1.25  | Applying alpha-rule on (1) yields:
% 2.58/1.25  | (2)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] : ( ~ greater(v4, v3) |  ~ inertia(v0, v2, v4) |  ~ inertia(v0, v1, v3) |  ~ organization(v0, v4) |  ~ organization(v0, v3) |  ~ reorganization_free(v0, v3, v4) | greater(v2, v1))
% 2.58/1.25  | (3) organization(all_0_4_4, all_0_0_0)
% 2.58/1.25  | (4)  ! [v0] :  ! [v1] : ( ~ organization(v0, v1) |  ? [v2] : inertia(v0, v2, v1))
% 2.58/1.25  | (5)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] :  ! [v5] :  ! [v6] :  ! [v7] : ( ~ greater(v5, v4) |  ~ survival_chance(v1, v7, v3) |  ~ survival_chance(v0, v6, v2) |  ~ inertia(v1, v5, v3) |  ~ inertia(v0, v4, v2) |  ~ organization(v1, v3) |  ~ organization(v0, v2) |  ~ reorganization_free(v1, v3, v3) |  ~ reorganization_free(v0, v2, v2) | greater(v7, v6))
% 2.58/1.25  | (6) survival_chance(all_0_4_4, all_0_2_2, all_0_0_0)
% 2.58/1.25  | (7) reorganization_free(all_0_4_4, all_0_1_1, all_0_0_0)
% 2.58/1.25  | (8) survival_chance(all_0_4_4, all_0_3_3, all_0_1_1)
% 2.58/1.25  | (9) greater(all_0_0_0, all_0_1_1)
% 2.58/1.25  | (10)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, v1, v1))
% 2.58/1.26  | (11)  ! [v0] :  ! [v1] :  ! [v2] : ( ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, v2, v2))
% 2.58/1.26  | (12)  ~ greater(all_0_2_2, all_0_3_3)
% 2.58/1.26  | (13) organization(all_0_4_4, all_0_1_1)
% 2.58/1.26  |
% 2.58/1.26  | Instantiating formula (4) with all_0_0_0, all_0_4_4 and discharging atoms organization(all_0_4_4, all_0_0_0), yields:
% 2.58/1.26  | (14)  ? [v0] : inertia(all_0_4_4, v0, all_0_0_0)
% 2.58/1.26  |
% 2.58/1.26  | Instantiating formula (4) with all_0_1_1, all_0_4_4 and discharging atoms organization(all_0_4_4, all_0_1_1), yields:
% 2.58/1.26  | (15)  ? [v0] : inertia(all_0_4_4, v0, all_0_1_1)
% 2.58/1.26  |
% 2.58/1.26  | Instantiating formula (11) with all_0_0_0, all_0_1_1, all_0_4_4 and discharging atoms reorganization_free(all_0_4_4, all_0_1_1, all_0_0_0), yields:
% 2.58/1.26  | (16) reorganization_free(all_0_4_4, all_0_0_0, all_0_0_0)
% 2.58/1.26  |
% 2.58/1.26  | Instantiating formula (10) with all_0_0_0, all_0_1_1, all_0_4_4 and discharging atoms reorganization_free(all_0_4_4, all_0_1_1, all_0_0_0), yields:
% 2.58/1.26  | (17) reorganization_free(all_0_4_4, all_0_1_1, all_0_1_1)
% 2.58/1.26  |
% 2.58/1.26  | Instantiating (15) with all_9_0_5 yields:
% 2.58/1.26  | (18) inertia(all_0_4_4, all_9_0_5, all_0_1_1)
% 2.58/1.26  |
% 2.58/1.26  | Instantiating (14) with all_11_0_6 yields:
% 2.58/1.26  | (19) inertia(all_0_4_4, all_11_0_6, all_0_0_0)
% 2.58/1.26  |
% 2.58/1.26  | Instantiating formula (2) with all_0_0_0, all_0_1_1, all_11_0_6, all_9_0_5, all_0_4_4 and discharging atoms greater(all_0_0_0, all_0_1_1), inertia(all_0_4_4, all_11_0_6, all_0_0_0), inertia(all_0_4_4, all_9_0_5, all_0_1_1), organization(all_0_4_4, all_0_0_0), organization(all_0_4_4, all_0_1_1), reorganization_free(all_0_4_4, all_0_1_1, all_0_0_0), yields:
% 2.58/1.26  | (20) greater(all_11_0_6, all_9_0_5)
% 2.58/1.26  |
% 2.58/1.26  | Instantiating formula (5) with all_0_2_2, all_0_3_3, all_11_0_6, all_9_0_5, all_0_0_0, all_0_1_1, all_0_4_4, all_0_4_4 and discharging atoms greater(all_11_0_6, all_9_0_5), survival_chance(all_0_4_4, all_0_2_2, all_0_0_0), survival_chance(all_0_4_4, all_0_3_3, all_0_1_1), inertia(all_0_4_4, all_11_0_6, all_0_0_0), inertia(all_0_4_4, all_9_0_5, all_0_1_1), organization(all_0_4_4, all_0_0_0), organization(all_0_4_4, all_0_1_1), reorganization_free(all_0_4_4, all_0_0_0, all_0_0_0), reorganization_free(all_0_4_4, all_0_1_1, all_0_1_1),  ~ greater(all_0_2_2, all_0_3_3), yields:
% 2.58/1.26  | (21) $false
% 2.58/1.26  |
% 2.58/1.26  |-The branch is then unsatisfiable
% 2.58/1.26  % SZS output end Proof for theBenchmark
% 2.58/1.26  
% 2.58/1.26  682ms
%------------------------------------------------------------------------------