%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n019.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 18:59:35 EDT 2022 % Result : Theorem 1.75s 1.09s % Output : Proof 2.29s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : SWB006+2 : TPTP v8.1.0. Released v5.2.0. % 0.04/0.14 % Command : ePrincess-casc -timeout=%d %s % 0.14/0.36 % Computer : n019.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Wed Jun 1 06:24:40 EDT 2022 % 0.14/0.36 % CPUTime : % 0.51/0.62 ____ _ % 0.51/0.62 ___ / __ \_____(_)___ ________ __________ % 0.51/0.62 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.51/0.62 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.51/0.62 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.51/0.62 % 0.51/0.62 A Theorem Prover for First-Order Logic % 0.51/0.62 (ePrincess v.1.0) % 0.51/0.62 % 0.51/0.62 (c) Philipp Rümmer, 2009-2015 % 0.51/0.62 (c) Peter Backeman, 2014-2015 % 0.51/0.62 (contributions by Angelo Brillout, Peter Baumgartner) % 0.51/0.62 Free software under GNU Lesser General Public License (LGPL). % 0.51/0.62 Bug reports to peter@backeman.se % 0.51/0.62 % 0.51/0.62 For more information, visit http://user.uu.se/~petba168/breu/ % 0.51/0.62 % 0.51/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.78/0.67 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.25/0.92 Prover 0: Preprocessing ... % 1.47/1.00 Prover 0: Warning: ignoring some quantifiers % 1.47/1.01 Prover 0: Constructing countermodel ... % 1.75/1.09 Prover 0: proved (415ms) % 1.75/1.09 % 1.75/1.09 No countermodel exists, formula is valid % 1.75/1.09 % SZS status Theorem for theBenchmark % 1.75/1.09 % 1.75/1.09 Generating proof ... Warning: ignoring some quantifiers % 2.17/1.22 found it (size 12) % 2.17/1.22 % 2.17/1.22 % SZS output start Proof for theBenchmark % 2.17/1.22 Assumed formulas after preprocessing and simplification: % 2.17/1.22 | (0) ? [v0] : ? [v1] : (literal_plain(dat_str_abc) = v0 & iext(uri_owl_sameAs, v1, v0) & iext(uri_owl_sameAs, v1, uri_ex_w) & iext(uri_owl_sameAs, uri_ex_u, v0) & ~ iext(uri_owl_sameAs, uri_ex_u, uri_ex_w) & ! [v2] : ! [v3] : ! [v4] : (v3 = v2 | ~ (literal_plain(v4) = v3) | ~ (literal_plain(v4) = v2)) & ! [v2] : ! [v3] : (v3 = v2 | ~ iext(uri_owl_sameAs, v2, v3)) & ? [v2] : iext(uri_owl_sameAs, v2, v2)) % 2.29/1.26 | Instantiating (0) with all_0_0_0, all_0_1_1 yields: % 2.29/1.26 | (1) literal_plain(dat_str_abc) = all_0_1_1 & iext(uri_owl_sameAs, all_0_0_0, all_0_1_1) & iext(uri_owl_sameAs, all_0_0_0, uri_ex_w) & iext(uri_owl_sameAs, uri_ex_u, all_0_1_1) & ~ iext(uri_owl_sameAs, uri_ex_u, uri_ex_w) & ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (literal_plain(v2) = v1) | ~ (literal_plain(v2) = v0)) & ! [v0] : ! [v1] : (v1 = v0 | ~ iext(uri_owl_sameAs, v0, v1)) & ? [v0] : iext(uri_owl_sameAs, v0, v0) % 2.29/1.26 | % 2.29/1.26 | Applying alpha-rule on (1) yields: % 2.29/1.26 | (2) iext(uri_owl_sameAs, all_0_0_0, uri_ex_w) % 2.29/1.26 | (3) ? [v0] : iext(uri_owl_sameAs, v0, v0) % 2.29/1.26 | (4) ~ iext(uri_owl_sameAs, uri_ex_u, uri_ex_w) % 2.29/1.27 | (5) literal_plain(dat_str_abc) = all_0_1_1 % 2.29/1.27 | (6) iext(uri_owl_sameAs, uri_ex_u, all_0_1_1) % 2.29/1.27 | (7) ! [v0] : ! [v1] : (v1 = v0 | ~ iext(uri_owl_sameAs, v0, v1)) % 2.29/1.27 | (8) iext(uri_owl_sameAs, all_0_0_0, all_0_1_1) % 2.29/1.27 | (9) ! [v0] : ! [v1] : ! [v2] : (v1 = v0 | ~ (literal_plain(v2) = v1) | ~ (literal_plain(v2) = v0)) % 2.29/1.27 | % 2.29/1.27 | Instantiating formula (7) with all_0_1_1, all_0_0_0 and discharging atoms iext(uri_owl_sameAs, all_0_0_0, all_0_1_1), yields: % 2.29/1.27 | (10) all_0_0_0 = all_0_1_1 % 2.29/1.27 | % 2.29/1.27 | Instantiating formula (7) with uri_ex_w, all_0_0_0 and discharging atoms iext(uri_owl_sameAs, all_0_0_0, uri_ex_w), yields: % 2.29/1.27 | (11) all_0_0_0 = uri_ex_w % 2.29/1.27 | % 2.29/1.27 | Instantiating formula (7) with all_0_1_1, uri_ex_u and discharging atoms iext(uri_owl_sameAs, uri_ex_u, all_0_1_1), yields: % 2.29/1.27 | (12) all_0_1_1 = uri_ex_u % 2.29/1.27 | % 2.29/1.27 | Combining equations (11,10) yields a new equation: % 2.29/1.27 | (13) all_0_1_1 = uri_ex_w % 2.29/1.27 | % 2.29/1.27 | Combining equations (13,12) yields a new equation: % 2.29/1.27 | (14) uri_ex_w = uri_ex_u % 2.29/1.27 | % 2.29/1.27 | Simplifying 14 yields: % 2.29/1.27 | (15) uri_ex_w = uri_ex_u % 2.29/1.27 | % 2.29/1.27 | From (12) and (6) follows: % 2.29/1.27 | (16) iext(uri_owl_sameAs, uri_ex_u, uri_ex_u) % 2.29/1.27 | % 2.29/1.27 | From (15) and (4) follows: % 2.29/1.27 | (17) ~ iext(uri_owl_sameAs, uri_ex_u, uri_ex_u) % 2.29/1.27 | % 2.29/1.27 | Using (16) and (17) yields: % 2.29/1.27 | (18) $false % 2.29/1.27 | % 2.29/1.27 |-The branch is then unsatisfiable % 2.29/1.27 % SZS output end Proof for theBenchmark % 2.29/1.28 % 2.29/1.28 643ms %------------------------------------------------------------------------------