TSTP Solution File: CSR062+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : CSR062+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 : n020.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:37:02 EDT 2023
% Result : Theorem 11.75s 2.44s
% Output : Proof 14.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.16 % Problem : CSR062+1 : TPTP v8.1.2. Released v3.4.0.
% 0.11/0.17 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.38 % Computer : n020.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8042.1875MB
% 0.12/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Aug 28 07:10:59 EDT 2023
% 0.12/0.38 % CPUTime :
% 0.20/0.69 ________ _____
% 0.20/0.69 ___ __ \_________(_)________________________________
% 0.20/0.69 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.69 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.69 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.69
% 0.20/0.69 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.69 (2023-06-19)
% 0.20/0.69
% 0.20/0.69 (c) Philipp Rümmer, 2009-2023
% 0.20/0.69 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.69 Amanda Stjerna.
% 0.20/0.69 Free software under BSD-3-Clause.
% 0.20/0.69
% 0.20/0.69 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.69
% 0.20/0.69 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.70 Running up to 7 provers in parallel.
% 0.20/0.72 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.72 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.72 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.72 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.72 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.72 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.72 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.94/1.23 Prover 1: Preprocessing ...
% 2.94/1.23 Prover 4: Preprocessing ...
% 3.49/1.29 Prover 3: Preprocessing ...
% 3.49/1.29 Prover 0: Preprocessing ...
% 3.49/1.29 Prover 6: Preprocessing ...
% 3.49/1.29 Prover 5: Preprocessing ...
% 3.49/1.29 Prover 2: Preprocessing ...
% 5.58/1.63 Prover 2: Constructing countermodel ...
% 6.11/1.65 Prover 5: Proving ...
% 6.82/1.78 Prover 3: Warning: ignoring some quantifiers
% 6.82/1.80 Prover 3: Constructing countermodel ...
% 6.82/1.80 Prover 6: Proving ...
% 6.82/1.82 Prover 1: Warning: ignoring some quantifiers
% 7.79/1.90 Prover 1: Constructing countermodel ...
% 8.35/1.95 Prover 0: Proving ...
% 8.35/1.98 Prover 4: Constructing countermodel ...
% 10.53/2.31 Prover 3: gave up
% 10.53/2.32 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 11.07/2.37 Prover 7: Preprocessing ...
% 11.29/2.37 Prover 1: gave up
% 11.29/2.38 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 11.75/2.44 Prover 0: proved (1736ms)
% 11.75/2.44
% 11.75/2.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.75/2.44
% 11.75/2.45 Prover 2: stopped
% 11.75/2.45 Prover 5: stopped
% 11.75/2.45 Prover 6: stopped
% 11.75/2.45 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 11.75/2.45 Prover 8: Preprocessing ...
% 11.75/2.45 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 11.75/2.45 Prover 7: Constructing countermodel ...
% 11.75/2.45 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 11.75/2.45 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 11.97/2.50 Prover 16: Preprocessing ...
% 11.97/2.51 Prover 13: Preprocessing ...
% 11.97/2.51 Prover 11: Preprocessing ...
% 12.51/2.53 Prover 10: Preprocessing ...
% 12.51/2.56 Prover 16: Constructing countermodel ...
% 12.83/2.60 Prover 10: Constructing countermodel ...
% 12.83/2.61 Prover 4: Found proof (size 45)
% 12.83/2.61 Prover 4: proved (1904ms)
% 12.83/2.61 Prover 13: Constructing countermodel ...
% 12.83/2.62 Prover 7: stopped
% 12.83/2.62 Prover 16: stopped
% 12.83/2.62 Prover 13: stopped
% 12.83/2.63 Prover 10: stopped
% 12.83/2.64 Prover 8: Warning: ignoring some quantifiers
% 12.83/2.65 Prover 8: Constructing countermodel ...
% 12.83/2.66 Prover 8: stopped
% 12.83/2.74 Prover 11: Constructing countermodel ...
% 12.83/2.75 Prover 11: stopped
% 12.83/2.75
% 12.83/2.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.83/2.75
% 13.94/2.76 % SZS output start Proof for theBenchmark
% 13.94/2.77 Assumptions after simplification:
% 13.94/2.77 ---------------------------------
% 13.94/2.77
% 13.94/2.77 (just11)
% 14.11/2.79 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (tptptypes_7_389(v0,
% 14.11/2.79 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) &
% 14.11/2.79 tptptypes_8_390(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( ~
% 14.11/2.79 (tptptypes_8_390(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | tptptypes_7_389(v0,
% 14.11/2.79 v1) = 0)
% 14.11/2.79
% 14.11/2.79 (just12)
% 14.11/2.79 genlmt(c_tptp_spindleheadmt, c_cyclistsmt) = 0 & $i(c_tptp_spindleheadmt) &
% 14.11/2.79 $i(c_cyclistsmt)
% 14.11/2.79
% 14.11/2.79 (just13)
% 14.11/2.80 genlmt(c_tptp_member3205_mt, c_tptp_spindleheadmt) = 0 &
% 14.11/2.80 $i(c_tptp_member3205_mt) & $i(c_tptp_spindleheadmt)
% 14.11/2.80
% 14.11/2.80 (just14)
% 14.11/2.80 $i(c_tptpcol_15_4027) & $i(c_pushingwithfingers) & $i(c_cyclistsmt) & ? [v0:
% 14.11/2.80 any] : ? [v1: any] : (mtvisible(c_cyclistsmt) = v0 &
% 14.11/2.80 tptptypes_8_390(c_pushingwithfingers, c_tptpcol_15_4027) = v1 & ( ~ (v0 = 0)
% 14.11/2.80 | v1 = 0))
% 14.11/2.80
% 14.11/2.80 (just23)
% 14.11/2.80 $i(c_tptpcol_15_4027) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (isa(v0,
% 14.11/2.80 c_tptpcol_15_4027) = v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) &
% 14.11/2.80 tptpcol_15_4027(v0) = v2)) & ! [v0: $i] : ( ~ (tptpcol_15_4027(v0) = 0) |
% 14.11/2.80 ~ $i(v0) | isa(v0, c_tptpcol_15_4027) = 0)
% 14.11/2.80
% 14.11/2.80 (just4)
% 14.11/2.80 genlmt(c_cyclistsmt, c_calendarsmt) = 0 & $i(c_cyclistsmt) & $i(c_calendarsmt)
% 14.11/2.80
% 14.11/2.80 (just53)
% 14.11/2.80 ! [v0: $i] : ! [v1: $i] : ( ~ (genlmt(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) |
% 14.11/2.80 ? [v2: any] : ? [v3: any] : (mtvisible(v1) = v3 & mtvisible(v0) = v2 & ( ~
% 14.11/2.80 (v2 = 0) | v3 = 0)))
% 14.11/2.80
% 14.11/2.80 (just7)
% 14.11/2.80 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (tptptypes_5_387(v0,
% 14.11/2.80 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) &
% 14.11/2.80 tptptypes_6_388(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( ~
% 14.11/2.80 (tptptypes_6_388(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | tptptypes_5_387(v0,
% 14.11/2.80 v1) = 0)
% 14.11/2.80
% 14.11/2.80 (just9)
% 14.11/2.81 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (tptptypes_6_388(v1,
% 14.11/2.81 v0) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) &
% 14.11/2.81 tptptypes_7_389(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( ~
% 14.11/2.81 (tptptypes_7_389(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | tptptypes_6_388(v1,
% 14.11/2.81 v0) = 0)
% 14.11/2.81
% 14.11/2.81 (query62)
% 14.11/2.81 mtvisible(c_tptp_member3205_mt) = 0 & $i(c_pushingwithfingers) &
% 14.11/2.81 $i(c_tptp_member3205_mt) & ! [v0: $i] : ( ~ (tptptypes_5_387(v0,
% 14.11/2.81 c_pushingwithfingers) = 0) | ~ $i(v0))
% 14.11/2.81
% 14.11/2.81 (function-axioms)
% 14.11/2.82 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 14.11/2.82 [v3: $i] : (v1 = v0 | ~ (genls(v3, v2) = v1) | ~ (genls(v3, v2) = v0)) & !
% 14.11/2.82 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 14.11/2.82 $i] : (v1 = v0 | ~ (disjointwith(v3, v2) = v1) | ~ (disjointwith(v3, v2) =
% 14.11/2.82 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 14.11/2.82 $i] : ! [v3: $i] : (v1 = v0 | ~ (isa(v3, v2) = v1) | ~ (isa(v3, v2) =
% 14.11/2.82 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 14.11/2.82 $i] : ! [v3: $i] : (v1 = v0 | ~ (tptptypes_8_390(v3, v2) = v1) | ~
% 14.11/2.82 (tptptypes_8_390(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 14.11/2.82 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 14.11/2.82 (tptptypes_7_389(v3, v2) = v1) | ~ (tptptypes_7_389(v3, v2) = v0)) & !
% 14.11/2.82 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 14.11/2.82 $i] : (v1 = v0 | ~ (genlinverse(v3, v2) = v1) | ~ (genlinverse(v3, v2) =
% 14.11/2.82 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 14.11/2.82 $i] : ! [v3: $i] : (v1 = v0 | ~ (tptptypes_5_387(v3, v2) = v1) | ~
% 14.11/2.82 (tptptypes_5_387(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 14.11/2.82 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 14.11/2.82 (tptptypes_6_388(v3, v2) = v1) | ~ (tptptypes_6_388(v3, v2) = v0)) & !
% 14.11/2.82 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 14.11/2.82 $i] : (v1 = v0 | ~ (genlpreds(v3, v2) = v1) | ~ (genlpreds(v3, v2) = v0))
% 14.11/2.82 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 14.11/2.82 [v3: $i] : (v1 = v0 | ~ (genlmt(v3, v2) = v1) | ~ (genlmt(v3, v2) = v0)) &
% 14.11/2.82 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 =
% 14.11/2.82 v0 | ~ (microtheory(v2) = v1) | ~ (microtheory(v2) = v0)) & ! [v0:
% 14.11/2.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 14.11/2.82 ~ (thing(v2) = v1) | ~ (thing(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 14.11/2.82 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (predicate(v2) = v1) |
% 14.11/2.82 ~ (predicate(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 14.11/2.82 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (binarypredicate(v2) = v1)
% 14.11/2.82 | ~ (binarypredicate(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 14.11/2.82 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (firstordercollection(v2) =
% 14.11/2.82 v1) | ~ (firstordercollection(v2) = v0)) & ! [v0: MultipleValueBool] :
% 14.11/2.82 ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~
% 14.11/2.82 (pushingwithfingers(v2) = v1) | ~ (pushingwithfingers(v2) = v0)) & ! [v0:
% 14.11/2.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 14.11/2.82 ~ (tptpcol_15_4027(v2) = v1) | ~ (tptpcol_15_4027(v2) = v0)) & ! [v0:
% 14.11/2.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 14.11/2.82 ~ (collection(v2) = v1) | ~ (collection(v2) = v0)) & ! [v0:
% 14.11/2.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 14.11/2.82 ~ (mtvisible(v2) = v1) | ~ (mtvisible(v2) = v0)) & ! [v0:
% 14.11/2.82 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 14.11/2.82 ~ (transitivebinarypredicate(v2) = v1) | ~ (transitivebinarypredicate(v2) =
% 14.11/2.82 v0))
% 14.11/2.82
% 14.11/2.82 Further assumptions not needed in the proof:
% 14.11/2.82 --------------------------------------------
% 14.11/2.82 just1, just10, just15, just16, just17, just18, just19, just2, just20, just21,
% 14.11/2.82 just22, just24, just25, just26, just27, just28, just29, just3, just30, just31,
% 14.11/2.82 just32, just33, just34, just35, just36, just37, just38, just39, just40, just41,
% 14.11/2.82 just42, just43, just44, just45, just46, just47, just48, just49, just5, just50,
% 14.11/2.82 just51, just52, just54, just55, just56, just57, just58, just59, just6, just60,
% 14.11/2.82 just61, just8
% 14.11/2.82
% 14.11/2.82 Those formulas are unsatisfiable:
% 14.11/2.82 ---------------------------------
% 14.11/2.82
% 14.11/2.82 Begin of proof
% 14.11/2.82 |
% 14.11/2.82 | ALPHA: (just4) implies:
% 14.11/2.82 | (1) $i(c_calendarsmt)
% 14.11/2.82 | (2) genlmt(c_cyclistsmt, c_calendarsmt) = 0
% 14.11/2.82 |
% 14.11/2.82 | ALPHA: (just7) implies:
% 14.11/2.82 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (tptptypes_6_388(v0, v1) = 0) | ~
% 14.11/2.82 | $i(v1) | ~ $i(v0) | tptptypes_5_387(v0, v1) = 0)
% 14.11/2.82 |
% 14.11/2.82 | ALPHA: (just9) implies:
% 14.11/2.82 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ (tptptypes_7_389(v0, v1) = 0) | ~
% 14.11/2.82 | $i(v1) | ~ $i(v0) | tptptypes_6_388(v1, v0) = 0)
% 14.11/2.82 |
% 14.11/2.82 | ALPHA: (just11) implies:
% 14.11/2.82 | (5) ! [v0: $i] : ! [v1: $i] : ( ~ (tptptypes_8_390(v0, v1) = 0) | ~
% 14.11/2.82 | $i(v1) | ~ $i(v0) | tptptypes_7_389(v0, v1) = 0)
% 14.11/2.82 |
% 14.11/2.82 | ALPHA: (just12) implies:
% 14.11/2.82 | (6) genlmt(c_tptp_spindleheadmt, c_cyclistsmt) = 0
% 14.11/2.82 |
% 14.11/2.82 | ALPHA: (just13) implies:
% 14.11/2.82 | (7) $i(c_tptp_spindleheadmt)
% 14.11/2.82 | (8) genlmt(c_tptp_member3205_mt, c_tptp_spindleheadmt) = 0
% 14.11/2.82 |
% 14.11/2.82 | ALPHA: (just14) implies:
% 14.11/2.82 | (9) $i(c_cyclistsmt)
% 14.11/2.82 | (10) ? [v0: any] : ? [v1: any] : (mtvisible(c_cyclistsmt) = v0 &
% 14.11/2.82 | tptptypes_8_390(c_pushingwithfingers, c_tptpcol_15_4027) = v1 & ( ~
% 14.11/2.82 | (v0 = 0) | v1 = 0))
% 14.11/2.82 |
% 14.11/2.82 | ALPHA: (just23) implies:
% 14.11/2.82 | (11) $i(c_tptpcol_15_4027)
% 14.11/2.82 |
% 14.11/2.82 | ALPHA: (query62) implies:
% 14.11/2.82 | (12) $i(c_tptp_member3205_mt)
% 14.11/2.82 | (13) $i(c_pushingwithfingers)
% 14.11/2.83 | (14) mtvisible(c_tptp_member3205_mt) = 0
% 14.11/2.83 | (15) ! [v0: $i] : ( ~ (tptptypes_5_387(v0, c_pushingwithfingers) = 0) | ~
% 14.11/2.83 | $i(v0))
% 14.11/2.83 |
% 14.11/2.83 | ALPHA: (function-axioms) implies:
% 14.11/2.83 | (16) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i]
% 14.11/2.83 | : (v1 = v0 | ~ (mtvisible(v2) = v1) | ~ (mtvisible(v2) = v0))
% 14.11/2.83 |
% 14.11/2.83 | DELTA: instantiating (10) with fresh symbols all_53_0, all_53_1 gives:
% 14.11/2.83 | (17) mtvisible(c_cyclistsmt) = all_53_1 &
% 14.11/2.83 | tptptypes_8_390(c_pushingwithfingers, c_tptpcol_15_4027) = all_53_0 &
% 14.11/2.83 | ( ~ (all_53_1 = 0) | all_53_0 = 0)
% 14.11/2.83 |
% 14.11/2.83 | ALPHA: (17) implies:
% 14.11/2.83 | (18) tptptypes_8_390(c_pushingwithfingers, c_tptpcol_15_4027) = all_53_0
% 14.11/2.83 | (19) mtvisible(c_cyclistsmt) = all_53_1
% 14.11/2.83 | (20) ~ (all_53_1 = 0) | all_53_0 = 0
% 14.11/2.83 |
% 14.11/2.83 | GROUND_INST: instantiating (just53) with c_cyclistsmt, c_calendarsmt,
% 14.11/2.83 | simplifying with (1), (2), (9) gives:
% 14.11/2.83 | (21) ? [v0: any] : ? [v1: any] : (mtvisible(c_cyclistsmt) = v0 &
% 14.11/2.83 | mtvisible(c_calendarsmt) = v1 & ( ~ (v0 = 0) | v1 = 0))
% 14.11/2.83 |
% 14.11/2.83 | GROUND_INST: instantiating (just53) with c_tptp_spindleheadmt, c_cyclistsmt,
% 14.11/2.83 | simplifying with (6), (7), (9) gives:
% 14.11/2.83 | (22) ? [v0: any] : ? [v1: any] : (mtvisible(c_tptp_spindleheadmt) = v0 &
% 14.11/2.83 | mtvisible(c_cyclistsmt) = v1 & ( ~ (v0 = 0) | v1 = 0))
% 14.11/2.83 |
% 14.11/2.83 | GROUND_INST: instantiating (just53) with c_tptp_member3205_mt,
% 14.11/2.83 | c_tptp_spindleheadmt, simplifying with (7), (8), (12) gives:
% 14.11/2.83 | (23) ? [v0: any] : ? [v1: any] : (mtvisible(c_tptp_member3205_mt) = v0 &
% 14.11/2.83 | mtvisible(c_tptp_spindleheadmt) = v1 & ( ~ (v0 = 0) | v1 = 0))
% 14.11/2.83 |
% 14.11/2.83 | DELTA: instantiating (23) with fresh symbols all_61_0, all_61_1 gives:
% 14.11/2.83 | (24) mtvisible(c_tptp_member3205_mt) = all_61_1 &
% 14.11/2.83 | mtvisible(c_tptp_spindleheadmt) = all_61_0 & ( ~ (all_61_1 = 0) |
% 14.11/2.83 | all_61_0 = 0)
% 14.11/2.83 |
% 14.11/2.83 | ALPHA: (24) implies:
% 14.11/2.83 | (25) mtvisible(c_tptp_spindleheadmt) = all_61_0
% 14.11/2.83 | (26) mtvisible(c_tptp_member3205_mt) = all_61_1
% 14.11/2.83 | (27) ~ (all_61_1 = 0) | all_61_0 = 0
% 14.11/2.83 |
% 14.11/2.83 | DELTA: instantiating (22) with fresh symbols all_67_0, all_67_1 gives:
% 14.11/2.83 | (28) mtvisible(c_tptp_spindleheadmt) = all_67_1 & mtvisible(c_cyclistsmt) =
% 14.11/2.83 | all_67_0 & ( ~ (all_67_1 = 0) | all_67_0 = 0)
% 14.11/2.83 |
% 14.11/2.83 | ALPHA: (28) implies:
% 14.11/2.83 | (29) mtvisible(c_cyclistsmt) = all_67_0
% 14.11/2.83 | (30) mtvisible(c_tptp_spindleheadmt) = all_67_1
% 14.11/2.83 | (31) ~ (all_67_1 = 0) | all_67_0 = 0
% 14.11/2.83 |
% 14.11/2.83 | DELTA: instantiating (21) with fresh symbols all_69_0, all_69_1 gives:
% 14.11/2.83 | (32) mtvisible(c_cyclistsmt) = all_69_1 & mtvisible(c_calendarsmt) =
% 14.11/2.83 | all_69_0 & ( ~ (all_69_1 = 0) | all_69_0 = 0)
% 14.11/2.83 |
% 14.11/2.83 | ALPHA: (32) implies:
% 14.11/2.83 | (33) mtvisible(c_cyclistsmt) = all_69_1
% 14.11/2.83 |
% 14.11/2.83 | GROUND_INST: instantiating (16) with all_53_1, all_69_1, c_cyclistsmt,
% 14.11/2.83 | simplifying with (19), (33) gives:
% 14.11/2.83 | (34) all_69_1 = all_53_1
% 14.11/2.83 |
% 14.11/2.83 | GROUND_INST: instantiating (16) with all_67_0, all_69_1, c_cyclistsmt,
% 14.11/2.83 | simplifying with (29), (33) gives:
% 14.11/2.83 | (35) all_69_1 = all_67_0
% 14.11/2.83 |
% 14.11/2.83 | GROUND_INST: instantiating (16) with all_61_0, all_67_1, c_tptp_spindleheadmt,
% 14.11/2.84 | simplifying with (25), (30) gives:
% 14.11/2.84 | (36) all_67_1 = all_61_0
% 14.11/2.84 |
% 14.11/2.84 | GROUND_INST: instantiating (16) with 0, all_61_1, c_tptp_member3205_mt,
% 14.11/2.84 | simplifying with (14), (26) gives:
% 14.11/2.84 | (37) all_61_1 = 0
% 14.11/2.84 |
% 14.11/2.84 | COMBINE_EQS: (34), (35) imply:
% 14.11/2.84 | (38) all_67_0 = all_53_1
% 14.11/2.84 |
% 14.11/2.84 | BETA: splitting (27) gives:
% 14.11/2.84 |
% 14.11/2.84 | Case 1:
% 14.11/2.84 | |
% 14.11/2.84 | | (39) ~ (all_61_1 = 0)
% 14.11/2.84 | |
% 14.11/2.84 | | REDUCE: (37), (39) imply:
% 14.11/2.84 | | (40) $false
% 14.11/2.84 | |
% 14.11/2.84 | | CLOSE: (40) is inconsistent.
% 14.11/2.84 | |
% 14.11/2.84 | Case 2:
% 14.11/2.84 | |
% 14.11/2.84 | | (41) all_61_0 = 0
% 14.11/2.84 | |
% 14.11/2.84 | | COMBINE_EQS: (36), (41) imply:
% 14.11/2.84 | | (42) all_67_1 = 0
% 14.11/2.84 | |
% 14.11/2.84 | | BETA: splitting (31) gives:
% 14.11/2.84 | |
% 14.11/2.84 | | Case 1:
% 14.11/2.84 | | |
% 14.11/2.84 | | | (43) ~ (all_67_1 = 0)
% 14.11/2.84 | | |
% 14.11/2.84 | | | REDUCE: (42), (43) imply:
% 14.11/2.84 | | | (44) $false
% 14.11/2.84 | | |
% 14.11/2.84 | | | CLOSE: (44) is inconsistent.
% 14.11/2.84 | | |
% 14.11/2.84 | | Case 2:
% 14.11/2.84 | | |
% 14.11/2.84 | | | (45) all_67_0 = 0
% 14.11/2.84 | | |
% 14.11/2.84 | | | COMBINE_EQS: (38), (45) imply:
% 14.11/2.84 | | | (46) all_53_1 = 0
% 14.11/2.84 | | |
% 14.11/2.84 | | | SIMP: (46) implies:
% 14.11/2.84 | | | (47) all_53_1 = 0
% 14.11/2.84 | | |
% 14.11/2.84 | | | BETA: splitting (20) gives:
% 14.11/2.84 | | |
% 14.11/2.84 | | | Case 1:
% 14.11/2.84 | | | |
% 14.11/2.84 | | | | (48) ~ (all_53_1 = 0)
% 14.11/2.84 | | | |
% 14.11/2.84 | | | | REDUCE: (47), (48) imply:
% 14.11/2.84 | | | | (49) $false
% 14.11/2.84 | | | |
% 14.11/2.84 | | | | CLOSE: (49) is inconsistent.
% 14.11/2.84 | | | |
% 14.11/2.84 | | | Case 2:
% 14.11/2.84 | | | |
% 14.11/2.84 | | | | (50) all_53_0 = 0
% 14.11/2.84 | | | |
% 14.11/2.84 | | | | REDUCE: (18), (50) imply:
% 14.11/2.84 | | | | (51) tptptypes_8_390(c_pushingwithfingers, c_tptpcol_15_4027) = 0
% 14.11/2.84 | | | |
% 14.11/2.84 | | | | GROUND_INST: instantiating (5) with c_pushingwithfingers,
% 14.11/2.84 | | | | c_tptpcol_15_4027, simplifying with (11), (13), (51) gives:
% 14.11/2.84 | | | | (52) tptptypes_7_389(c_pushingwithfingers, c_tptpcol_15_4027) = 0
% 14.11/2.84 | | | |
% 14.11/2.84 | | | | GROUND_INST: instantiating (4) with c_pushingwithfingers,
% 14.11/2.84 | | | | c_tptpcol_15_4027, simplifying with (11), (13), (52) gives:
% 14.11/2.84 | | | | (53) tptptypes_6_388(c_tptpcol_15_4027, c_pushingwithfingers) = 0
% 14.11/2.84 | | | |
% 14.11/2.84 | | | | GROUND_INST: instantiating (3) with c_tptpcol_15_4027,
% 14.11/2.84 | | | | c_pushingwithfingers, simplifying with (11), (13), (53)
% 14.11/2.84 | | | | gives:
% 14.11/2.84 | | | | (54) tptptypes_5_387(c_tptpcol_15_4027, c_pushingwithfingers) = 0
% 14.11/2.84 | | | |
% 14.11/2.84 | | | | GROUND_INST: instantiating (15) with c_tptpcol_15_4027, simplifying with
% 14.11/2.84 | | | | (11), (54) gives:
% 14.11/2.84 | | | | (55) $false
% 14.11/2.84 | | | |
% 14.11/2.84 | | | | CLOSE: (55) is inconsistent.
% 14.11/2.84 | | | |
% 14.11/2.84 | | | End of split
% 14.11/2.84 | | |
% 14.11/2.84 | | End of split
% 14.11/2.84 | |
% 14.11/2.84 | End of split
% 14.11/2.84 |
% 14.11/2.84 End of proof
% 14.11/2.84 % SZS output end Proof for theBenchmark
% 14.11/2.84
% 14.11/2.84 2154ms
%------------------------------------------------------------------------------