↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : LAT327+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 : n005.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 06:24:47 EDT 2023

% Result   : Theorem 12.27s 2.53s
% Output   : Proof 17.23s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LAT327+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.12/0.35  % Computer : n005.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit : 300
% 0.12/0.35  % WCLimit  : 300
% 0.12/0.35  % DateTime : Thu Aug 24 06:10:53 EDT 2023
% 0.12/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.63  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.64  Running up to 7 provers in parallel.
% 0.20/0.66  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.66  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.66  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.66  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.66  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.66  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.66  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.80/1.16  Prover 1: Preprocessing ...
% 2.80/1.16  Prover 4: Preprocessing ...
% 3.12/1.20  Prover 0: Preprocessing ...
% 3.12/1.20  Prover 3: Preprocessing ...
% 3.12/1.20  Prover 5: Preprocessing ...
% 3.12/1.20  Prover 6: Preprocessing ...
% 3.12/1.20  Prover 2: Preprocessing ...
% 7.22/1.79  Prover 2: Proving ...
% 7.22/1.80  Prover 5: Proving ...
% 7.22/1.83  Prover 1: Warning: ignoring some quantifiers
% 7.71/1.87  Prover 3: Warning: ignoring some quantifiers
% 7.88/1.89  Prover 1: Constructing countermodel ...
% 7.88/1.90  Prover 3: Constructing countermodel ...
% 8.22/1.92  Prover 6: Proving ...
% 11.23/2.34  Prover 4: Warning: ignoring some quantifiers
% 11.80/2.42  Prover 4: Constructing countermodel ...
% 12.27/2.53  Prover 5: proved (1875ms)
% 12.27/2.53  
% 12.27/2.53  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.27/2.53  
% 12.27/2.53  Prover 3: stopped
% 12.27/2.53  Prover 6: stopped
% 12.27/2.53  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 12.27/2.53  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 12.27/2.53  Prover 2: stopped
% 12.27/2.54  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 12.27/2.54  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 13.13/2.60  Prover 11: Preprocessing ...
% 13.13/2.61  Prover 8: Preprocessing ...
% 13.13/2.62  Prover 7: Preprocessing ...
% 13.51/2.64  Prover 0: Proving ...
% 13.51/2.64  Prover 10: Preprocessing ...
% 13.51/2.65  Prover 0: stopped
% 13.51/2.65  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 13.51/2.72  Prover 13: Preprocessing ...
% 13.51/2.74  Prover 10: Warning: ignoring some quantifiers
% 13.51/2.75  Prover 7: Warning: ignoring some quantifiers
% 13.51/2.77  Prover 10: Constructing countermodel ...
% 13.51/2.78  Prover 7: Constructing countermodel ...
% 13.51/2.84  Prover 8: Warning: ignoring some quantifiers
% 14.44/2.87  Prover 8: Constructing countermodel ...
% 14.44/2.91  Prover 13: Warning: ignoring some quantifiers
% 15.56/2.94  Prover 13: Constructing countermodel ...
% 16.25/3.01  Prover 10: Found proof (size 17)
% 16.25/3.01  Prover 10: proved (480ms)
% 16.25/3.02  Prover 8: stopped
% 16.25/3.02  Prover 4: stopped
% 16.25/3.02  Prover 1: stopped
% 16.25/3.02  Prover 13: stopped
% 16.25/3.02  Prover 7: stopped
% 16.63/3.17  Prover 11: Warning: ignoring some quantifiers
% 17.04/3.18  Prover 11: Constructing countermodel ...
% 17.09/3.19  Prover 11: stopped
% 17.09/3.20  
% 17.09/3.20  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.09/3.20  
% 17.09/3.20  % SZS output start Proof for theBenchmark
% 17.09/3.20  Assumptions after simplification:
% 17.09/3.20  ---------------------------------
% 17.09/3.20  
% 17.09/3.20    (cc1_lattices)
% 17.18/3.21     ! [v0: $i] : ( ~ $i(v0) |  ~ l3_lattices(v0) |  ~ v10_lattices(v0) |
% 17.18/3.21      v9_lattices(v0) | v3_struct_0(v0)) &  ! [v0: $i] : ( ~ $i(v0) |  ~
% 17.18/3.21      l3_lattices(v0) |  ~ v10_lattices(v0) | v8_lattices(v0) | v3_struct_0(v0)) &
% 17.18/3.21     ! [v0: $i] : ( ~ $i(v0) |  ~ l3_lattices(v0) |  ~ v10_lattices(v0) |
% 17.18/3.21      v7_lattices(v0) | v3_struct_0(v0)) &  ! [v0: $i] : ( ~ $i(v0) |  ~
% 17.18/3.21      l3_lattices(v0) |  ~ v10_lattices(v0) | v6_lattices(v0) | v3_struct_0(v0)) &
% 17.18/3.21     ! [v0: $i] : ( ~ $i(v0) |  ~ l3_lattices(v0) |  ~ v10_lattices(v0) |
% 17.18/3.21      v5_lattices(v0) | v3_struct_0(v0)) &  ! [v0: $i] : ( ~ $i(v0) |  ~
% 17.18/3.21      l3_lattices(v0) |  ~ v10_lattices(v0) | v4_lattices(v0) | v3_struct_0(v0))
% 17.18/3.21  
% 17.18/3.21    (reflexivity_r3_lattices)
% 17.23/3.23     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ (u1_struct_0(v0) =
% 17.23/3.23        v3) |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ v9_lattices(v0) |  ~
% 17.23/3.23      v8_lattices(v0) |  ~ v6_lattices(v0) |  ~ m1_subset_1(v2, v3) |  ~
% 17.23/3.23      m1_subset_1(v1, v3) |  ~ l3_lattices(v0) | r3_lattices(v0, v1, v1) |
% 17.23/3.23      v3_struct_0(v0))
% 17.23/3.23  
% 17.23/3.23    (t63_filter_2)
% 17.23/3.24     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] :  ! [v5:
% 17.23/3.24      $i] : ( ~ (k22_filter_2(v0, v2, v3) = v4) |  ~ (u1_struct_0(v0) = v1) |  ~
% 17.23/3.24      $i(v5) |  ~ $i(v3) |  ~ $i(v2) |  ~ $i(v0) |  ~ r2_hidden(v5, v4) |  ~
% 17.23/3.24      r3_lattices(v0, v2, v3) |  ~ m1_subset_1(v5, v1) |  ~ m1_subset_1(v3, v1) | 
% 17.23/3.24      ~ m1_subset_1(v2, v1) |  ~ l3_lattices(v0) |  ~ v10_lattices(v0) |
% 17.23/3.24      r3_lattices(v0, v5, v3) | v3_struct_0(v0)) &  ! [v0: $i] :  ! [v1: $i] :  !
% 17.23/3.24    [v2: $i] :  ! [v3: $i] :  ! [v4: $i] :  ! [v5: $i] : ( ~ (k22_filter_2(v0, v2,
% 17.23/3.24          v3) = v4) |  ~ (u1_struct_0(v0) = v1) |  ~ $i(v5) |  ~ $i(v3) |  ~
% 17.23/3.24      $i(v2) |  ~ $i(v0) |  ~ r2_hidden(v5, v4) |  ~ r3_lattices(v0, v2, v3) |  ~
% 17.23/3.24      m1_subset_1(v5, v1) |  ~ m1_subset_1(v3, v1) |  ~ m1_subset_1(v2, v1) |  ~
% 17.23/3.24      l3_lattices(v0) |  ~ v10_lattices(v0) | r3_lattices(v0, v2, v5) |
% 17.23/3.24      v3_struct_0(v0)) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : 
% 17.23/3.24    ! [v4: $i] :  ! [v5: $i] : ( ~ (k22_filter_2(v0, v2, v3) = v4) |  ~
% 17.23/3.24      (u1_struct_0(v0) = v1) |  ~ $i(v5) |  ~ $i(v3) |  ~ $i(v2) |  ~ $i(v0) |  ~
% 17.23/3.24      r3_lattices(v0, v5, v3) |  ~ r3_lattices(v0, v2, v5) |  ~ r3_lattices(v0,
% 17.23/3.24        v2, v3) |  ~ m1_subset_1(v5, v1) |  ~ m1_subset_1(v3, v1) |  ~
% 17.23/3.24      m1_subset_1(v2, v1) |  ~ l3_lattices(v0) |  ~ v10_lattices(v0) |
% 17.23/3.24      r2_hidden(v5, v4) | v3_struct_0(v0))
% 17.23/3.24  
% 17.23/3.24    (t64_filter_2)
% 17.23/3.24     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] :
% 17.23/3.24    (k22_filter_2(v0, v2, v3) = v4 & u1_struct_0(v0) = v1 & $i(v4) & $i(v3) &
% 17.23/3.24      $i(v2) & $i(v1) & $i(v0) & r3_lattices(v0, v2, v3) & m1_subset_1(v3, v1) &
% 17.23/3.24      m1_subset_1(v2, v1) & l3_lattices(v0) & v10_lattices(v0) &  ~
% 17.23/3.24      v3_struct_0(v0) & ( ~ r2_hidden(v3, v4) |  ~ r2_hidden(v2, v4)))
% 17.23/3.24  
% 17.23/3.24  Further assumptions not needed in the proof:
% 17.23/3.24  --------------------------------------------
% 17.23/3.24  antisymmetry_r2_hidden, cc1_funct_1, cc2_lattices, dt_k1_xboole_0,
% 17.23/3.24  dt_k1_zfmisc_1, dt_k22_filter_2, dt_l1_lattices, dt_l1_struct_0, dt_l2_lattices,
% 17.23/3.24  dt_l3_lattices, dt_m1_subset_1, dt_m2_lattice4, dt_u1_struct_0,
% 17.23/3.24  existence_l1_lattices, existence_l1_struct_0, existence_l2_lattices,
% 17.23/3.24  existence_l3_lattices, existence_m1_subset_1, existence_m2_lattice4,
% 17.23/3.24  fc1_struct_0, fc1_subset_1, fc1_xboole_0, rc1_lattice4, rc1_subset_1,
% 17.23/3.24  rc1_xboole_0, rc2_subset_1, rc2_xboole_0, rc3_struct_0, rc5_struct_0,
% 17.23/3.24  redefinition_r3_lattices, reflexivity_r1_tarski, t1_subset, t2_subset,
% 17.23/3.24  t3_subset, t4_subset, t5_subset, t6_boole, t7_boole, t8_boole
% 17.23/3.24  
% 17.23/3.24  Those formulas are unsatisfiable:
% 17.23/3.24  ---------------------------------
% 17.23/3.24  
% 17.23/3.24  Begin of proof
% 17.23/3.24  | 
% 17.23/3.24  | ALPHA: (cc1_lattices) implies:
% 17.23/3.24  |   (1)   ! [v0: $i] : ( ~ $i(v0) |  ~ l3_lattices(v0) |  ~ v10_lattices(v0) |
% 17.23/3.24  |          v6_lattices(v0) | v3_struct_0(v0))
% 17.23/3.24  |   (2)   ! [v0: $i] : ( ~ $i(v0) |  ~ l3_lattices(v0) |  ~ v10_lattices(v0) |
% 17.23/3.24  |          v8_lattices(v0) | v3_struct_0(v0))
% 17.23/3.24  |   (3)   ! [v0: $i] : ( ~ $i(v0) |  ~ l3_lattices(v0) |  ~ v10_lattices(v0) |
% 17.23/3.24  |          v9_lattices(v0) | v3_struct_0(v0))
% 17.23/3.24  | 
% 17.23/3.24  | ALPHA: (t63_filter_2) implies:
% 17.23/3.24  |   (4)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] : 
% 17.23/3.24  |        ! [v5: $i] : ( ~ (k22_filter_2(v0, v2, v3) = v4) |  ~ (u1_struct_0(v0)
% 17.23/3.24  |            = v1) |  ~ $i(v5) |  ~ $i(v3) |  ~ $i(v2) |  ~ $i(v0) |  ~
% 17.23/3.24  |          r3_lattices(v0, v5, v3) |  ~ r3_lattices(v0, v2, v5) |  ~
% 17.23/3.24  |          r3_lattices(v0, v2, v3) |  ~ m1_subset_1(v5, v1) |  ~ m1_subset_1(v3,
% 17.23/3.24  |            v1) |  ~ m1_subset_1(v2, v1) |  ~ l3_lattices(v0) |  ~
% 17.23/3.24  |          v10_lattices(v0) | r2_hidden(v5, v4) | v3_struct_0(v0))
% 17.23/3.24  | 
% 17.23/3.24  | DELTA: instantiating (t64_filter_2) with fresh symbols all_47_0, all_47_1,
% 17.23/3.24  |        all_47_2, all_47_3, all_47_4 gives:
% 17.23/3.24  |   (5)  k22_filter_2(all_47_4, all_47_2, all_47_1) = all_47_0 &
% 17.23/3.24  |        u1_struct_0(all_47_4) = all_47_3 & $i(all_47_0) & $i(all_47_1) &
% 17.23/3.24  |        $i(all_47_2) & $i(all_47_3) & $i(all_47_4) & r3_lattices(all_47_4,
% 17.23/3.24  |          all_47_2, all_47_1) & m1_subset_1(all_47_1, all_47_3) &
% 17.23/3.24  |        m1_subset_1(all_47_2, all_47_3) & l3_lattices(all_47_4) &
% 17.23/3.24  |        v10_lattices(all_47_4) &  ~ v3_struct_0(all_47_4) & ( ~
% 17.23/3.25  |          r2_hidden(all_47_1, all_47_0) |  ~ r2_hidden(all_47_2, all_47_0))
% 17.23/3.25  | 
% 17.23/3.25  | ALPHA: (5) implies:
% 17.23/3.25  |   (6)   ~ v3_struct_0(all_47_4)
% 17.23/3.25  |   (7)  v10_lattices(all_47_4)
% 17.23/3.25  |   (8)  l3_lattices(all_47_4)
% 17.23/3.25  |   (9)  m1_subset_1(all_47_2, all_47_3)
% 17.23/3.25  |   (10)  m1_subset_1(all_47_1, all_47_3)
% 17.23/3.25  |   (11)  r3_lattices(all_47_4, all_47_2, all_47_1)
% 17.23/3.25  |   (12)  $i(all_47_4)
% 17.23/3.25  |   (13)  $i(all_47_2)
% 17.23/3.25  |   (14)  $i(all_47_1)
% 17.23/3.25  |   (15)  u1_struct_0(all_47_4) = all_47_3
% 17.23/3.25  |   (16)  k22_filter_2(all_47_4, all_47_2, all_47_1) = all_47_0
% 17.23/3.25  |   (17)   ~ r2_hidden(all_47_1, all_47_0) |  ~ r2_hidden(all_47_2, all_47_0)
% 17.23/3.25  | 
% 17.23/3.25  | GROUND_INST: instantiating (3) with all_47_4, simplifying with (6), (7), (8),
% 17.23/3.25  |              (12) gives:
% 17.23/3.25  |   (18)  v9_lattices(all_47_4)
% 17.23/3.25  | 
% 17.23/3.25  | GROUND_INST: instantiating (2) with all_47_4, simplifying with (6), (7), (8),
% 17.23/3.25  |              (12) gives:
% 17.23/3.25  |   (19)  v8_lattices(all_47_4)
% 17.23/3.25  | 
% 17.23/3.25  | GROUND_INST: instantiating (1) with all_47_4, simplifying with (6), (7), (8),
% 17.23/3.25  |              (12) gives:
% 17.23/3.25  |   (20)  v6_lattices(all_47_4)
% 17.23/3.25  | 
% 17.23/3.25  | GROUND_INST: instantiating (reflexivity_r3_lattices) with all_47_4, all_47_1,
% 17.23/3.25  |              all_47_2, all_47_3, simplifying with (6), (8), (9), (10), (12),
% 17.23/3.25  |              (13), (14), (15), (18), (19), (20) gives:
% 17.23/3.25  |   (21)  r3_lattices(all_47_4, all_47_1, all_47_1)
% 17.23/3.25  | 
% 17.23/3.25  | GROUND_INST: instantiating (reflexivity_r3_lattices) with all_47_4, all_47_2,
% 17.23/3.25  |              all_47_2, all_47_3, simplifying with (6), (8), (9), (12), (13),
% 17.23/3.25  |              (15), (18), (19), (20) gives:
% 17.23/3.25  |   (22)  r3_lattices(all_47_4, all_47_2, all_47_2)
% 17.23/3.25  | 
% 17.23/3.25  | GROUND_INST: instantiating (4) with all_47_4, all_47_3, all_47_2, all_47_1,
% 17.23/3.25  |              all_47_0, all_47_2, simplifying with (6), (7), (8), (9), (10),
% 17.23/3.25  |              (11), (12), (13), (14), (15), (16), (22) gives:
% 17.23/3.25  |   (23)  r2_hidden(all_47_2, all_47_0)
% 17.23/3.25  | 
% 17.23/3.25  | GROUND_INST: instantiating (4) with all_47_4, all_47_3, all_47_2, all_47_1,
% 17.23/3.25  |              all_47_0, all_47_1, simplifying with (6), (7), (8), (9), (10),
% 17.23/3.25  |              (11), (12), (13), (14), (15), (16), (21) gives:
% 17.23/3.25  |   (24)  r2_hidden(all_47_1, all_47_0)
% 17.23/3.25  | 
% 17.23/3.25  | BETA: splitting (17) gives:
% 17.23/3.25  | 
% 17.23/3.25  | Case 1:
% 17.23/3.25  | | 
% 17.23/3.25  | |   (25)   ~ r2_hidden(all_47_1, all_47_0)
% 17.23/3.25  | | 
% 17.23/3.25  | | PRED_UNIFY: (24), (25) imply:
% 17.23/3.26  | |   (26)  $false
% 17.23/3.26  | | 
% 17.23/3.26  | | CLOSE: (26) is inconsistent.
% 17.23/3.26  | | 
% 17.23/3.26  | Case 2:
% 17.23/3.26  | | 
% 17.23/3.26  | |   (27)   ~ r2_hidden(all_47_2, all_47_0)
% 17.23/3.26  | | 
% 17.23/3.26  | | PRED_UNIFY: (23), (27) imply:
% 17.23/3.26  | |   (28)  $false
% 17.23/3.26  | | 
% 17.23/3.26  | | CLOSE: (28) is inconsistent.
% 17.23/3.26  | | 
% 17.23/3.26  | End of split
% 17.23/3.26  | 
% 17.23/3.26  End of proof
% 17.23/3.26  % SZS output end Proof for theBenchmark
% 17.23/3.26  
% 17.23/3.26  2631ms
%------------------------------------------------------------------------------