%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV414+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 : n021.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:14 EDT 2023 % Result : Theorem 11.14s 2.24s % Output : Proof 13.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV414+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.35 % Computer : n021.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Tue Aug 29 10:23:29 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.68/0.63 Running up to 7 provers in parallel. % 0.68/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.68/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.68/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.68/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.68/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.68/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.68/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.81/1.22 Prover 4: Preprocessing ... % 3.81/1.22 Prover 1: Preprocessing ... % 3.81/1.26 Prover 0: Preprocessing ... % 3.81/1.26 Prover 3: Preprocessing ... % 3.81/1.26 Prover 5: Preprocessing ... % 3.81/1.26 Prover 6: Preprocessing ... % 3.81/1.26 Prover 2: Preprocessing ... % 9.87/2.02 Prover 1: Warning: ignoring some quantifiers % 10.03/2.07 Prover 3: Warning: ignoring some quantifiers % 10.03/2.09 Prover 5: Proving ... % 10.03/2.09 Prover 6: Proving ... % 10.03/2.09 Prover 1: Constructing countermodel ... % 10.03/2.10 Prover 3: Constructing countermodel ... % 10.66/2.12 Prover 2: Proving ... % 10.66/2.14 Prover 4: Constructing countermodel ... % 11.14/2.21 Prover 0: Proving ... % 11.14/2.24 Prover 3: proved (1599ms) % 11.14/2.24 % 11.14/2.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.14/2.24 % 11.14/2.24 Prover 6: stopped % 11.14/2.24 Prover 0: stopped % 11.14/2.25 Prover 5: stopped % 11.14/2.25 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.14/2.25 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.14/2.25 Prover 2: stopped % 11.14/2.26 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.14/2.26 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 11.14/2.26 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 11.85/2.30 Prover 1: Found proof (size 9) % 11.85/2.30 Prover 1: proved (1663ms) % 11.85/2.30 Prover 4: stopped % 12.11/2.32 Prover 8: Preprocessing ... % 12.11/2.32 Prover 7: Preprocessing ... % 12.11/2.33 Prover 13: Preprocessing ... % 12.11/2.33 Prover 10: Preprocessing ... % 12.11/2.33 Prover 11: Preprocessing ... % 12.62/2.39 Prover 7: stopped % 12.62/2.39 Prover 10: stopped % 12.62/2.43 Prover 13: stopped % 12.62/2.43 Prover 11: stopped % 13.17/2.51 Prover 8: Warning: ignoring some quantifiers % 13.17/2.53 Prover 8: Constructing countermodel ... % 13.50/2.54 Prover 8: stopped % 13.50/2.54 % 13.50/2.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 13.50/2.54 % 13.50/2.54 % SZS output start Proof for theBenchmark % 13.50/2.55 Assumptions after simplification: % 13.50/2.55 --------------------------------- % 13.50/2.55 % 13.50/2.55 (ax54) % 13.64/2.57 $i(create_slb) & $i(create_pq) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 13.64/2.57 (triple(v0, create_slb, v1) = v2) | ~ $i(v1) | ~ $i(v0) | i(v2) = % 13.64/2.57 create_pq) % 13.64/2.57 % 13.64/2.57 (co1) % 13.64/2.57 $i(create_pqp) & $i(create_slb) & $i(create_pq) & ? [v0: $i] : ? [v1: $i] : % 13.64/2.57 ? [v2: $i] : ( ~ (v2 = create_pq) & i(v1) = v2 & triple(create_pqp, % 13.64/2.57 create_slb, v0) = v1 & $i(v2) & $i(v1) & $i(v0)) % 13.64/2.57 % 13.64/2.57 (function-axioms) % 13.64/2.59 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 % 13.64/2.59 | ~ (triple(v4, v3, v2) = v1) | ~ (triple(v4, v3, v2) = v0)) & ! [v0: % 13.64/2.59 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 13.64/2.59 : ! [v4: $i] : (v1 = v0 | ~ (pair_in_list(v4, v3, v2) = v1) | ~ % 13.64/2.59 (pair_in_list(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 13.64/2.59 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 13.64/2.59 (pi_sharp_removemin(v3, v2) = v1) | ~ (pi_sharp_removemin(v3, v2) = v0)) & % 13.64/2.59 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 13.64/2.59 $i] : (v1 = v0 | ~ (pi_sharp_find_min(v3, v2) = v1) | ~ % 13.64/2.59 (pi_sharp_find_min(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 13.64/2.59 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 13.64/2.59 (pi_remove(v3, v2) = v1) | ~ (pi_remove(v3, v2) = v0)) & ! [v0: % 13.64/2.59 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 13.64/2.59 : (v1 = v0 | ~ (pi_sharp_remove(v3, v2) = v1) | ~ (pi_sharp_remove(v3, v2) = % 13.64/2.59 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 13.64/2.59 ~ (remove_pqp(v3, v2) = v1) | ~ (remove_pqp(v3, v2) = v0)) & ! [v0: $i] : % 13.64/2.59 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_pqp(v3, v2) = % 13.64/2.59 v1) | ~ (insert_pqp(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 13.64/2.59 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 13.64/2.59 (contains_cpq(v3, v2) = v1) | ~ (contains_cpq(v3, v2) = v0)) & ! [v0: $i] % 13.64/2.59 : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (remove_cpq(v3, v2) % 13.64/2.59 = v1) | ~ (remove_cpq(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 13.64/2.59 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_cpq(v3, v2) = v1) | ~ % 13.64/2.59 (insert_cpq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 13.64/2.59 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (succ_cpq(v3, % 13.64/2.59 v2) = v1) | ~ (succ_cpq(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 13.64/2.59 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (update_slb(v3, v2) = v1) | ~ % 13.64/2.59 (update_slb(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 13.64/2.59 [v3: $i] : (v1 = v0 | ~ (lookup_slb(v3, v2) = v1) | ~ (lookup_slb(v3, v2) = % 13.64/2.59 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 13.64/2.59 ~ (remove_slb(v3, v2) = v1) | ~ (remove_slb(v3, v2) = v0)) & ! [v0: % 13.64/2.59 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 13.64/2.59 : (v1 = v0 | ~ (contains_slb(v3, v2) = v1) | ~ (contains_slb(v3, v2) = v0)) % 13.64/2.59 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 13.64/2.59 (pair(v3, v2) = v1) | ~ (pair(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 13.64/2.59 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_slb(v3, v2) = v1) | ~ % 13.64/2.59 (insert_slb(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 13.64/2.59 [v3: $i] : (v1 = v0 | ~ (removemin_pq_res(v3, v2) = v1) | ~ % 13.64/2.59 (removemin_pq_res(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 13.64/2.59 ! [v3: $i] : (v1 = v0 | ~ (removemin_pq_eff(v3, v2) = v1) | ~ % 13.64/2.59 (removemin_pq_eff(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 13.64/2.59 ! [v3: $i] : (v1 = v0 | ~ (findmin_pq_res(v3, v2) = v1) | ~ % 13.64/2.59 (findmin_pq_res(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 13.64/2.59 ! [v3: $i] : (v1 = v0 | ~ (findmin_pq_eff(v3, v2) = v1) | ~ % 13.64/2.59 (findmin_pq_eff(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 13.64/2.59 ! [v3: $i] : (v1 = v0 | ~ (remove_pq(v3, v2) = v1) | ~ (remove_pq(v3, v2) = % 13.64/2.59 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 13.64/2.59 $i] : ! [v3: $i] : (v1 = v0 | ~ (issmallestelement_pq(v3, v2) = v1) | ~ % 13.64/2.59 (issmallestelement_pq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 13.64/2.59 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 13.64/2.59 (contains_pq(v3, v2) = v1) | ~ (contains_pq(v3, v2) = v0)) & ! [v0: $i] : % 13.64/2.59 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_pq(v3, v2) = % 13.64/2.59 v1) | ~ (insert_pq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 13.64/2.59 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 13.64/2.59 (strictly_less_than(v3, v2) = v1) | ~ (strictly_less_than(v3, v2) = v0)) & % 13.64/2.59 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 13.64/2.59 $i] : (v1 = v0 | ~ (less_than(v3, v2) = v1) | ~ (less_than(v3, v2) = v0)) % 13.64/2.59 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 % 13.64/2.59 = v0 | ~ (phi(v2) = v1) | ~ (phi(v2) = v0)) & ! [v0: MultipleValueBool] : % 13.64/2.59 ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (pi_removemin(v2) = % 13.64/2.59 v1) | ~ (pi_removemin(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 13.64/2.59 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (pi_find_min(v2) = v1) | ~ % 13.64/2.59 (pi_find_min(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 13.64/2.59 | ~ (i(v2) = v1) | ~ (i(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 13.64/2.59 $i] : (v1 = v0 | ~ (removemin_cpq_res(v2) = v1) | ~ (removemin_cpq_res(v2) % 13.64/2.59 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 13.64/2.59 (findmin_cpq_res(v2) = v1) | ~ (findmin_cpq_res(v2) = v0)) & ! [v0: $i] : % 13.64/2.59 ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_pqp_res(v2) = v1) | ~ % 13.64/2.59 (findmin_pqp_res(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 13.64/2.59 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ok(v2) = v1) | ~ (ok(v2) % 13.64/2.59 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 13.64/2.59 $i] : (v1 = v0 | ~ (check_cpq(v2) = v1) | ~ (check_cpq(v2) = v0)) & ! % 13.64/2.59 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (removemin_cpq_eff(v2) = % 13.64/2.59 v1) | ~ (removemin_cpq_eff(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 13.64/2.59 [v2: $i] : (v1 = v0 | ~ (findmin_cpq_eff(v2) = v1) | ~ (findmin_cpq_eff(v2) % 13.64/2.59 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 13.64/2.59 $i] : (v1 = v0 | ~ (isnonempty_slb(v2) = v1) | ~ (isnonempty_slb(v2) = % 13.64/2.59 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 13.64/2.59 $i] : (v1 = v0 | ~ (isnonempty_pq(v2) = v1) | ~ (isnonempty_pq(v2) = v0)) % 13.64/2.59 % 13.64/2.59 Further assumptions not needed in the proof: % 13.64/2.59 -------------------------------------------- % 13.64/2.59 ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax20, ax21, ax22, % 13.64/2.59 ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30, ax31, ax32, ax33, ax34, ax35, % 13.64/2.59 ax36, ax37, ax38, ax39, ax40, ax41, ax42, ax43, ax44, ax45, ax46, ax47, ax48, % 13.64/2.59 ax49, ax50, ax51, ax52, ax53, ax55, ax56, ax57, ax58, ax59, ax6, ax60, ax61, % 13.64/2.59 ax62, ax7, ax8, ax9, bottom_smallest, reflexivity, stricly_smaller_definition, % 13.64/2.59 totality, transitivity % 13.64/2.59 % 13.64/2.59 Those formulas are unsatisfiable: % 13.64/2.59 --------------------------------- % 13.64/2.59 % 13.64/2.59 Begin of proof % 13.64/2.60 | % 13.64/2.60 | ALPHA: (ax54) implies: % 13.64/2.60 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (triple(v0, create_slb, % 13.64/2.60 | v1) = v2) | ~ $i(v1) | ~ $i(v0) | i(v2) = create_pq) % 13.64/2.60 | % 13.64/2.60 | ALPHA: (co1) implies: % 13.64/2.60 | (2) $i(create_pqp) % 13.64/2.60 | (3) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ( ~ (v2 = create_pq) & i(v1) % 13.64/2.60 | = v2 & triple(create_pqp, create_slb, v0) = v1 & $i(v2) & $i(v1) & % 13.64/2.60 | $i(v0)) % 13.64/2.60 | % 13.64/2.60 | ALPHA: (function-axioms) implies: % 13.64/2.60 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (i(v2) = v1) | % 13.64/2.60 | ~ (i(v2) = v0)) % 13.64/2.60 | % 13.64/2.60 | DELTA: instantiating (3) with fresh symbols all_64_0, all_64_1, all_64_2 % 13.64/2.60 | gives: % 13.64/2.60 | (5) ~ (all_64_0 = create_pq) & i(all_64_1) = all_64_0 & triple(create_pqp, % 13.64/2.60 | create_slb, all_64_2) = all_64_1 & $i(all_64_0) & $i(all_64_1) & % 13.64/2.60 | $i(all_64_2) % 13.64/2.60 | % 13.64/2.60 | ALPHA: (5) implies: % 13.64/2.60 | (6) ~ (all_64_0 = create_pq) % 13.64/2.60 | (7) $i(all_64_2) % 13.64/2.60 | (8) triple(create_pqp, create_slb, all_64_2) = all_64_1 % 13.64/2.60 | (9) i(all_64_1) = all_64_0 % 13.64/2.60 | % 13.64/2.60 | GROUND_INST: instantiating (1) with create_pqp, all_64_2, all_64_1, % 13.64/2.60 | simplifying with (2), (7), (8) gives: % 13.64/2.60 | (10) i(all_64_1) = create_pq % 13.64/2.60 | % 13.64/2.60 | GROUND_INST: instantiating (4) with all_64_0, create_pq, all_64_1, simplifying % 13.64/2.60 | with (9), (10) gives: % 13.64/2.60 | (11) all_64_0 = create_pq % 13.64/2.60 | % 13.64/2.60 | REDUCE: (6), (11) imply: % 13.64/2.60 | (12) $false % 13.64/2.61 | % 13.64/2.61 | CLOSE: (12) is inconsistent. % 13.64/2.61 | % 13.64/2.61 End of proof % 13.64/2.61 % SZS output end Proof for theBenchmark % 13.64/2.61 % 13.64/2.61 1989ms %------------------------------------------------------------------------------