%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV365+1 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n028.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 : Thu Aug 31 22:56:02 EDT 2023 % Result : Theorem 12.42s 2.38s % Output : Proof 14.63s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV365+1 : TPTP v8.1.2. Released v3.3.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n028.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Tue Aug 29 07:33:55 EDT 2023 % 0.13/0.34 % CPUTime : % 0.65/0.62 ________ _____ % 0.65/0.62 ___ __ \_________(_)________________________________ % 0.65/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.65/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.65/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.65/0.62 % 0.65/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.65/0.62 (2023-06-19) % 0.65/0.62 % 0.65/0.62 (c) Philipp Rümmer, 2009-2023 % 0.65/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.65/0.62 Amanda Stjerna. % 0.65/0.62 Free software under BSD-3-Clause. % 0.65/0.62 % 0.65/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.65/0.62 % 0.65/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.65/0.63 Running up to 7 provers in parallel. % 0.65/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.65/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.65/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.65/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.65/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.65/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.65/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.58/1.29 Prover 1: Preprocessing ... % 3.58/1.29 Prover 4: Preprocessing ... % 4.34/1.33 Prover 5: Preprocessing ... % 4.34/1.33 Prover 0: Preprocessing ... % 4.34/1.33 Prover 3: Preprocessing ... % 4.34/1.33 Prover 2: Preprocessing ... % 4.34/1.33 Prover 6: Preprocessing ... % 10.12/2.09 Prover 1: Warning: ignoring some quantifiers % 10.63/2.15 Prover 3: Warning: ignoring some quantifiers % 10.63/2.18 Prover 6: Proving ... % 10.63/2.18 Prover 1: Constructing countermodel ... % 10.63/2.18 Prover 5: Proving ... % 10.63/2.20 Prover 3: Constructing countermodel ... % 11.17/2.26 Prover 2: Proving ... % 11.67/2.30 Prover 4: Constructing countermodel ... % 11.67/2.31 Prover 0: Proving ... % 12.42/2.37 Prover 3: proved (1719ms) % 12.42/2.37 % 12.42/2.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.42/2.38 % 12.42/2.38 Prover 6: proved (1725ms) % 12.42/2.38 % 12.42/2.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.42/2.38 % 12.42/2.38 Prover 5: stopped % 12.42/2.39 Prover 0: stopped % 12.42/2.39 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.42/2.39 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.42/2.39 Prover 2: stopped % 12.64/2.40 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 12.64/2.40 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.64/2.40 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 12.64/2.41 Prover 1: Found proof (size 11) % 12.64/2.41 Prover 1: proved (1768ms) % 12.64/2.43 Prover 8: Preprocessing ... % 12.64/2.44 Prover 4: stopped % 12.64/2.45 Prover 7: Preprocessing ... % 12.64/2.46 Prover 10: Preprocessing ... % 12.64/2.46 Prover 13: Preprocessing ... % 13.26/2.48 Prover 11: Preprocessing ... % 13.30/2.53 Prover 7: stopped % 13.30/2.53 Prover 10: stopped % 13.30/2.55 Prover 13: stopped % 13.30/2.55 Prover 11: stopped % 14.05/2.62 Prover 8: Warning: ignoring some quantifiers % 14.20/2.64 Prover 8: Constructing countermodel ... % 14.20/2.65 Prover 8: stopped % 14.20/2.65 % 14.20/2.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.20/2.65 % 14.20/2.65 % SZS output start Proof for theBenchmark % 14.20/2.66 Assumptions after simplification: % 14.20/2.66 --------------------------------- % 14.20/2.66 % 14.20/2.66 (ax54) % 14.20/2.68 $i(create_slb) & $i(create_pq) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 14.20/2.68 (triple(v0, create_slb, v1) = v2) | ~ $i(v1) | ~ $i(v0) | i(v2) = % 14.20/2.68 create_pq) % 14.20/2.68 % 14.20/2.68 (l1_co) % 14.20/2.68 $i(create_slb) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? % 14.20/2.68 [v4: $i] : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ( ~ (v7 = v5) & i(v6) = % 14.20/2.69 v7 & i(v4) = v5 & triple(v1, create_slb, v3) = v6 & triple(v0, create_slb, % 14.20/2.69 v2) = v4 & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 14.20/2.69 $i(v0)) % 14.20/2.69 % 14.20/2.69 (function-axioms) % 14.20/2.71 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 % 14.20/2.71 | ~ (triple(v4, v3, v2) = v1) | ~ (triple(v4, v3, v2) = v0)) & ! [v0: % 14.20/2.71 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 14.20/2.71 : ! [v4: $i] : (v1 = v0 | ~ (pair_in_list(v4, v3, v2) = v1) | ~ % 14.20/2.71 (pair_in_list(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 14.20/2.71 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.20/2.71 (pi_sharp_removemin(v3, v2) = v1) | ~ (pi_sharp_removemin(v3, v2) = v0)) & % 14.20/2.71 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 14.20/2.71 $i] : (v1 = v0 | ~ (pi_sharp_find_min(v3, v2) = v1) | ~ % 14.20/2.71 (pi_sharp_find_min(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 14.20/2.71 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.20/2.71 (pi_remove(v3, v2) = v1) | ~ (pi_remove(v3, v2) = v0)) & ! [v0: % 14.20/2.71 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 14.20/2.71 : (v1 = v0 | ~ (pi_sharp_remove(v3, v2) = v1) | ~ (pi_sharp_remove(v3, v2) = % 14.20/2.71 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 14.20/2.71 ~ (remove_pqp(v3, v2) = v1) | ~ (remove_pqp(v3, v2) = v0)) & ! [v0: $i] : % 14.20/2.71 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_pqp(v3, v2) = % 14.20/2.71 v1) | ~ (insert_pqp(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 14.20/2.71 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.20/2.71 (contains_cpq(v3, v2) = v1) | ~ (contains_cpq(v3, v2) = v0)) & ! [v0: $i] % 14.20/2.71 : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (remove_cpq(v3, v2) % 14.20/2.71 = v1) | ~ (remove_cpq(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 14.20/2.71 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_cpq(v3, v2) = v1) | ~ % 14.20/2.71 (insert_cpq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 14.20/2.71 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (succ_cpq(v3, % 14.20/2.71 v2) = v1) | ~ (succ_cpq(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 14.20/2.71 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (update_slb(v3, v2) = v1) | ~ % 14.20/2.71 (update_slb(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 14.20/2.71 [v3: $i] : (v1 = v0 | ~ (lookup_slb(v3, v2) = v1) | ~ (lookup_slb(v3, v2) = % 14.20/2.71 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 14.20/2.71 ~ (remove_slb(v3, v2) = v1) | ~ (remove_slb(v3, v2) = v0)) & ! [v0: % 14.20/2.71 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 14.20/2.71 : (v1 = v0 | ~ (contains_slb(v3, v2) = v1) | ~ (contains_slb(v3, v2) = v0)) % 14.20/2.71 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.20/2.71 (pair(v3, v2) = v1) | ~ (pair(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 14.20/2.71 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_slb(v3, v2) = v1) | ~ % 14.20/2.71 (insert_slb(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 14.20/2.71 [v3: $i] : (v1 = v0 | ~ (removemin_pq_res(v3, v2) = v1) | ~ % 14.20/2.71 (removemin_pq_res(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 14.20/2.71 ! [v3: $i] : (v1 = v0 | ~ (removemin_pq_eff(v3, v2) = v1) | ~ % 14.20/2.71 (removemin_pq_eff(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 14.20/2.71 ! [v3: $i] : (v1 = v0 | ~ (findmin_pq_res(v3, v2) = v1) | ~ % 14.20/2.71 (findmin_pq_res(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 14.20/2.71 ! [v3: $i] : (v1 = v0 | ~ (findmin_pq_eff(v3, v2) = v1) | ~ % 14.20/2.71 (findmin_pq_eff(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 14.20/2.71 ! [v3: $i] : (v1 = v0 | ~ (remove_pq(v3, v2) = v1) | ~ (remove_pq(v3, v2) = % 14.20/2.71 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 14.20/2.71 $i] : ! [v3: $i] : (v1 = v0 | ~ (issmallestelement_pq(v3, v2) = v1) | ~ % 14.20/2.71 (issmallestelement_pq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 14.20/2.71 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.20/2.71 (contains_pq(v3, v2) = v1) | ~ (contains_pq(v3, v2) = v0)) & ! [v0: $i] : % 14.20/2.71 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_pq(v3, v2) = % 14.20/2.71 v1) | ~ (insert_pq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 14.20/2.71 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 14.20/2.71 (strictly_less_than(v3, v2) = v1) | ~ (strictly_less_than(v3, v2) = v0)) & % 14.20/2.71 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 14.20/2.71 $i] : (v1 = v0 | ~ (less_than(v3, v2) = v1) | ~ (less_than(v3, v2) = v0)) % 14.20/2.71 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 % 14.20/2.71 = v0 | ~ (phi(v2) = v1) | ~ (phi(v2) = v0)) & ! [v0: MultipleValueBool] : % 14.20/2.71 ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (pi_removemin(v2) = % 14.20/2.71 v1) | ~ (pi_removemin(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 14.20/2.71 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (pi_find_min(v2) = v1) | ~ % 14.20/2.71 (pi_find_min(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 14.20/2.71 | ~ (i(v2) = v1) | ~ (i(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 14.20/2.71 $i] : (v1 = v0 | ~ (removemin_cpq_res(v2) = v1) | ~ (removemin_cpq_res(v2) % 14.20/2.71 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 14.20/2.71 (findmin_cpq_res(v2) = v1) | ~ (findmin_cpq_res(v2) = v0)) & ! [v0: $i] : % 14.20/2.71 ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_pqp_res(v2) = v1) | ~ % 14.20/2.71 (findmin_pqp_res(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 14.20/2.71 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ok(v2) = v1) | ~ (ok(v2) % 14.20/2.71 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 14.20/2.71 $i] : (v1 = v0 | ~ (check_cpq(v2) = v1) | ~ (check_cpq(v2) = v0)) & ! % 14.20/2.71 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (removemin_cpq_eff(v2) = % 14.20/2.71 v1) | ~ (removemin_cpq_eff(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 14.20/2.71 [v2: $i] : (v1 = v0 | ~ (findmin_cpq_eff(v2) = v1) | ~ (findmin_cpq_eff(v2) % 14.20/2.71 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 14.20/2.71 $i] : (v1 = v0 | ~ (isnonempty_slb(v2) = v1) | ~ (isnonempty_slb(v2) = % 14.20/2.71 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 14.20/2.71 $i] : (v1 = v0 | ~ (isnonempty_pq(v2) = v1) | ~ (isnonempty_pq(v2) = v0)) % 14.20/2.71 % 14.20/2.71 Further assumptions not needed in the proof: % 14.20/2.71 -------------------------------------------- % 14.20/2.71 ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax20, ax21, ax22, % 14.20/2.71 ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30, ax31, ax32, ax33, ax34, ax35, % 14.20/2.71 ax36, ax37, ax38, ax39, ax40, ax41, ax42, ax43, ax44, ax45, ax46, ax47, ax48, % 14.20/2.71 ax49, ax50, ax51, ax52, ax53, ax55, ax56, ax57, ax58, ax59, ax6, ax60, ax61, % 14.20/2.71 ax62, ax7, ax8, ax9, bottom_smallest, reflexivity, stricly_smaller_definition, % 14.20/2.71 totality, transitivity % 14.20/2.71 % 14.20/2.71 Those formulas are unsatisfiable: % 14.20/2.71 --------------------------------- % 14.20/2.71 % 14.20/2.71 Begin of proof % 14.20/2.71 | % 14.20/2.72 | ALPHA: (ax54) implies: % 14.20/2.72 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (triple(v0, create_slb, % 14.20/2.72 | v1) = v2) | ~ $i(v1) | ~ $i(v0) | i(v2) = create_pq) % 14.20/2.72 | % 14.20/2.72 | ALPHA: (l1_co) implies: % 14.20/2.72 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 14.20/2.72 | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ( ~ (v7 = v5) & i(v6) = v7 & % 14.20/2.72 | i(v4) = v5 & triple(v1, create_slb, v3) = v6 & triple(v0, create_slb, % 14.20/2.72 | v2) = v4 & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & % 14.20/2.72 | $i(v1) & $i(v0)) % 14.20/2.72 | % 14.20/2.72 | ALPHA: (function-axioms) implies: % 14.20/2.72 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (i(v2) = v1) | % 14.20/2.72 | ~ (i(v2) = v0)) % 14.20/2.72 | % 14.20/2.72 | DELTA: instantiating (2) with fresh symbols all_66_0, all_66_1, all_66_2, % 14.20/2.72 | all_66_3, all_66_4, all_66_5, all_66_6, all_66_7 gives: % 14.20/2.72 | (4) ~ (all_66_0 = all_66_2) & i(all_66_1) = all_66_0 & i(all_66_3) = % 14.20/2.72 | all_66_2 & triple(all_66_6, create_slb, all_66_4) = all_66_1 & % 14.20/2.72 | triple(all_66_7, create_slb, all_66_5) = all_66_3 & $i(all_66_0) & % 14.20/2.72 | $i(all_66_1) & $i(all_66_2) & $i(all_66_3) & $i(all_66_4) & % 14.20/2.72 | $i(all_66_5) & $i(all_66_6) & $i(all_66_7) % 14.20/2.72 | % 14.20/2.72 | ALPHA: (4) implies: % 14.20/2.72 | (5) ~ (all_66_0 = all_66_2) % 14.20/2.72 | (6) $i(all_66_7) % 14.20/2.72 | (7) $i(all_66_6) % 14.20/2.72 | (8) $i(all_66_5) % 14.20/2.72 | (9) $i(all_66_4) % 14.20/2.72 | (10) triple(all_66_7, create_slb, all_66_5) = all_66_3 % 14.20/2.72 | (11) triple(all_66_6, create_slb, all_66_4) = all_66_1 % 14.20/2.72 | (12) i(all_66_3) = all_66_2 % 14.63/2.72 | (13) i(all_66_1) = all_66_0 % 14.63/2.72 | % 14.63/2.73 | GROUND_INST: instantiating (1) with all_66_7, all_66_5, all_66_3, simplifying % 14.63/2.73 | with (6), (8), (10) gives: % 14.63/2.73 | (14) i(all_66_3) = create_pq % 14.63/2.73 | % 14.63/2.73 | GROUND_INST: instantiating (1) with all_66_6, all_66_4, all_66_1, simplifying % 14.63/2.73 | with (7), (9), (11) gives: % 14.63/2.73 | (15) i(all_66_1) = create_pq % 14.63/2.73 | % 14.63/2.73 | GROUND_INST: instantiating (3) with all_66_2, create_pq, all_66_3, simplifying % 14.63/2.73 | with (12), (14) gives: % 14.63/2.73 | (16) all_66_2 = create_pq % 14.63/2.73 | % 14.63/2.73 | GROUND_INST: instantiating (3) with all_66_0, create_pq, all_66_1, simplifying % 14.63/2.73 | with (13), (15) gives: % 14.63/2.73 | (17) all_66_0 = create_pq % 14.63/2.73 | % 14.63/2.73 | REDUCE: (5), (16), (17) imply: % 14.63/2.73 | (18) $false % 14.63/2.73 | % 14.63/2.73 | CLOSE: (18) is inconsistent. % 14.63/2.73 | % 14.63/2.73 End of proof % 14.63/2.73 % SZS output end Proof for theBenchmark % 14.63/2.73 % 14.63/2.73 2107ms %------------------------------------------------------------------------------