%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SWB009+2 : TPTP v8.1.0. Released v5.2.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 18:59:36 EDT 2022 % Result : Theorem 1.81s 1.13s % Output : Proof 2.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : SWB009+2 : TPTP v8.1.0. Released v5.2.0. % 0.11/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.14/0.34 % Computer : n026.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Wed Jun 1 08:57:11 EDT 2022 % 0.14/0.35 % CPUTime : % 0.62/0.60 ____ _ % 0.62/0.60 ___ / __ \_____(_)___ ________ __________ % 0.62/0.60 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.62/0.60 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.62/0.60 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.62/0.60 % 0.62/0.60 A Theorem Prover for First-Order Logic % 0.62/0.61 (ePrincess v.1.0) % 0.62/0.61 % 0.62/0.61 (c) Philipp Rümmer, 2009-2015 % 0.62/0.61 (c) Peter Backeman, 2014-2015 % 0.62/0.61 (contributions by Angelo Brillout, Peter Baumgartner) % 0.62/0.61 Free software under GNU Lesser General Public License (LGPL). % 0.62/0.61 Bug reports to peter@backeman.se % 0.62/0.61 % 0.62/0.61 For more information, visit http://user.uu.se/~petba168/breu/ % 0.62/0.61 % 0.62/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.36/0.93 Prover 0: Preprocessing ... % 1.43/1.02 Prover 0: Constructing countermodel ... % 1.81/1.13 Prover 0: proved (474ms) % 1.81/1.13 % 1.81/1.13 No countermodel exists, formula is valid % 1.81/1.13 % SZS status Theorem for theBenchmark % 1.81/1.13 % 1.81/1.13 Generating proof ... found it (size 9) % 2.30/1.28 % 2.30/1.28 % SZS output start Proof for theBenchmark % 2.30/1.29 Assumed formulas after preprocessing and simplification: % 2.30/1.29 | (0) ? [v0] : (iext(uri_owl_onProperty, v0, uri_ex_p) & iext(uri_owl_someValuesFrom, v0, uri_ex_c) & iext(uri_rdf_type, v0, uri_owl_Restriction) & iext(uri_rdf_type, uri_ex_c, uri_owl_Class) & iext(uri_rdf_type, uri_ex_s, v0) & iext(uri_rdf_type, uri_ex_p, uri_owl_ObjectProperty) & ! [v1] : ! [v2] : ! [v3] : ! [v4] : ! [v5] : ( ~ icext(v3, v5) | ~ iext(v2, v4, v5) | ~ iext(uri_owl_onProperty, v1, v2) | ~ iext(uri_owl_someValuesFrom, v1, v3) | icext(v1, v4)) & ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ icext(v1, v4) | ~ iext(uri_owl_onProperty, v1, v2) | ~ iext(uri_owl_someValuesFrom, v1, v3) | ? [v5] : (icext(v3, v5) & iext(v2, v4, v5))) & ! [v1] : ! [v2] : ( ~ icext(v2, v1) | iext(uri_rdf_type, v1, v2)) & ! [v1] : ! [v2] : ( ~ iext(uri_rdf_type, v1, v2) | icext(v2, v1)) & ! [v1] : ( ~ iext(uri_ex_p, uri_ex_s, v1) | ~ iext(uri_rdf_type, v1, uri_ex_c))) % 2.30/1.30 | Instantiating (0) with all_0_0_0 yields: % 2.30/1.30 | (1) iext(uri_owl_onProperty, all_0_0_0, uri_ex_p) & iext(uri_owl_someValuesFrom, all_0_0_0, uri_ex_c) & iext(uri_rdf_type, all_0_0_0, uri_owl_Restriction) & iext(uri_rdf_type, uri_ex_c, uri_owl_Class) & iext(uri_rdf_type, uri_ex_s, all_0_0_0) & iext(uri_rdf_type, uri_ex_p, uri_owl_ObjectProperty) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ icext(v2, v4) | ~ iext(v1, v3, v4) | ~ iext(uri_owl_onProperty, v0, v1) | ~ iext(uri_owl_someValuesFrom, v0, v2) | icext(v0, v3)) & ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ icext(v0, v3) | ~ iext(uri_owl_onProperty, v0, v1) | ~ iext(uri_owl_someValuesFrom, v0, v2) | ? [v4] : (icext(v2, v4) & iext(v1, v3, v4))) & ! [v0] : ! [v1] : ( ~ icext(v1, v0) | iext(uri_rdf_type, v0, v1)) & ! [v0] : ! [v1] : ( ~ iext(uri_rdf_type, v0, v1) | icext(v1, v0)) & ! [v0] : ( ~ iext(uri_ex_p, uri_ex_s, v0) | ~ iext(uri_rdf_type, v0, uri_ex_c)) % 2.30/1.30 | % 2.30/1.30 | Applying alpha-rule on (1) yields: % 2.30/1.30 | (2) ! [v0] : ! [v1] : ( ~ iext(uri_rdf_type, v0, v1) | icext(v1, v0)) % 2.30/1.30 | (3) ! [v0] : ! [v1] : ( ~ icext(v1, v0) | iext(uri_rdf_type, v0, v1)) % 2.30/1.30 | (4) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ( ~ icext(v0, v3) | ~ iext(uri_owl_onProperty, v0, v1) | ~ iext(uri_owl_someValuesFrom, v0, v2) | ? [v4] : (icext(v2, v4) & iext(v1, v3, v4))) % 2.30/1.30 | (5) ! [v0] : ! [v1] : ! [v2] : ! [v3] : ! [v4] : ( ~ icext(v2, v4) | ~ iext(v1, v3, v4) | ~ iext(uri_owl_onProperty, v0, v1) | ~ iext(uri_owl_someValuesFrom, v0, v2) | icext(v0, v3)) % 2.30/1.30 | (6) iext(uri_rdf_type, uri_ex_s, all_0_0_0) % 2.30/1.30 | (7) iext(uri_owl_onProperty, all_0_0_0, uri_ex_p) % 2.30/1.30 | (8) iext(uri_rdf_type, uri_ex_p, uri_owl_ObjectProperty) % 2.30/1.30 | (9) iext(uri_rdf_type, uri_ex_c, uri_owl_Class) % 2.30/1.30 | (10) iext(uri_owl_someValuesFrom, all_0_0_0, uri_ex_c) % 2.30/1.30 | (11) ! [v0] : ( ~ iext(uri_ex_p, uri_ex_s, v0) | ~ iext(uri_rdf_type, v0, uri_ex_c)) % 2.30/1.31 | (12) iext(uri_rdf_type, all_0_0_0, uri_owl_Restriction) % 2.30/1.31 | % 2.30/1.31 | Instantiating formula (2) with all_0_0_0, uri_ex_s and discharging atoms iext(uri_rdf_type, uri_ex_s, all_0_0_0), yields: % 2.30/1.31 | (13) icext(all_0_0_0, uri_ex_s) % 2.30/1.31 | % 2.30/1.31 | Instantiating formula (4) with uri_ex_s, uri_ex_c, uri_ex_p, all_0_0_0 and discharging atoms icext(all_0_0_0, uri_ex_s), iext(uri_owl_onProperty, all_0_0_0, uri_ex_p), iext(uri_owl_someValuesFrom, all_0_0_0, uri_ex_c), yields: % 2.30/1.31 | (14) ? [v0] : (icext(uri_ex_c, v0) & iext(uri_ex_p, uri_ex_s, v0)) % 2.30/1.31 | % 2.30/1.31 | Instantiating (14) with all_14_0_1 yields: % 2.30/1.31 | (15) icext(uri_ex_c, all_14_0_1) & iext(uri_ex_p, uri_ex_s, all_14_0_1) % 2.30/1.31 | % 2.30/1.31 | Applying alpha-rule on (15) yields: % 2.30/1.31 | (16) icext(uri_ex_c, all_14_0_1) % 2.30/1.31 | (17) iext(uri_ex_p, uri_ex_s, all_14_0_1) % 2.30/1.31 | % 2.30/1.31 | Instantiating formula (3) with uri_ex_c, all_14_0_1 and discharging atoms icext(uri_ex_c, all_14_0_1), yields: % 2.30/1.31 | (18) iext(uri_rdf_type, all_14_0_1, uri_ex_c) % 2.30/1.31 | % 2.30/1.31 | Instantiating formula (11) with all_14_0_1 and discharging atoms iext(uri_ex_p, uri_ex_s, all_14_0_1), iext(uri_rdf_type, all_14_0_1, uri_ex_c), yields: % 2.30/1.31 | (19) $false % 2.30/1.31 | % 2.30/1.31 |-The branch is then unsatisfiable % 2.30/1.31 % SZS output end Proof for theBenchmark % 2.30/1.31 % 2.30/1.31 695ms %------------------------------------------------------------------------------