%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : CSR026+1 : TPTP v8.1.2. Released v3.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n027.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 : 300s % DateTime : Wed Aug 30 21:36:27 EDT 2023 % Result : Theorem 7.96s 1.87s % Output : Proof 11.90s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : CSR026+1 : TPTP v8.1.2. Released v3.4.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.17/0.34 % Computer : n027.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Mon Aug 28 08:07:06 EDT 2023 % 0.17/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.61 Running up to 7 provers in parallel. % 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.64/1.08 Prover 1: Preprocessing ... % 2.64/1.08 Prover 4: Preprocessing ... % 3.25/1.12 Prover 3: Preprocessing ... % 3.25/1.12 Prover 6: Preprocessing ... % 3.25/1.12 Prover 5: Preprocessing ... % 3.25/1.12 Prover 0: Preprocessing ... % 3.25/1.12 Prover 2: Preprocessing ... % 5.85/1.51 Prover 2: Proving ... % 5.85/1.51 Prover 5: Proving ... % 6.39/1.59 Prover 6: Constructing countermodel ... % 6.39/1.60 Prover 3: Constructing countermodel ... % 6.39/1.62 Prover 1: Constructing countermodel ... % 7.29/1.74 Prover 0: Proving ... % 7.29/1.75 Prover 4: Constructing countermodel ... % 7.96/1.87 Prover 3: proved (1249ms) % 7.96/1.87 % 7.96/1.87 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.96/1.87 % 7.96/1.87 Prover 6: stopped % 7.96/1.87 Prover 5: stopped % 7.96/1.87 Prover 2: stopped % 8.51/1.89 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.51/1.89 Prover 0: stopped % 8.51/1.90 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.51/1.90 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.51/1.90 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.51/1.93 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.51/1.96 Prover 7: Preprocessing ... % 9.08/1.97 Prover 10: Preprocessing ... % 9.17/1.98 Prover 13: Preprocessing ... % 9.17/1.99 Prover 8: Preprocessing ... % 9.17/2.00 Prover 11: Preprocessing ... % 9.47/2.05 Prover 7: Constructing countermodel ... % 9.47/2.07 Prover 13: Warning: ignoring some quantifiers % 9.47/2.07 Prover 13: Constructing countermodel ... % 9.47/2.09 Prover 10: Constructing countermodel ... % 10.68/2.20 Prover 1: Found proof (size 71) % 10.68/2.20 Prover 1: proved (1585ms) % 10.68/2.20 Prover 13: stopped % 10.68/2.20 Prover 4: stopped % 10.68/2.20 Prover 7: stopped % 10.68/2.20 Prover 10: stopped % 10.68/2.25 Prover 8: Warning: ignoring some quantifiers % 10.68/2.26 Prover 8: Constructing countermodel ... % 10.68/2.27 Prover 8: stopped % 10.68/2.31 Prover 11: Constructing countermodel ... % 10.68/2.33 Prover 11: stopped % 10.68/2.33 % 10.68/2.33 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.68/2.33 % 10.68/2.34 % SZS output start Proof for theBenchmark % 10.68/2.35 Assumptions after simplification: % 10.68/2.35 --------------------------------- % 10.68/2.35 % 10.68/2.35 (just10) % 11.60/2.38 $i(c_runningshorts) & $i(c_tptpofobject) & $i(n_756) & % 11.60/2.38 $i(c_tptp_member2701_mt) & ? [v0: any] : ? [v1: $i] : ? [v2: any] : % 11.60/2.38 (relationallinstance(c_tptpofobject, c_runningshorts, v1) = v2 & % 11.60/2.38 mtvisible(c_tptp_member2701_mt) = v0 & f_tptpquantityfn_2(n_756) = v1 & % 11.60/2.38 $i(v1) & ( ~ (v0 = 0) | v2 = 0)) % 11.60/2.38 % 11.60/2.38 (just11) % 11.69/2.38 $i(c_tptprunningshorts) & $i(c_cyclistsmt) & ? [v0: any] : ? [v1: any] : % 11.69/2.38 (mtvisible(c_cyclistsmt) = v0 & runningshorts(c_tptprunningshorts) = v1 & ( ~ % 11.69/2.38 (v0 = 0) | v1 = 0)) % 11.69/2.38 % 11.69/2.38 (just48) % 11.69/2.39 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (mtvisible(v1) = v2) | % 11.69/2.39 ~ (mtvisible(v0) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) % 11.69/2.39 & genlmt(v0, v1) = v3)) % 11.69/2.39 % 11.69/2.39 (just5) % 11.69/2.39 genlmt(c_tptp_spindleheadmt, c_cyclistsmt) = 0 & $i(c_tptp_spindleheadmt) & % 11.69/2.39 $i(c_cyclistsmt) % 11.69/2.39 % 11.69/2.39 (just53) % 11.69/2.39 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 11.69/2.39 (genlmt(v0, v2) = v3) | ~ (genlmt(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ % 11.69/2.39 $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & genlmt(v1, v2) = v4)) % 11.69/2.39 % 11.69/2.39 (just6) % 11.69/2.39 genlmt(c_tptp_spindlecollectormt, c_tptp_member2701_mt) = 0 & % 11.69/2.39 $i(c_tptp_member2701_mt) & $i(c_tptp_spindlecollectormt) % 11.69/2.39 % 11.69/2.39 (just7) % 11.69/2.39 genlmt(c_tptp_member3993_mt, c_tptp_spindleheadmt) = 0 & % 11.69/2.39 $i(c_tptp_member3993_mt) & $i(c_tptp_spindleheadmt) % 11.69/2.39 % 11.69/2.39 (just8) % 11.69/2.39 genlmt(c_tptp_spindlecollectormt, c_tptp_member3993_mt) = 0 & % 11.69/2.39 $i(c_tptp_member3993_mt) & $i(c_tptp_spindlecollectormt) % 11.69/2.39 % 11.69/2.39 (just9) % 11.69/2.39 $i(n_756) & $i(c_tptp_member2701_mt) & ? [v0: any] : ? [v1: $i] : % 11.69/2.39 (mtvisible(c_tptp_member2701_mt) = v0 & f_tptpquantityfn_2(n_756) = v1 & % 11.69/2.39 $i(v1) & ! [v2: $i] : ! [v3: int] : ( ~ (v0 = 0) | v3 = 0 | ~ % 11.69/2.39 (tptpofobject(v2, v1) = v3) | ~ $i(v2) | ? [v4: int] : ( ~ (v4 = 0) & % 11.69/2.39 runningshorts(v2) = v4))) % 11.69/2.39 % 11.69/2.39 (query26) % 11.69/2.40 $i(c_tptprunningshorts) & $i(n_756) & $i(c_tptp_spindlecollectormt) & ? [v0: % 11.69/2.40 $i] : ? [v1: int] : ( ~ (v1 = 0) & mtvisible(c_tptp_spindlecollectormt) = 0 % 11.69/2.40 & f_tptpquantityfn_2(n_756) = v0 & tptpofobject(c_tptprunningshorts, v0) = % 11.69/2.40 v1 & $i(v0)) % 11.69/2.40 % 11.69/2.40 (function-axioms) % 11.82/2.41 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 11.82/2.41 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (natargument(v4, v3, v2) = v1) | ~ % 11.82/2.41 (natargument(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.82/2.41 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ % 11.82/2.41 (relationallinstance(v4, v3, v2) = v1) | ~ (relationallinstance(v4, v3, v2) % 11.82/2.41 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 11.82/2.41 $i] : ! [v3: $i] : (v1 = v0 | ~ (natfunction(v3, v2) = v1) | ~ % 11.82/2.41 (natfunction(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.82/2.41 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (genls(v3, % 11.82/2.41 v2) = v1) | ~ (genls(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 11.82/2.41 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.82/2.41 (genlinverse(v3, v2) = v1) | ~ (genlinverse(v3, v2) = v0)) & ! [v0: % 11.82/2.41 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 11.82/2.41 : (v1 = v0 | ~ (genlpreds(v3, v2) = v1) | ~ (genlpreds(v3, v2) = v0)) & ! % 11.82/2.41 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 11.82/2.41 $i] : (v1 = v0 | ~ (disjointwith(v3, v2) = v1) | ~ (disjointwith(v3, v2) = % 11.82/2.41 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 11.82/2.41 $i] : ! [v3: $i] : (v1 = v0 | ~ (isa(v3, v2) = v1) | ~ (isa(v3, v2) = % 11.82/2.41 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 11.82/2.41 $i] : ! [v3: $i] : (v1 = v0 | ~ (tptpofobject(v3, v2) = v1) | ~ % 11.82/2.41 (tptpofobject(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.82/2.41 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (genlmt(v3, % 11.82/2.41 v2) = v1) | ~ (genlmt(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 11.82/2.41 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (microtheory(v2) = v1) | % 11.82/2.41 ~ (microtheory(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.82/2.41 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (thing(v2) = v1) | ~ % 11.82/2.41 (thing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] % 11.82/2.41 : ! [v2: $i] : (v1 = v0 | ~ (partiallytangible(v2) = v1) | ~ % 11.82/2.41 (partiallytangible(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.82/2.41 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (tptpquantity(v2) = v1) | % 11.82/2.41 ~ (tptpquantity(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.82/2.41 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (collection(v2) = v1) | ~ % 11.82/2.41 (collection(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.82/2.41 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (binarypredicate(v2) = v1) % 11.82/2.41 | ~ (binarypredicate(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.82/2.41 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (predicate(v2) = v1) | ~ % 11.82/2.41 (predicate(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.82/2.41 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (mtvisible(v2) = v1) | ~ % 11.82/2.41 (mtvisible(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | % 11.82/2.41 ~ (f_tptpquantityfn_2(v2) = v1) | ~ (f_tptpquantityfn_2(v2) = v0)) & ! % 11.82/2.41 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 % 11.82/2.41 | ~ (runningshorts(v2) = v1) | ~ (runningshorts(v2) = v0)) & ! [v0: % 11.82/2.41 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 11.82/2.41 ~ (transitivebinarypredicate(v2) = v1) | ~ (transitivebinarypredicate(v2) = % 11.82/2.41 v0)) % 11.82/2.41 % 11.82/2.41 Further assumptions not needed in the proof: % 11.82/2.41 -------------------------------------------- % 11.82/2.41 just1, just12, just13, just14, just15, just16, just17, just18, just19, just2, % 11.82/2.41 just20, just21, just22, just23, just24, just25, just26, just27, just28, just29, % 11.82/2.41 just3, just30, just31, just32, just33, just34, just35, just36, just37, just38, % 11.82/2.41 just39, just4, just40, just41, just42, just43, just44, just45, just46, just47, % 11.82/2.41 just49, just50, just51, just52, just54, just55, just56 % 11.82/2.41 % 11.82/2.41 Those formulas are unsatisfiable: % 11.82/2.41 --------------------------------- % 11.82/2.41 % 11.82/2.41 Begin of proof % 11.82/2.41 | % 11.82/2.42 | ALPHA: (just5) implies: % 11.82/2.42 | (1) genlmt(c_tptp_spindleheadmt, c_cyclistsmt) = 0 % 11.82/2.42 | % 11.82/2.42 | ALPHA: (just6) implies: % 11.82/2.42 | (2) genlmt(c_tptp_spindlecollectormt, c_tptp_member2701_mt) = 0 % 11.82/2.42 | % 11.82/2.42 | ALPHA: (just7) implies: % 11.82/2.42 | (3) $i(c_tptp_spindleheadmt) % 11.82/2.42 | (4) genlmt(c_tptp_member3993_mt, c_tptp_spindleheadmt) = 0 % 11.82/2.42 | % 11.82/2.42 | ALPHA: (just8) implies: % 11.82/2.42 | (5) $i(c_tptp_member3993_mt) % 11.82/2.42 | (6) genlmt(c_tptp_spindlecollectormt, c_tptp_member3993_mt) = 0 % 11.82/2.42 | % 11.82/2.42 | ALPHA: (just9) implies: % 11.82/2.42 | (7) ? [v0: any] : ? [v1: $i] : (mtvisible(c_tptp_member2701_mt) = v0 & % 11.82/2.42 | f_tptpquantityfn_2(n_756) = v1 & $i(v1) & ! [v2: $i] : ! [v3: int] % 11.82/2.42 | : ( ~ (v0 = 0) | v3 = 0 | ~ (tptpofobject(v2, v1) = v3) | ~ $i(v2) % 11.82/2.42 | | ? [v4: int] : ( ~ (v4 = 0) & runningshorts(v2) = v4))) % 11.82/2.42 | % 11.82/2.42 | ALPHA: (just10) implies: % 11.82/2.42 | (8) $i(c_tptp_member2701_mt) % 11.82/2.42 | (9) ? [v0: any] : ? [v1: $i] : ? [v2: any] : % 11.82/2.42 | (relationallinstance(c_tptpofobject, c_runningshorts, v1) = v2 & % 11.82/2.42 | mtvisible(c_tptp_member2701_mt) = v0 & f_tptpquantityfn_2(n_756) = v1 % 11.82/2.42 | & $i(v1) & ( ~ (v0 = 0) | v2 = 0)) % 11.82/2.42 | % 11.82/2.42 | ALPHA: (just11) implies: % 11.82/2.42 | (10) $i(c_cyclistsmt) % 11.82/2.42 | (11) ? [v0: any] : ? [v1: any] : (mtvisible(c_cyclistsmt) = v0 & % 11.82/2.42 | runningshorts(c_tptprunningshorts) = v1 & ( ~ (v0 = 0) | v1 = 0)) % 11.82/2.42 | % 11.82/2.42 | ALPHA: (query26) implies: % 11.90/2.42 | (12) $i(c_tptp_spindlecollectormt) % 11.90/2.42 | (13) $i(c_tptprunningshorts) % 11.90/2.42 | (14) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & % 11.90/2.42 | mtvisible(c_tptp_spindlecollectormt) = 0 & f_tptpquantityfn_2(n_756) % 11.90/2.42 | = v0 & tptpofobject(c_tptprunningshorts, v0) = v1 & $i(v0)) % 11.90/2.42 | % 11.90/2.42 | ALPHA: (function-axioms) implies: % 11.90/2.43 | (15) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 11.90/2.43 | : (v1 = v0 | ~ (runningshorts(v2) = v1) | ~ (runningshorts(v2) = % 11.90/2.43 | v0)) % 11.90/2.43 | (16) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 11.90/2.43 | (f_tptpquantityfn_2(v2) = v1) | ~ (f_tptpquantityfn_2(v2) = v0)) % 11.90/2.43 | (17) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 11.90/2.43 | : (v1 = v0 | ~ (mtvisible(v2) = v1) | ~ (mtvisible(v2) = v0)) % 11.90/2.43 | (18) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 11.90/2.43 | : ! [v3: $i] : (v1 = v0 | ~ (genlmt(v3, v2) = v1) | ~ (genlmt(v3, % 11.90/2.43 | v2) = v0)) % 11.90/2.43 | % 11.90/2.43 | DELTA: instantiating (11) with fresh symbols all_47_0, all_47_1 gives: % 11.90/2.43 | (19) mtvisible(c_cyclistsmt) = all_47_1 & % 11.90/2.43 | runningshorts(c_tptprunningshorts) = all_47_0 & ( ~ (all_47_1 = 0) | % 11.90/2.43 | all_47_0 = 0) % 11.90/2.43 | % 11.90/2.43 | ALPHA: (19) implies: % 11.90/2.43 | (20) runningshorts(c_tptprunningshorts) = all_47_0 % 11.90/2.43 | (21) mtvisible(c_cyclistsmt) = all_47_1 % 11.90/2.43 | (22) ~ (all_47_1 = 0) | all_47_0 = 0 % 11.90/2.43 | % 11.90/2.43 | DELTA: instantiating (14) with fresh symbols all_49_0, all_49_1 gives: % 11.90/2.43 | (23) ~ (all_49_0 = 0) & mtvisible(c_tptp_spindlecollectormt) = 0 & % 11.90/2.43 | f_tptpquantityfn_2(n_756) = all_49_1 & % 11.90/2.43 | tptpofobject(c_tptprunningshorts, all_49_1) = all_49_0 & $i(all_49_1) % 11.90/2.43 | % 11.90/2.43 | ALPHA: (23) implies: % 11.90/2.43 | (24) ~ (all_49_0 = 0) % 11.90/2.43 | (25) tptpofobject(c_tptprunningshorts, all_49_1) = all_49_0 % 11.90/2.43 | (26) f_tptpquantityfn_2(n_756) = all_49_1 % 11.90/2.43 | (27) mtvisible(c_tptp_spindlecollectormt) = 0 % 11.90/2.43 | % 11.90/2.43 | DELTA: instantiating (9) with fresh symbols all_51_0, all_51_1, all_51_2 % 11.90/2.43 | gives: % 11.90/2.43 | (28) relationallinstance(c_tptpofobject, c_runningshorts, all_51_1) = % 11.90/2.43 | all_51_0 & mtvisible(c_tptp_member2701_mt) = all_51_2 & % 11.90/2.43 | f_tptpquantityfn_2(n_756) = all_51_1 & $i(all_51_1) & ( ~ (all_51_2 = % 11.90/2.43 | 0) | all_51_0 = 0) % 11.90/2.43 | % 11.90/2.43 | ALPHA: (28) implies: % 11.90/2.43 | (29) mtvisible(c_tptp_member2701_mt) = all_51_2 % 11.90/2.43 | % 11.90/2.43 | DELTA: instantiating (7) with fresh symbols all_53_0, all_53_1 gives: % 11.90/2.43 | (30) mtvisible(c_tptp_member2701_mt) = all_53_1 & f_tptpquantityfn_2(n_756) % 11.90/2.43 | = all_53_0 & $i(all_53_0) & ! [v0: $i] : ! [v1: int] : ( ~ (all_53_1 % 11.90/2.43 | = 0) | v1 = 0 | ~ (tptpofobject(v0, all_53_0) = v1) | ~ $i(v0) | % 11.90/2.43 | ? [v2: int] : ( ~ (v2 = 0) & runningshorts(v0) = v2)) % 11.90/2.43 | % 11.90/2.43 | ALPHA: (30) implies: % 11.90/2.43 | (31) f_tptpquantityfn_2(n_756) = all_53_0 % 11.90/2.44 | (32) mtvisible(c_tptp_member2701_mt) = all_53_1 % 11.90/2.44 | (33) ! [v0: $i] : ! [v1: int] : ( ~ (all_53_1 = 0) | v1 = 0 | ~ % 11.90/2.44 | (tptpofobject(v0, all_53_0) = v1) | ~ $i(v0) | ? [v2: int] : ( ~ % 11.90/2.44 | (v2 = 0) & runningshorts(v0) = v2)) % 11.90/2.44 | % 11.90/2.44 | GROUND_INST: instantiating (16) with all_49_1, all_53_0, n_756, simplifying % 11.90/2.44 | with (26), (31) gives: % 11.90/2.44 | (34) all_53_0 = all_49_1 % 11.90/2.44 | % 11.90/2.44 | GROUND_INST: instantiating (17) with all_51_2, all_53_1, c_tptp_member2701_mt, % 11.90/2.44 | simplifying with (29), (32) gives: % 11.90/2.44 | (35) all_53_1 = all_51_2 % 11.90/2.44 | % 11.90/2.44 | GROUND_INST: instantiating (just48) with c_tptp_spindlecollectormt, % 11.90/2.44 | c_cyclistsmt, all_47_1, simplifying with (10), (12), (21), (27) % 11.90/2.44 | gives: % 11.90/2.44 | (36) all_47_1 = 0 | ? [v0: int] : ( ~ (v0 = 0) & % 11.90/2.44 | genlmt(c_tptp_spindlecollectormt, c_cyclistsmt) = v0) % 11.90/2.44 | % 11.90/2.44 | GROUND_INST: instantiating (just48) with c_tptp_spindlecollectormt, % 11.90/2.44 | c_tptp_member2701_mt, all_51_2, simplifying with (8), (12), (27), % 11.90/2.44 | (29) gives: % 11.90/2.44 | (37) all_51_2 = 0 | ? [v0: int] : ( ~ (v0 = 0) & % 11.90/2.44 | genlmt(c_tptp_spindlecollectormt, c_tptp_member2701_mt) = v0) % 11.90/2.44 | % 11.90/2.44 | BETA: splitting (37) gives: % 11.90/2.44 | % 11.90/2.44 | Case 1: % 11.90/2.44 | | % 11.90/2.44 | | (38) all_51_2 = 0 % 11.90/2.44 | | % 11.90/2.44 | | COMBINE_EQS: (35), (38) imply: % 11.90/2.44 | | (39) all_53_1 = 0 % 11.90/2.44 | | % 11.90/2.44 | | BETA: splitting (22) gives: % 11.90/2.44 | | % 11.90/2.44 | | Case 1: % 11.90/2.44 | | | % 11.90/2.44 | | | (40) ~ (all_47_1 = 0) % 11.90/2.44 | | | % 11.90/2.44 | | | BETA: splitting (36) gives: % 11.90/2.44 | | | % 11.90/2.44 | | | Case 1: % 11.90/2.44 | | | | % 11.90/2.44 | | | | (41) all_47_1 = 0 % 11.90/2.44 | | | | % 11.90/2.44 | | | | REDUCE: (40), (41) imply: % 11.90/2.44 | | | | (42) $false % 11.90/2.44 | | | | % 11.90/2.44 | | | | CLOSE: (42) is inconsistent. % 11.90/2.44 | | | | % 11.90/2.44 | | | Case 2: % 11.90/2.44 | | | | % 11.90/2.44 | | | | (43) ? [v0: int] : ( ~ (v0 = 0) & genlmt(c_tptp_spindlecollectormt, % 11.90/2.44 | | | | c_cyclistsmt) = v0) % 11.90/2.44 | | | | % 11.90/2.44 | | | | DELTA: instantiating (43) with fresh symbol all_96_0 gives: % 11.90/2.44 | | | | (44) ~ (all_96_0 = 0) & genlmt(c_tptp_spindlecollectormt, % 11.90/2.44 | | | | c_cyclistsmt) = all_96_0 % 11.90/2.44 | | | | % 11.90/2.44 | | | | ALPHA: (44) implies: % 11.90/2.44 | | | | (45) ~ (all_96_0 = 0) % 11.90/2.44 | | | | (46) genlmt(c_tptp_spindlecollectormt, c_cyclistsmt) = all_96_0 % 11.90/2.44 | | | | % 11.90/2.44 | | | | GROUND_INST: instantiating (just53) with c_tptp_spindlecollectormt, % 11.90/2.44 | | | | c_tptp_member3993_mt, c_cyclistsmt, all_96_0, simplifying % 11.90/2.44 | | | | with (5), (6), (10), (12), (46) gives: % 11.90/2.45 | | | | (47) all_96_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & % 11.90/2.45 | | | | genlmt(c_tptp_member3993_mt, c_cyclistsmt) = v0) % 11.90/2.45 | | | | % 11.90/2.45 | | | | BETA: splitting (47) gives: % 11.90/2.45 | | | | % 11.90/2.45 | | | | Case 1: % 11.90/2.45 | | | | | % 11.90/2.45 | | | | | (48) all_96_0 = 0 % 11.90/2.45 | | | | | % 11.90/2.45 | | | | | REDUCE: (45), (48) imply: % 11.90/2.45 | | | | | (49) $false % 11.90/2.45 | | | | | % 11.90/2.45 | | | | | CLOSE: (49) is inconsistent. % 11.90/2.45 | | | | | % 11.90/2.45 | | | | Case 2: % 11.90/2.45 | | | | | % 11.90/2.45 | | | | | (50) ? [v0: int] : ( ~ (v0 = 0) & genlmt(c_tptp_member3993_mt, % 11.90/2.45 | | | | | c_cyclistsmt) = v0) % 11.90/2.45 | | | | | % 11.90/2.45 | | | | | DELTA: instantiating (50) with fresh symbol all_115_0 gives: % 11.90/2.45 | | | | | (51) ~ (all_115_0 = 0) & genlmt(c_tptp_member3993_mt, % 11.90/2.45 | | | | | c_cyclistsmt) = all_115_0 % 11.90/2.45 | | | | | % 11.90/2.45 | | | | | ALPHA: (51) implies: % 11.90/2.45 | | | | | (52) ~ (all_115_0 = 0) % 11.90/2.45 | | | | | (53) genlmt(c_tptp_member3993_mt, c_cyclistsmt) = all_115_0 % 11.90/2.45 | | | | | % 11.90/2.45 | | | | | GROUND_INST: instantiating (just53) with c_tptp_member3993_mt, % 11.90/2.45 | | | | | c_tptp_spindleheadmt, c_cyclistsmt, all_115_0, % 11.90/2.45 | | | | | simplifying with (3), (4), (5), (10), (53) gives: % 11.90/2.45 | | | | | (54) all_115_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & % 11.90/2.45 | | | | | genlmt(c_tptp_spindleheadmt, c_cyclistsmt) = v0) % 11.90/2.45 | | | | | % 11.90/2.45 | | | | | BETA: splitting (54) gives: % 11.90/2.45 | | | | | % 11.90/2.45 | | | | | Case 1: % 11.90/2.45 | | | | | | % 11.90/2.45 | | | | | | (55) all_115_0 = 0 % 11.90/2.45 | | | | | | % 11.90/2.45 | | | | | | REDUCE: (52), (55) imply: % 11.90/2.45 | | | | | | (56) $false % 11.90/2.45 | | | | | | % 11.90/2.45 | | | | | | CLOSE: (56) is inconsistent. % 11.90/2.45 | | | | | | % 11.90/2.45 | | | | | Case 2: % 11.90/2.45 | | | | | | % 11.90/2.45 | | | | | | (57) ? [v0: int] : ( ~ (v0 = 0) & genlmt(c_tptp_spindleheadmt, % 11.90/2.45 | | | | | | c_cyclistsmt) = v0) % 11.90/2.45 | | | | | | % 11.90/2.45 | | | | | | DELTA: instantiating (57) with fresh symbol all_124_0 gives: % 11.90/2.45 | | | | | | (58) ~ (all_124_0 = 0) & genlmt(c_tptp_spindleheadmt, % 11.90/2.45 | | | | | | c_cyclistsmt) = all_124_0 % 11.90/2.45 | | | | | | % 11.90/2.45 | | | | | | ALPHA: (58) implies: % 11.90/2.45 | | | | | | (59) ~ (all_124_0 = 0) % 11.90/2.45 | | | | | | (60) genlmt(c_tptp_spindleheadmt, c_cyclistsmt) = all_124_0 % 11.90/2.45 | | | | | | % 11.90/2.45 | | | | | | GROUND_INST: instantiating (18) with 0, all_124_0, c_cyclistsmt, % 11.90/2.45 | | | | | | c_tptp_spindleheadmt, simplifying with (1), (60) gives: % 11.90/2.45 | | | | | | (61) all_124_0 = 0 % 11.90/2.45 | | | | | | % 11.90/2.45 | | | | | | REDUCE: (59), (61) imply: % 11.90/2.45 | | | | | | (62) $false % 11.90/2.45 | | | | | | % 11.90/2.45 | | | | | | CLOSE: (62) is inconsistent. % 11.90/2.45 | | | | | | % 11.90/2.45 | | | | | End of split % 11.90/2.45 | | | | | % 11.90/2.45 | | | | End of split % 11.90/2.45 | | | | % 11.90/2.45 | | | End of split % 11.90/2.45 | | | % 11.90/2.45 | | Case 2: % 11.90/2.45 | | | % 11.90/2.45 | | | (63) all_47_0 = 0 % 11.90/2.45 | | | % 11.90/2.45 | | | REDUCE: (20), (63) imply: % 11.90/2.45 | | | (64) runningshorts(c_tptprunningshorts) = 0 % 11.90/2.45 | | | % 11.90/2.45 | | | GROUND_INST: instantiating (33) with c_tptprunningshorts, all_49_0, % 11.90/2.45 | | | simplifying with (13) gives: % 11.90/2.45 | | | (65) ~ (all_53_1 = 0) | all_49_0 = 0 | ~ % 11.90/2.45 | | | (tptpofobject(c_tptprunningshorts, all_53_0) = all_49_0) | ? [v0: % 11.90/2.45 | | | int] : ( ~ (v0 = 0) & runningshorts(c_tptprunningshorts) = v0) % 11.90/2.45 | | | % 11.90/2.45 | | | BETA: splitting (65) gives: % 11.90/2.45 | | | % 11.90/2.45 | | | Case 1: % 11.90/2.45 | | | | % 11.90/2.45 | | | | (66) ~ (tptpofobject(c_tptprunningshorts, all_53_0) = all_49_0) % 11.90/2.45 | | | | % 11.90/2.45 | | | | REDUCE: (34), (66) imply: % 11.90/2.45 | | | | (67) ~ (tptpofobject(c_tptprunningshorts, all_49_1) = all_49_0) % 11.90/2.45 | | | | % 11.90/2.45 | | | | PRED_UNIFY: (25), (67) imply: % 11.90/2.45 | | | | (68) $false % 11.90/2.45 | | | | % 11.90/2.45 | | | | CLOSE: (68) is inconsistent. % 11.90/2.45 | | | | % 11.90/2.45 | | | Case 2: % 11.90/2.45 | | | | % 11.90/2.46 | | | | (69) ~ (all_53_1 = 0) | all_49_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & % 11.90/2.46 | | | | runningshorts(c_tptprunningshorts) = v0) % 11.90/2.46 | | | | % 11.90/2.46 | | | | BETA: splitting (69) gives: % 11.90/2.46 | | | | % 11.90/2.46 | | | | Case 1: % 11.90/2.46 | | | | | % 11.90/2.46 | | | | | (70) ~ (all_53_1 = 0) % 11.90/2.46 | | | | | % 11.90/2.46 | | | | | REDUCE: (39), (70) imply: % 11.90/2.46 | | | | | (71) $false % 11.90/2.46 | | | | | % 11.90/2.46 | | | | | CLOSE: (71) is inconsistent. % 11.90/2.46 | | | | | % 11.90/2.46 | | | | Case 2: % 11.90/2.46 | | | | | % 11.90/2.46 | | | | | (72) all_49_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & % 11.90/2.46 | | | | | runningshorts(c_tptprunningshorts) = v0) % 11.90/2.46 | | | | | % 11.90/2.46 | | | | | BETA: splitting (72) gives: % 11.90/2.46 | | | | | % 11.90/2.46 | | | | | Case 1: % 11.90/2.46 | | | | | | % 11.90/2.46 | | | | | | (73) all_49_0 = 0 % 11.90/2.46 | | | | | | % 11.90/2.46 | | | | | | REDUCE: (24), (73) imply: % 11.90/2.46 | | | | | | (74) $false % 11.90/2.46 | | | | | | % 11.90/2.46 | | | | | | CLOSE: (74) is inconsistent. % 11.90/2.46 | | | | | | % 11.90/2.46 | | | | | Case 2: % 11.90/2.46 | | | | | | % 11.90/2.46 | | | | | | (75) ? [v0: int] : ( ~ (v0 = 0) & % 11.90/2.46 | | | | | | runningshorts(c_tptprunningshorts) = v0) % 11.90/2.46 | | | | | | % 11.90/2.46 | | | | | | DELTA: instantiating (75) with fresh symbol all_110_0 gives: % 11.90/2.46 | | | | | | (76) ~ (all_110_0 = 0) & runningshorts(c_tptprunningshorts) = % 11.90/2.46 | | | | | | all_110_0 % 11.90/2.46 | | | | | | % 11.90/2.46 | | | | | | ALPHA: (76) implies: % 11.90/2.46 | | | | | | (77) ~ (all_110_0 = 0) % 11.90/2.46 | | | | | | (78) runningshorts(c_tptprunningshorts) = all_110_0 % 11.90/2.46 | | | | | | % 11.90/2.46 | | | | | | GROUND_INST: instantiating (15) with 0, all_110_0, % 11.90/2.46 | | | | | | c_tptprunningshorts, simplifying with (64), (78) gives: % 11.90/2.46 | | | | | | (79) all_110_0 = 0 % 11.90/2.46 | | | | | | % 11.90/2.46 | | | | | | REDUCE: (77), (79) imply: % 11.90/2.46 | | | | | | (80) $false % 11.90/2.46 | | | | | | % 11.90/2.46 | | | | | | CLOSE: (80) is inconsistent. % 11.90/2.46 | | | | | | % 11.90/2.46 | | | | | End of split % 11.90/2.46 | | | | | % 11.90/2.46 | | | | End of split % 11.90/2.46 | | | | % 11.90/2.46 | | | End of split % 11.90/2.46 | | | % 11.90/2.46 | | End of split % 11.90/2.46 | | % 11.90/2.46 | Case 2: % 11.90/2.46 | | % 11.90/2.46 | | (81) ? [v0: int] : ( ~ (v0 = 0) & genlmt(c_tptp_spindlecollectormt, % 11.90/2.46 | | c_tptp_member2701_mt) = v0) % 11.90/2.46 | | % 11.90/2.46 | | DELTA: instantiating (81) with fresh symbol all_70_0 gives: % 11.90/2.46 | | (82) ~ (all_70_0 = 0) & genlmt(c_tptp_spindlecollectormt, % 11.90/2.46 | | c_tptp_member2701_mt) = all_70_0 % 11.90/2.46 | | % 11.90/2.46 | | ALPHA: (82) implies: % 11.90/2.46 | | (83) ~ (all_70_0 = 0) % 11.90/2.46 | | (84) genlmt(c_tptp_spindlecollectormt, c_tptp_member2701_mt) = all_70_0 % 11.90/2.46 | | % 11.90/2.46 | | GROUND_INST: instantiating (18) with 0, all_70_0, c_tptp_member2701_mt, % 11.90/2.46 | | c_tptp_spindlecollectormt, simplifying with (2), (84) gives: % 11.90/2.46 | | (85) all_70_0 = 0 % 11.90/2.46 | | % 11.90/2.46 | | REDUCE: (83), (85) imply: % 11.90/2.46 | | (86) $false % 11.90/2.46 | | % 11.90/2.46 | | CLOSE: (86) is inconsistent. % 11.90/2.46 | | % 11.90/2.46 | End of split % 11.90/2.46 | % 11.90/2.46 End of proof % 11.90/2.46 % SZS output end Proof for theBenchmark % 11.90/2.46 % 11.90/2.46 1865ms %------------------------------------------------------------------------------