%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET877+1 : 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 00:22:52 EDT 2022 % Result : Theorem 2.03s 1.17s % Output : Proof 2.72s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SET877+1 : TPTP v8.1.0. Released v3.2.0. % 0.03/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 Jul 10 19:55:57 EDT 2022 % 0.12/0.33 % CPUTime : % 0.55/0.58 ____ _ % 0.55/0.58 ___ / __ \_____(_)___ ________ __________ % 0.55/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.55/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.55/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.55/0.58 % 0.55/0.58 A Theorem Prover for First-Order Logic % 0.55/0.58 (ePrincess v.1.0) % 0.55/0.58 % 0.55/0.58 (c) Philipp Rümmer, 2009-2015 % 0.55/0.58 (c) Peter Backeman, 2014-2015 % 0.55/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.55/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.55/0.58 Bug reports to peter@backeman.se % 0.55/0.58 % 0.55/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.55/0.58 % 0.55/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.55/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.30/0.89 Prover 0: Preprocessing ... % 1.67/1.04 Prover 0: Warning: ignoring some quantifiers % 1.67/1.05 Prover 0: Constructing countermodel ... % 2.03/1.17 Prover 0: proved (538ms) % 2.03/1.17 % 2.03/1.17 No countermodel exists, formula is valid % 2.03/1.17 % SZS status Theorem for theBenchmark % 2.03/1.17 % 2.03/1.17 Generating proof ... Warning: ignoring some quantifiers % 2.63/1.36 found it (size 7) % 2.63/1.36 % 2.63/1.36 % SZS output start Proof for theBenchmark % 2.63/1.36 Assumed formulas after preprocessing and simplification: % 2.63/1.36 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ( ~ (v1 = v0) & singleton(v1) = v3 & singleton(v0) = v2 & set_intersection2(v2, v3) = v2 & empty(v5) & ~ empty(v4) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : (v7 = v6 | ~ (set_intersection2(v9, v8) = v7) | ~ (set_intersection2(v9, v8) = v6)) & ! [v6] : ! [v7] : ! [v8] : (v8 = v6 | ~ (singleton(v6) = v7) | ~ in(v8, v7)) & ! [v6] : ! [v7] : ! [v8] : (v7 = v6 | ~ (singleton(v8) = v7) | ~ (singleton(v8) = v6)) & ! [v6] : ! [v7] : ! [v8] : ( ~ (singleton(v7) = v8) | ~ (set_intersection2(v6, v8) = v8) | in(v7, v6)) & ! [v6] : ! [v7] : ! [v8] : ( ~ (set_intersection2(v7, v6) = v8) | set_intersection2(v6, v7) = v8) & ! [v6] : ! [v7] : ! [v8] : ( ~ (set_intersection2(v6, v7) = v8) | set_intersection2(v7, v6) = v8) & ? [v6] : ! [v7] : ! [v8] : (v8 = v6 | ~ (singleton(v7) = v8) | ? [v9] : (( ~ (v9 = v7) | ~ in(v7, v6)) & (v9 = v7 | in(v9, v6)))) & ! [v6] : ! [v7] : (v7 = v6 | ~ (set_intersection2(v6, v6) = v7)) & ! [v6] : ! [v7] : ( ~ (singleton(v6) = v7) | in(v6, v7)) & ! [v6] : ! [v7] : ( ~ in(v7, v6) | ~ in(v6, v7))) % 2.72/1.39 | 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.72/1.39 | (1) ~ (all_0_4_4 = all_0_5_5) & singleton(all_0_4_4) = all_0_2_2 & singleton(all_0_5_5) = all_0_3_3 & set_intersection2(all_0_3_3, all_0_2_2) = all_0_3_3 & empty(all_0_0_0) & ~ empty(all_0_1_1) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) & ! [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] : ( ~ (singleton(v1) = v2) | ~ (set_intersection2(v0, v2) = v2) | in(v1, v0)) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v1, v0) = v2) | set_intersection2(v0, v1) = v2) & ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2) & ? [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v1) = v2) | ? [v3] : (( ~ (v3 = v1) | ~ in(v1, v0)) & (v3 = v1 | in(v3, v0)))) & ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1)) & ! [v0] : ! [v1] : ( ~ (singleton(v0) = v1) | in(v0, v1)) & ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.72/1.40 | % 2.72/1.40 | Applying alpha-rule on (1) yields: % 2.72/1.40 | (2) ! [v0] : ! [v1] : ( ~ (singleton(v0) = v1) | in(v0, v1)) % 2.72/1.40 | (3) singleton(all_0_4_4) = all_0_2_2 % 2.72/1.40 | (4) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.72/1.40 | (5) ? [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v1) = v2) | ? [v3] : (( ~ (v3 = v1) | ~ in(v1, v0)) & (v3 = v1 | in(v3, v0)))) % 2.72/1.40 | (6) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v0, v1) = v2) | set_intersection2(v1, v0) = v2) % 2.72/1.40 | (7) ! [v0] : ! [v1] : ! [v2] : ( ~ (set_intersection2(v1, v0) = v2) | set_intersection2(v0, v1) = v2) % 2.72/1.40 | (8) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 2.72/1.40 | (9) empty(all_0_0_0) % 2.72/1.40 | (10) ! [v0] : ! [v1] : ! [v2] : ( ~ (singleton(v1) = v2) | ~ (set_intersection2(v0, v2) = v2) | in(v1, v0)) % 2.72/1.40 | (11) set_intersection2(all_0_3_3, all_0_2_2) = all_0_3_3 % 2.72/1.40 | (12) singleton(all_0_5_5) = all_0_3_3 % 2.72/1.40 | (13) ~ empty(all_0_1_1) % 2.72/1.40 | (14) ! [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v0) = v1) | ~ in(v2, v1)) % 2.72/1.40 | (15) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (set_intersection2(v3, v2) = v1) | ~ (set_intersection2(v3, v2) = v0)) % 2.72/1.40 | (16) ~ (all_0_4_4 = all_0_5_5) % 2.72/1.40 | (17) ! [v0] : ! [v1] : (v1 = v0 | ~ (set_intersection2(v0, v0) = v1)) % 2.72/1.40 | % 2.72/1.41 | Instantiating formula (7) with all_0_3_3, all_0_3_3, all_0_2_2 and discharging atoms set_intersection2(all_0_3_3, all_0_2_2) = all_0_3_3, yields: % 2.72/1.41 | (18) set_intersection2(all_0_2_2, all_0_3_3) = all_0_3_3 % 2.72/1.41 | % 2.72/1.41 | Instantiating formula (10) with all_0_3_3, all_0_5_5, all_0_2_2 and discharging atoms singleton(all_0_5_5) = all_0_3_3, set_intersection2(all_0_2_2, all_0_3_3) = all_0_3_3, yields: % 2.72/1.41 | (19) in(all_0_5_5, all_0_2_2) % 2.72/1.41 | % 2.72/1.41 | Instantiating formula (14) with all_0_5_5, all_0_2_2, all_0_4_4 and discharging atoms singleton(all_0_4_4) = all_0_2_2, in(all_0_5_5, all_0_2_2), yields: % 2.72/1.41 | (20) all_0_4_4 = all_0_5_5 % 2.72/1.41 | % 2.72/1.41 | Equations (20) can reduce 16 to: % 2.72/1.41 | (21) $false % 2.72/1.41 | % 2.72/1.41 |-The branch is then unsatisfiable % 2.72/1.41 % SZS output end Proof for theBenchmark % 2.72/1.41 % 2.72/1.41 822ms %------------------------------------------------------------------------------