%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR051+1 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n024.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 : Fri Jul 15 02:50:39 EDT 2022 % Result : Theorem 2.04s 1.09s % Output : Proof 2.74s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : CSR051+1 : TPTP v8.1.0. Released v3.4.0. % 0.06/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n024.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 : Thu Jun 9 19:43:34 EDT 2022 % 0.12/0.33 % CPUTime : % 0.50/0.58 ____ _ % 0.50/0.58 ___ / __ \_____(_)___ ________ __________ % 0.50/0.58 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.50/0.58 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.50/0.58 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.50/0.58 % 0.50/0.58 A Theorem Prover for First-Order Logic % 0.50/0.58 (ePrincess v.1.0) % 0.50/0.58 % 0.50/0.58 (c) Philipp Rümmer, 2009-2015 % 0.50/0.58 (c) Peter Backeman, 2014-2015 % 0.50/0.58 (contributions by Angelo Brillout, Peter Baumgartner) % 0.50/0.58 Free software under GNU Lesser General Public License (LGPL). % 0.50/0.58 Bug reports to peter@backeman.se % 0.50/0.58 % 0.50/0.58 For more information, visit http://user.uu.se/~petba168/breu/ % 0.50/0.58 % 0.50/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.77/0.63 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.46/0.91 Prover 0: Preprocessing ... % 1.80/1.04 Prover 0: Constructing countermodel ... % 2.04/1.09 Prover 0: proved (460ms) % 2.04/1.09 % 2.04/1.09 No countermodel exists, formula is valid % 2.04/1.09 % SZS status Theorem for theBenchmark % 2.04/1.09 % 2.04/1.09 Generating proof ... found it (size 3) % 2.61/1.26 % 2.61/1.26 % SZS output start Proof for theBenchmark % 2.61/1.26 Assumed formulas after preprocessing and simplification: % 2.61/1.26 | (0) marriagelicensedocument(c_tptpmarriagelicensedocument) & mtvisible(c_basekb) & mtvisible(c_tptp_member3356_mt) & ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v1) | ~ disjointwith(v0, v1) | disjointwith(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v0) | ~ disjointwith(v0, v1) | disjointwith(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v1, v2) | ~ isa(v0, v1) | isa(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v2, v0) | ~ genlinverse(v0, v1) | genlinverse(v2, v1)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlpreds(v0, v1) | genlpreds(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlinverse(v0, v1) | genlinverse(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v1, v2) | ~ genlinverse(v0, v1) | genlpreds(v0, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ disjointwith(v1, v2) | ~ isa(v0, v2) | ~ isa(v0, v1)) & ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1)) & ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0)) & ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1)) & ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0)) & ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1)) & ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0)) & ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0)) & ! [v0] : ! [v1] : ( ~ isa(v0, v1) | thing(v0)) & ! [v0] : ! [v1] : ( ~ isa(v0, v1) | collection(v1)) & ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0)) & ! [v0] : ( ~ isa(v0, c_marriagelicensedocument) | marriagelicensedocument(v0)) & ! [v0] : ( ~ marriagelicensedocument(v0) | isa(v0, c_marriagelicensedocument)) & ! [v0] : ~ marriagelicensedocument(v0) % 2.61/1.27 | Applying alpha-rule on (0) yields: % 2.61/1.27 | (1) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0)) % 2.61/1.27 | (2) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlpreds(v0, v1) | genlpreds(v0, v2)) % 2.61/1.27 | (3) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v0) | ~ disjointwith(v0, v1) | disjointwith(v2, v1)) % 2.61/1.27 | (4) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0)) % 2.61/1.27 | (5) ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0)) % 2.74/1.27 | (6) ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v1, v2) | ~ genlinverse(v0, v1) | genlpreds(v0, v2)) % 2.74/1.27 | (7) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0)) % 2.74/1.27 | (8) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1)) % 2.74/1.28 | (9) ! [v0] : ( ~ marriagelicensedocument(v0) | isa(v0, c_marriagelicensedocument)) % 2.74/1.28 | (10) ! [v0] : ( ~ isa(v0, c_marriagelicensedocument) | marriagelicensedocument(v0)) % 2.74/1.28 | (11) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v1) | ~ disjointwith(v0, v1) | disjointwith(v0, v2)) % 2.74/1.28 | (12) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0)) % 2.74/1.28 | (13) mtvisible(c_basekb) % 2.74/1.28 | (14) marriagelicensedocument(c_tptpmarriagelicensedocument) % 2.74/1.28 | (15) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlinverse(v0, v1) | genlinverse(v0, v2)) % 2.74/1.28 | (16) ! [v0] : ! [v1] : ! [v2] : ( ~ disjointwith(v1, v2) | ~ isa(v0, v2) | ~ isa(v0, v1)) % 2.74/1.28 | (17) mtvisible(c_tptp_member3356_mt) % 2.74/1.28 | (18) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1)) % 2.74/1.28 | (19) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | thing(v0)) % 2.74/1.28 | (20) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1)) % 2.74/1.28 | (21) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v2, v0) | ~ genlinverse(v0, v1) | genlinverse(v2, v1)) % 2.74/1.28 | (22) ! [v0] : ~ marriagelicensedocument(v0) % 2.74/1.28 | (23) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v1, v2) | ~ isa(v0, v1) | isa(v0, v2)) % 2.74/1.28 | (24) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | collection(v1)) % 2.74/1.28 | % 2.74/1.28 | Instantiating formula (22) with c_tptpmarriagelicensedocument and discharging atoms marriagelicensedocument(c_tptpmarriagelicensedocument), yields: % 2.74/1.28 | (25) $false % 2.74/1.28 | % 2.74/1.28 |-The branch is then unsatisfiable % 2.74/1.28 % SZS output end Proof for theBenchmark % 2.74/1.28 % 2.74/1.28 691ms %------------------------------------------------------------------------------