TSTP Solution File: SWC371+1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SWC371+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n013.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 20:51:05 EDT 2023

% Result   : Theorem 63.34s 9.01s
% Output   : Proof 76.99s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWC371+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34  % Computer : n013.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon Aug 28 14:50:17 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.60  ________       _____
% 0.19/0.60  ___  __ \_________(_)________________________________
% 0.19/0.60  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.60  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.60  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.60  
% 0.19/0.60  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.60  (2023-06-19)
% 0.19/0.60  
% 0.19/0.60  (c) Philipp Rümmer, 2009-2023
% 0.19/0.60  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.60                Amanda Stjerna.
% 0.19/0.60  Free software under BSD-3-Clause.
% 0.19/0.60  
% 0.19/0.60  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.60  
% 0.19/0.60  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.61  Running up to 7 provers in parallel.
% 0.19/0.63  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.63  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.63  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.63  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.63  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.63  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.63  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 5.21/1.47  Prover 1: Preprocessing ...
% 5.36/1.48  Prover 4: Preprocessing ...
% 5.36/1.51  Prover 5: Preprocessing ...
% 5.36/1.51  Prover 6: Preprocessing ...
% 5.36/1.51  Prover 0: Preprocessing ...
% 5.36/1.51  Prover 2: Preprocessing ...
% 5.36/1.51  Prover 3: Preprocessing ...
% 14.87/2.74  Prover 5: Constructing countermodel ...
% 14.87/2.75  Prover 2: Proving ...
% 15.91/2.89  Prover 1: Constructing countermodel ...
% 15.91/2.93  Prover 3: Constructing countermodel ...
% 17.12/3.08  Prover 6: Proving ...
% 24.35/4.04  Prover 4: Constructing countermodel ...
% 26.23/4.29  Prover 0: Proving ...
% 63.34/9.01  Prover 5: proved (8387ms)
% 63.34/9.01  
% 63.34/9.01  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 63.34/9.01  
% 63.34/9.02  Prover 3: stopped
% 63.34/9.02  Prover 2: stopped
% 63.34/9.02  Prover 6: stopped
% 63.34/9.02  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 63.34/9.02  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 63.34/9.02  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 63.34/9.03  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 63.34/9.03  Prover 0: stopped
% 63.34/9.03  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 64.97/9.29  Prover 10: Preprocessing ...
% 64.97/9.29  Prover 11: Preprocessing ...
% 65.67/9.31  Prover 7: Preprocessing ...
% 65.67/9.32  Prover 8: Preprocessing ...
% 65.67/9.33  Prover 13: Preprocessing ...
% 66.30/9.46  Prover 10: Constructing countermodel ...
% 66.30/9.47  Prover 7: Constructing countermodel ...
% 67.87/9.60  Prover 8: Warning: ignoring some quantifiers
% 67.87/9.61  Prover 8: Constructing countermodel ...
% 68.05/9.65  Prover 13: Constructing countermodel ...
% 72.95/10.27  Prover 11: Constructing countermodel ...
% 76.64/10.73  Prover 10: Found proof (size 24)
% 76.64/10.73  Prover 10: proved (1703ms)
% 76.64/10.73  Prover 11: stopped
% 76.64/10.73  Prover 13: stopped
% 76.64/10.73  Prover 7: stopped
% 76.64/10.73  Prover 4: stopped
% 76.64/10.73  Prover 1: stopped
% 76.64/10.73  Prover 8: stopped
% 76.64/10.73  
% 76.64/10.73  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 76.64/10.73  
% 76.64/10.74  % SZS output start Proof for theBenchmark
% 76.64/10.74  Assumptions after simplification:
% 76.64/10.74  ---------------------------------
% 76.64/10.74  
% 76.64/10.74    (ax17)
% 76.64/10.74    $i(nil) & ssList(nil)
% 76.64/10.74  
% 76.64/10.74    (ax49)
% 76.64/10.75     ! [v0: $i] : ( ~ $i(v0) |  ~ ssList(v0) | rearsegP(v0, v0))
% 76.64/10.75  
% 76.64/10.75    (ax5)
% 76.64/10.77     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (app(v1, v2) = v0) |  ~ $i(v2) |
% 76.64/10.77       ~ $i(v1) |  ~ $i(v0) |  ~ ssList(v2) |  ~ ssList(v1) |  ~ ssList(v0) |
% 76.64/10.77      frontsegP(v0, v1)) &  ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~
% 76.64/10.77      frontsegP(v0, v1) |  ~ ssList(v1) |  ~ ssList(v0) |  ? [v2: $i] : (app(v1,
% 76.64/10.77          v2) = v0 & $i(v2) & ssList(v2)))
% 76.64/10.77  
% 76.64/10.77    (ax58)
% 76.64/10.77    $i(nil) &  ! [v0: $i] : (v0 = nil |  ~ $i(v0) |  ~ segmentP(nil, v0) |  ~
% 76.64/10.77      ssList(v0)) & ( ~ ssList(nil) | segmentP(nil, nil))
% 76.64/10.77  
% 76.64/10.77    (ax6)
% 76.64/10.77     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (app(v2, v1) = v0) |  ~ $i(v2) |
% 76.64/10.77       ~ $i(v1) |  ~ $i(v0) |  ~ ssList(v2) |  ~ ssList(v1) |  ~ ssList(v0) |
% 76.64/10.77      rearsegP(v0, v1)) &  ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~
% 76.64/10.77      rearsegP(v0, v1) |  ~ ssList(v1) |  ~ ssList(v0) |  ? [v2: $i] : (app(v2,
% 76.64/10.77          v1) = v0 & $i(v2) & ssList(v2)))
% 76.64/10.77  
% 76.64/10.77    (ax7)
% 76.64/10.78     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] : ( ~
% 76.64/10.78      (app(v3, v4) = v0) |  ~ (app(v2, v1) = v3) |  ~ $i(v4) |  ~ $i(v2) |  ~
% 76.64/10.78      $i(v1) |  ~ $i(v0) |  ~ ssList(v4) |  ~ ssList(v2) |  ~ ssList(v1) |  ~
% 76.64/10.78      ssList(v0) | segmentP(v0, v1)) &  ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~
% 76.64/10.78      $i(v0) |  ~ segmentP(v0, v1) |  ~ ssList(v1) |  ~ ssList(v0) |  ? [v2: $i] :
% 76.64/10.78       ? [v3: $i] :  ? [v4: $i] : (app(v3, v4) = v0 & app(v2, v1) = v3 & $i(v4) &
% 76.64/10.78        $i(v3) & $i(v2) & ssList(v4) & ssList(v2)))
% 76.64/10.78  
% 76.64/10.78    (co1)
% 76.64/10.78    $i(nil) &  ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] : (app(v0, v2) = v1 & $i(v2)
% 76.64/10.78      & $i(v1) & $i(v0) & totalorderedP(v0) & ssList(v2) & ssList(v1) & ssList(v0)
% 76.64/10.78      &  ~ segmentP(v1, v0) &  ! [v3: $i] :  ! [v4: $i] :  ! [v5: $i] :  ! [v6:
% 76.64/10.78        $i] :  ! [v7: $i] :  ! [v8: $i] : ( ~ (cons(v6, nil) = v7) |  ~ (cons(v3,
% 76.64/10.78            nil) = v4) |  ~ (app(v8, v7) = v0) |  ~ (app(v4, v5) = v2) |  ~ $i(v8)
% 76.64/10.78        |  ~ $i(v6) |  ~ $i(v5) |  ~ $i(v3) |  ~ leq(v6, v3) |  ~ ssList(v8) |  ~
% 76.64/10.78        ssList(v5) |  ~ ssItem(v6) |  ~ ssItem(v3)) & ( ~ (v0 = nil) | v1 = nil))
% 76.64/10.78  
% 76.64/10.78  Further assumptions not needed in the proof:
% 76.64/10.78  --------------------------------------------
% 76.64/10.78  ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax18, ax19, ax2, ax20, ax21,
% 76.64/10.78  ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33,
% 76.64/10.78  ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45,
% 76.64/10.78  ax46, ax47, ax48, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax59, ax60,
% 76.64/10.78  ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax70, ax71, ax72, ax73,
% 76.64/10.78  ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, ax83, ax84, ax85,
% 76.64/10.78  ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, ax94, ax95
% 76.64/10.78  
% 76.64/10.78  Those formulas are unsatisfiable:
% 76.64/10.78  ---------------------------------
% 76.64/10.78  
% 76.64/10.78  Begin of proof
% 76.64/10.78  | 
% 76.64/10.78  | ALPHA: (ax5) implies:
% 76.64/10.78  |   (1)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ frontsegP(v0,
% 76.64/10.78  |            v1) |  ~ ssList(v1) |  ~ ssList(v0) |  ? [v2: $i] : (app(v1, v2) =
% 76.64/10.78  |            v0 & $i(v2) & ssList(v2)))
% 76.64/10.78  |   (2)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (app(v1, v2) = v0) |  ~
% 76.64/10.78  |          $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ ssList(v2) |  ~ ssList(v1) |  ~
% 76.64/10.78  |          ssList(v0) | frontsegP(v0, v1))
% 76.64/10.78  | 
% 76.64/10.78  | ALPHA: (ax6) implies:
% 76.64/10.78  |   (3)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ rearsegP(v0,
% 76.64/10.78  |            v1) |  ~ ssList(v1) |  ~ ssList(v0) |  ? [v2: $i] : (app(v2, v1) =
% 76.64/10.78  |            v0 & $i(v2) & ssList(v2)))
% 76.64/10.78  | 
% 76.64/10.78  | ALPHA: (ax7) implies:
% 76.64/10.78  |   (4)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] : (
% 76.64/10.78  |          ~ (app(v3, v4) = v0) |  ~ (app(v2, v1) = v3) |  ~ $i(v4) |  ~ $i(v2)
% 76.64/10.78  |          |  ~ $i(v1) |  ~ $i(v0) |  ~ ssList(v4) |  ~ ssList(v2) |  ~
% 76.64/10.78  |          ssList(v1) |  ~ ssList(v0) | segmentP(v0, v1))
% 76.64/10.78  | 
% 76.64/10.78  | ALPHA: (ax17) implies:
% 76.64/10.78  |   (5)  ssList(nil)
% 76.64/10.78  | 
% 76.64/10.78  | ALPHA: (ax58) implies:
% 76.64/10.78  |   (6)   ~ ssList(nil) | segmentP(nil, nil)
% 76.64/10.78  | 
% 76.64/10.79  | ALPHA: (co1) implies:
% 76.99/10.79  |   (7)   ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] : (app(v0, v2) = v1 & $i(v2) &
% 76.99/10.79  |          $i(v1) & $i(v0) & totalorderedP(v0) & ssList(v2) & ssList(v1) &
% 76.99/10.79  |          ssList(v0) &  ~ segmentP(v1, v0) &  ! [v3: $i] :  ! [v4: $i] :  !
% 76.99/10.79  |          [v5: $i] :  ! [v6: $i] :  ! [v7: $i] :  ! [v8: $i] : ( ~ (cons(v6,
% 76.99/10.79  |                nil) = v7) |  ~ (cons(v3, nil) = v4) |  ~ (app(v8, v7) = v0) | 
% 76.99/10.79  |            ~ (app(v4, v5) = v2) |  ~ $i(v8) |  ~ $i(v6) |  ~ $i(v5) |  ~
% 76.99/10.79  |            $i(v3) |  ~ leq(v6, v3) |  ~ ssList(v8) |  ~ ssList(v5) |  ~
% 76.99/10.79  |            ssItem(v6) |  ~ ssItem(v3)) & ( ~ (v0 = nil) | v1 = nil))
% 76.99/10.79  | 
% 76.99/10.79  | DELTA: instantiating (7) with fresh symbols all_91_0, all_91_1, all_91_2
% 76.99/10.79  |        gives:
% 76.99/10.79  |   (8)  app(all_91_2, all_91_0) = all_91_1 & $i(all_91_0) & $i(all_91_1) &
% 76.99/10.79  |        $i(all_91_2) & totalorderedP(all_91_2) & ssList(all_91_0) &
% 76.99/10.79  |        ssList(all_91_1) & ssList(all_91_2) &  ~ segmentP(all_91_1, all_91_2) &
% 76.99/10.79  |         ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] : 
% 76.99/10.79  |        ! [v5: $i] : ( ~ (cons(v3, nil) = v4) |  ~ (cons(v0, nil) = v1) |  ~
% 76.99/10.79  |          (app(v5, v4) = all_91_2) |  ~ (app(v1, v2) = all_91_0) |  ~ $i(v5) | 
% 76.99/10.79  |          ~ $i(v3) |  ~ $i(v2) |  ~ $i(v0) |  ~ leq(v3, v0) |  ~ ssList(v5) | 
% 76.99/10.79  |          ~ ssList(v2) |  ~ ssItem(v3) |  ~ ssItem(v0)) & ( ~ (all_91_2 = nil)
% 76.99/10.79  |          | all_91_1 = nil)
% 76.99/10.79  | 
% 76.99/10.79  | ALPHA: (8) implies:
% 76.99/10.79  |   (9)   ~ segmentP(all_91_1, all_91_2)
% 76.99/10.79  |   (10)  ssList(all_91_2)
% 76.99/10.79  |   (11)  ssList(all_91_1)
% 76.99/10.79  |   (12)  ssList(all_91_0)
% 76.99/10.79  |   (13)  $i(all_91_2)
% 76.99/10.79  |   (14)  $i(all_91_1)
% 76.99/10.79  |   (15)  $i(all_91_0)
% 76.99/10.79  |   (16)  app(all_91_2, all_91_0) = all_91_1
% 76.99/10.79  | 
% 76.99/10.79  | BETA: splitting (6) gives:
% 76.99/10.79  | 
% 76.99/10.79  | Case 1:
% 76.99/10.79  | | 
% 76.99/10.79  | |   (17)   ~ ssList(nil)
% 76.99/10.79  | | 
% 76.99/10.79  | | PRED_UNIFY: (5), (17) imply:
% 76.99/10.79  | |   (18)  $false
% 76.99/10.79  | | 
% 76.99/10.79  | | CLOSE: (18) is inconsistent.
% 76.99/10.79  | | 
% 76.99/10.79  | Case 2:
% 76.99/10.79  | | 
% 76.99/10.79  | | 
% 76.99/10.79  | | GROUND_INST: instantiating (ax49) with all_91_2, simplifying with (10), (13)
% 76.99/10.79  | |              gives:
% 76.99/10.79  | |   (19)  rearsegP(all_91_2, all_91_2)
% 76.99/10.79  | | 
% 76.99/10.79  | | GROUND_INST: instantiating (2) with all_91_1, all_91_2, all_91_0,
% 76.99/10.79  | |              simplifying with (10), (11), (12), (13), (14), (15), (16)
% 76.99/10.79  | |              gives:
% 76.99/10.79  | |   (20)  frontsegP(all_91_1, all_91_2)
% 76.99/10.79  | | 
% 76.99/10.79  | | GROUND_INST: instantiating (1) with all_91_1, all_91_2, simplifying with
% 76.99/10.79  | |              (10), (11), (13), (14), (20) gives:
% 76.99/10.80  | |   (21)   ? [v0: $i] : (app(all_91_2, v0) = all_91_1 & $i(v0) & ssList(v0))
% 76.99/10.80  | | 
% 76.99/10.80  | | GROUND_INST: instantiating (3) with all_91_2, all_91_2, simplifying with
% 76.99/10.80  | |              (10), (13), (19) gives:
% 76.99/10.80  | |   (22)   ? [v0: $i] : (app(v0, all_91_2) = all_91_2 & $i(v0) & ssList(v0))
% 76.99/10.80  | | 
% 76.99/10.80  | | DELTA: instantiating (21) with fresh symbol all_134_0 gives:
% 76.99/10.80  | |   (23)  app(all_91_2, all_134_0) = all_91_1 & $i(all_134_0) &
% 76.99/10.80  | |         ssList(all_134_0)
% 76.99/10.80  | | 
% 76.99/10.80  | | ALPHA: (23) implies:
% 76.99/10.80  | |   (24)  ssList(all_134_0)
% 76.99/10.80  | |   (25)  $i(all_134_0)
% 76.99/10.80  | |   (26)  app(all_91_2, all_134_0) = all_91_1
% 76.99/10.80  | | 
% 76.99/10.80  | | DELTA: instantiating (22) with fresh symbol all_148_0 gives:
% 76.99/10.80  | |   (27)  app(all_148_0, all_91_2) = all_91_2 & $i(all_148_0) &
% 76.99/10.80  | |         ssList(all_148_0)
% 76.99/10.80  | | 
% 76.99/10.80  | | ALPHA: (27) implies:
% 76.99/10.80  | |   (28)  ssList(all_148_0)
% 76.99/10.80  | |   (29)  $i(all_148_0)
% 76.99/10.80  | |   (30)  app(all_148_0, all_91_2) = all_91_2
% 76.99/10.80  | | 
% 76.99/10.80  | | GROUND_INST: instantiating (4) with all_91_1, all_91_2, all_148_0, all_91_2,
% 76.99/10.80  | |              all_134_0, simplifying with (9), (10), (11), (13), (14), (24),
% 76.99/10.80  | |              (25), (26), (28), (29), (30) gives:
% 76.99/10.80  | |   (31)  $false
% 76.99/10.80  | | 
% 76.99/10.80  | | CLOSE: (31) is inconsistent.
% 76.99/10.80  | | 
% 76.99/10.80  | End of split
% 76.99/10.80  | 
% 76.99/10.80  End of proof
% 76.99/10.80  % SZS output end Proof for theBenchmark
% 76.99/10.80  
% 76.99/10.80  10201ms
%------------------------------------------------------------------------------