%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SWB015+2 : TPTP v8.1.0. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n022.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:38 EDT 2022 % Result : Theorem 1.91s 1.11s % Output : Proof 2.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SWB015+2 : TPTP v8.1.0. Released v5.2.0. % 0.13/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.13/0.33 % Computer : n022.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 : Wed Jun 1 00:29:37 EDT 2022 % 0.13/0.33 % CPUTime : % 0.59/0.60 ____ _ % 0.59/0.60 ___ / __ \_____(_)___ ________ __________ % 0.59/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.59/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.59/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.59/0.60 % 0.59/0.60 A Theorem Prover for First-Order Logic % 0.59/0.61 (ePrincess v.1.0) % 0.59/0.61 % 0.59/0.61 (c) Philipp Rümmer, 2009-2015 % 0.59/0.61 (c) Peter Backeman, 2014-2015 % 0.59/0.61 (contributions by Angelo Brillout, Peter Baumgartner) % 0.59/0.61 Free software under GNU Lesser General Public License (LGPL). % 0.59/0.61 Bug reports to peter@backeman.se % 0.59/0.61 % 0.59/0.61 For more information, visit http://user.uu.se/~petba168/breu/ % 0.59/0.61 % 0.59/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.72/0.66 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.26/0.89 Prover 0: Preprocessing ... % 1.41/0.93 Prover 0: Warning: ignoring some quantifiers % 1.43/0.94 Prover 0: Constructing countermodel ... % 1.57/1.03 Prover 0: gave up % 1.57/1.03 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -resolutionMethod=normal +ignoreQuantifiers -generateTriggers=all % 1.57/1.05 Prover 1: Preprocessing ... % 1.91/1.09 Prover 1: Constructing countermodel ... % 1.91/1.11 Prover 1: proved (79ms) % 1.91/1.11 % 1.91/1.11 No countermodel exists, formula is valid % 1.91/1.11 % SZS status Theorem for theBenchmark % 1.91/1.11 % 1.91/1.11 Generating proof ... found it (size 5) % 2.31/1.21 % 2.31/1.21 % SZS output start Proof for theBenchmark % 2.31/1.21 Assumed formulas after preprocessing and simplification: % 2.31/1.21 | (0) ? [v0] : ( ~ (v0 = 0) & iext(uri_owl_sameAs, uri_owl_sameAs, uri_owl_sameAs) = v0 & ! [v1] : ! [v2] : ! [v3] : ! [v4] : ! [v5] : (v2 = v1 | ~ (iext(v5, v4, v3) = v2) | ~ (iext(v5, v4, v3) = v1)) & ! [v1] : ! [v2] : (v2 = v1 | ~ (iext(uri_owl_sameAs, v1, v2) = 0)) & ! [v1] : ! [v2] : (v2 = 0 | ~ (iext(uri_owl_sameAs, v1, v1) = v2))) % 2.37/1.25 | Instantiating (0) with all_0_0_0 yields: % 2.37/1.25 | (1) ~ (all_0_0_0 = 0) & iext(uri_owl_sameAs, uri_owl_sameAs, uri_owl_sameAs) = all_0_0_0 & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ (iext(v4, v3, v2) = v0)) & ! [v0] : ! [v1] : (v1 = v0 | ~ (iext(uri_owl_sameAs, v0, v1) = 0)) & ! [v0] : ! [v1] : (v1 = 0 | ~ (iext(uri_owl_sameAs, v0, v0) = v1)) % 2.37/1.25 | % 2.37/1.25 | Applying alpha-rule on (1) yields: % 2.37/1.25 | (2) iext(uri_owl_sameAs, uri_owl_sameAs, uri_owl_sameAs) = all_0_0_0 % 2.37/1.25 | (3) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ (iext(v4, v3, v2) = v0)) % 2.37/1.26 | (4) ~ (all_0_0_0 = 0) % 2.37/1.26 | (5) ! [v0] : ! [v1] : (v1 = v0 | ~ (iext(uri_owl_sameAs, v0, v1) = 0)) % 2.37/1.26 | (6) ! [v0] : ! [v1] : (v1 = 0 | ~ (iext(uri_owl_sameAs, v0, v0) = v1)) % 2.37/1.26 | % 2.37/1.26 | Instantiating formula (6) with all_0_0_0, uri_owl_sameAs and discharging atoms iext(uri_owl_sameAs, uri_owl_sameAs, uri_owl_sameAs) = all_0_0_0, yields: % 2.37/1.26 | (7) all_0_0_0 = 0 % 2.37/1.26 | % 2.37/1.26 | Equations (7) can reduce 4 to: % 2.37/1.26 | (8) $false % 2.37/1.26 | % 2.37/1.26 |-The branch is then unsatisfiable % 2.37/1.26 % SZS output end Proof for theBenchmark % 2.37/1.26 % 2.37/1.26 643ms %------------------------------------------------------------------------------