%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU149+3 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n032.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 1.87s 1.09s % Output : Proof 2.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.10 % Problem : SEU149+3 : TPTP v8.1.0. Released v3.2.0. % 0.09/0.10 % Command : ePrincess-casc -timeout=%d %s % 0.10/0.30 % Computer : n032.cluster.edu % 0.10/0.30 % Model : x86_64 x86_64 % 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.30 % Memory : 8042.1875MB % 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.30 % CPULimit : 300 % 0.10/0.30 % WCLimit : 600 % 0.10/0.30 % DateTime : Mon Jun 20 07:04:48 EDT 2022 % 0.10/0.30 % CPUTime : % 0.16/0.51 ____ _ % 0.16/0.51 ___ / __ \_____(_)___ ________ __________ % 0.16/0.51 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.16/0.51 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.16/0.51 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.16/0.51 % 0.16/0.51 A Theorem Prover for First-Order Logic % 0.16/0.52 (ePrincess v.1.0) % 0.16/0.52 % 0.16/0.52 (c) Philipp Rümmer, 2009-2015 % 0.16/0.52 (c) Peter Backeman, 2014-2015 % 0.16/0.52 (contributions by Angelo Brillout, Peter Baumgartner) % 0.16/0.52 Free software under GNU Lesser General Public License (LGPL). % 0.16/0.52 Bug reports to peter@backeman.se % 0.16/0.52 % 0.16/0.52 For more information, visit http://user.uu.se/~petba168/breu/ % 0.16/0.52 % 0.51/0.52 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.54/0.56 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.09/0.79 Prover 0: Preprocessing ... % 1.43/0.96 Prover 0: Warning: ignoring some quantifiers % 1.43/0.97 Prover 0: Constructing countermodel ... % 1.87/1.08 Prover 0: proved (520ms) % 1.87/1.09 % 1.87/1.09 No countermodel exists, formula is valid % 1.87/1.09 % SZS status Theorem for theBenchmark % 1.87/1.09 % 1.87/1.09 Generating proof ... Warning: ignoring some quantifiers % 2.34/1.23 found it (size 6) % 2.34/1.23 % 2.34/1.23 % SZS output start Proof for theBenchmark % 2.34/1.23 Assumed formulas after preprocessing and simplification: % 2.34/1.23 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ( ~ (v1 = v0) & singleton(v0) = v3 & unordered_pair(v1, v2) = v3 & empty(v5) & ~ empty(v4) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : (v9 = v7 | v9 = v6 | ~ (unordered_pair(v6, v7) = v8) | ~ in(v9, v8)) & ! [v6] : ! [v7] : ! [v8] : ! [v9] : (v7 = v6 | ~ (unordered_pair(v9, v8) = v7) | ~ (unordered_pair(v9, v8) = v6)) & ? [v6] : ! [v7] : ! [v8] : ! [v9] : (v9 = v6 | ~ (unordered_pair(v7, v8) = v9) | ? [v10] : ((v10 = v8 | v10 = v7 | in(v10, v6)) & ( ~ in(v10, v6) | ( ~ (v10 = v8) & ~ (v10 = v7))))) & ! [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] : ( ~ (unordered_pair(v7, v6) = v8) | unordered_pair(v6, v7) = v8) & ! [v6] : ! [v7] : ! [v8] : ( ~ (unordered_pair(v6, v7) = v8) | unordered_pair(v7, v6) = v8) & ! [v6] : ! [v7] : ! [v8] : ( ~ (unordered_pair(v6, v7) = v8) | in(v7, v8)) & ! [v6] : ! [v7] : ! [v8] : ( ~ (unordered_pair(v6, v7) = v8) | in(v6, v8)) & ? [v6] : ! [v7] : ! [v8] : (v8 = v6 | ~ (singleton(v7) = v8) | ? [v9] : (( ~ (v9 = v7) | ~ in(v7, v6)) & (v9 = v7 | in(v9, v6)))) & ! [v6] : ! [v7] : ( ~ (singleton(v6) = v7) | in(v6, v7)) & ! [v6] : ! [v7] : ( ~ in(v7, v6) | ~ in(v6, v7))) % 2.34/1.26 | 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.34/1.26 | (1) ~ (all_0_4_4 = all_0_5_5) & singleton(all_0_5_5) = all_0_2_2 & unordered_pair(all_0_4_4, all_0_3_3) = all_0_2_2 & empty(all_0_0_0) & ~ empty(all_0_1_1) & ! [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.34/1.27 | % 2.34/1.27 | Applying alpha-rule on (1) yields: % 2.34/1.27 | (2) ! [v0] : ! [v1] : ( ~ (singleton(v0) = v1) | in(v0, v1)) % 2.34/1.27 | (3) ? [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v1) = v2) | ? [v3] : (( ~ (v3 = v1) | ~ in(v1, v0)) & (v3 = v1 | in(v3, v0)))) % 2.34/1.27 | (4) empty(all_0_0_0) % 2.34/1.27 | (5) ! [v0] : ! [v1] : ! [v2] : (v2 = v0 | ~ (singleton(v0) = v1) | ~ in(v2, v1)) % 2.34/1.27 | (6) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 2.34/1.27 | (7) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v0, v2)) % 2.34/1.27 | (8) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) % 2.34/1.27 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v3 = v1 | v3 = v0 | ~ (unordered_pair(v0, v1) = v2) | ~ in(v3, v2)) % 2.34/1.27 | (10) ~ (all_0_4_4 = all_0_5_5) % 2.34/1.27 | (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.34/1.27 | (12) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2) % 2.34/1.27 | (13) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2) % 2.34/1.27 | (14) singleton(all_0_5_5) = all_0_2_2 % 2.34/1.28 | (15) unordered_pair(all_0_4_4, all_0_3_3) = all_0_2_2 % 2.34/1.28 | (16) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | in(v1, v2)) % 2.34/1.28 | (17) ~ empty(all_0_1_1) % 2.34/1.28 | (18) ! [v0] : ! [v1] : ( ~ in(v1, v0) | ~ in(v0, v1)) % 2.34/1.28 | % 2.49/1.28 | Instantiating formula (7) with all_0_2_2, all_0_3_3, all_0_4_4 and discharging atoms unordered_pair(all_0_4_4, all_0_3_3) = all_0_2_2, yields: % 2.49/1.28 | (19) in(all_0_4_4, all_0_2_2) % 2.49/1.28 | % 2.49/1.28 | Instantiating formula (5) with all_0_4_4, all_0_2_2, all_0_5_5 and discharging atoms singleton(all_0_5_5) = all_0_2_2, in(all_0_4_4, all_0_2_2), yields: % 2.49/1.28 | (20) all_0_4_4 = all_0_5_5 % 2.49/1.28 | % 2.49/1.28 | Equations (20) can reduce 10 to: % 2.49/1.28 | (21) $false % 2.49/1.28 | % 2.49/1.28 |-The branch is then unsatisfiable % 2.49/1.28 % SZS output end Proof for theBenchmark % 2.49/1.28 % 2.49/1.28 753ms %------------------------------------------------------------------------------