%------------------------------------------------------------------------------ % File : ePrincess---1.0 % Problem : CSR031+1 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : ePrincess-casc -timeout=%d %s % Computer : n018.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:20 EDT 2022 % Result : Theorem 2.30s 1.23s % Output : Proof 3.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : CSR031+1 : TPTP v8.1.0. Released v3.4.0. % 0.03/0.12 % Command : ePrincess-casc -timeout=%d %s % 0.12/0.33 % Computer : n018.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 : Sat Jun 11 03:50:40 EDT 2022 % 0.12/0.33 % CPUTime : % 0.57/0.57 ____ _ % 0.57/0.57 ___ / __ \_____(_)___ ________ __________ % 0.57/0.57 / _ \/ /_/ / ___/ / __ \/ ___/ _ \/ ___/ ___/ % 0.57/0.57 / __/ ____/ / / / / / / /__/ __(__ |__ ) % 0.57/0.57 \___/_/ /_/ /_/_/ /_/\___/\___/____/____/ % 0.57/0.57 % 0.57/0.57 A Theorem Prover for First-Order Logic % 0.57/0.57 (ePrincess v.1.0) % 0.57/0.57 % 0.57/0.57 (c) Philipp Rümmer, 2009-2015 % 0.57/0.57 (c) Peter Backeman, 2014-2015 % 0.57/0.57 (contributions by Angelo Brillout, Peter Baumgartner) % 0.57/0.57 Free software under GNU Lesser General Public License (LGPL). % 0.57/0.57 Bug reports to peter@backeman.se % 0.57/0.57 % 0.57/0.57 For more information, visit http://user.uu.se/~petba168/breu/ % 0.57/0.57 % 0.57/0.57 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.57/0.62 Prover 0: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -resolutionMethod=nonUnifying +ignoreQuantifiers -generateTriggers=all % 1.71/0.97 Prover 0: Preprocessing ... % 2.01/1.14 Prover 0: Constructing countermodel ... % 2.30/1.23 Prover 0: proved (607ms) % 2.30/1.23 % 2.30/1.23 No countermodel exists, formula is valid % 2.30/1.23 % SZS status Theorem for theBenchmark % 2.30/1.23 % 2.30/1.23 Generating proof ... found it (size 4) % 3.36/1.45 % 3.36/1.45 % SZS output start Proof for theBenchmark % 3.36/1.45 Assumed formulas after preprocessing and simplification: % 3.36/1.45 | (0) mtvisible(c_basekb) & mtvisible(c_logicaltruthmt) & mtvisible(c_corecyclmt) & mtvisible(c_universalvocabularymt) & arg2isa(c_disjointwith, c_collection) & disjointwith(c_tptptptpcol_16_8398, c_tptpcol_16_18488) & disjointwith(c_collection, c_individual) & individual(c_tptptptpcol_16_8398) & transitivebinarypredicate(c_genlmt) & genlmt(c_corecyclmt, c_logicaltruthmt) & genlmt(c_universalvocabularymt, c_corecyclmt) & ! [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) | ~ arg2isa(v0, v1) | arg2isa(v0, v2)) & ! [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] : ( ~ isa(v0, v2) | ~ isa(v0, v1) | ~ disjointwith(v1, v2)) & ! [v0] : ! [v1] : ! [v2] : ( ~ genlmt(v1, v2) | ~ genlmt(v0, v1) | genlmt(v0, v2)) & ! [v0] : ! [v1] : ( ~ mtvisible(v0) | ~ genlmt(v0, v1) | mtvisible(v1)) & ! [v0] : ! [v1] : ( ~ arg2isa(v0, v1) | relation(v0)) & ! [v0] : ! [v1] : ( ~ arg2isa(v0, v1) | collection(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] : ( ~ isa(v0, v1) | thing(v0)) & ! [v0] : ! [v1] : ( ~ isa(v0, v1) | collection(v1)) & ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0)) & ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1)) & ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0)) & ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v1)) & ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v0)) & ! [v0] : ( ~ microtheory(v0) | genlmt(v0, v0)) & ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0)) & ! [v0] : ( ~ isa(v0, c_transitivebinarypredicate) | transitivebinarypredicate(v0)) & ! [v0] : ( ~ isa(v0, c_individual) | individual(v0)) & ! [v0] : ( ~ isa(v0, c_collection) | collection(v0)) & ! [v0] : ( ~ individual(v0) | ~ collection(v0)) & ! [v0] : ( ~ individual(v0) | isa(v0, c_individual)) & ! [v0] : ( ~ collection(v0) | isa(v0, c_collection)) & ! [v0] : ( ~ transitivebinarypredicate(v0) | isa(v0, c_transitivebinarypredicate)) % 3.36/1.47 | Applying alpha-rule on (0) yields: % 3.36/1.47 | (1) disjointwith(c_tptptptpcol_16_8398, c_tptpcol_16_18488) % 3.36/1.47 | (2) mtvisible(c_universalvocabularymt) % 3.36/1.47 | (3) ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v1)) % 3.36/1.47 | (4) mtvisible(c_logicaltruthmt) % 3.36/1.47 | (5) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v1, v2) | ~ arg2isa(v0, v1) | arg2isa(v0, v2)) % 3.36/1.47 | (6) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | collection(v1)) % 3.36/1.47 | (7) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v1)) % 3.36/1.47 | (8) ! [v0] : ! [v1] : ( ~ genlmt(v0, v1) | microtheory(v0)) % 3.36/1.47 | (9) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v1, v2) | ~ isa(v0, v1) | isa(v0, v2)) % 3.36/1.47 | (10) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v0)) % 3.36/1.47 | (11) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlinverse(v0, v1) | genlinverse(v0, v2)) % 3.36/1.47 | (12) genlmt(c_universalvocabularymt, c_corecyclmt) % 3.36/1.47 | (13) transitivebinarypredicate(c_genlmt) % 3.36/1.47 | (14) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v0) | ~ disjointwith(v0, v1) | disjointwith(v2, v1)) % 3.36/1.47 | (15) ! [v0] : ( ~ microtheory(v0) | genlmt(v0, v0)) % 3.36/1.47 | (16) ! [v0] : ( ~ transitivebinarypredicate(v0) | isa(v0, c_transitivebinarypredicate)) % 3.36/1.47 | (17) ! [v0] : ( ~ isa(v0, c_transitivebinarypredicate) | transitivebinarypredicate(v0)) % 3.36/1.47 | (18) ! [v0] : ( ~ individual(v0) | ~ collection(v0)) % 3.36/1.47 | (19) ! [v0] : ! [v1] : ! [v2] : ( ~ genlmt(v1, v2) | ~ genlmt(v0, v1) | genlmt(v0, v2)) % 3.36/1.48 | (20) ! [v0] : ( ~ predicate(v0) | genlpreds(v0, v0)) % 3.36/1.48 | (21) ! [v0] : ! [v1] : ! [v2] : ( ~ genls(v2, v1) | ~ disjointwith(v0, v1) | disjointwith(v0, v2)) % 3.36/1.48 | (22) ! [v0] : ( ~ individual(v0) | isa(v0, c_individual)) % 3.36/1.48 | (23) ! [v0] : ( ~ isa(v0, c_individual) | individual(v0)) % 3.36/1.48 | (24) ! [v0] : ! [v1] : ! [v2] : ( ~ genlinverse(v1, v2) | ~ genlinverse(v0, v1) | genlpreds(v0, v2)) % 3.36/1.48 | (25) disjointwith(c_collection, c_individual) % 3.36/1.48 | (26) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v1)) % 3.36/1.48 | (27) genlmt(c_corecyclmt, c_logicaltruthmt) % 3.36/1.48 | (28) mtvisible(c_basekb) % 3.36/1.48 | (29) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v2, v0) | ~ genlinverse(v0, v1) | genlinverse(v2, v1)) % 3.36/1.48 | (30) mtvisible(c_corecyclmt) % 3.36/1.48 | (31) ! [v0] : ! [v1] : ! [v2] : ( ~ genlpreds(v1, v2) | ~ genlpreds(v0, v1) | genlpreds(v0, v2)) % 3.36/1.48 | (32) ! [v0] : ( ~ collection(v0) | isa(v0, c_collection)) % 3.36/1.48 | (33) ! [v0] : ( ~ isa(v0, c_collection) | collection(v0)) % 3.36/1.48 | (34) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | collection(v0)) % 3.36/1.48 | (35) ! [v0] : ! [v1] : ! [v2] : ( ~ isa(v0, v2) | ~ isa(v0, v1) | ~ disjointwith(v1, v2)) % 3.36/1.48 | (36) ! [v0] : ! [v1] : ( ~ disjointwith(v0, v1) | disjointwith(v1, v0)) % 3.36/1.48 | (37) ! [v0] : ! [v1] : ( ~ isa(v0, v1) | thing(v0)) % 3.36/1.48 | (38) individual(c_tptptptpcol_16_8398) % 3.36/1.48 | (39) arg2isa(c_disjointwith, c_collection) % 3.36/1.48 | (40) ! [v0] : ! [v1] : ( ~ arg2isa(v0, v1) | relation(v0)) % 3.36/1.48 | (41) ! [v0] : ! [v1] : ( ~ mtvisible(v0) | ~ genlmt(v0, v1) | mtvisible(v1)) % 3.36/1.48 | (42) ! [v0] : ! [v1] : ( ~ genlinverse(v0, v1) | binarypredicate(v0)) % 3.36/1.48 | (43) ! [v0] : ! [v1] : ( ~ genlpreds(v0, v1) | predicate(v1)) % 3.36/1.48 | (44) ! [v0] : ! [v1] : ( ~ arg2isa(v0, v1) | collection(v1)) % 3.36/1.48 | % 3.36/1.48 | Instantiating formula (34) with c_tptpcol_16_18488, c_tptptptpcol_16_8398 and discharging atoms disjointwith(c_tptptptpcol_16_8398, c_tptpcol_16_18488), yields: % 3.36/1.48 | (45) collection(c_tptptptpcol_16_8398) % 3.36/1.48 | % 3.36/1.48 | Instantiating formula (18) with c_tptptptpcol_16_8398 and discharging atoms individual(c_tptptptpcol_16_8398), collection(c_tptptptpcol_16_8398), yields: % 3.36/1.48 | (46) $false % 3.36/1.48 | % 3.36/1.48 |-The branch is then unsatisfiable % 3.36/1.48 % SZS output end Proof for theBenchmark % 3.36/1.48 % 3.36/1.48 902ms %------------------------------------------------------------------------------