%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU143+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n016.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:46:55 EDT 2022 % Result : Theorem 1.78s 1.11s % Output : Proof 2.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SEU143+1 : TPTP v8.1.0. Released v3.3.0. % 0.07/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n016.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 09:54:10 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.58 A Theorem Prover for First-Order Logic % 0.52/0.58 (ePrincess v.1.0) % 0.52/0.58 % 0.52/0.58 (c) Philipp Rümmer, 2009-2015 % 0.52/0.58 (c) Peter Backeman, 2014-2015 % 0.52/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.52/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.52/0.58 Bug reports to peter@backeman.se % 0.52/0.58 % 0.52/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.52/0.58 % 0.52/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.52/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.28/0.89 Prover 0: Preprocessing ... % 1.54/1.01 Prover 0: Warning: ignoring some quantifiers % 1.54/1.02 Prover 0: Constructing countermodel ... % 1.78/1.11 Prover 0: proved (475ms) % 1.78/1.11 % 1.78/1.11 No countermodel exists, formula is valid % 1.78/1.11 % SZS status Theorem for theBenchmark % 1.78/1.11 % 1.78/1.11 Generating proof ... Warning: ignoring some quantifiers % 2.38/1.25 found it (size 5) % 2.38/1.25 % 2.38/1.25 % SZS output start Proof for theBenchmark % 2.38/1.25 Assumed formulas after preprocessing and simplification: % 2.38/1.25 | (0) ? [v0] : ? [v1] : ? [v2] : (singleton(v0) = empty_set & empty(v2) & empty(empty_set) & ~ empty(v1) & ! [v3] : ! [v4] : ! [v5] : (v5 = v3 | ~ (singleton(v3) = v4) | ~ in(v5, v4)) & ! [v3] : ! [v4] : ! [v5] : (v4 = v3 | ~ (singleton(v5) = v4) | ~ (singleton(v5) = v3)) & ? [v3] : ! [v4] : ! [v5] : (v5 = v3 | ~ (singleton(v4) = v5) | ? [v6] : (( ~ (v6 = v4) | ~ in(v4, v3)) & (v6 = v4 | in(v6, v3)))) & ! [v3] : ! [v4] : ( ~ (singleton(v3) = v4) | in(v3, v4)) & ! [v3] : ! [v4] : ( ~ in(v4, v3) | ~ in(v3, v4)) & ! [v3] : ~ in(v3, empty_set) & ? [v3] : (v3 = empty_set | ? [v4] : in(v4, v3))) % 2.42/1.29 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2 yields: % 2.42/1.29 | (1) singleton(all_0_2_2) = empty_set & empty(all_0_0_0) & empty(empty_set) & ~ empty(all_0_1_1) & ! [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] : (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)) & ! [v0] : ~ in(v0, empty_set) & ? [v0] : (v0 = empty_set | ? [v1] : in(v1, v0)) % 2.42/1.29 | % 2.42/1.29 | Applying alpha-rule on (1) yields: % 2.42/1.29 | (2) singleton(all_0_2_2) = empty_set % 2.42/1.30 | (3) empty(all_0_0_0) % 2.42/1.30 | (4) ! [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v0) = v1) | ~ in(v2, v1)) % 2.42/1.30 | (5) ~ empty(all_0_1_1) % 2.42/1.30 | (6) ! [v0] : ! [v1] : ( ~ (singleton(v0) = v1) | in(v0, v1)) % 2.42/1.30 | (7) ? [v0] : (v0 = empty_set | ? [v1] : in(v1, v0)) % 2.42/1.30 | (8) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.42/1.30 | (9) ? [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v1) = v2) | ? [v3] : (( ~ (v3 = v1) | ~ in(v1, v0)) & (v3 = v1 | in(v3, v0)))) % 2.42/1.30 | (10) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 2.42/1.30 | (11) empty(empty_set) % 2.42/1.30 | (12) ! [v0] : ~ in(v0, empty_set) % 2.42/1.30 | % 2.42/1.30 | Instantiating formula (6) with empty_set, all_0_2_2 and discharging atoms singleton(all_0_2_2) = empty_set, yields: % 2.42/1.30 | (13) in(all_0_2_2, empty_set) % 2.42/1.30 | % 2.42/1.30 | Instantiating formula (12) with all_0_2_2 and discharging atoms in(all_0_2_2, empty_set), yields: % 2.42/1.30 | (14) $false % 2.42/1.30 | % 2.42/1.30 |-The branch is then unsatisfiable % 2.42/1.30 % SZS output end Proof for theBenchmark % 2.42/1.30 % 2.42/1.30 710ms %------------------------------------------------------------------------------