TSTP Solution File: SWC369+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWC369+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 : n008.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:04 EDT 2023
% Result : Theorem 24.69s 4.08s
% Output : Proof 33.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC369+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.17/0.35 % Computer : n008.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Mon Aug 28 18:28:02 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.20/0.61 ________ _____
% 0.20/0.61 ___ __ \_________(_)________________________________
% 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61
% 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61 (2023-06-19)
% 0.20/0.61
% 0.20/0.61 (c) Philipp Rümmer, 2009-2023
% 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61 Amanda Stjerna.
% 0.20/0.61 Free software under BSD-3-Clause.
% 0.20/0.61
% 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61
% 0.20/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.71/1.46 Prover 1: Preprocessing ...
% 4.71/1.46 Prover 4: Preprocessing ...
% 4.71/1.50 Prover 6: Preprocessing ...
% 4.71/1.50 Prover 3: Preprocessing ...
% 4.71/1.50 Prover 5: Preprocessing ...
% 4.71/1.50 Prover 2: Preprocessing ...
% 4.71/1.50 Prover 0: Preprocessing ...
% 15.24/2.84 Prover 2: Proving ...
% 15.24/2.88 Prover 5: Constructing countermodel ...
% 15.24/2.91 Prover 1: Constructing countermodel ...
% 16.63/3.02 Prover 6: Proving ...
% 17.04/3.08 Prover 3: Constructing countermodel ...
% 23.35/3.89 Prover 4: Constructing countermodel ...
% 24.69/4.07 Prover 3: proved (3436ms)
% 24.69/4.07
% 24.69/4.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 24.69/4.08
% 24.69/4.08 Prover 2: stopped
% 24.69/4.08 Prover 6: stopped
% 24.69/4.09 Prover 5: stopped
% 24.69/4.10 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 24.69/4.10 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 24.69/4.10 Prover 0: Proving ...
% 24.69/4.10 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 24.69/4.10 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 24.69/4.10 Prover 0: stopped
% 24.69/4.11 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 25.68/4.35 Prover 8: Preprocessing ...
% 25.68/4.35 Prover 7: Preprocessing ...
% 25.68/4.35 Prover 10: Preprocessing ...
% 25.68/4.36 Prover 13: Preprocessing ...
% 25.68/4.38 Prover 11: Preprocessing ...
% 29.26/4.66 Prover 10: Constructing countermodel ...
% 29.26/4.69 Prover 7: Constructing countermodel ...
% 30.12/4.77 Prover 13: Constructing countermodel ...
% 30.12/4.79 Prover 1: Found proof (size 102)
% 30.12/4.79 Prover 1: proved (4161ms)
% 30.12/4.79 Prover 4: stopped
% 30.12/4.79 Prover 7: stopped
% 30.12/4.80 Prover 10: stopped
% 30.12/4.80 Prover 8: Warning: ignoring some quantifiers
% 30.12/4.81 Prover 13: stopped
% 30.12/4.81 Prover 8: Constructing countermodel ...
% 30.12/4.82 Prover 8: stopped
% 32.39/5.30 Prover 11: Constructing countermodel ...
% 32.52/5.33 Prover 11: stopped
% 32.52/5.33
% 32.52/5.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 32.52/5.33
% 32.52/5.34 % SZS output start Proof for theBenchmark
% 32.52/5.35 Assumptions after simplification:
% 32.52/5.35 ---------------------------------
% 32.52/5.35
% 32.52/5.35 (ax10)
% 32.87/5.42 ! [v0: $i] : ! [v1: any] : ( ~ (strictorderP(v0) = v1) | ~ $i(v0) | ? [v2:
% 32.87/5.42 int] : ( ~ (v2 = 0) & ssList(v0) = v2) | (( ~ (v1 = 0) | ! [v2: $i] : ( ~
% 32.87/5.42 (ssItem(v2) = 0) | ~ $i(v2) | ! [v3: $i] : ! [v4: any] : ( ~
% 32.87/5.42 (lt(v2, v3) = v4) | ~ $i(v3) | ? [v5: any] : ? [v6: any] :
% 32.87/5.42 (lt(v3, v2) = v6 & ssItem(v3) = v5 & ( ~ (v5 = 0) | ! [v7: $i] : (
% 32.87/5.42 ~ (ssList(v7) = 0) | ~ $i(v7) | ! [v8: $i] : ! [v9: $i] :
% 32.87/5.42 ! [v10: $i] : ( ~ (cons(v2, v8) = v9) | ~ (app(v7, v9) = v10)
% 32.87/5.42 | ~ $i(v8) | ? [v11: int] : ( ~ (v11 = 0) & ssList(v8) =
% 32.87/5.42 v11) | ! [v11: $i] : ! [v12: $i] : (v6 = 0 | v4 = 0 | ~
% 32.87/5.42 (cons(v3, v11) = v12) | ~ (app(v10, v12) = v0) | ~
% 32.87/5.42 $i(v11) | ? [v13: int] : ( ~ (v13 = 0) & ssList(v11) =
% 32.87/5.42 v13))))))))) & (v1 = 0 | ? [v2: $i] : (ssItem(v2) = 0 &
% 32.87/5.42 $i(v2) & ? [v3: $i] : ? [v4: any] : ? [v5: any] : (lt(v3, v2) = v5
% 32.87/5.42 & lt(v2, v3) = v4 & ssItem(v3) = 0 & $i(v3) & ? [v6: $i] :
% 32.87/5.42 (ssList(v6) = 0 & $i(v6) & ? [v7: $i] : ? [v8: $i] : ? [v9: $i] :
% 32.87/5.42 (ssList(v7) = 0 & cons(v2, v7) = v8 & app(v6, v8) = v9 & $i(v9) &
% 32.87/5.42 $i(v8) & $i(v7) & ? [v10: $i] : ? [v11: $i] : ( ~ (v5 = 0) &
% 32.87/5.42 ~ (v4 = 0) & ssList(v10) = 0 & cons(v3, v10) = v11 & app(v9,
% 32.87/5.42 v11) = v0 & $i(v11) & $i(v10)))))))))
% 32.87/5.42
% 32.87/5.42 (ax15)
% 32.87/5.42 ! [v0: $i] : ( ~ (ssList(v0) = 0) | ~ $i(v0) | ! [v1: $i] : ! [v2: any] :
% 32.87/5.42 ( ~ (neq(v0, v1) = v2) | ~ $i(v1) | ? [v3: int] : ( ~ (v3 = 0) &
% 32.87/5.42 ssList(v1) = v3) | (( ~ (v2 = 0) | ~ (v1 = v0)) & (v2 = 0 | v1 = v0))))
% 32.87/5.42
% 32.87/5.42 (ax17)
% 32.87/5.42 ssList(nil) = 0 & $i(nil)
% 32.87/5.42
% 32.87/5.42 (ax58)
% 32.87/5.43 $i(nil) & ! [v0: $i] : ! [v1: any] : ( ~ (segmentP(nil, v0) = v1) | ~
% 32.87/5.43 $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2) | (( ~ (v1 = 0) | v0
% 32.87/5.43 = nil) & ( ~ (v0 = nil) | v1 = 0)))
% 32.87/5.43
% 32.87/5.43 (ax64)
% 32.87/5.43 strictorderP(nil) = 0 & $i(nil)
% 32.87/5.43
% 32.87/5.43 (ax7)
% 32.87/5.43 ! [v0: $i] : ( ~ (ssList(v0) = 0) | ~ $i(v0) | ! [v1: $i] : ! [v2: any] :
% 32.87/5.43 ( ~ (segmentP(v0, v1) = v2) | ~ $i(v1) | ? [v3: int] : ( ~ (v3 = 0) &
% 32.87/5.43 ssList(v1) = v3) | (( ~ (v2 = 0) | ? [v3: $i] : ? [v4: $i] :
% 32.87/5.43 (ssList(v3) = 0 & app(v3, v1) = v4 & $i(v4) & $i(v3) & ? [v5: $i] :
% 32.87/5.43 (ssList(v5) = 0 & app(v4, v5) = v0 & $i(v5)))) & (v2 = 0 | ! [v3:
% 32.87/5.43 $i] : ! [v4: $i] : ( ~ (app(v3, v1) = v4) | ~ $i(v3) | ? [v5:
% 32.87/5.43 int] : ( ~ (v5 = 0) & ssList(v3) = v5) | ! [v5: $i] : ( ~
% 32.87/5.43 (app(v4, v5) = v0) | ~ $i(v5) | ? [v6: int] : ( ~ (v6 = 0) &
% 32.87/5.43 ssList(v5) = v6)))))))
% 32.87/5.43
% 32.87/5.43 (co1)
% 32.87/5.43 $i(nil) & ? [v0: $i] : (ssList(v0) = 0 & $i(v0) & ? [v1: $i] : ? [v2: any]
% 32.87/5.43 : (segmentP(v1, v0) = v2 & ssList(v1) = 0 & $i(v1) & ? [v3: $i] : ? [v4:
% 32.87/5.43 MultipleValueBool] : (ssList(v3) = 0 & neq(v3, nil) = v4 & $i(v3) & ?
% 32.87/5.43 [v5: int] : (v3 = v0 & ~ (v5 = 0) & ~ (v2 = 0) & neq(v1, nil) = v5 & (
% 32.87/5.43 ~ (v1 = nil) | v0 = nil)))))
% 32.87/5.43
% 32.87/5.43 (function-axioms)
% 32.87/5.44 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 32.87/5.44 [v3: $i] : (v1 = v0 | ~ (gt(v3, v2) = v1) | ~ (gt(v3, v2) = v0)) & ! [v0:
% 32.87/5.44 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 32.87/5.44 : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0:
% 32.87/5.44 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 32.87/5.44 : (v1 = v0 | ~ (lt(v3, v2) = v1) | ~ (lt(v3, v2) = v0)) & ! [v0:
% 32.87/5.44 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 32.87/5.44 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0:
% 32.87/5.44 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 32.87/5.44 : (v1 = v0 | ~ (segmentP(v3, v2) = v1) | ~ (segmentP(v3, v2) = v0)) & !
% 32.87/5.44 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 32.87/5.44 $i] : (v1 = v0 | ~ (rearsegP(v3, v2) = v1) | ~ (rearsegP(v3, v2) = v0)) &
% 32.87/5.44 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 32.87/5.44 $i] : (v1 = v0 | ~ (frontsegP(v3, v2) = v1) | ~ (frontsegP(v3, v2) = v0))
% 32.87/5.44 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 32.87/5.44 [v3: $i] : (v1 = v0 | ~ (memberP(v3, v2) = v1) | ~ (memberP(v3, v2) = v0)) &
% 32.87/5.44 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 32.87/5.44 (cons(v3, v2) = v1) | ~ (cons(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] :
% 32.87/5.44 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (app(v3, v2) = v1) | ~ (app(v3, v2)
% 32.87/5.44 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 32.87/5.44 $i] : ! [v3: $i] : (v1 = v0 | ~ (neq(v3, v2) = v1) | ~ (neq(v3, v2) =
% 32.87/5.44 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (tl(v2) =
% 32.87/5.44 v1) | ~ (tl(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 =
% 32.87/5.44 v0 | ~ (hd(v2) = v1) | ~ (hd(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 32.87/5.44 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (equalelemsP(v2) = v1) |
% 32.87/5.44 ~ (equalelemsP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 32.87/5.44 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (duplicatefreeP(v2) = v1) |
% 32.87/5.44 ~ (duplicatefreeP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 32.87/5.44 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (strictorderedP(v2) = v1) |
% 32.87/5.44 ~ (strictorderedP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 32.87/5.44 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (totalorderedP(v2) = v1) |
% 32.87/5.44 ~ (totalorderedP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 32.87/5.44 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (strictorderP(v2) = v1) |
% 32.87/5.44 ~ (strictorderP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 32.87/5.44 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (totalorderP(v2) = v1) | ~
% 32.87/5.44 (totalorderP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 32.87/5.44 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cyclefreeP(v2) = v1) | ~
% 32.87/5.44 (cyclefreeP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 32.87/5.44 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (singletonP(v2) = v1) | ~
% 32.87/5.44 (singletonP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 32.87/5.44 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ssList(v2) = v1) | ~
% 32.87/5.44 (ssList(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool]
% 32.87/5.44 : ! [v2: $i] : (v1 = v0 | ~ (ssItem(v2) = v1) | ~ (ssItem(v2) = v0))
% 32.87/5.44
% 32.87/5.44 Further assumptions not needed in the proof:
% 32.87/5.44 --------------------------------------------
% 32.87/5.45 ax1, ax11, ax12, ax13, ax14, ax16, ax18, ax19, ax2, ax20, ax21, ax22, ax23,
% 32.87/5.45 ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33, ax34, ax35,
% 32.87/5.45 ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45, ax46, ax47,
% 32.87/5.45 ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax59, ax6,
% 32.87/5.45 ax60, ax61, ax62, ax63, ax65, ax66, ax67, ax68, ax69, ax70, ax71, ax72, ax73,
% 32.87/5.45 ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, ax83, ax84, ax85,
% 32.87/5.45 ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, ax94, ax95
% 32.87/5.45
% 32.87/5.45 Those formulas are unsatisfiable:
% 32.87/5.45 ---------------------------------
% 32.87/5.45
% 32.87/5.45 Begin of proof
% 32.87/5.45 |
% 32.87/5.45 | ALPHA: (ax17) implies:
% 32.87/5.45 | (1) ssList(nil) = 0
% 32.87/5.45 |
% 32.87/5.45 | ALPHA: (ax58) implies:
% 32.87/5.45 | (2) ! [v0: $i] : ! [v1: any] : ( ~ (segmentP(nil, v0) = v1) | ~ $i(v0) |
% 32.87/5.45 | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2) | (( ~ (v1 = 0) | v0 =
% 32.87/5.45 | nil) & ( ~ (v0 = nil) | v1 = 0)))
% 32.87/5.45 |
% 32.87/5.45 | ALPHA: (ax64) implies:
% 32.87/5.45 | (3) strictorderP(nil) = 0
% 32.87/5.45 |
% 32.87/5.45 | ALPHA: (co1) implies:
% 32.87/5.45 | (4) $i(nil)
% 32.87/5.45 | (5) ? [v0: $i] : (ssList(v0) = 0 & $i(v0) & ? [v1: $i] : ? [v2: any] :
% 32.87/5.45 | (segmentP(v1, v0) = v2 & ssList(v1) = 0 & $i(v1) & ? [v3: $i] : ?
% 32.87/5.45 | [v4: MultipleValueBool] : (ssList(v3) = 0 & neq(v3, nil) = v4 &
% 32.87/5.45 | $i(v3) & ? [v5: int] : (v3 = v0 & ~ (v5 = 0) & ~ (v2 = 0) &
% 32.87/5.45 | neq(v1, nil) = v5 & ( ~ (v1 = nil) | v0 = nil)))))
% 32.87/5.45 |
% 32.87/5.45 | ALPHA: (function-axioms) implies:
% 32.87/5.46 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 32.87/5.46 | (v1 = v0 | ~ (ssList(v2) = v1) | ~ (ssList(v2) = v0))
% 32.87/5.46 |
% 32.87/5.46 | DELTA: instantiating (5) with fresh symbol all_93_0 gives:
% 32.87/5.46 | (7) ssList(all_93_0) = 0 & $i(all_93_0) & ? [v0: $i] : ? [v1: any] :
% 32.87/5.46 | (segmentP(v0, all_93_0) = v1 & ssList(v0) = 0 & $i(v0) & ? [v2: $i] :
% 32.87/5.46 | ? [v3: MultipleValueBool] : (ssList(v2) = 0 & neq(v2, nil) = v3 &
% 32.87/5.46 | $i(v2) & ? [v4: int] : (v2 = all_93_0 & ~ (v4 = 0) & ~ (v1 = 0)
% 32.87/5.46 | & neq(v0, nil) = v4 & ( ~ (v0 = nil) | all_93_0 = nil))))
% 32.87/5.46 |
% 32.87/5.46 | ALPHA: (7) implies:
% 32.87/5.46 | (8) ? [v0: $i] : ? [v1: any] : (segmentP(v0, all_93_0) = v1 & ssList(v0)
% 32.87/5.46 | = 0 & $i(v0) & ? [v2: $i] : ? [v3: MultipleValueBool] : (ssList(v2)
% 32.87/5.46 | = 0 & neq(v2, nil) = v3 & $i(v2) & ? [v4: int] : (v2 = all_93_0 &
% 32.87/5.46 | ~ (v4 = 0) & ~ (v1 = 0) & neq(v0, nil) = v4 & ( ~ (v0 = nil) |
% 32.87/5.46 | all_93_0 = nil))))
% 32.87/5.46 |
% 32.87/5.46 | DELTA: instantiating (8) with fresh symbols all_97_0, all_97_1 gives:
% 32.87/5.46 | (9) segmentP(all_97_1, all_93_0) = all_97_0 & ssList(all_97_1) = 0 &
% 32.87/5.46 | $i(all_97_1) & ? [v0: $i] : ? [v1: MultipleValueBool] : (ssList(v0) =
% 32.87/5.46 | 0 & neq(v0, nil) = v1 & $i(v0) & ? [v2: int] : (v0 = all_93_0 & ~
% 32.87/5.46 | (v2 = 0) & ~ (all_97_0 = 0) & neq(all_97_1, nil) = v2 & ( ~
% 32.87/5.46 | (all_97_1 = nil) | all_93_0 = nil)))
% 32.87/5.46 |
% 32.87/5.46 | ALPHA: (9) implies:
% 32.87/5.46 | (10) $i(all_97_1)
% 32.87/5.46 | (11) ssList(all_97_1) = 0
% 32.87/5.46 | (12) segmentP(all_97_1, all_93_0) = all_97_0
% 32.87/5.46 | (13) ? [v0: $i] : ? [v1: MultipleValueBool] : (ssList(v0) = 0 & neq(v0,
% 32.87/5.46 | nil) = v1 & $i(v0) & ? [v2: int] : (v0 = all_93_0 & ~ (v2 = 0) &
% 32.87/5.46 | ~ (all_97_0 = 0) & neq(all_97_1, nil) = v2 & ( ~ (all_97_1 = nil)
% 32.87/5.46 | | all_93_0 = nil)))
% 32.87/5.46 |
% 32.87/5.46 | DELTA: instantiating (13) with fresh symbols all_99_0, all_99_1 gives:
% 32.87/5.46 | (14) ssList(all_99_1) = 0 & neq(all_99_1, nil) = all_99_0 & $i(all_99_1) &
% 32.87/5.46 | ? [v0: int] : (all_99_1 = all_93_0 & ~ (v0 = 0) & ~ (all_97_0 = 0) &
% 32.87/5.46 | neq(all_97_1, nil) = v0 & ( ~ (all_97_1 = nil) | all_93_0 = nil))
% 32.87/5.46 |
% 32.87/5.46 | ALPHA: (14) implies:
% 32.87/5.46 | (15) $i(all_99_1)
% 32.87/5.47 | (16) ssList(all_99_1) = 0
% 32.87/5.47 | (17) ? [v0: int] : (all_99_1 = all_93_0 & ~ (v0 = 0) & ~ (all_97_0 = 0)
% 32.87/5.47 | & neq(all_97_1, nil) = v0 & ( ~ (all_97_1 = nil) | all_93_0 = nil))
% 32.87/5.47 |
% 32.87/5.47 | DELTA: instantiating (17) with fresh symbol all_101_0 gives:
% 32.87/5.47 | (18) all_99_1 = all_93_0 & ~ (all_101_0 = 0) & ~ (all_97_0 = 0) &
% 32.87/5.47 | neq(all_97_1, nil) = all_101_0 & ( ~ (all_97_1 = nil) | all_93_0 =
% 32.87/5.47 | nil)
% 32.87/5.47 |
% 32.87/5.47 | ALPHA: (18) implies:
% 32.87/5.47 | (19) all_99_1 = all_93_0
% 32.87/5.47 | (20) ~ (all_97_0 = 0)
% 32.87/5.47 | (21) ~ (all_101_0 = 0)
% 32.87/5.47 | (22) neq(all_97_1, nil) = all_101_0
% 32.87/5.47 | (23) ~ (all_97_1 = nil) | all_93_0 = nil
% 32.87/5.47 |
% 32.87/5.47 | REDUCE: (16), (19) imply:
% 32.87/5.47 | (24) ssList(all_93_0) = 0
% 32.87/5.47 |
% 32.87/5.47 | REDUCE: (15), (19) imply:
% 32.87/5.47 | (25) $i(all_93_0)
% 32.87/5.47 |
% 32.87/5.47 | GROUND_INST: instantiating (ax7) with all_97_1, simplifying with (10), (11)
% 32.87/5.47 | gives:
% 32.87/5.47 | (26) ! [v0: $i] : ! [v1: any] : ( ~ (segmentP(all_97_1, v0) = v1) | ~
% 33.22/5.47 | $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2) | (( ~ (v1 =
% 33.22/5.47 | 0) | ? [v2: $i] : ? [v3: $i] : (ssList(v2) = 0 & app(v2, v0)
% 33.22/5.47 | = v3 & $i(v3) & $i(v2) & ? [v4: $i] : (ssList(v4) = 0 &
% 33.22/5.47 | app(v3, v4) = all_97_1 & $i(v4)))) & (v1 = 0 | ! [v2: $i] :
% 33.22/5.47 | ! [v3: $i] : ( ~ (app(v2, v0) = v3) | ~ $i(v2) | ? [v4: int]
% 33.22/5.47 | : ( ~ (v4 = 0) & ssList(v2) = v4) | ! [v4: $i] : ( ~ (app(v3,
% 33.22/5.47 | v4) = all_97_1) | ~ $i(v4) | ? [v5: int] : ( ~ (v5 =
% 33.22/5.47 | 0) & ssList(v4) = v5))))))
% 33.22/5.47 |
% 33.22/5.47 | GROUND_INST: instantiating (ax15) with all_97_1, simplifying with (10), (11)
% 33.22/5.47 | gives:
% 33.22/5.47 | (27) ! [v0: $i] : ! [v1: any] : ( ~ (neq(all_97_1, v0) = v1) | ~ $i(v0)
% 33.22/5.47 | | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2) | (( ~ (v1 = 0) |
% 33.22/5.47 | ~ (v0 = all_97_1)) & (v1 = 0 | v0 = all_97_1)))
% 33.22/5.47 |
% 33.22/5.47 | GROUND_INST: instantiating (ax10) with nil, 0, simplifying with (3), (4)
% 33.22/5.47 | gives:
% 33.22/5.48 | (28) ? [v0: int] : ( ~ (v0 = 0) & ssList(nil) = v0) | ! [v0: $i] : ( ~
% 33.22/5.48 | (ssItem(v0) = 0) | ~ $i(v0) | ! [v1: $i] : ! [v2: any] : ( ~
% 33.22/5.48 | (lt(v0, v1) = v2) | ~ $i(v1) | ? [v3: any] : ? [v4: any] :
% 33.22/5.48 | (lt(v1, v0) = v4 & ssItem(v1) = v3 & ( ~ (v3 = 0) | ! [v5: $i] :
% 33.22/5.48 | ( ~ (ssList(v5) = 0) | ~ $i(v5) | ! [v6: $i] : ! [v7: $i] :
% 33.22/5.48 | ! [v8: $i] : ( ~ (cons(v0, v6) = v7) | ~ (app(v5, v7) =
% 33.22/5.48 | v8) | ~ $i(v6) | ? [v9: int] : ( ~ (v9 = 0) &
% 33.22/5.48 | ssList(v6) = v9) | ! [v9: $i] : ! [v10: $i] : (v4 = 0
% 33.22/5.48 | | v2 = 0 | ~ (cons(v1, v9) = v10) | ~ (app(v8, v10) =
% 33.22/5.48 | nil) | ~ $i(v9) | ? [v11: int] : ( ~ (v11 = 0) &
% 33.22/5.48 | ssList(v9) = v11))))))))
% 33.22/5.48 |
% 33.22/5.48 | GROUND_INST: instantiating (27) with nil, all_101_0, simplifying with (4),
% 33.22/5.48 | (22) gives:
% 33.22/5.48 | (29) ? [v0: int] : ( ~ (v0 = 0) & ssList(nil) = v0) | (( ~ (all_101_0 = 0)
% 33.22/5.48 | | ~ (all_97_1 = nil)) & (all_101_0 = 0 | all_97_1 = nil))
% 33.22/5.48 |
% 33.22/5.48 | GROUND_INST: instantiating (26) with all_93_0, all_97_0, simplifying with
% 33.22/5.48 | (12), (25) gives:
% 33.22/5.48 | (30) ? [v0: int] : ( ~ (v0 = 0) & ssList(all_93_0) = v0) | (( ~ (all_97_0
% 33.22/5.48 | = 0) | ? [v0: $i] : ? [v1: $i] : (ssList(v0) = 0 & app(v0,
% 33.22/5.48 | all_93_0) = v1 & $i(v1) & $i(v0) & ? [v2: $i] : (ssList(v2) =
% 33.22/5.48 | 0 & app(v1, v2) = all_97_1 & $i(v2)))) & (all_97_0 = 0 | !
% 33.22/5.48 | [v0: $i] : ! [v1: $i] : ( ~ (app(v0, all_93_0) = v1) | ~ $i(v0)
% 33.22/5.48 | | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2) | ! [v2: $i] :
% 33.22/5.48 | ( ~ (app(v1, v2) = all_97_1) | ~ $i(v2) | ? [v3: int] : ( ~
% 33.22/5.48 | (v3 = 0) & ssList(v2) = v3)))))
% 33.22/5.48 |
% 33.22/5.48 | BETA: splitting (29) gives:
% 33.22/5.48 |
% 33.22/5.48 | Case 1:
% 33.22/5.48 | |
% 33.22/5.48 | | (31) ? [v0: int] : ( ~ (v0 = 0) & ssList(nil) = v0)
% 33.22/5.48 | |
% 33.22/5.48 | | DELTA: instantiating (31) with fresh symbol all_253_0 gives:
% 33.22/5.48 | | (32) ~ (all_253_0 = 0) & ssList(nil) = all_253_0
% 33.22/5.48 | |
% 33.22/5.48 | | ALPHA: (32) implies:
% 33.22/5.48 | | (33) ~ (all_253_0 = 0)
% 33.22/5.48 | | (34) ssList(nil) = all_253_0
% 33.22/5.48 | |
% 33.22/5.48 | | GROUND_INST: instantiating (6) with 0, all_253_0, nil, simplifying with (1),
% 33.22/5.48 | | (34) gives:
% 33.22/5.48 | | (35) all_253_0 = 0
% 33.22/5.48 | |
% 33.22/5.48 | | REDUCE: (33), (35) imply:
% 33.22/5.48 | | (36) $false
% 33.22/5.48 | |
% 33.22/5.48 | | CLOSE: (36) is inconsistent.
% 33.22/5.48 | |
% 33.22/5.48 | Case 2:
% 33.22/5.48 | |
% 33.22/5.48 | | (37) ( ~ (all_101_0 = 0) | ~ (all_97_1 = nil)) & (all_101_0 = 0 |
% 33.22/5.48 | | all_97_1 = nil)
% 33.22/5.48 | |
% 33.22/5.48 | | ALPHA: (37) implies:
% 33.22/5.48 | | (38) all_101_0 = 0 | all_97_1 = nil
% 33.22/5.48 | |
% 33.22/5.48 | | BETA: splitting (38) gives:
% 33.22/5.48 | |
% 33.22/5.48 | | Case 1:
% 33.22/5.48 | | |
% 33.22/5.48 | | | (39) all_97_1 = nil
% 33.22/5.48 | | |
% 33.22/5.48 | | | REDUCE: (12), (39) imply:
% 33.22/5.48 | | | (40) segmentP(nil, all_93_0) = all_97_0
% 33.22/5.48 | | |
% 33.22/5.48 | | | BETA: splitting (23) gives:
% 33.22/5.48 | | |
% 33.22/5.48 | | | Case 1:
% 33.22/5.48 | | | |
% 33.22/5.48 | | | | (41) ~ (all_97_1 = nil)
% 33.22/5.48 | | | |
% 33.22/5.48 | | | | REDUCE: (39), (41) imply:
% 33.22/5.48 | | | | (42) $false
% 33.22/5.48 | | | |
% 33.22/5.48 | | | | CLOSE: (42) is inconsistent.
% 33.22/5.48 | | | |
% 33.22/5.48 | | | Case 2:
% 33.22/5.48 | | | |
% 33.22/5.48 | | | | (43) all_93_0 = nil
% 33.22/5.48 | | | |
% 33.22/5.48 | | | | REDUCE: (40), (43) imply:
% 33.22/5.48 | | | | (44) segmentP(nil, nil) = all_97_0
% 33.22/5.48 | | | |
% 33.22/5.48 | | | | BETA: splitting (28) gives:
% 33.22/5.48 | | | |
% 33.22/5.48 | | | | Case 1:
% 33.22/5.48 | | | | |
% 33.22/5.48 | | | | | (45) ? [v0: int] : ( ~ (v0 = 0) & ssList(nil) = v0)
% 33.22/5.48 | | | | |
% 33.22/5.48 | | | | | REF_CLOSE: (1), (6), (30), (43), (45) are inconsistent by sub-proof
% 33.22/5.48 | | | | | #1.
% 33.22/5.48 | | | | |
% 33.22/5.48 | | | | Case 2:
% 33.22/5.48 | | | | |
% 33.22/5.48 | | | | |
% 33.22/5.48 | | | | | GROUND_INST: instantiating (2) with nil, all_97_0, simplifying with
% 33.22/5.48 | | | | | (4), (44) gives:
% 33.22/5.48 | | | | | (46) all_97_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & ssList(nil) = v0)
% 33.22/5.48 | | | | |
% 33.22/5.48 | | | | | BETA: splitting (46) gives:
% 33.22/5.48 | | | | |
% 33.22/5.48 | | | | | Case 1:
% 33.22/5.48 | | | | | |
% 33.22/5.48 | | | | | | (47) all_97_0 = 0
% 33.22/5.48 | | | | | |
% 33.22/5.48 | | | | | | REDUCE: (20), (47) imply:
% 33.22/5.48 | | | | | | (48) $false
% 33.22/5.48 | | | | | |
% 33.22/5.48 | | | | | | CLOSE: (48) is inconsistent.
% 33.22/5.48 | | | | | |
% 33.22/5.49 | | | | | Case 2:
% 33.22/5.49 | | | | | |
% 33.22/5.49 | | | | | | (49) ? [v0: int] : ( ~ (v0 = 0) & ssList(nil) = v0)
% 33.22/5.49 | | | | | |
% 33.22/5.49 | | | | | | REF_CLOSE: (1), (6), (30), (43), (49) are inconsistent by sub-proof
% 33.22/5.49 | | | | | | #1.
% 33.22/5.49 | | | | | |
% 33.22/5.49 | | | | | End of split
% 33.22/5.49 | | | | |
% 33.22/5.49 | | | | End of split
% 33.22/5.49 | | | |
% 33.22/5.49 | | | End of split
% 33.22/5.49 | | |
% 33.22/5.49 | | Case 2:
% 33.22/5.49 | | |
% 33.22/5.49 | | | (50) all_101_0 = 0
% 33.22/5.49 | | |
% 33.22/5.49 | | | REDUCE: (21), (50) imply:
% 33.22/5.49 | | | (51) $false
% 33.22/5.49 | | |
% 33.22/5.49 | | | CLOSE: (51) is inconsistent.
% 33.22/5.49 | | |
% 33.22/5.49 | | End of split
% 33.22/5.49 | |
% 33.22/5.49 | End of split
% 33.22/5.49 |
% 33.22/5.49 End of proof
% 33.22/5.49
% 33.22/5.49 Sub-proof #1 shows that the following formulas are inconsistent:
% 33.22/5.49 ----------------------------------------------------------------
% 33.22/5.49 (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 33.22/5.49 (v1 = v0 | ~ (ssList(v2) = v1) | ~ (ssList(v2) = v0))
% 33.22/5.49 (2) ? [v0: int] : ( ~ (v0 = 0) & ssList(all_93_0) = v0) | (( ~ (all_97_0 =
% 33.22/5.49 0) | ? [v0: $i] : ? [v1: $i] : (ssList(v0) = 0 & app(v0,
% 33.22/5.49 all_93_0) = v1 & $i(v1) & $i(v0) & ? [v2: $i] : (ssList(v2) = 0
% 33.22/5.49 & app(v1, v2) = all_97_1 & $i(v2)))) & (all_97_0 = 0 | ! [v0:
% 33.22/5.49 $i] : ! [v1: $i] : ( ~ (app(v0, all_93_0) = v1) | ~ $i(v0) | ?
% 33.22/5.49 [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2) | ! [v2: $i] : ( ~
% 33.22/5.49 (app(v1, v2) = all_97_1) | ~ $i(v2) | ? [v3: int] : ( ~ (v3 =
% 33.22/5.49 0) & ssList(v2) = v3)))))
% 33.22/5.49 (3) all_93_0 = nil
% 33.22/5.49 (4) ssList(nil) = 0
% 33.22/5.49 (5) ? [v0: int] : ( ~ (v0 = 0) & ssList(nil) = v0)
% 33.22/5.49
% 33.22/5.49 Begin of proof
% 33.22/5.49 |
% 33.22/5.49 | BETA: splitting (2) gives:
% 33.22/5.49 |
% 33.22/5.49 | Case 1:
% 33.22/5.49 | |
% 33.22/5.49 | | (6) ? [v0: int] : ( ~ (v0 = 0) & ssList(all_93_0) = v0)
% 33.22/5.49 | |
% 33.22/5.49 | | DELTA: instantiating (5) with fresh symbol all_278_0 gives:
% 33.22/5.49 | | (7) ~ (all_278_0 = 0) & ssList(nil) = all_278_0
% 33.22/5.49 | |
% 33.22/5.49 | | ALPHA: (7) implies:
% 33.22/5.49 | | (8) ~ (all_278_0 = 0)
% 33.22/5.49 | | (9) ssList(nil) = all_278_0
% 33.22/5.49 | |
% 33.22/5.49 | | DELTA: instantiating (5) with fresh symbol all_280_0 gives:
% 33.22/5.49 | | (10) ~ (all_280_0 = 0) & ssList(nil) = all_280_0
% 33.22/5.49 | |
% 33.22/5.49 | | ALPHA: (10) implies:
% 33.22/5.49 | | (11) ssList(nil) = all_280_0
% 33.22/5.49 | |
% 33.22/5.49 | | DELTA: instantiating (6) with fresh symbol all_282_0 gives:
% 33.22/5.49 | | (12) ~ (all_282_0 = 0) & ssList(all_93_0) = all_282_0
% 33.22/5.49 | |
% 33.22/5.49 | | ALPHA: (12) implies:
% 33.22/5.49 | | (13) ssList(all_93_0) = all_282_0
% 33.22/5.49 | |
% 33.22/5.49 | | REDUCE: (3), (13) imply:
% 33.22/5.49 | | (14) ssList(nil) = all_282_0
% 33.22/5.49 | |
% 33.22/5.49 | | GROUND_INST: instantiating (1) with 0, all_280_0, nil, simplifying with (4),
% 33.22/5.49 | | (11) gives:
% 33.22/5.49 | | (15) all_280_0 = 0
% 33.22/5.49 | |
% 33.22/5.49 | | GROUND_INST: instantiating (1) with all_280_0, all_282_0, nil, simplifying
% 33.22/5.49 | | with (11), (14) gives:
% 33.22/5.49 | | (16) all_282_0 = all_280_0
% 33.22/5.49 | |
% 33.22/5.49 | | GROUND_INST: instantiating (1) with all_278_0, all_282_0, nil, simplifying
% 33.22/5.49 | | with (9), (14) gives:
% 33.22/5.49 | | (17) all_282_0 = all_278_0
% 33.22/5.49 | |
% 33.22/5.49 | | COMBINE_EQS: (16), (17) imply:
% 33.22/5.49 | | (18) all_280_0 = all_278_0
% 33.22/5.49 | |
% 33.22/5.49 | | SIMP: (18) implies:
% 33.22/5.49 | | (19) all_280_0 = all_278_0
% 33.22/5.49 | |
% 33.22/5.49 | | COMBINE_EQS: (15), (19) imply:
% 33.22/5.49 | | (20) all_278_0 = 0
% 33.22/5.49 | |
% 33.22/5.49 | | REDUCE: (8), (20) imply:
% 33.22/5.49 | | (21) $false
% 33.22/5.49 | |
% 33.22/5.49 | | CLOSE: (21) is inconsistent.
% 33.22/5.49 | |
% 33.22/5.49 | Case 2:
% 33.22/5.49 | |
% 33.22/5.49 | |
% 33.22/5.49 | | DELTA: instantiating (5) with fresh symbol all_278_0 gives:
% 33.22/5.49 | | (22) ~ (all_278_0 = 0) & ssList(nil) = all_278_0
% 33.22/5.49 | |
% 33.22/5.49 | | ALPHA: (22) implies:
% 33.22/5.49 | | (23) ~ (all_278_0 = 0)
% 33.22/5.49 | | (24) ssList(nil) = all_278_0
% 33.22/5.49 | |
% 33.22/5.49 | | DELTA: instantiating (5) with fresh symbol all_280_0 gives:
% 33.22/5.49 | | (25) ~ (all_280_0 = 0) & ssList(nil) = all_280_0
% 33.22/5.49 | |
% 33.22/5.49 | | ALPHA: (25) implies:
% 33.22/5.49 | | (26) ssList(nil) = all_280_0
% 33.22/5.49 | |
% 33.22/5.49 | | GROUND_INST: instantiating (1) with 0, all_280_0, nil, simplifying with (4),
% 33.22/5.49 | | (26) gives:
% 33.22/5.49 | | (27) all_280_0 = 0
% 33.22/5.49 | |
% 33.22/5.49 | | GROUND_INST: instantiating (1) with all_278_0, all_280_0, nil, simplifying
% 33.22/5.49 | | with (24), (26) gives:
% 33.22/5.49 | | (28) all_280_0 = all_278_0
% 33.22/5.49 | |
% 33.22/5.49 | | COMBINE_EQS: (27), (28) imply:
% 33.22/5.49 | | (29) all_278_0 = 0
% 33.22/5.49 | |
% 33.22/5.49 | | REDUCE: (23), (29) imply:
% 33.22/5.49 | | (30) $false
% 33.22/5.49 | |
% 33.22/5.49 | | CLOSE: (30) is inconsistent.
% 33.22/5.49 | |
% 33.22/5.50 | End of split
% 33.22/5.50 |
% 33.22/5.50 End of proof
% 33.22/5.50 % SZS output end Proof for theBenchmark
% 33.22/5.50
% 33.22/5.50 4880ms
%------------------------------------------------------------------------------