%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET904+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n008.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:02 EDT 2022 % Result : Theorem 1.89s 1.08s % Output : Proof 2.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SET904+1 : TPTP v8.1.0. Released v3.2.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.11/0.33 % Computer : n008.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Sun Jul 10 07:40:23 EDT 2022 % 0.11/0.33 % CPUTime : % 0.54/0.58 ____ _ % 0.54/0.58 ___ / __ \_____(_)___ ________ __________ % 0.54/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.54/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.54/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.54/0.58 % 0.54/0.58 A Theorem Prover for First-Order Logic % 0.54/0.58 (ePrincess v.1.0) % 0.54/0.58 % 0.54/0.58 (c) Philipp Rümmer, 2009-2015 % 0.54/0.58 (c) Peter Backeman, 2014-2015 % 0.54/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.54/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.54/0.58 Bug reports to peter@backeman.se % 0.54/0.58 % 0.54/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.54/0.58 % 0.54/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.54/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.35/0.87 Prover 0: Preprocessing ... % 1.59/0.99 Prover 0: Warning: ignoring some quantifiers % 1.59/1.00 Prover 0: Constructing countermodel ... % 1.89/1.08 Prover 0: proved (450ms) % 1.89/1.08 % 1.89/1.08 No countermodel exists, formula is valid % 1.89/1.08 % SZS status Theorem for theBenchmark % 1.89/1.08 % 1.89/1.08 Generating proof ... Warning: ignoring some quantifiers % 2.47/1.23 found it (size 4) % 2.47/1.23 % 2.47/1.23 % SZS output start Proof for theBenchmark % 2.47/1.23 Assumed formulas after preprocessing and simplification: % 2.47/1.24 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : (singleton(v0) = v2 & set_union2(v2, v1) = v3 & subset(v3, v1) & empty(v5) & ~ in(v0, v1) & ~ empty(v4) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : (v7 = v6 | ~ (set_union2(v9, v8) = v7) | ~ (set_union2(v9, v8) = v6)) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : ( ~ (singleton(v6) = v8) | ~ (set_union2(v8, v7) = v9) | ~ subset(v9, v7) | in(v6, v7)) & ! [v6] : ! [v7] : ! [v8] : (v7 = v6 | ~ (singleton(v8) = v7) | ~ (singleton(v8) = v6)) & ! [v6] : ! [v7] : ! [v8] : ( ~ (set_union2(v7, v6) = v8) | ~ empty(v8) | empty(v6)) & ! [v6] : ! [v7] : ! [v8] : ( ~ (set_union2(v7, v6) = v8) | set_union2(v6, v7) = v8) & ! [v6] : ! [v7] : ! [v8] : ( ~ (set_union2(v6, v7) = v8) | ~ empty(v8) | empty(v6)) & ! [v6] : ! [v7] : ! [v8] : ( ~ (set_union2(v6, v7) = v8) | set_union2(v7, v6) = v8) & ! [v6] : ! [v7] : (v7 = v6 | ~ (set_union2(v6, v6) = v7)) & ! [v6] : ! [v7] : ( ~ in(v7, v6) | ~ in(v6, v7)) & ? [v6] : subset(v6, v6)) % 2.50/1.27 | 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 yields: % 2.50/1.27 | (1) singleton(all_0_5_5) = all_0_3_3 & set_union2(all_0_3_3, all_0_4_4) = all_0_2_2 & subset(all_0_2_2, all_0_4_4) & empty(all_0_0_0) & ~ in(all_0_5_5, all_0_4_4) & ~ empty(all_0_1_1) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_union2(v3, v2) = v1) | ~ (set_union2(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (singleton(v0) = v2) | ~ (set_union2(v2, v1) = v3) | ~ subset(v3, v1) | in(v0, v1)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v1, v0) = v2) | ~ empty(v2) | empty(v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v1, v0) = v2) | set_union2(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | ~ empty(v2) | empty(v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | set_union2(v1, v0) = v2) & ! [v0] : ! [v1] : (v1 = v0 | ~ (set_union2(v0, v0) = v1)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) & ? [v0] : subset(v0, v0) % 2.50/1.28 | % 2.50/1.28 | Applying alpha-rule on (1) yields: % 2.50/1.28 | (2) empty(all_0_0_0) % 2.50/1.28 | (3) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.50/1.28 | (4) ~ empty(all_0_1_1) % 2.50/1.28 | (5) singleton(all_0_5_5) = all_0_3_3 % 2.50/1.28 | (6) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_union2(v0, v0) = v1)) % 2.50/1.28 | (7) set_union2(all_0_3_3, all_0_4_4) = all_0_2_2 % 2.50/1.28 | (8) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_union2(v3, v2) = v1) | ~ (set_union2(v3, v2) = v0)) % 2.50/1.28 | (9) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | set_union2(v1, v0) = v2) % 2.50/1.28 | (10) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v1, v0) = v2) | set_union2(v0, v1) = v2) % 2.50/1.28 | (11) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ (singleton(v0) = v2) | ~ (set_union2(v2, v1) = v3) | ~ subset(v3, v1) | in(v0, v1)) % 2.50/1.28 | (12) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v0, v1) = v2) | ~ empty(v2) | empty(v0)) % 2.50/1.28 | (13) subset(all_0_2_2, all_0_4_4) % 2.50/1.28 | (14) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_union2(v1, v0) = v2) | ~ empty(v2) | empty(v0)) % 2.50/1.29 | (15) ~ in(all_0_5_5, all_0_4_4) % 2.50/1.29 | (16) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 2.50/1.29 | (17) ? [v0] : subset(v0, v0) % 2.50/1.29 | % 2.50/1.29 | Instantiating formula (11) with all_0_2_2, all_0_3_3, all_0_4_4, all_0_5_5 and discharging atoms singleton(all_0_5_5) = all_0_3_3, set_union2(all_0_3_3, all_0_4_4) = all_0_2_2, subset(all_0_2_2, all_0_4_4), ~ in(all_0_5_5, all_0_4_4), yields: % 2.50/1.29 | (18) $false % 2.50/1.29 | % 2.50/1.29 |-The branch is then unsatisfiable % 2.50/1.29 % SZS output end Proof for theBenchmark % 2.50/1.29 % 2.50/1.29 696ms %------------------------------------------------------------------------------