TSTP Solution File: SET899+1 by ePrincess---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ePrincess---1.0
% Problem : SET899+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : ePrincess-casc -timeout=%d %s
% Computer : n005.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 00:23:00 EDT 2022
% Result : Theorem 1.80s 1.08s
% Output : Proof 2.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET899+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : ePrincess-casc -timeout=%d %s
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 9 23:42:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.61/0.59 ____ _
% 0.61/0.59 ___ / __ \_____(_)___ ________ __________
% 0.61/0.59 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/
% 0.61/0.59 / __/ ____/ / / / / / / /__/ __(__ |__ )
% 0.61/0.59 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/
% 0.61/0.59
% 0.61/0.59 A Theorem Prover for First-Order Logic
% 0.61/0.59 (ePrincess v.1.0)
% 0.61/0.59
% 0.61/0.59 (c) Philipp Rümmer, 2009-2015
% 0.61/0.59 (c) Peter Backeman, 2014-2015
% 0.61/0.59 (contributions by Angelo Brillout, Peter Baumgartner)
% 0.61/0.59 Free software under GNU Lesser General Public License (LGPL).
% 0.61/0.59 Bug reports to peter@backeman.se
% 0.61/0.59
% 0.61/0.59 For more information, visit http://user.uu.se/~petba168/breu/
% 0.61/0.59
% 0.61/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.77/0.64 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all
% 1.32/0.90 Prover 0: Preprocessing ...
% 1.47/0.99 Prover 0: Warning: ignoring some quantifiers
% 1.47/1.00 Prover 0: Constructing countermodel ...
% 1.80/1.08 Prover 0: proved (444ms)
% 1.80/1.08
% 1.80/1.08 No countermodel exists, formula is valid
% 1.80/1.08 % SZS status Theorem for theBenchmark
% 1.80/1.08
% 1.80/1.08 Generating proof ... Warning: ignoring some quantifiers
% 2.20/1.20 found it (size 4)
% 2.20/1.20
% 2.20/1.20 % SZS output start Proof for theBenchmark
% 2.20/1.20 Assumed formulas after preprocessing and simplification:
% 2.20/1.20 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : (singleton(v2) = v3 & set_difference(v1, v3) = v4 & empty(v6) & subset(v0, v1) & ~ empty(v5) & ~ in(v2, v0) & ~ subset(v0, v4) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : ! [v11] : ( ~ (singleton(v9) = v10) | ~ (set_difference(v8, v10) = v11) | ~ subset(v7, v8) | in(v9, v7) | subset(v7, v11)) & ! [v7] : ! [v8] : ! [v9] : ! [v10] : (v8 = v7 | ~ (set_difference(v10, v9) = v8) | ~ (set_difference(v10, v9) = v7)) & ! [v7] : ! [v8] : ! [v9] : (v8 = v7 | ~ (singleton(v9) = v8) | ~ (singleton(v9) = v7)) & ! [v7] : ! [v8] : ( ~ in(v8, v7) | ~ in(v7, v8)) & ? [v7] : subset(v7, v7))
% 2.34/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, all_0_5_5, all_0_6_6 yields:
% 2.34/1.24 | (1) singleton(all_0_4_4) = all_0_3_3 & set_difference(all_0_5_5, all_0_3_3) = all_0_2_2 & empty(all_0_0_0) & subset(all_0_6_6, all_0_5_5) & ~ empty(all_0_1_1) & ~ in(all_0_4_4, all_0_6_6) & ~ subset(all_0_6_6, all_0_2_2) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (singleton(v2) = v3) | ~ (set_difference(v1, v3) = v4) | ~ subset(v0, v1) | in(v2, v0) | subset(v0, v4)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_difference(v3, v2) = v1) | ~ (set_difference(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) & ? [v0] : subset(v0, v0)
% 2.34/1.25 |
% 2.34/1.25 | Applying alpha-rule on (1) yields:
% 2.34/1.25 | (2) set_difference(all_0_5_5, all_0_3_3) = all_0_2_2
% 2.34/1.25 | (3) ? [v0] : subset(v0, v0)
% 2.34/1.25 | (4) subset(all_0_6_6, all_0_5_5)
% 2.34/1.25 | (5) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_difference(v3, v2) = v1) | ~ (set_difference(v3, v2) = v0))
% 2.34/1.25 | (6) singleton(all_0_4_4) = all_0_3_3
% 2.34/1.25 | (7) ~ subset(all_0_6_6, all_0_2_2)
% 2.34/1.25 | (8) ~ empty(all_0_1_1)
% 2.34/1.25 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ (singleton(v2) = v3) | ~ (set_difference(v1, v3) = v4) | ~ subset(v0, v1) | in(v2, v0) | subset(v0, v4))
% 2.34/1.25 | (10) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0))
% 2.34/1.25 | (11) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1))
% 2.34/1.25 | (12) empty(all_0_0_0)
% 2.34/1.25 | (13) ~ in(all_0_4_4, all_0_6_6)
% 2.34/1.25 |
% 2.34/1.25 | Instantiating formula (9) with all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5, all_0_6_6 and discharging atoms singleton(all_0_4_4) = all_0_3_3, set_difference(all_0_5_5, all_0_3_3) = all_0_2_2, subset(all_0_6_6, all_0_5_5), ~ in(all_0_4_4, all_0_6_6), ~ subset(all_0_6_6, all_0_2_2), yields:
% 2.34/1.26 | (14) $false
% 2.34/1.26 |
% 2.34/1.26 |-The branch is then unsatisfiable
% 2.34/1.26 % SZS output end Proof for theBenchmark
% 2.34/1.26
% 2.34/1.26 659ms
%------------------------------------------------------------------------------