%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SET978+1 : TPTP v8.1.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n011.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:34 EDT 2022 % Result : Theorem 1.71s 1.15s % Output : Proof 2.73s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET978+1 : TPTP v8.1.0. Released v3.2.0. % 0.07/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n011.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sat Jul 9 15:57:55 EDT 2022 % 0.13/0.33 % CPUTime : % 0.18/0.58 ____ _ % 0.18/0.58 ___ / __ \_____(_)___ ________ __________ % 0.18/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.18/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.18/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.18/0.58 % 0.18/0.58 A Theorem Prover for First-Order Logic % 0.18/0.58 (ePrincess v.1.0) % 0.18/0.58 % 0.18/0.58 (c) Philipp Rümmer, 2009-2015 % 0.18/0.58 (c) Peter Backeman, 2014-2015 % 0.18/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.18/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.18/0.58 Bug reports to peter@backeman.se % 0.18/0.58 % 0.18/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.18/0.58 % 0.18/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.65 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.34/0.92 Prover 0: Preprocessing ... % 1.59/1.04 Prover 0: Constructing countermodel ... % 1.71/1.15 Prover 0: proved (498ms) % 1.71/1.15 % 1.71/1.15 No countermodel exists, formula is valid % 1.71/1.15 % SZS status Theorem for theBenchmark % 1.71/1.15 % 1.71/1.15 Generating proof ... found it (size 14) % 2.61/1.33 % 2.61/1.33 % SZS output start Proof for theBenchmark % 2.61/1.33 Assumed formulas after preprocessing and simplification: % 2.61/1.33 | (0) ? [v0] : ? [v1] : ? [v2] : ? [v3] : ? [v4] : ? [v5] : ? [v6] : ? [v7] : ? [v8] : ? [v9] : ? [v10] : ? [v11] : ( ~ (v1 = v0) & singleton(v1) = v6 & singleton(v0) = v4 & cartesian_product2(v6, v3) = v7 & cartesian_product2(v4, v2) = v5 & cartesian_product2(v3, v6) = v9 & cartesian_product2(v2, v4) = v8 & empty(v11) & ~ empty(v10) & ! [v12] : ! [v13] : ! [v14] : ! [v15] : ! [v16] : ! [v17] : ( ~ (cartesian_product2(v13, v15) = v17) | ~ (cartesian_product2(v12, v14) = v16) | ~ disjoint(v14, v15) | disjoint(v16, v17)) & ! [v12] : ! [v13] : ! [v14] : ! [v15] : ! [v16] : ! [v17] : ( ~ (cartesian_product2(v13, v15) = v17) | ~ (cartesian_product2(v12, v14) = v16) | ~ disjoint(v12, v13) | disjoint(v16, v17)) & ! [v12] : ! [v13] : ! [v14] : ! [v15] : (v13 = v12 | ~ (singleton(v13) = v15) | ~ (singleton(v12) = v14) | disjoint(v14, v15)) & ! [v12] : ! [v13] : ! [v14] : ! [v15] : (v13 = v12 | ~ (cartesian_product2(v15, v14) = v13) | ~ (cartesian_product2(v15, v14) = v12)) & ! [v12] : ! [v13] : ! [v14] : (v13 = v12 | ~ (singleton(v14) = v13) | ~ (singleton(v14) = v12)) & ! [v12] : ! [v13] : ( ~ disjoint(v12, v13) | disjoint(v13, v12)) & ( ~ disjoint(v8, v9) | ~ disjoint(v5, v7))) % 2.61/1.37 | 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, all_0_6_6, all_0_7_7, all_0_8_8, all_0_9_9, all_0_10_10, all_0_11_11 yields: % 2.61/1.37 | (1) ~ (all_0_10_10 = all_0_11_11) & singleton(all_0_10_10) = all_0_5_5 & singleton(all_0_11_11) = all_0_7_7 & cartesian_product2(all_0_5_5, all_0_8_8) = all_0_4_4 & cartesian_product2(all_0_7_7, all_0_9_9) = all_0_6_6 & cartesian_product2(all_0_8_8, all_0_5_5) = all_0_2_2 & cartesian_product2(all_0_9_9, all_0_7_7) = all_0_3_3 & empty(all_0_0_0) & ~ empty(all_0_1_1) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ (cartesian_product2(v1, v3) = v5) | ~ (cartesian_product2(v0, v2) = v4) | ~ disjoint(v2, v3) | disjoint(v4, v5)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ (cartesian_product2(v1, v3) = v5) | ~ (cartesian_product2(v0, v2) = v4) | ~ disjoint(v0, v1) | disjoint(v4, v5)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (singleton(v1) = v3) | ~ (singleton(v0) = v2) | disjoint(v2, v3)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (cartesian_product2(v3, v2) = v1) | ~ (cartesian_product2(v3, v2) = v0)) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) & ! [v0] : ! [v1] : ( ~ disjoint(v0, v1) | disjoint(v1, v0)) & ( ~ disjoint(all_0_3_3, all_0_2_2) | ~ disjoint(all_0_6_6, all_0_4_4)) % 2.61/1.38 | % 2.61/1.38 | Applying alpha-rule on (1) yields: % 2.61/1.38 | (2) singleton(all_0_10_10) = all_0_5_5 % 2.61/1.38 | (3) empty(all_0_0_0) % 2.61/1.38 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (singleton(v1) = v3) | ~ (singleton(v0) = v2) | disjoint(v2, v3)) % 2.61/1.38 | (5) cartesian_product2(all_0_7_7, all_0_9_9) = all_0_6_6 % 2.61/1.38 | (6) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ (cartesian_product2(v1, v3) = v5) | ~ (cartesian_product2(v0, v2) = v4) | ~ disjoint(v2, v3) | disjoint(v4, v5)) % 2.61/1.38 | (7) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ (singleton(v2) = v0)) % 2.61/1.38 | (8) ~ empty(all_0_1_1) % 2.61/1.38 | (9) cartesian_product2(all_0_8_8, all_0_5_5) = all_0_2_2 % 2.61/1.38 | (10) ! [v0] : ! [v1] : ( ~ disjoint(v0, v1) | disjoint(v1, v0)) % 2.61/1.38 | (11) cartesian_product2(all_0_9_9, all_0_7_7) = all_0_3_3 % 2.61/1.38 | (12) cartesian_product2(all_0_5_5, all_0_8_8) = all_0_4_4 % 2.61/1.38 | (13) ! [v0] : ! [v1] : ! [v2] : ! [v3] : (v1 = v0 | ~ (cartesian_product2(v3, v2) = v1) | ~ (cartesian_product2(v3, v2) = v0)) % 2.61/1.38 | (14) ~ (all_0_10_10 = all_0_11_11) % 2.61/1.38 | (15) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ (cartesian_product2(v1, v3) = v5) | ~ (cartesian_product2(v0, v2) = v4) | ~ disjoint(v0, v1) | disjoint(v4, v5)) % 2.61/1.38 | (16) ~ disjoint(all_0_3_3, all_0_2_2) | ~ disjoint(all_0_6_6, all_0_4_4) % 2.61/1.38 | (17) singleton(all_0_11_11) = all_0_7_7 % 2.61/1.38 | % 2.61/1.38 | Instantiating formula (4) with all_0_5_5, all_0_7_7, all_0_10_10, all_0_11_11 and discharging atoms singleton(all_0_10_10) = all_0_5_5, singleton(all_0_11_11) = all_0_7_7, yields: % 2.61/1.38 | (18) all_0_10_10 = all_0_11_11 | disjoint(all_0_7_7, all_0_5_5) % 2.61/1.38 | % 2.61/1.38 +-Applying beta-rule and splitting (16), into two cases. % 2.61/1.38 |-Branch one: % 2.61/1.38 | (19) ~ disjoint(all_0_3_3, all_0_2_2) % 2.61/1.38 | % 2.61/1.39 +-Applying beta-rule and splitting (18), into two cases. % 2.61/1.39 |-Branch one: % 2.61/1.39 | (20) disjoint(all_0_7_7, all_0_5_5) % 2.61/1.39 | % 2.61/1.39 | Instantiating formula (6) with all_0_2_2, all_0_3_3, all_0_5_5, all_0_7_7, all_0_8_8, all_0_9_9 and discharging atoms cartesian_product2(all_0_8_8, all_0_5_5) = all_0_2_2, cartesian_product2(all_0_9_9, all_0_7_7) = all_0_3_3, disjoint(all_0_7_7, all_0_5_5), ~ disjoint(all_0_3_3, all_0_2_2), yields: % 2.61/1.39 | (21) $false % 2.61/1.39 | % 2.73/1.39 |-The branch is then unsatisfiable % 2.73/1.39 |-Branch two: % 2.73/1.39 | (22) ~ disjoint(all_0_7_7, all_0_5_5) % 2.73/1.39 | (23) all_0_10_10 = all_0_11_11 % 2.73/1.39 | % 2.73/1.39 | Equations (23) can reduce 14 to: % 2.73/1.39 | (24) $false % 2.73/1.39 | % 2.73/1.39 |-The branch is then unsatisfiable % 2.73/1.39 |-Branch two: % 2.73/1.39 | (25) disjoint(all_0_3_3, all_0_2_2) % 2.73/1.39 | (26) ~ disjoint(all_0_6_6, all_0_4_4) % 2.73/1.39 | % 2.73/1.39 +-Applying beta-rule and splitting (18), into two cases. % 2.73/1.39 |-Branch one: % 2.73/1.39 | (20) disjoint(all_0_7_7, all_0_5_5) % 2.73/1.39 | % 2.73/1.39 | Instantiating formula (15) with all_0_4_4, all_0_6_6, all_0_8_8, all_0_9_9, all_0_5_5, all_0_7_7 and discharging atoms cartesian_product2(all_0_5_5, all_0_8_8) = all_0_4_4, cartesian_product2(all_0_7_7, all_0_9_9) = all_0_6_6, disjoint(all_0_7_7, all_0_5_5), ~ disjoint(all_0_6_6, all_0_4_4), yields: % 2.73/1.39 | (21) $false % 2.73/1.39 | % 2.73/1.39 |-The branch is then unsatisfiable % 2.73/1.39 |-Branch two: % 2.73/1.39 | (22) ~ disjoint(all_0_7_7, all_0_5_5) % 2.73/1.39 | (23) all_0_10_10 = all_0_11_11 % 2.73/1.39 | % 2.73/1.39 | Equations (23) can reduce 14 to: % 2.73/1.39 | (24) $false % 2.73/1.39 | % 2.73/1.39 |-The branch is then unsatisfiable % 2.73/1.39 % SZS output end Proof for theBenchmark % 2.73/1.39 % 2.73/1.39 799ms %------------------------------------------------------------------------------