%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : SWB011+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:37 EDT 2022 % Result : Unsatisfiable 1.70s 1.09s % Output : Proof 2.28s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SWB011+2 : TPTP v8.1.0. Released v5.2.0. % 0.04/0.13 % Command : ePrincess-casc -timeout=%d %s % 0.14/0.34 % Computer : n022.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 07:48:22 EDT 2022 % 0.14/0.34 % CPUTime : % 0.50/0.61 ____ _ % 0.50/0.61 ___ / __ \_____(_)___ ________ __________ % 0.50/0.61 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.50/0.61 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.50/0.61 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.50/0.61 % 0.50/0.61 A Theorem Prover for First-Order Logic % 0.50/0.61 (ePrincess v.1.0) % 0.50/0.61 % 0.50/0.61 (c) Philipp Rümmer, 2009-2015 % 0.50/0.61 (c) Peter Backeman, 2014-2015 % 0.50/0.61 (contributions by Angelo Brillout, Peter Baumgartner) % 0.50/0.61 Free software under GNU Lesser General Public License (LGPL). % 0.50/0.61 Bug reports to peter@backeman.se % 0.50/0.61 % 0.50/0.61 For more information, visit http://user.uu.se/~petba168/breu/ % 0.50/0.61 % 0.50/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.66 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.24/0.92 Prover 0: Preprocessing ... % 1.52/1.02 Prover 0: Constructing countermodel ... % 1.70/1.09 Prover 0: proved (433ms) % 1.70/1.09 % 1.70/1.09 No countermodel exists, formula is valid % 1.70/1.09 % SZS status Unsatisfiable for theBenchmark % 1.70/1.09 % 1.70/1.09 Generating proof ... found it (size 5) % 2.13/1.22 % 2.13/1.22 % SZS output start Proof for theBenchmark % 2.13/1.22 Assumed formulas after preprocessing and simplification: % 2.13/1.22 | (0) iext(uri_owl_disjointWith, uri_owl_Class, uri_owl_ObjectProperty) & iext(uri_rdf_type, uri_ex_x, uri_owl_ObjectProperty) & iext(uri_rdf_type, uri_ex_x, uri_owl_Class) & ! [v0] : ! [v1] : ! [v2] : ( ~ icext(v1, v2) | ~ icext(v0, v2) | ~ iext(uri_owl_disjointWith, v0, v1)) & ! [v0] : ! [v1] : ( ~ ic(v1) | ~ ic(v0) | iext(uri_owl_disjointWith, v0, v1) | ? [v2] : (icext(v1, v2) & icext(v0, v2))) & ! [v0] : ! [v1] : ( ~ icext(v1, v0) | iext(uri_rdf_type, v0, v1)) & ! [v0] : ! [v1] : ( ~ iext(uri_owl_disjointWith, v0, v1) | ic(v1)) & ! [v0] : ! [v1] : ( ~ iext(uri_owl_disjointWith, v0, v1) | ic(v0)) & ! [v0] : ! [v1] : ( ~ iext(uri_rdf_type, v0, v1) | icext(v1, v0)) % 2.13/1.23 | Applying alpha-rule on (0) yields: % 2.13/1.23 | (1) ! [v0] : ! [v1] : ( ~ iext(uri_rdf_type, v0, v1) | icext(v1, v0)) % 2.13/1.23 | (2) ! [v0] : ! [v1] : ( ~ icext(v1, v0) | iext(uri_rdf_type, v0, v1)) % 2.13/1.23 | (3) ! [v0] : ! [v1] : ( ~ iext(uri_owl_disjointWith, v0, v1) | ic(v0)) % 2.13/1.23 | (4) ! [v0] : ! [v1] : ( ~ ic(v1) | ~ ic(v0) | iext(uri_owl_disjointWith, v0, v1) | ? [v2] : (icext(v1, v2) & icext(v0, v2))) % 2.13/1.23 | (5) iext(uri_owl_disjointWith, uri_owl_Class, uri_owl_ObjectProperty) % 2.13/1.23 | (6) iext(uri_rdf_type, uri_ex_x, uri_owl_ObjectProperty) % 2.13/1.23 | (7) ! [v0] : ! [v1] : ! [v2] : ( ~ icext(v1, v2) | ~ icext(v0, v2) | ~ iext(uri_owl_disjointWith, v0, v1)) % 2.28/1.23 | (8) ! [v0] : ! [v1] : ( ~ iext(uri_owl_disjointWith, v0, v1) | ic(v1)) % 2.28/1.23 | (9) iext(uri_rdf_type, uri_ex_x, uri_owl_Class) % 2.28/1.24 | % 2.28/1.24 | Instantiating formula (1) with uri_owl_ObjectProperty, uri_ex_x and discharging atoms iext(uri_rdf_type, uri_ex_x, uri_owl_ObjectProperty), yields: % 2.28/1.24 | (10) icext(uri_owl_ObjectProperty, uri_ex_x) % 2.28/1.24 | % 2.28/1.24 | Instantiating formula (1) with uri_owl_Class, uri_ex_x and discharging atoms iext(uri_rdf_type, uri_ex_x, uri_owl_Class), yields: % 2.28/1.24 | (11) icext(uri_owl_Class, uri_ex_x) % 2.28/1.24 | % 2.28/1.24 | Instantiating formula (7) with uri_ex_x, uri_owl_ObjectProperty, uri_owl_Class and discharging atoms icext(uri_owl_ObjectProperty, uri_ex_x), icext(uri_owl_Class, uri_ex_x), iext(uri_owl_disjointWith, uri_owl_Class, uri_owl_ObjectProperty), yields: % 2.28/1.24 | (12) $false % 2.28/1.24 | % 2.28/1.24 |-The branch is then unsatisfiable % 2.28/1.24 % SZS output end Proof for theBenchmark % 2.28/1.24 % 2.28/1.24 623ms %------------------------------------------------------------------------------