TSTP Solution File: MGT014+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n024.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:58 EDT 2022
% Result : Theorem 2.25s 1.14s
% Output : Proof 2.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : MGT014+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.33 % Computer : n024.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 11:21:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.52/0.58 ____ _
% 0.52/0.58 ___ / __ \_____(_)___ ________ __________
% 0.52/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.52/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.52/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.52/0.58
% 0.52/0.59 A Theorem Prover for First-Order Logic
% 0.52/0.59 (ePrincess v.1.0)
% 0.52/0.59
% 0.52/0.59 (c) Philipp Rümmer, 2009-2015
% 0.52/0.59 (c) Peter Backeman, 2014-2015
% 0.52/0.59 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.52/0.59 Free software under GNU Lesser General Public License (LGPL).
% 0.52/0.59 Bug reports to peter@backeman.se
% 0.52/0.59
% 0.52/0.59 For more information, visit http://user.uu.se/~petba168/breu/
% 0.52/0.59
% 0.52/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.77/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.45/0.89 Prover 0: Preprocessing ...
% 1.73/1.01 Prover 0: Constructing countermodel ...
% 2.25/1.14 Prover 0: proved (506ms)
% 2.25/1.14
% 2.25/1.14 No countermodel exists, formula is valid
% 2.25/1.14 % SZS status Theorem for theBenchmark
% 2.25/1.14
% 2.25/1.14 Generating proof ... found it (size 18)
% 2.66/1.30
% 2.66/1.30 % SZS output start Proof for theBenchmark
% 2.66/1.30 Assumed formulas after preprocessing and simplification:
% 2.66/1.30 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : (complexity(v0, v2, v6) & complexity(v0, v1, v5) & size(v0, v4, v6) & size(v0, v3, v5) & reorganization_free(v0, v5, v6) & organization(v0, v6) & organization(v0, v5) & greater(v4, v3) & greater(v1, v2) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ! [v11] : ( ~ complexity(v7, v9, v11) | ~ complexity(v7, v8, v10) | ~ reorganization_free(v7, v10, v11) | ~ organization(v7, v11) | ~ organization(v7, v10) | ~ greater(v11, v10) | ~ greater(v8, v9)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ! [v11] : ( ~ size(v7, v9, v11) | ~ size(v7, v8, v10) | ~ reorganization_free(v7, v10, v11) | ~ organization(v7, v11) | ~ organization(v7, v10) | ~ greater(v11, v10) | ~ greater(v8, v9)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v9 = v8 | ~ size(v7, v9, v10) | ~ size(v7, v8, v10) | ~ organization(v7, v10)) & ! [v7] : ! [v8] : ! [v9] : ( ~ reorganization_free(v7, v8, v9) | reorganization_free(v7, v9, v8)) & ! [v7] : ! [v8] : (v8 = v7 | ~ time(v8) | ~ time(v7) | greater(v8, v7) | greater(v7, v8)) & ! [v7] : ! [v8] : ( ~ organization(v7, v8) | time(v8)) & ! [v7] : ! [v8] : ( ~ greater(v8, v7) | ~ greater(v7, v8)) & ! [v7] : ~ greater(v7, v7))
% 2.66/1.31 | 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 yields:
% 2.66/1.31 | (1) complexity(all_0_6_6, all_0_4_4, all_0_0_0) & complexity(all_0_6_6, all_0_5_5, all_0_1_1) & size(all_0_6_6, all_0_2_2, all_0_0_0) & size(all_0_6_6, all_0_3_3, all_0_1_1) & reorganization_free(all_0_6_6, all_0_1_1, all_0_0_0) & organization(all_0_6_6, all_0_0_0) & organization(all_0_6_6, all_0_1_1) & greater(all_0_2_2, all_0_3_3) & greater(all_0_5_5, all_0_4_4) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ complexity(v0, v2, v4) | ~ complexity(v0, v1, v3) | ~ reorganization_free(v0, v3, v4) | ~ organization(v0, v4) | ~ organization(v0, v3) | ~ greater(v4, v3) | ~ greater(v1, v2)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ size(v0, v2, v4) | ~ size(v0, v1, v3) | ~ reorganization_free(v0, v3, v4) | ~ organization(v0, v4) | ~ organization(v0, v3) | ~ greater(v4, v3) | ~ greater(v1, v2)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v2 = v1 | ~ size(v0, v2, v3) | ~ size(v0, v1, v3) | ~ organization(v0, v3)) & ! [v0] : ! [v1] : ! [v2] : ( ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, v2, v1)) & ! [v0] : ! [v1] : (v1 = v0 | ~ time(v1) | ~ time(v0) | greater(v1, v0) | greater(v0, v1)) & ! [v0] : ! [v1] : ( ~ organization(v0, v1) | time(v1)) & ! [v0] : ! [v1] : ( ~ greater(v1, v0) | ~ greater(v0, v1)) & ! [v0] : ~ greater(v0, v0)
% 2.66/1.31 |
% 2.66/1.31 | Applying alpha-rule on (1) yields:
% 2.66/1.32 | (2) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ size(v0, v2, v4) | ~ size(v0, v1, v3) | ~ reorganization_free(v0, v3, v4) | ~ organization(v0, v4) | ~ organization(v0, v3) | ~ greater(v4, v3) | ~ greater(v1, v2))
% 2.66/1.32 | (3) size(all_0_6_6, all_0_2_2, all_0_0_0)
% 2.66/1.32 | (4) complexity(all_0_6_6, all_0_4_4, all_0_0_0)
% 2.66/1.32 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ reorganization_free(v0, v1, v2) | reorganization_free(v0, v2, v1))
% 2.66/1.32 | (6) greater(all_0_2_2, all_0_3_3)
% 2.66/1.32 | (7) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v2 = v1 | ~ size(v0, v2, v3) | ~ size(v0, v1, v3) | ~ organization(v0, v3))
% 2.66/1.32 | (8) greater(all_0_5_5, all_0_4_4)
% 2.66/1.32 | (9) ! [v0] : ~ greater(v0, v0)
% 2.66/1.32 | (10) complexity(all_0_6_6, all_0_5_5, all_0_1_1)
% 2.66/1.32 | (11) organization(all_0_6_6, all_0_1_1)
% 2.66/1.32 | (12) size(all_0_6_6, all_0_3_3, all_0_1_1)
% 2.66/1.32 | (13) reorganization_free(all_0_6_6, all_0_1_1, all_0_0_0)
% 2.66/1.32 | (14) ! [v0] : ! [v1] : ( ~ organization(v0, v1) | time(v1))
% 2.66/1.32 | (15) ! [v0] : ! [v1] : (v1 = v0 | ~ time(v1) | ~ time(v0) | greater(v1, v0) | greater(v0, v1))
% 2.66/1.32 | (16) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ complexity(v0, v2, v4) | ~ complexity(v0, v1, v3) | ~ reorganization_free(v0, v3, v4) | ~ organization(v0, v4) | ~ organization(v0, v3) | ~ greater(v4, v3) | ~ greater(v1, v2))
% 2.66/1.32 | (17) ! [v0] : ! [v1] : ( ~ greater(v1, v0) | ~ greater(v0, v1))
% 2.66/1.32 | (18) organization(all_0_6_6, all_0_0_0)
% 2.66/1.32 |
% 2.66/1.32 | Instantiating formula (5) with all_0_0_0, all_0_1_1, all_0_6_6 and discharging atoms reorganization_free(all_0_6_6, all_0_1_1, all_0_0_0), yields:
% 2.66/1.32 | (19) reorganization_free(all_0_6_6, all_0_0_0, all_0_1_1)
% 2.66/1.32 |
% 2.66/1.32 | Instantiating formula (14) with all_0_0_0, all_0_6_6 and discharging atoms organization(all_0_6_6, all_0_0_0), yields:
% 2.66/1.32 | (20) time(all_0_0_0)
% 2.66/1.32 |
% 2.66/1.32 | Instantiating formula (14) with all_0_1_1, all_0_6_6 and discharging atoms organization(all_0_6_6, all_0_1_1), yields:
% 2.66/1.32 | (21) time(all_0_1_1)
% 2.66/1.32 |
% 2.66/1.32 | Instantiating formula (15) with all_0_1_1, all_0_0_0 and discharging atoms time(all_0_0_0), time(all_0_1_1), yields:
% 2.66/1.32 | (22) all_0_0_0 = all_0_1_1 | greater(all_0_0_0, all_0_1_1) | greater(all_0_1_1, all_0_0_0)
% 2.91/1.32 |
% 2.91/1.32 +-Applying beta-rule and splitting (22), into two cases.
% 2.91/1.32 |-Branch one:
% 2.91/1.32 | (23) greater(all_0_0_0, all_0_1_1)
% 2.91/1.32 |
% 2.91/1.32 | Instantiating formula (16) with all_0_0_0, all_0_1_1, all_0_4_4, all_0_5_5, all_0_6_6 and discharging atoms complexity(all_0_6_6, all_0_4_4, all_0_0_0), complexity(all_0_6_6, all_0_5_5, all_0_1_1), reorganization_free(all_0_6_6, all_0_1_1, all_0_0_0), organization(all_0_6_6, all_0_0_0), organization(all_0_6_6, all_0_1_1), greater(all_0_0_0, all_0_1_1), greater(all_0_5_5, all_0_4_4), yields:
% 2.91/1.33 | (24) $false
% 2.91/1.33 |
% 2.91/1.33 |-The branch is then unsatisfiable
% 2.91/1.33 |-Branch two:
% 2.91/1.33 | (25) ~ greater(all_0_0_0, all_0_1_1)
% 2.91/1.33 | (26) all_0_0_0 = all_0_1_1 | greater(all_0_1_1, all_0_0_0)
% 2.91/1.33 |
% 2.91/1.33 +-Applying beta-rule and splitting (26), into two cases.
% 2.91/1.33 |-Branch one:
% 2.91/1.33 | (27) greater(all_0_1_1, all_0_0_0)
% 2.91/1.33 |
% 2.91/1.33 | Instantiating formula (2) with all_0_1_1, all_0_0_0, all_0_3_3, all_0_2_2, all_0_6_6 and discharging atoms size(all_0_6_6, all_0_2_2, all_0_0_0), size(all_0_6_6, all_0_3_3, all_0_1_1), reorganization_free(all_0_6_6, all_0_0_0, all_0_1_1), organization(all_0_6_6, all_0_0_0), organization(all_0_6_6, all_0_1_1), greater(all_0_1_1, all_0_0_0), greater(all_0_2_2, all_0_3_3), yields:
% 2.91/1.33 | (24) $false
% 2.91/1.33 |
% 2.91/1.33 |-The branch is then unsatisfiable
% 2.91/1.33 |-Branch two:
% 2.91/1.33 | (29) ~ greater(all_0_1_1, all_0_0_0)
% 2.91/1.33 | (30) all_0_0_0 = all_0_1_1
% 2.91/1.33 |
% 2.91/1.33 | From (30) and (3) follows:
% 2.91/1.33 | (31) size(all_0_6_6, all_0_2_2, all_0_1_1)
% 2.91/1.33 |
% 2.91/1.33 | From (30) and (18) follows:
% 2.91/1.33 | (11) organization(all_0_6_6, all_0_1_1)
% 2.91/1.33 |
% 2.91/1.33 | Instantiating formula (7) with all_0_1_1, all_0_2_2, all_0_3_3, all_0_6_6 and discharging atoms size(all_0_6_6, all_0_2_2, all_0_1_1), size(all_0_6_6, all_0_3_3, all_0_1_1), organization(all_0_6_6, all_0_1_1), yields:
% 2.91/1.33 | (33) all_0_2_2 = all_0_3_3
% 2.91/1.33 |
% 2.91/1.33 | From (33) and (6) follows:
% 2.91/1.33 | (34) greater(all_0_3_3, all_0_3_3)
% 2.91/1.33 |
% 2.91/1.33 | Instantiating formula (17) with all_0_3_3, all_0_3_3 and discharging atoms greater(all_0_3_3, all_0_3_3), yields:
% 2.91/1.33 | (24) $false
% 2.91/1.33 |
% 2.91/1.33 |-The branch is then unsatisfiable
% 2.91/1.33 % SZS output end Proof for theBenchmark
% 2.91/1.33
% 2.91/1.33 736ms
%------------------------------------------------------------------------------