%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n026.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.59s 1.07s % Output : Proof 2.27s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SEU150+1 : TPTP v8.1.0. Released v3.3.0. % 0.04/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n026.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 Jun 19 11:58:55 EDT 2022 % 0.12/0.33 % CPUTime : % 0.57/0.57 ____ _ % 0.57/0.57 ___ / __ \_____(_)___ ________ __________ % 0.57/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.57/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.57/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.57/0.57 % 0.57/0.57 A Theorem Prover for First-Order Logic % 0.57/0.57 (ePrincess v.1.0) % 0.57/0.57 % 0.57/0.57 (c) Philipp Rümmer, 2009-2015 % 0.57/0.57 (c) Peter Backeman, 2014-2015 % 0.57/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.57/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.57/0.57 Bug reports to peter@backeman.se % 0.57/0.57 % 0.57/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.57/0.57 % 0.57/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.62/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.22/0.86 Prover 0: Preprocessing ... % 1.45/0.99 Prover 0: Constructing countermodel ... % 1.59/1.07 Prover 0: proved (453ms) % 1.59/1.07 % 1.59/1.07 No countermodel exists, formula is valid % 1.59/1.07 % SZS status Theorem for theBenchmark % 1.59/1.07 % 1.59/1.07 Generating proof ... found it (size 9) % 2.21/1.23 % 2.21/1.23 % SZS output start Proof for theBenchmark % 2.21/1.23 Assumed formulas after preprocessing and simplification: % 2.21/1.23 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ( ~ (v2 = v1) & singleton(v0) = v3 & unordered_pair(v1, v2) = v3 & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (singleton(v4) = v7) | ~ (unordered_pair(v5, v6) = v7)) & ! [v4] : ! [v5] : ! [v6] : ! [v7] : (v5 = v4 | ~ (unordered_pair(v7, v6) = v5) | ~ (unordered_pair(v7, v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : (v5 = v4 | ~ (singleton(v6) = v5) | ~ (singleton(v6) = v4)) & ! [v4] : ! [v5] : ! [v6] : ( ~ (unordered_pair(v5, v4) = v6) | unordered_pair(v4, v5) = v6) & ! [v4] : ! [v5] : ! [v6] : ( ~ (unordered_pair(v4, v5) = v6) | unordered_pair(v5, v4) = v6)) % 2.27/1.26 | Instantiating (0) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 yields: % 2.27/1.26 | (1) ~ (all_0_1_1 = all_0_2_2) & singleton(all_0_3_3) = all_0_0_0 & unordered_pair(all_0_2_2, all_0_1_1) = all_0_0_0 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (singleton(v0) = v3) | ~ (unordered_pair(v1, v2) = v3)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [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) % 2.27/1.27 | % 2.27/1.27 | Applying alpha-rule on (1) yields: % 2.27/1.27 | (2) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 2.27/1.27 | (3) singleton(all_0_3_3) = all_0_0_0 % 2.27/1.27 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) % 2.27/1.27 | (5) unordered_pair(all_0_2_2, all_0_1_1) = all_0_0_0 % 2.27/1.27 | (6) ~ (all_0_1_1 = all_0_2_2) % 2.27/1.27 | (7) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v0, v1) = v2) | unordered_pair(v1, v0) = v2) % 2.27/1.27 | (8) ! [v0] : ! [v1] : ! [v2] : ( ~ (unordered_pair(v1, v0) = v2) | unordered_pair(v0, v1) = v2) % 2.27/1.27 | (9) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (singleton(v0) = v3) | ~ (unordered_pair(v1, v2) = v3)) % 2.27/1.27 | % 2.27/1.27 | Instantiating formula (9) with all_0_0_0, all_0_1_1, all_0_2_2, all_0_3_3 and discharging atoms singleton(all_0_3_3) = all_0_0_0, unordered_pair(all_0_2_2, all_0_1_1) = all_0_0_0, yields: % 2.27/1.27 | (10) all_0_2_2 = all_0_3_3 % 2.27/1.27 | % 2.27/1.27 | Equations (10) can reduce 6 to: % 2.27/1.27 | (11) ~ (all_0_1_1 = all_0_3_3) % 2.27/1.27 | % 2.27/1.27 | From (10) and (5) follows: % 2.27/1.27 | (12) unordered_pair(all_0_3_3, all_0_1_1) = all_0_0_0 % 2.27/1.27 | % 2.27/1.27 | Instantiating formula (8) with all_0_0_0, all_0_3_3, all_0_1_1 and discharging atoms unordered_pair(all_0_3_3, all_0_1_1) = all_0_0_0, yields: % 2.27/1.27 | (13) unordered_pair(all_0_1_1, all_0_3_3) = all_0_0_0 % 2.27/1.28 | % 2.27/1.28 | Instantiating formula (9) with all_0_0_0, all_0_3_3, all_0_1_1, all_0_3_3 and discharging atoms singleton(all_0_3_3) = all_0_0_0, unordered_pair(all_0_1_1, all_0_3_3) = all_0_0_0, yields: % 2.27/1.28 | (14) all_0_1_1 = all_0_3_3 % 2.27/1.28 | % 2.27/1.28 | Equations (14) can reduce 11 to: % 2.27/1.28 | (15) $false % 2.27/1.28 | % 2.27/1.28 |-The branch is then unsatisfiable % 2.27/1.28 % SZS output end Proof for theBenchmark % 2.27/1.28 % 2.27/1.28 698ms %------------------------------------------------------------------------------