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

View Problem - Process Solution

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

% Computer : n025.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:56 EDT 2022

% Result   : Theorem 1.79s 1.14s
% Output   : Proof 2.60s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : MGT008+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13  % Command  : ePrincess-casc -timeout=%d %s
% 0.14/0.34  % Computer : n025.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jun  9 07:29:50 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.60/0.59          ____       _                          
% 0.60/0.59    ___  / __ \_____(_)___  ________  __________
% 0.60/0.59   / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.60/0.59  /  __/ ____/ /  / / / / / /__/  __(__  |__  ) 
% 0.60/0.59  \___/_/   /_/  /_/_/ /_/\___/\___/____/____/  
% 0.60/0.59  
% 0.60/0.59  A Theorem Prover for First-Order Logic
% 0.60/0.59  (ePrincess v.1.0)
% 0.60/0.59  
% 0.60/0.59  (c) Philipp Rümmer, 2009-2015
% 0.60/0.59  (c) Peter Backeman, 2014-2015
% 0.60/0.59  (contributions by Angelo Brillout, Peter Baumgartner)
% 0.60/0.59  Free software under GNU Lesser General Public License (LGPL).
% 0.60/0.59  Bug reports to peter@backeman.se
% 0.60/0.59  
% 0.60/0.59  For more information, visit http://user.uu.se/~petba168/breu/
% 0.60/0.59  
% 0.60/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.74/0.64  Prover 0: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.39/0.93  Prover 0: Preprocessing ...
% 1.66/1.03  Prover 0: Constructing countermodel ...
% 1.79/1.14  Prover 0: proved (498ms)
% 1.79/1.14  
% 1.79/1.14  No countermodel exists, formula is valid
% 1.79/1.14  % SZS status Theorem for theBenchmark
% 1.79/1.14  
% 1.79/1.14  Generating proof ... found it (size 9)
% 2.60/1.32  
% 2.60/1.32  % SZS output start Proof for theBenchmark
% 2.60/1.32  Assumed formulas after preprocessing and simplification: 
% 2.60/1.32  | (0)  ? [v0] :  ? [v1] :  ? [v2] :  ? [v3] :  ? [v4] :  ? [v5] :  ? [v6] :  ? [v7] :  ? [v8] : (survival_chance(v1, v4, v8) & survival_chance(v0, v3, v7) & reorganization_free(v1, v8, v8) & reorganization_free(v0, v7, v7) & greater(v6, v5) & size(v1, v6, v8) & size(v0, v5, v7) & class(v1, v2, v8) & class(v0, v2, v7) & organization(v1, v8) & organization(v0, v7) &  ~ greater(v4, v3) &  ! [v9] :  ! [v10] :  ! [v11] :  ! [v12] :  ! [v13] :  ! [v14] :  ! [v15] :  ! [v16] :  ! [v17] : ( ~ greater(v13, v12) |  ~ size(v10, v13, v17) |  ~ size(v9, v12, v16) |  ~ class(v10, v11, v17) |  ~ class(v9, v11, v16) |  ~ inertia(v10, v15, v17) |  ~ inertia(v9, v14, v16) |  ~ organization(v10, v17) |  ~ organization(v9, v16) | greater(v15, v14)) &  ! [v9] :  ! [v10] :  ! [v11] :  ! [v12] :  ! [v13] :  ! [v14] :  ! [v15] :  ! [v16] : ( ~ survival_chance(v10, v16, v12) |  ~ survival_chance(v9, v15, v11) |  ~ reorganization_free(v10, v12, v12) |  ~ reorganization_free(v9, v11, v11) |  ~ greater(v14, v13) |  ~ inertia(v10, v14, v12) |  ~ inertia(v9, v13, v11) |  ~ organization(v10, v12) |  ~ organization(v9, v11) | greater(v16, v15)) &  ! [v9] :  ! [v10] : ( ~ organization(v9, v10) |  ? [v11] : inertia(v9, v11, v10)))
% 2.60/1.33  | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5, all_0_6_6, all_0_7_7, all_0_8_8 yields:
% 2.60/1.33  | (1) survival_chance(all_0_7_7, all_0_4_4, all_0_0_0) & survival_chance(all_0_8_8, all_0_5_5, all_0_1_1) & reorganization_free(all_0_7_7, all_0_0_0, all_0_0_0) & reorganization_free(all_0_8_8, all_0_1_1, all_0_1_1) & greater(all_0_2_2, all_0_3_3) & size(all_0_7_7, all_0_2_2, all_0_0_0) & size(all_0_8_8, all_0_3_3, all_0_1_1) & class(all_0_7_7, all_0_6_6, all_0_0_0) & class(all_0_8_8, all_0_6_6, all_0_1_1) & organization(all_0_7_7, all_0_0_0) & organization(all_0_8_8, all_0_1_1) &  ~ greater(all_0_4_4, all_0_5_5) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] :  ! [v5] :  ! [v6] :  ! [v7] :  ! [v8] : ( ~ greater(v4, v3) |  ~ size(v1, v4, v8) |  ~ size(v0, v3, v7) |  ~ class(v1, v2, v8) |  ~ class(v0, v2, v7) |  ~ inertia(v1, v6, v8) |  ~ inertia(v0, v5, v7) |  ~ organization(v1, v8) |  ~ organization(v0, v7) | greater(v6, v5)) &  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] :  ! [v5] :  ! [v6] :  ! [v7] : ( ~ survival_chance(v1, v7, v3) |  ~ survival_chance(v0, v6, v2) |  ~ reorganization_free(v1, v3, v3) |  ~ reorganization_free(v0, v2, v2) |  ~ greater(v5, v4) |  ~ inertia(v1, v5, v3) |  ~ inertia(v0, v4, v2) |  ~ organization(v1, v3) |  ~ organization(v0, v2) | greater(v7, v6)) &  ! [v0] :  ! [v1] : ( ~ organization(v0, v1) |  ? [v2] : inertia(v0, v2, v1))
% 2.60/1.34  |
% 2.60/1.34  | Applying alpha-rule on (1) yields:
% 2.60/1.34  | (2)  ! [v0] :  ! [v1] : ( ~ organization(v0, v1) |  ? [v2] : inertia(v0, v2, v1))
% 2.60/1.34  | (3) reorganization_free(all_0_7_7, all_0_0_0, all_0_0_0)
% 2.60/1.34  | (4) survival_chance(all_0_8_8, all_0_5_5, all_0_1_1)
% 2.60/1.34  | (5) class(all_0_7_7, all_0_6_6, all_0_0_0)
% 2.60/1.34  | (6) reorganization_free(all_0_8_8, all_0_1_1, all_0_1_1)
% 2.60/1.34  | (7) survival_chance(all_0_7_7, all_0_4_4, all_0_0_0)
% 2.60/1.34  | (8) organization(all_0_8_8, all_0_1_1)
% 2.60/1.34  | (9) size(all_0_8_8, all_0_3_3, all_0_1_1)
% 2.60/1.34  | (10) organization(all_0_7_7, all_0_0_0)
% 2.60/1.34  | (11) size(all_0_7_7, all_0_2_2, all_0_0_0)
% 2.60/1.34  | (12) class(all_0_8_8, all_0_6_6, all_0_1_1)
% 2.60/1.34  | (13) greater(all_0_2_2, all_0_3_3)
% 2.60/1.34  | (14)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] :  ! [v5] :  ! [v6] :  ! [v7] : ( ~ survival_chance(v1, v7, v3) |  ~ survival_chance(v0, v6, v2) |  ~ reorganization_free(v1, v3, v3) |  ~ reorganization_free(v0, v2, v2) |  ~ greater(v5, v4) |  ~ inertia(v1, v5, v3) |  ~ inertia(v0, v4, v2) |  ~ organization(v1, v3) |  ~ organization(v0, v2) | greater(v7, v6))
% 2.60/1.34  | (15)  ! [v0] :  ! [v1] :  ! [v2] :  ! [v3] :  ! [v4] :  ! [v5] :  ! [v6] :  ! [v7] :  ! [v8] : ( ~ greater(v4, v3) |  ~ size(v1, v4, v8) |  ~ size(v0, v3, v7) |  ~ class(v1, v2, v8) |  ~ class(v0, v2, v7) |  ~ inertia(v1, v6, v8) |  ~ inertia(v0, v5, v7) |  ~ organization(v1, v8) |  ~ organization(v0, v7) | greater(v6, v5))
% 2.60/1.34  | (16)  ~ greater(all_0_4_4, all_0_5_5)
% 2.60/1.34  |
% 2.60/1.34  | Instantiating formula (2) with all_0_0_0, all_0_7_7 and discharging atoms organization(all_0_7_7, all_0_0_0), yields:
% 2.60/1.34  | (17)  ? [v0] : inertia(all_0_7_7, v0, all_0_0_0)
% 2.60/1.34  |
% 2.60/1.34  | Instantiating formula (2) with all_0_1_1, all_0_8_8 and discharging atoms organization(all_0_8_8, all_0_1_1), yields:
% 2.60/1.34  | (18)  ? [v0] : inertia(all_0_8_8, v0, all_0_1_1)
% 2.60/1.34  |
% 2.60/1.34  | Instantiating (18) with all_8_0_9 yields:
% 2.60/1.34  | (19) inertia(all_0_8_8, all_8_0_9, all_0_1_1)
% 2.60/1.34  |
% 2.60/1.34  | Instantiating (17) with all_10_0_10 yields:
% 2.60/1.34  | (20) inertia(all_0_7_7, all_10_0_10, all_0_0_0)
% 2.60/1.34  |
% 2.60/1.35  | Instantiating formula (15) with all_0_0_0, all_0_1_1, all_10_0_10, all_8_0_9, all_0_2_2, all_0_3_3, all_0_6_6, all_0_7_7, all_0_8_8 and discharging atoms greater(all_0_2_2, all_0_3_3), size(all_0_7_7, all_0_2_2, all_0_0_0), size(all_0_8_8, all_0_3_3, all_0_1_1), class(all_0_7_7, all_0_6_6, all_0_0_0), class(all_0_8_8, all_0_6_6, all_0_1_1), inertia(all_0_7_7, all_10_0_10, all_0_0_0), inertia(all_0_8_8, all_8_0_9, all_0_1_1), organization(all_0_7_7, all_0_0_0), organization(all_0_8_8, all_0_1_1), yields:
% 2.60/1.35  | (21) greater(all_10_0_10, all_8_0_9)
% 2.60/1.35  |
% 2.60/1.35  | Instantiating formula (14) with all_0_4_4, all_0_5_5, all_10_0_10, all_8_0_9, all_0_0_0, all_0_1_1, all_0_7_7, all_0_8_8 and discharging atoms survival_chance(all_0_7_7, all_0_4_4, all_0_0_0), survival_chance(all_0_8_8, all_0_5_5, all_0_1_1), reorganization_free(all_0_7_7, all_0_0_0, all_0_0_0), reorganization_free(all_0_8_8, all_0_1_1, all_0_1_1), greater(all_10_0_10, all_8_0_9), inertia(all_0_7_7, all_10_0_10, all_0_0_0), inertia(all_0_8_8, all_8_0_9, all_0_1_1), organization(all_0_7_7, all_0_0_0), organization(all_0_8_8, all_0_1_1),  ~ greater(all_0_4_4, all_0_5_5), yields:
% 2.60/1.35  | (22) $false
% 2.60/1.35  |
% 2.60/1.35  |-The branch is then unsatisfiable
% 2.60/1.35  % SZS output end Proof for theBenchmark
% 2.60/1.35  
% 2.60/1.35  750ms
%------------------------------------------------------------------------------