↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SWV367+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 : 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 : Thu Aug 31 22:56:02 EDT 2023

% Result   : Theorem 11.73s 2.30s
% Output   : Proof 14.27s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SWV367+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue Aug 29 07:09:23 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.64  ________       _____
% 0.21/0.64  ___  __ \_________(_)________________________________
% 0.21/0.64  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.21/0.64  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.21/0.64  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.21/0.64  
% 0.21/0.64  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.64  (2023-06-19)
% 0.21/0.64  
% 0.21/0.64  (c) Philipp Rümmer, 2009-2023
% 0.21/0.64  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.64                Amanda Stjerna.
% 0.21/0.64  Free software under BSD-3-Clause.
% 0.21/0.64  
% 0.21/0.64  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.64  
% 0.21/0.64  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.21/0.65  Running up to 7 provers in parallel.
% 0.21/0.67  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.67  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.67  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.67  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.67  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.67  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.67  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.08/1.26  Prover 4: Preprocessing ...
% 4.08/1.30  Prover 1: Preprocessing ...
% 4.08/1.30  Prover 0: Preprocessing ...
% 4.08/1.30  Prover 3: Preprocessing ...
% 4.08/1.30  Prover 5: Preprocessing ...
% 4.08/1.30  Prover 2: Preprocessing ...
% 4.08/1.30  Prover 6: Preprocessing ...
% 9.17/2.02  Prover 1: Warning: ignoring some quantifiers
% 9.17/2.12  Prover 3: Warning: ignoring some quantifiers
% 10.11/2.13  Prover 1: Constructing countermodel ...
% 10.11/2.15  Prover 5: Proving ...
% 10.11/2.15  Prover 6: Proving ...
% 10.11/2.15  Prover 3: Constructing countermodel ...
% 11.15/2.25  Prover 2: Proving ...
% 11.73/2.28  Prover 4: Constructing countermodel ...
% 11.73/2.30  Prover 6: proved (1631ms)
% 11.73/2.30  
% 11.73/2.30  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.73/2.30  
% 11.73/2.30  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 11.73/2.30  Prover 3: stopped
% 11.73/2.30  Prover 0: Proving ...
% 11.73/2.31  Prover 0: stopped
% 11.73/2.32  Prover 2: stopped
% 11.73/2.33  Prover 5: stopped
% 11.73/2.34  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 11.73/2.34  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 11.73/2.34  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 11.73/2.34  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 11.73/2.37  Prover 7: Preprocessing ...
% 12.46/2.38  Prover 8: Preprocessing ...
% 12.46/2.39  Prover 1: Found proof (size 11)
% 12.46/2.39  Prover 10: Preprocessing ...
% 12.46/2.39  Prover 1: proved (1732ms)
% 12.63/2.40  Prover 4: stopped
% 12.63/2.40  Prover 13: Preprocessing ...
% 12.63/2.40  Prover 11: Preprocessing ...
% 12.83/2.45  Prover 7: stopped
% 12.83/2.47  Prover 10: stopped
% 13.39/2.51  Prover 11: stopped
% 13.39/2.51  Prover 13: stopped
% 13.79/2.58  Prover 8: Warning: ignoring some quantifiers
% 13.79/2.61  Prover 8: Constructing countermodel ...
% 13.79/2.62  Prover 8: stopped
% 13.79/2.62  
% 13.79/2.62  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.79/2.62  
% 13.79/2.62  % SZS output start Proof for theBenchmark
% 13.79/2.62  Assumptions after simplification:
% 13.79/2.62  ---------------------------------
% 13.79/2.62  
% 13.79/2.62    (ax54)
% 13.79/2.65    $i(create_slb) & $i(create_pq) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~
% 13.79/2.65      (triple(v0, create_slb, v1) = v2) |  ~ $i(v1) |  ~ $i(v0) | i(v2) =
% 13.79/2.65      create_pq)
% 13.79/2.65  
% 13.79/2.65    (ax8)
% 13.79/2.65    $i(create_pq) &  ! [v0: $i] : ( ~ (contains_pq(create_pq, v0) = 0) |  ~
% 13.79/2.65      $i(v0))
% 13.79/2.65  
% 13.79/2.65    (l3_co)
% 13.79/2.65    $i(create_slb) &  ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ?
% 13.79/2.65    [v4: $i] :  ? [v5: $i] :  ? [v6: $i] :  ? [v7: $i] : ( ~ (v7 = v6) & i(v5) =
% 13.79/2.65      v6 & i(v3) = v4 & triple(v0, create_slb, v1) = v3 & remove_cpq(v3, v2) = v5
% 13.79/2.65      & remove_pq(v4, v2) = v7 & contains_pq(v4, v2) = 0 & $i(v7) & $i(v6) &
% 13.79/2.65      $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 13.79/2.65  
% 13.79/2.65    (function-axioms)
% 13.79/2.66     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] : (v1 = v0
% 13.79/2.66      |  ~ (triple(v4, v3, v2) = v1) |  ~ (triple(v4, v3, v2) = v0)) &  ! [v0:
% 13.79/2.66      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i]
% 13.79/2.66    :  ! [v4: $i] : (v1 = v0 |  ~ (pair_in_list(v4, v3, v2) = v1) |  ~
% 13.79/2.66      (pair_in_list(v4, v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 13.79/2.66      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 13.79/2.66      (pi_sharp_removemin(v3, v2) = v1) |  ~ (pi_sharp_removemin(v3, v2) = v0)) & 
% 13.79/2.66    ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3:
% 13.79/2.66      $i] : (v1 = v0 |  ~ (pi_sharp_find_min(v3, v2) = v1) |  ~
% 13.79/2.66      (pi_sharp_find_min(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 13.79/2.66      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 13.79/2.66      (pi_remove(v3, v2) = v1) |  ~ (pi_remove(v3, v2) = v0)) &  ! [v0:
% 13.79/2.66      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i]
% 13.79/2.66    : (v1 = v0 |  ~ (pi_sharp_remove(v3, v2) = v1) |  ~ (pi_sharp_remove(v3, v2) =
% 13.79/2.66        v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 | 
% 13.79/2.66      ~ (remove_pqp(v3, v2) = v1) |  ~ (remove_pqp(v3, v2) = v0)) &  ! [v0: $i] : 
% 13.79/2.66    ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (insert_pqp(v3, v2) =
% 13.79/2.66        v1) |  ~ (insert_pqp(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 13.79/2.66      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 13.79/2.66      (contains_cpq(v3, v2) = v1) |  ~ (contains_cpq(v3, v2) = v0)) &  ! [v0: $i]
% 13.79/2.66    :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (remove_cpq(v3, v2)
% 13.79/2.66        = v1) |  ~ (remove_cpq(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  !
% 13.79/2.66    [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (insert_cpq(v3, v2) = v1) |  ~
% 13.79/2.66      (insert_cpq(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 13.79/2.66      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (succ_cpq(v3,
% 13.79/2.66          v2) = v1) |  ~ (succ_cpq(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  !
% 13.79/2.66    [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (update_slb(v3, v2) = v1) |  ~
% 13.79/2.66      (update_slb(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  !
% 13.79/2.66    [v3: $i] : (v1 = v0 |  ~ (lookup_slb(v3, v2) = v1) |  ~ (lookup_slb(v3, v2) =
% 13.79/2.66        v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 | 
% 13.79/2.66      ~ (remove_slb(v3, v2) = v1) |  ~ (remove_slb(v3, v2) = v0)) &  ! [v0:
% 13.79/2.66      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i]
% 13.79/2.66    : (v1 = v0 |  ~ (contains_slb(v3, v2) = v1) |  ~ (contains_slb(v3, v2) = v0))
% 13.79/2.66    &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 13.79/2.66      (pair(v3, v2) = v1) |  ~ (pair(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] : 
% 13.79/2.66    ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (insert_slb(v3, v2) = v1) |  ~
% 13.79/2.66      (insert_slb(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  !
% 13.79/2.66    [v3: $i] : (v1 = v0 |  ~ (removemin_pq_res(v3, v2) = v1) |  ~
% 13.79/2.66      (removemin_pq_res(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :
% 13.79/2.66     ! [v3: $i] : (v1 = v0 |  ~ (removemin_pq_eff(v3, v2) = v1) |  ~
% 13.79/2.66      (removemin_pq_eff(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :
% 13.79/2.66     ! [v3: $i] : (v1 = v0 |  ~ (findmin_pq_res(v3, v2) = v1) |  ~
% 13.79/2.66      (findmin_pq_res(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : 
% 13.79/2.66    ! [v3: $i] : (v1 = v0 |  ~ (findmin_pq_eff(v3, v2) = v1) |  ~
% 13.79/2.66      (findmin_pq_eff(v3, v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : 
% 13.79/2.66    ! [v3: $i] : (v1 = v0 |  ~ (remove_pq(v3, v2) = v1) |  ~ (remove_pq(v3, v2) =
% 13.79/2.66        v0)) &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2:
% 13.79/2.66      $i] :  ! [v3: $i] : (v1 = v0 |  ~ (issmallestelement_pq(v3, v2) = v1) |  ~
% 13.79/2.66      (issmallestelement_pq(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 13.79/2.66      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 13.79/2.66      (contains_pq(v3, v2) = v1) |  ~ (contains_pq(v3, v2) = v0)) &  ! [v0: $i] : 
% 13.79/2.66    ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (insert_pq(v3, v2) =
% 13.79/2.66        v1) |  ~ (insert_pq(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 13.79/2.66      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 13.79/2.66      (strictly_less_than(v3, v2) = v1) |  ~ (strictly_less_than(v3, v2) = v0)) & 
% 13.79/2.66    ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3:
% 13.79/2.66      $i] : (v1 = v0 |  ~ (less_than(v3, v2) = v1) |  ~ (less_than(v3, v2) = v0))
% 13.79/2.66    &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1
% 13.79/2.66      = v0 |  ~ (phi(v2) = v1) |  ~ (phi(v2) = v0)) &  ! [v0: MultipleValueBool] :
% 13.79/2.66     ! [v1: MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~ (pi_removemin(v2) =
% 13.79/2.66        v1) |  ~ (pi_removemin(v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 13.79/2.66      MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~ (pi_find_min(v2) = v1) |  ~
% 13.79/2.66      (pi_find_min(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0
% 13.79/2.66      |  ~ (i(v2) = v1) |  ~ (i(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2:
% 13.79/2.66      $i] : (v1 = v0 |  ~ (removemin_cpq_res(v2) = v1) |  ~ (removemin_cpq_res(v2)
% 13.79/2.66        = v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~
% 13.79/2.66      (findmin_cpq_res(v2) = v1) |  ~ (findmin_cpq_res(v2) = v0)) &  ! [v0: $i] : 
% 13.79/2.66    ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (findmin_pqp_res(v2) = v1) |  ~
% 13.79/2.66      (findmin_pqp_res(v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 13.79/2.66      MultipleValueBool] :  ! [v2: $i] : (v1 = v0 |  ~ (ok(v2) = v1) |  ~ (ok(v2)
% 13.79/2.66        = v0)) &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2:
% 13.79/2.66      $i] : (v1 = v0 |  ~ (check_cpq(v2) = v1) |  ~ (check_cpq(v2) = v0)) &  !
% 13.79/2.66    [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (removemin_cpq_eff(v2) =
% 13.79/2.66        v1) |  ~ (removemin_cpq_eff(v2) = v0)) &  ! [v0: $i] :  ! [v1: $i] :  !
% 13.79/2.66    [v2: $i] : (v1 = v0 |  ~ (findmin_cpq_eff(v2) = v1) |  ~ (findmin_cpq_eff(v2)
% 13.79/2.66        = v0)) &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2:
% 13.79/2.66      $i] : (v1 = v0 |  ~ (isnonempty_slb(v2) = v1) |  ~ (isnonempty_slb(v2) =
% 13.79/2.66        v0)) &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2:
% 13.79/2.66      $i] : (v1 = v0 |  ~ (isnonempty_pq(v2) = v1) |  ~ (isnonempty_pq(v2) = v0))
% 13.79/2.66  
% 13.79/2.66  Further assumptions not needed in the proof:
% 13.79/2.66  --------------------------------------------
% 13.79/2.67  ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax20, ax21, ax22,
% 13.79/2.67  ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30, ax31, ax32, ax33, ax34, ax35,
% 13.79/2.67  ax36, ax37, ax38, ax39, ax40, ax41, ax42, ax43, ax44, ax45, ax46, ax47, ax48,
% 13.79/2.67  ax49, ax50, ax51, ax52, ax53, ax55, ax56, ax57, ax58, ax59, ax6, ax60, ax61,
% 13.79/2.67  ax62, ax7, ax9, bottom_smallest, reflexivity, stricly_smaller_definition,
% 13.79/2.67  totality, transitivity
% 13.79/2.67  
% 13.79/2.67  Those formulas are unsatisfiable:
% 13.79/2.67  ---------------------------------
% 13.79/2.67  
% 13.79/2.67  Begin of proof
% 13.79/2.67  | 
% 13.79/2.67  | ALPHA: (ax8) implies:
% 13.79/2.67  |   (1)   ! [v0: $i] : ( ~ (contains_pq(create_pq, v0) = 0) |  ~ $i(v0))
% 13.79/2.67  | 
% 13.79/2.67  | ALPHA: (ax54) implies:
% 13.79/2.67  |   (2)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (triple(v0, create_slb,
% 13.79/2.67  |              v1) = v2) |  ~ $i(v1) |  ~ $i(v0) | i(v2) = create_pq)
% 13.79/2.67  | 
% 13.79/2.67  | ALPHA: (l3_co) implies:
% 13.79/2.67  |   (3)   ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] : 
% 13.79/2.67  |        ? [v5: $i] :  ? [v6: $i] :  ? [v7: $i] : ( ~ (v7 = v6) & i(v5) = v6 &
% 13.79/2.67  |          i(v3) = v4 & triple(v0, create_slb, v1) = v3 & remove_cpq(v3, v2) =
% 13.79/2.67  |          v5 & remove_pq(v4, v2) = v7 & contains_pq(v4, v2) = 0 & $i(v7) &
% 13.79/2.67  |          $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 13.79/2.67  | 
% 13.79/2.67  | ALPHA: (function-axioms) implies:
% 13.79/2.67  |   (4)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (i(v2) = v1) | 
% 13.79/2.67  |          ~ (i(v2) = v0))
% 13.79/2.67  | 
% 13.79/2.67  | DELTA: instantiating (3) with fresh symbols all_66_0, all_66_1, all_66_2,
% 13.79/2.67  |        all_66_3, all_66_4, all_66_5, all_66_6, all_66_7 gives:
% 14.27/2.67  |   (5)   ~ (all_66_0 = all_66_1) & i(all_66_2) = all_66_1 & i(all_66_4) =
% 14.27/2.67  |        all_66_3 & triple(all_66_7, create_slb, all_66_6) = all_66_4 &
% 14.27/2.67  |        remove_cpq(all_66_4, all_66_5) = all_66_2 & remove_pq(all_66_3,
% 14.27/2.67  |          all_66_5) = all_66_0 & contains_pq(all_66_3, all_66_5) = 0 &
% 14.27/2.67  |        $i(all_66_0) & $i(all_66_1) & $i(all_66_2) & $i(all_66_3) &
% 14.27/2.67  |        $i(all_66_4) & $i(all_66_5) & $i(all_66_6) & $i(all_66_7)
% 14.27/2.67  | 
% 14.27/2.67  | ALPHA: (5) implies:
% 14.27/2.67  |   (6)  $i(all_66_7)
% 14.27/2.67  |   (7)  $i(all_66_6)
% 14.27/2.67  |   (8)  $i(all_66_5)
% 14.27/2.67  |   (9)  contains_pq(all_66_3, all_66_5) = 0
% 14.27/2.68  |   (10)  triple(all_66_7, create_slb, all_66_6) = all_66_4
% 14.27/2.68  |   (11)  i(all_66_4) = all_66_3
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (2) with all_66_7, all_66_6, all_66_4, simplifying
% 14.27/2.68  |              with (6), (7), (10) gives:
% 14.27/2.68  |   (12)  i(all_66_4) = create_pq
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (4) with all_66_3, create_pq, all_66_4, simplifying
% 14.27/2.68  |              with (11), (12) gives:
% 14.27/2.68  |   (13)  all_66_3 = create_pq
% 14.27/2.68  | 
% 14.27/2.68  | REDUCE: (9), (13) imply:
% 14.27/2.68  |   (14)  contains_pq(create_pq, all_66_5) = 0
% 14.27/2.68  | 
% 14.27/2.68  | GROUND_INST: instantiating (1) with all_66_5, simplifying with (8), (14)
% 14.27/2.68  |              gives:
% 14.27/2.68  |   (15)  $false
% 14.27/2.68  | 
% 14.27/2.68  | CLOSE: (15) is inconsistent.
% 14.27/2.68  | 
% 14.27/2.68  End of proof
% 14.27/2.68  % SZS output end Proof for theBenchmark
% 14.27/2.68  
% 14.27/2.68  2039ms
%------------------------------------------------------------------------------