TSTP Solution File: SEU151+3 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SEU151+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n028.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 : Tue Jul 19 08:47:02 EDT 2022
% Result : Theorem 1.85s 1.12s
% Output : Proof 2.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU151+3 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.33 % Computer : n028.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 : Sun Jun 19 22:30:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.57 ____ _
% 0.18/0.57 ___ / __ \_____(_)___ ________ __________
% 0.18/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.18/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.18/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.18/0.57
% 0.18/0.57 A Theorem Prover for First-Order Logic
% 0.18/0.58 (ePrincess v.1.0)
% 0.18/0.58
% 0.18/0.58 (c) Philipp Rümmer, 2009-2015
% 0.18/0.58 (c) Peter Backeman, 2014-2015
% 0.18/0.58 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.18/0.58 Free software under GNU Lesser General Public License (LGPL).
% 0.18/0.58 Bug reports to peter@backeman.se
% 0.18/0.58
% 0.18/0.58 For more information, visit http://user.uu.se/~petba168/breu/
% 0.18/0.58
% 0.18/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.75/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.32/0.87 Prover 0: Preprocessing ...
% 1.63/1.00 Prover 0: Warning: ignoring some quantifiers
% 1.63/1.02 Prover 0: Constructing countermodel ...
% 1.85/1.12 Prover 0: proved (490ms)
% 1.85/1.12
% 1.85/1.12 No countermodel exists, formula is valid
% 1.85/1.12 % SZS status Theorem for theBenchmark
% 1.85/1.12
% 1.85/1.12 Generating proof ... Warning: ignoring some quantifiers
% 2.49/1.29 found it (size 10)
% 2.49/1.29
% 2.49/1.29 % SZS output start Proof for theBenchmark
% 2.49/1.29 Assumed formulas after preprocessing and simplification:
% 2.49/1.30 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ( ~ (v3 = v0) & ~ (v2 = v0) & unordered_pair(v2, v3) = v4 & unordered_pair(v0, v1) = v4 & empty(v6) & ~ empty(v5) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v10 = v8 | v10 = v7 | ~ (unordered_pair(v7, v8) = v9) | ~ in(v10, v9)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (unordered_pair(v10, v9) = v8) | ~ (unordered_pair(v10, v9) = v7)) & ? [v7] : ! [v8] : ! [v9] : ! [v10] : (v10 = v7 | ~ (unordered_pair(v8, v9) = v10) | ? [v11] : ((v11 = v9 | v11 = v8 | in(v11, v7)) & ( ~ in(v11, v7) | ( ~ (v11 = v9) & ~ (v11 = v8))))) & ! [v7] : ! [v8] : ! [v9] : ( ~ (unordered_pair(v8, v7) = v9) | unordered_pair(v7, v8) = v9) & ! [v7] : ! [v8] : ! [v9] : ( ~ (unordered_pair(v7, v8) = v9) | unordered_pair(v8, v7) = v9) & ! [v7] : ! [v8] : ! [v9] : ( ~ (unordered_pair(v7, v8) = v9) | in(v8, v9)) & ! [v7] : ! [v8] : ! [v9] : ( ~ (unordered_pair(v7, v8) = v9) | in(v7, v9)) & ! [v7] : ! [v8] : ( ~ in(v8, v7) | ~ in(v7, v8)))
% 2.49/1.32 | 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.49/1.32 | (1) ~ (all_0_3_3 = all_0_6_6) & ~ (all_0_4_4 = all_0_6_6) & unordered_pair(all_0_4_4, all_0_3_3) = all_0_2_2 & unordered_pair(all_0_6_6, all_0_5_5) = all_0_2_2 & empty(all_0_0_0) & ~ empty(all_0_1_1) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v1 | v3 = v0 | ~ (unordered_pair(v0, v1) = v2) | ~ in(v3, v2)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (unordered_pair(v1, v2) = v3) | ? [v4] : ((v4 = v2 | v4 = v1 | in(v4, v0)) & ( ~ in(v4, v0) | ( ~ (v4 = v2) & ~ (v4 = v1))))) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v1, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v0, v2)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1))
% 2.49/1.33 |
% 2.49/1.33 | Applying alpha-rule on (1) yields:
% 2.49/1.33 | (2) ~ (all_0_3_3 = all_0_6_6)
% 2.49/1.33 | (3) empty(all_0_0_0)
% 2.49/1.33 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v1 | v3 = v0 | ~ (unordered_pair(v0, v1) = v2) | ~ in(v3, v2))
% 2.78/1.33 | (5) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1))
% 2.78/1.33 | (6) ~ (all_0_4_4 = all_0_6_6)
% 2.78/1.33 | (7) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2)
% 2.78/1.33 | (8) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2)
% 2.78/1.33 | (9) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v0, v2))
% 2.78/1.33 | (10) ~ empty(all_0_1_1)
% 2.78/1.33 | (11) unordered_pair(all_0_6_6, all_0_5_5) = all_0_2_2
% 2.78/1.33 | (12) unordered_pair(all_0_4_4, all_0_3_3) = all_0_2_2
% 2.78/1.33 | (13) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v1, v2))
% 2.78/1.33 | (14) ? [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v0 | ~ (unordered_pair(v1, v2) = v3) | ? [v4] : ((v4 = v2 | v4 = v1 | in(v4, v0)) & ( ~ in(v4, v0) | ( ~ (v4 = v2) & ~ (v4 = v1)))))
% 2.78/1.34 | (15) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0))
% 2.78/1.34 |
% 2.78/1.34 | Instantiating formula (8) with all_0_2_2, all_0_4_4, all_0_3_3 and discharging atoms unordered_pair(all_0_4_4, all_0_3_3) = all_0_2_2, yields:
% 2.78/1.34 | (16) unordered_pair(all_0_3_3, all_0_4_4) = all_0_2_2
% 2.78/1.34 |
% 2.78/1.34 | Instantiating formula (9) with all_0_2_2, all_0_5_5, all_0_6_6 and discharging atoms unordered_pair(all_0_6_6, all_0_5_5) = all_0_2_2, yields:
% 2.78/1.34 | (17) in(all_0_6_6, all_0_2_2)
% 2.78/1.34 |
% 2.78/1.34 | Instantiating formula (4) with all_0_6_6, all_0_2_2, all_0_4_4, all_0_3_3 and discharging atoms unordered_pair(all_0_3_3, all_0_4_4) = all_0_2_2, in(all_0_6_6, all_0_2_2), yields:
% 2.78/1.34 | (18) all_0_3_3 = all_0_6_6 | all_0_4_4 = all_0_6_6
% 2.78/1.34 |
% 2.78/1.34 +-Applying beta-rule and splitting (18), into two cases.
% 2.78/1.34 |-Branch one:
% 2.78/1.34 | (19) all_0_3_3 = all_0_6_6
% 2.78/1.34 |
% 2.78/1.34 | Equations (19) can reduce 2 to:
% 2.78/1.34 | (20) $false
% 2.78/1.34 |
% 2.78/1.34 |-The branch is then unsatisfiable
% 2.78/1.34 |-Branch two:
% 2.78/1.34 | (2) ~ (all_0_3_3 = all_0_6_6)
% 2.78/1.34 | (22) all_0_4_4 = all_0_6_6
% 2.78/1.34 |
% 2.78/1.34 | Equations (22) can reduce 6 to:
% 2.78/1.34 | (20) $false
% 2.78/1.34 |
% 2.78/1.34 |-The branch is then unsatisfiable
% 2.78/1.34 % SZS output end Proof for theBenchmark
% 2.78/1.34
% 2.78/1.34 755ms
%------------------------------------------------------------------------------