%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC133+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 : n026.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:49:50 EDT 2023 % Result : Theorem 34.68s 5.67s % Output : Proof 40.96s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SWC133+1 : TPTP v8.1.2. Released v2.4.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.33 % Computer : n026.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Mon Aug 28 18:04:05 EDT 2023 % 0.11/0.33 % CPUTime : % 0.18/0.63 ________ _____ % 0.18/0.63 ___ __ \_________(_)________________________________ % 0.18/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.18/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.18/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.18/0.63 % 0.18/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.18/0.63 (2023-06-19) % 0.18/0.63 % 0.18/0.63 (c) Philipp Rümmer, 2009-2023 % 0.18/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.63 Amanda Stjerna. % 0.18/0.63 Free software under BSD-3-Clause. % 0.18/0.63 % 0.18/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.63 % 0.18/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.18/0.65 Running up to 7 provers in parallel. % 0.18/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 6.69/1.86 Prover 2: Preprocessing ... % 6.69/1.86 Prover 0: Preprocessing ... % 6.69/1.86 Prover 5: Preprocessing ... % 7.04/1.86 Prover 3: Preprocessing ... % 7.04/1.86 Prover 4: Preprocessing ... % 7.04/1.86 Prover 6: Preprocessing ... % 7.04/1.91 Prover 1: Preprocessing ... % 22.49/4.02 Prover 2: Proving ... % 22.49/4.04 Prover 5: Constructing countermodel ... % 22.49/4.09 Prover 1: Constructing countermodel ... % 24.73/4.31 Prover 6: Proving ... % 24.73/4.32 Prover 3: Constructing countermodel ... % 31.71/5.50 Prover 4: Constructing countermodel ... % 34.58/5.66 Prover 3: proved (4996ms) % 34.58/5.66 % 34.68/5.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 34.68/5.67 % 34.68/5.67 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 34.68/5.67 Prover 2: stopped % 34.68/5.67 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 34.68/5.67 Prover 5: stopped % 34.68/5.68 Prover 6: stopped % 34.68/5.68 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 34.68/5.68 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 36.38/5.92 Prover 7: Preprocessing ... % 36.38/5.92 Prover 8: Preprocessing ... % 36.38/5.93 Prover 11: Preprocessing ... % 37.29/6.02 Prover 0: Proving ... % 37.29/6.03 Prover 0: stopped % 37.29/6.04 Prover 1: Found proof (size 30) % 37.29/6.04 Prover 1: proved (5379ms) % 37.29/6.04 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 37.29/6.06 Prover 4: stopped % 37.29/6.08 Prover 10: Preprocessing ... % 37.29/6.14 Prover 7: stopped % 37.29/6.19 Prover 10: stopped % 38.37/6.25 Prover 11: stopped % 38.37/6.26 Prover 13: Preprocessing ... % 39.43/6.37 Prover 13: stopped % 40.27/6.57 Prover 8: Warning: ignoring some quantifiers % 40.27/6.58 Prover 8: Constructing countermodel ... % 40.47/6.60 Prover 8: stopped % 40.47/6.61 % 40.47/6.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 40.47/6.61 % 40.47/6.62 % SZS output start Proof for theBenchmark % 40.47/6.63 Assumptions after simplification: % 40.47/6.63 --------------------------------- % 40.47/6.63 % 40.47/6.63 (ax15) % 40.70/6.67 ! [v0: $i] : ( ~ (ssList(v0) = 0) | ~ $i(v0) | ! [v1: $i] : ! [v2: any] : % 40.70/6.67 ( ~ (neq(v0, v1) = v2) | ~ $i(v1) | ? [v3: int] : ( ~ (v3 = 0) & % 40.70/6.67 ssList(v1) = v3) | (( ~ (v2 = 0) | ~ (v1 = v0)) & (v2 = 0 | v1 = v0)))) % 40.70/6.67 % 40.70/6.67 (ax17) % 40.70/6.67 ssList(nil) = 0 & $i(nil) % 40.70/6.67 % 40.70/6.67 (ax60) % 40.70/6.67 cyclefreeP(nil) = 0 & $i(nil) % 40.70/6.67 % 40.70/6.67 (co1) % 40.70/6.68 $i(nil) & ? [v0: $i] : (ssList(v0) = 0 & $i(v0) & ? [v1: $i] : ? [v2: any] % 40.70/6.68 : (cyclefreeP(v1) = v2 & ssList(v1) = 0 & $i(v1) & ? [v3: $i] : (ssList(v3) % 40.70/6.68 = 0 & $i(v3) & ? [v4: int] : (v3 = v0 & ~ (v4 = 0) & ~ (v2 = 0) & % 40.70/6.68 neq(v1, nil) = v4)))) % 40.70/6.68 % 40.70/6.68 (function-axioms) % 40.70/6.70 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 40.70/6.70 [v3: $i] : (v1 = v0 | ~ (gt(v3, v2) = v1) | ~ (gt(v3, v2) = v0)) & ! [v0: % 40.70/6.70 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 40.70/6.70 : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0: % 40.70/6.70 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 40.70/6.70 : (v1 = v0 | ~ (lt(v3, v2) = v1) | ~ (lt(v3, v2) = v0)) & ! [v0: % 40.70/6.70 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 40.70/6.70 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0: % 40.70/6.70 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 40.70/6.70 : (v1 = v0 | ~ (segmentP(v3, v2) = v1) | ~ (segmentP(v3, v2) = v0)) & ! % 40.70/6.70 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 40.70/6.70 $i] : (v1 = v0 | ~ (rearsegP(v3, v2) = v1) | ~ (rearsegP(v3, v2) = v0)) & % 40.70/6.70 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 40.70/6.70 $i] : (v1 = v0 | ~ (frontsegP(v3, v2) = v1) | ~ (frontsegP(v3, v2) = v0)) % 40.70/6.70 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 40.70/6.70 [v3: $i] : (v1 = v0 | ~ (memberP(v3, v2) = v1) | ~ (memberP(v3, v2) = v0)) & % 40.70/6.70 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 40.70/6.70 (cons(v3, v2) = v1) | ~ (cons(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 40.70/6.70 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (app(v3, v2) = v1) | ~ (app(v3, v2) % 40.70/6.70 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 40.70/6.70 $i] : ! [v3: $i] : (v1 = v0 | ~ (neq(v3, v2) = v1) | ~ (neq(v3, v2) = % 40.70/6.70 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (tl(v2) = % 40.70/6.70 v1) | ~ (tl(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 40.70/6.70 v0 | ~ (hd(v2) = v1) | ~ (hd(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 40.70/6.70 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (equalelemsP(v2) = v1) | % 40.70/6.70 ~ (equalelemsP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 40.70/6.70 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (duplicatefreeP(v2) = v1) | % 40.70/6.70 ~ (duplicatefreeP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 40.70/6.70 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (strictorderedP(v2) = v1) | % 40.70/6.70 ~ (strictorderedP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 40.70/6.70 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (totalorderedP(v2) = v1) | % 40.96/6.70 ~ (totalorderedP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 40.96/6.70 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (strictorderP(v2) = v1) | % 40.96/6.70 ~ (strictorderP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 40.96/6.70 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (totalorderP(v2) = v1) | ~ % 40.96/6.70 (totalorderP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 40.96/6.70 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cyclefreeP(v2) = v1) | ~ % 40.96/6.70 (cyclefreeP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 40.96/6.70 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (singletonP(v2) = v1) | ~ % 40.96/6.70 (singletonP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 40.96/6.70 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ssList(v2) = v1) | ~ % 40.96/6.70 (ssList(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] % 40.96/6.70 : ! [v2: $i] : (v1 = v0 | ~ (ssItem(v2) = v1) | ~ (ssItem(v2) = v0)) % 40.96/6.70 % 40.96/6.70 Further assumptions not needed in the proof: % 40.96/6.70 -------------------------------------------- % 40.96/6.70 ax1, ax10, ax11, ax12, ax13, ax14, ax16, ax18, ax19, ax2, ax20, ax21, ax22, % 40.96/6.70 ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33, ax34, % 40.96/6.70 ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45, ax46, % 40.96/6.70 ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax58, % 40.96/6.70 ax59, ax6, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax7, ax70, % 40.96/6.70 ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, % 40.96/6.70 ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, ax94, % 40.96/6.70 ax95 % 40.96/6.70 % 40.96/6.70 Those formulas are unsatisfiable: % 40.96/6.70 --------------------------------- % 40.96/6.70 % 40.96/6.70 Begin of proof % 40.96/6.70 | % 40.96/6.70 | ALPHA: (ax17) implies: % 40.96/6.70 | (1) ssList(nil) = 0 % 40.96/6.71 | % 40.96/6.71 | ALPHA: (ax60) implies: % 40.96/6.71 | (2) cyclefreeP(nil) = 0 % 40.96/6.71 | % 40.96/6.71 | ALPHA: (co1) implies: % 40.96/6.71 | (3) $i(nil) % 40.96/6.71 | (4) ? [v0: $i] : (ssList(v0) = 0 & $i(v0) & ? [v1: $i] : ? [v2: any] : % 40.96/6.71 | (cyclefreeP(v1) = v2 & ssList(v1) = 0 & $i(v1) & ? [v3: $i] : % 40.96/6.71 | (ssList(v3) = 0 & $i(v3) & ? [v4: int] : (v3 = v0 & ~ (v4 = 0) & % 40.96/6.71 | ~ (v2 = 0) & neq(v1, nil) = v4)))) % 40.96/6.71 | % 40.96/6.71 | ALPHA: (function-axioms) implies: % 40.96/6.71 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 40.96/6.71 | (v1 = v0 | ~ (ssList(v2) = v1) | ~ (ssList(v2) = v0)) % 40.96/6.71 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 40.96/6.71 | (v1 = v0 | ~ (cyclefreeP(v2) = v1) | ~ (cyclefreeP(v2) = v0)) % 40.96/6.71 | % 40.96/6.71 | DELTA: instantiating (4) with fresh symbol all_93_0 gives: % 40.96/6.71 | (7) ssList(all_93_0) = 0 & $i(all_93_0) & ? [v0: $i] : ? [v1: any] : % 40.96/6.71 | (cyclefreeP(v0) = v1 & ssList(v0) = 0 & $i(v0) & ? [v2: $i] : % 40.96/6.71 | (ssList(v2) = 0 & $i(v2) & ? [v3: int] : (v2 = all_93_0 & ~ (v3 = % 40.96/6.71 | 0) & ~ (v1 = 0) & neq(v0, nil) = v3))) % 40.96/6.72 | % 40.96/6.72 | ALPHA: (7) implies: % 40.96/6.72 | (8) ? [v0: $i] : ? [v1: any] : (cyclefreeP(v0) = v1 & ssList(v0) = 0 & % 40.96/6.72 | $i(v0) & ? [v2: $i] : (ssList(v2) = 0 & $i(v2) & ? [v3: int] : (v2 % 40.96/6.72 | = all_93_0 & ~ (v3 = 0) & ~ (v1 = 0) & neq(v0, nil) = v3))) % 40.96/6.72 | % 40.96/6.72 | DELTA: instantiating (8) with fresh symbols all_97_0, all_97_1 gives: % 40.96/6.72 | (9) cyclefreeP(all_97_1) = all_97_0 & ssList(all_97_1) = 0 & $i(all_97_1) & % 40.96/6.72 | ? [v0: $i] : (ssList(v0) = 0 & $i(v0) & ? [v1: int] : (v0 = all_93_0 % 40.96/6.72 | & ~ (v1 = 0) & ~ (all_97_0 = 0) & neq(all_97_1, nil) = v1)) % 40.96/6.72 | % 40.96/6.72 | ALPHA: (9) implies: % 40.96/6.72 | (10) $i(all_97_1) % 40.96/6.72 | (11) ssList(all_97_1) = 0 % 40.96/6.72 | (12) cyclefreeP(all_97_1) = all_97_0 % 40.96/6.72 | (13) ? [v0: $i] : (ssList(v0) = 0 & $i(v0) & ? [v1: int] : (v0 = all_93_0 % 40.96/6.72 | & ~ (v1 = 0) & ~ (all_97_0 = 0) & neq(all_97_1, nil) = v1)) % 40.96/6.72 | % 40.96/6.72 | DELTA: instantiating (13) with fresh symbol all_99_0 gives: % 40.96/6.72 | (14) ssList(all_99_0) = 0 & $i(all_99_0) & ? [v0: int] : (all_99_0 = % 40.96/6.72 | all_93_0 & ~ (v0 = 0) & ~ (all_97_0 = 0) & neq(all_97_1, nil) = % 40.96/6.72 | v0) % 40.96/6.72 | % 40.96/6.72 | ALPHA: (14) implies: % 40.96/6.72 | (15) ? [v0: int] : (all_99_0 = all_93_0 & ~ (v0 = 0) & ~ (all_97_0 = 0) % 40.96/6.72 | & neq(all_97_1, nil) = v0) % 40.96/6.72 | % 40.96/6.72 | DELTA: instantiating (15) with fresh symbol all_101_0 gives: % 40.96/6.72 | (16) all_99_0 = all_93_0 & ~ (all_101_0 = 0) & ~ (all_97_0 = 0) & % 40.96/6.72 | neq(all_97_1, nil) = all_101_0 % 40.96/6.72 | % 40.96/6.72 | ALPHA: (16) implies: % 40.96/6.72 | (17) ~ (all_97_0 = 0) % 40.96/6.72 | (18) ~ (all_101_0 = 0) % 40.96/6.72 | (19) neq(all_97_1, nil) = all_101_0 % 40.96/6.72 | % 40.96/6.73 | GROUND_INST: instantiating (ax15) with all_97_1, simplifying with (10), (11) % 40.96/6.73 | gives: % 40.96/6.73 | (20) ! [v0: $i] : ! [v1: any] : ( ~ (neq(all_97_1, v0) = v1) | ~ $i(v0) % 40.96/6.73 | | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2) | (( ~ (v1 = 0) | % 40.96/6.73 | ~ (v0 = all_97_1)) & (v1 = 0 | v0 = all_97_1))) % 40.96/6.73 | % 40.96/6.73 | GROUND_INST: instantiating (20) with nil, all_101_0, simplifying with (3), % 40.96/6.73 | (19) gives: % 40.96/6.73 | (21) ? [v0: int] : ( ~ (v0 = 0) & ssList(nil) = v0) | (( ~ (all_101_0 = 0) % 40.96/6.73 | | ~ (all_97_1 = nil)) & (all_101_0 = 0 | all_97_1 = nil)) % 40.96/6.73 | % 40.96/6.73 | BETA: splitting (21) gives: % 40.96/6.73 | % 40.96/6.73 | Case 1: % 40.96/6.73 | | % 40.96/6.73 | | (22) ? [v0: int] : ( ~ (v0 = 0) & ssList(nil) = v0) % 40.96/6.73 | | % 40.96/6.73 | | DELTA: instantiating (22) with fresh symbol all_261_0 gives: % 40.96/6.73 | | (23) ~ (all_261_0 = 0) & ssList(nil) = all_261_0 % 40.96/6.73 | | % 40.96/6.73 | | ALPHA: (23) implies: % 40.96/6.73 | | (24) ~ (all_261_0 = 0) % 40.96/6.73 | | (25) ssList(nil) = all_261_0 % 40.96/6.73 | | % 40.96/6.73 | | GROUND_INST: instantiating (5) with 0, all_261_0, nil, simplifying with (1), % 40.96/6.73 | | (25) gives: % 40.96/6.73 | | (26) all_261_0 = 0 % 40.96/6.73 | | % 40.96/6.73 | | REDUCE: (24), (26) imply: % 40.96/6.73 | | (27) $false % 40.96/6.73 | | % 40.96/6.73 | | CLOSE: (27) is inconsistent. % 40.96/6.74 | | % 40.96/6.74 | Case 2: % 40.96/6.74 | | % 40.96/6.74 | | (28) ( ~ (all_101_0 = 0) | ~ (all_97_1 = nil)) & (all_101_0 = 0 | % 40.96/6.74 | | all_97_1 = nil) % 40.96/6.74 | | % 40.96/6.74 | | ALPHA: (28) implies: % 40.96/6.74 | | (29) all_101_0 = 0 | all_97_1 = nil % 40.96/6.74 | | % 40.96/6.74 | | BETA: splitting (29) gives: % 40.96/6.74 | | % 40.96/6.74 | | Case 1: % 40.96/6.74 | | | % 40.96/6.74 | | | (30) all_97_1 = nil % 40.96/6.74 | | | % 40.96/6.74 | | | REDUCE: (12), (30) imply: % 40.96/6.74 | | | (31) cyclefreeP(nil) = all_97_0 % 40.96/6.74 | | | % 40.96/6.74 | | | GROUND_INST: instantiating (6) with 0, all_97_0, nil, simplifying with % 40.96/6.74 | | | (2), (31) gives: % 40.96/6.74 | | | (32) all_97_0 = 0 % 40.96/6.74 | | | % 40.96/6.74 | | | REDUCE: (17), (32) imply: % 40.96/6.74 | | | (33) $false % 40.96/6.74 | | | % 40.96/6.74 | | | CLOSE: (33) is inconsistent. % 40.96/6.74 | | | % 40.96/6.74 | | Case 2: % 40.96/6.74 | | | % 40.96/6.74 | | | (34) all_101_0 = 0 % 40.96/6.74 | | | % 40.96/6.74 | | | REDUCE: (18), (34) imply: % 40.96/6.74 | | | (35) $false % 40.96/6.74 | | | % 40.96/6.74 | | | CLOSE: (35) is inconsistent. % 40.96/6.74 | | | % 40.96/6.74 | | End of split % 40.96/6.74 | | % 40.96/6.74 | End of split % 40.96/6.74 | % 40.96/6.74 End of proof % 40.96/6.74 % SZS output end Proof for theBenchmark % 40.96/6.74 % 40.96/6.74 6108ms %------------------------------------------------------------------------------