TSTP Solution File: SEU149+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SEU149+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n017.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:00 EDT 2022
% Result : Theorem 2.08s 1.21s
% Output : Proof 2.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU149+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s
% 0.12/0.33 % Computer : n017.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 : Mon Jun 20 01:20:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.54/0.60 ____ _
% 0.54/0.61 ___ / __ \_____(_)___ ________ __________
% 0.54/0.61 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.54/0.61 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.54/0.61 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.54/0.61
% 0.54/0.61 A Theorem Prover for First-Order Logic
% 0.54/0.61 (ePrincess v.1.0)
% 0.54/0.61
% 0.54/0.61 (c) Philipp Rümmer, 2009-2015
% 0.54/0.61 (c) Peter Backeman, 2014-2015
% 0.54/0.61 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.54/0.61 Free software under GNU Lesser General Public License (LGPL).
% 0.54/0.61 Bug reports to peter@backeman.se
% 0.54/0.61
% 0.54/0.61 For more information, visit http://user.uu.se/~petba168/breu/
% 0.54/0.61
% 0.54/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.72/0.68 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.37/0.93 Prover 0: Preprocessing ...
% 1.74/1.10 Prover 0: Warning: ignoring some quantifiers
% 1.74/1.11 Prover 0: Constructing countermodel ...
% 2.08/1.21 Prover 0: proved (533ms)
% 2.08/1.21
% 2.08/1.21 No countermodel exists, formula is valid
% 2.08/1.21 % SZS status Theorem for theBenchmark
% 2.08/1.21
% 2.08/1.21 Generating proof ... Warning: ignoring some quantifiers
% 2.67/1.41 found it (size 6)
% 2.67/1.41
% 2.67/1.41 % SZS output start Proof for theBenchmark
% 2.67/1.41 Assumed formulas after preprocessing and simplification:
% 2.67/1.42 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ( ~ (v1 = v0) & singleton(v0) = v3 & unordered_pair(v1, v2) = v3 & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v7 = v5 | v7 = v4 | ~ (unordered_pair(v4, v5) = v6) | ~ in(v7, v6)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (unordered_pair(v7, v6) = v5) | ~ (unordered_pair(v7, v6) = v4)) & ? [v4] : ! [v5] : ! [v6] : ! [v7] : (v7 = v4 | ~ (unordered_pair(v5, v6) = v7) | ? [v8] : ((v8 = v6 | v8 = v5 | in(v8, v4)) & ( ~ in(v8, v4) | ( ~ (v8 = v6) & ~ (v8 = v5))))) & ! [v4] : ! [v5] : ! [v6] : (v6 = v4 | ~ (singleton(v4) = v5) | ~ in(v6, v5)) & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (singleton(v6) = v5) | ~ (singleton(v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ( ~ (unordered_pair(v5, v4) = v6) | unordered_pair(v4, v5) = v6) & ! [v4] : ! [v5] : ! [v6] : ( ~ (unordered_pair(v4, v5) = v6) | unordered_pair(v5, v4) = v6) & ! [v4] : ! [v5] : ! [v6] : ( ~ (unordered_pair(v4, v5) = v6) | in(v5, v6)) & ! [v4] : ! [v5] : ! [v6] : ( ~ (unordered_pair(v4, v5) = v6) | in(v4, v6)) & ? [v4] : ! [v5] : ! [v6] : (v6 = v4 | ~ (singleton(v5) = v6) | ? [v7] : (( ~ (v7 = v5) | ~ in(v5, v4)) & (v7 = v5 | in(v7, v4)))) & ! [v4] : ! [v5] : ( ~ (singleton(v4) = v5) | in(v4, v5)) & ! [v4] : ! [v5] : ( ~ in(v5, v4) | ~ in(v4, v5)))
% 2.67/1.45 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields:
% 2.67/1.45 | (1) ~ (all_0_2_2 = all_0_3_3) & singleton(all_0_3_3) = all_0_0_0 & unordered_pair(all_0_2_2, all_0_1_1) = all_0_0_0 & ! [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] : (v2 = v0 | ~ (singleton(v0) = v1) | ~ in(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ! [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] : ! [v2] : (v2 = v0 | ~ (singleton(v1) = v2) | ? [v3] : (( ~ (v3 = v1) | ~ in(v1, v0)) & (v3 = v1 | in(v3, v0)))) & ! [v0] : ! [v1] : ( ~ (singleton(v0) = v1) | in(v0, v1)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1))
% 2.67/1.46 |
% 2.67/1.46 | Applying alpha-rule on (1) yields:
% 2.67/1.46 | (2) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v1 | v3 = v0 | ~ (unordered_pair(v0, v1) = v2) | ~ in(v3, v2))
% 2.67/1.46 | (3) ! [v0] : ! [v1] : ( ~ (singleton(v0) = v1) | in(v0, v1))
% 2.67/1.46 | (4) ? [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v1) = v2) | ? [v3] : (( ~ (v3 = v1) | ~ in(v1, v0)) & (v3 = v1 | in(v3, v0))))
% 2.67/1.46 | (5) ~ (all_0_2_2 = all_0_3_3)
% 2.67/1.46 | (6) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v0, v2))
% 2.95/1.46 | (7) singleton(all_0_3_3) = all_0_0_0
% 2.95/1.46 | (8) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v1, v2))
% 2.95/1.46 | (9) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0))
% 2.95/1.46 | (10) unordered_pair(all_0_2_2, all_0_1_1) = all_0_0_0
% 2.95/1.46 | (11) ? [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.95/1.46 | (12) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2)
% 2.95/1.46 | (13) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2)
% 2.95/1.46 | (14) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1))
% 2.95/1.46 | (15) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0))
% 2.95/1.46 | (16) ! [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v0) = v1) | ~ in(v2, v1))
% 2.95/1.46 |
% 2.95/1.46 | Instantiating formula (6) with all_0_0_0, all_0_1_1, all_0_2_2 and discharging atoms unordered_pair(all_0_2_2, all_0_1_1) = all_0_0_0, yields:
% 2.95/1.46 | (17) in(all_0_2_2, all_0_0_0)
% 2.95/1.46 |
% 2.95/1.46 | Instantiating formula (16) with all_0_2_2, all_0_0_0, all_0_3_3 and discharging atoms singleton(all_0_3_3) = all_0_0_0, in(all_0_2_2, all_0_0_0), yields:
% 2.95/1.46 | (18) all_0_2_2 = all_0_3_3
% 2.95/1.46 |
% 2.95/1.46 | Equations (18) can reduce 5 to:
% 2.95/1.46 | (19) $false
% 2.95/1.46 |
% 2.95/1.47 |-The branch is then unsatisfiable
% 2.95/1.47 % SZS output end Proof for theBenchmark
% 2.95/1.47
% 2.95/1.47 842ms
%------------------------------------------------------------------------------