%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SWB007+2 : TPTP v8.1.0. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n017.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.55s 1.02s % Output : Proof 2.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWB007+2 : TPTP v8.1.0. Released v5.2.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n017.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 : Wed Jun 1 02:22:26 EDT 2022 % 0.12/0.33 % CPUTime : % 0.46/0.61 ____ _ % 0.46/0.61 ___ / __ \_____(_)___ ________ __________ % 0.46/0.61 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.46/0.61 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.46/0.61 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.46/0.61 % 0.46/0.61 A Theorem Prover for First-Order Logic % 0.46/0.62 (ePrincess v.1.0) % 0.46/0.62 % 0.46/0.62 (c) Philipp Rümmer, 2009-2015 % 0.46/0.62 (c) Peter Backeman, 2014-2015 % 0.46/0.62 (contributions by Angelo Brillout, Peter Baumgartner) % 0.46/0.62 Free software under GNU Lesser General Public License (LGPL). % 0.46/0.62 Bug reports to peter@backeman.se % 0.46/0.62 % 0.46/0.62 For more information, visit http://user.uu.se/~petba168/breu/ % 0.46/0.62 % 0.46/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.66/0.68 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.24/0.89 Prover 0: Preprocessing ... % 1.43/0.94 Prover 0: Warning: ignoring some quantifiers % 1.43/0.95 Prover 0: Constructing countermodel ... % 1.55/1.01 Prover 0: proved (340ms) % 1.55/1.02 % 1.55/1.02 No countermodel exists, formula is valid % 1.55/1.02 % SZS status Theorem for theBenchmark % 1.55/1.02 % 1.55/1.02 Generating proof ... Warning: ignoring some quantifiers % 2.04/1.13 found it (size 13) % 2.04/1.13 % 2.04/1.13 % SZS output start Proof for theBenchmark % 2.04/1.13 Assumed formulas after preprocessing and simplification: % 2.04/1.13 | (0) iext(uri_rdfs_range, uri_ex_p, uri_ex_c1) & iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c1) & iext(uri_rdf_type, uri_ex_w, uri_ex_c1) & iext(uri_owl_sameAs, uri_ex_c1, uri_ex_c2) & ! [v0] : ! [v1] : (v1 = v0 | ~ iext(uri_owl_sameAs, v0, v1)) & ? [v0] : iext(uri_owl_sameAs, v0, v0) & ( ~ iext(uri_rdfs_range, uri_ex_p, uri_ex_c2) | ~ iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c2) | ~ iext(uri_rdf_type, uri_ex_w, uri_ex_c2)) % 2.04/1.14 | Applying alpha-rule on (0) yields: % 2.04/1.14 | (1) iext(uri_owl_sameAs, uri_ex_c1, uri_ex_c2) % 2.04/1.14 | (2) ~ iext(uri_rdfs_range, uri_ex_p, uri_ex_c2) | ~ iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c2) | ~ iext(uri_rdf_type, uri_ex_w, uri_ex_c2) % 2.04/1.14 | (3) ? [v0] : iext(uri_owl_sameAs, v0, v0) % 2.04/1.14 | (4) iext(uri_rdfs_range, uri_ex_p, uri_ex_c1) % 2.04/1.14 | (5) ! [v0] : ! [v1] : (v1 = v0 | ~ iext(uri_owl_sameAs, v0, v1)) % 2.04/1.14 | (6) iext(uri_rdf_type, uri_ex_w, uri_ex_c1) % 2.04/1.14 | (7) iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c1) % 2.04/1.14 | % 2.04/1.15 | Instantiating formula (5) with uri_ex_c2, uri_ex_c1 and discharging atoms iext(uri_owl_sameAs, uri_ex_c1, uri_ex_c2), yields: % 2.12/1.15 | (8) uri_ex_c1 = uri_ex_c2 % 2.12/1.15 | % 2.12/1.15 | From (8) and (4) follows: % 2.12/1.15 | (9) iext(uri_rdfs_range, uri_ex_p, uri_ex_c2) % 2.12/1.15 | % 2.12/1.15 | From (8) and (7) follows: % 2.12/1.15 | (10) iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c2) % 2.12/1.15 | % 2.12/1.15 | From (8) and (6) follows: % 2.12/1.15 | (11) iext(uri_rdf_type, uri_ex_w, uri_ex_c2) % 2.12/1.15 | % 2.12/1.15 +-Applying beta-rule and splitting (2), into two cases. % 2.12/1.15 |-Branch one: % 2.12/1.15 | (12) ~ iext(uri_rdfs_range, uri_ex_p, uri_ex_c2) % 2.12/1.15 | % 2.12/1.15 | Using (9) and (12) yields: % 2.12/1.15 | (13) $false % 2.12/1.15 | % 2.12/1.15 |-The branch is then unsatisfiable % 2.12/1.15 |-Branch two: % 2.12/1.15 | (9) iext(uri_rdfs_range, uri_ex_p, uri_ex_c2) % 2.12/1.15 | (15) ~ iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c2) | ~ iext(uri_rdf_type, uri_ex_w, uri_ex_c2) % 2.12/1.15 | % 2.12/1.15 +-Applying beta-rule and splitting (15), into two cases. % 2.12/1.15 |-Branch one: % 2.12/1.15 | (16) ~ iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c2) % 2.12/1.15 | % 2.12/1.15 | Using (10) and (16) yields: % 2.12/1.15 | (13) $false % 2.12/1.15 | % 2.12/1.15 |-The branch is then unsatisfiable % 2.12/1.15 |-Branch two: % 2.12/1.15 | (10) iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c2) % 2.12/1.15 | (19) ~ iext(uri_rdf_type, uri_ex_w, uri_ex_c2) % 2.12/1.15 | % 2.12/1.15 | Using (11) and (19) yields: % 2.12/1.15 | (13) $false % 2.12/1.15 | % 2.12/1.15 |-The branch is then unsatisfiable % 2.12/1.15 % SZS output end Proof for theBenchmark % 2.12/1.15 % 2.12/1.15 524ms %------------------------------------------------------------------------------