%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC328+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:50:51 EDT 2023 % Result : Theorem 19.05s 3.31s % Output : Proof 25.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWC328+1 : TPTP v8.1.2. Released v2.4.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n013.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Mon Aug 28 16:37:47 EDT 2023 % 0.13/0.35 % CPUTime : % 0.53/0.65 ________ _____ % 0.53/0.65 ___ __ \_________(_)________________________________ % 0.53/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.53/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.53/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.53/0.65 % 0.53/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.53/0.65 (2023-06-19) % 0.53/0.65 % 0.53/0.65 (c) Philipp Rümmer, 2009-2023 % 0.53/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.53/0.65 Amanda Stjerna. % 0.53/0.65 Free software under BSD-3-Clause. % 0.53/0.65 % 0.53/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.53/0.65 % 0.53/0.65 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.53/0.67 Running up to 7 provers in parallel. % 0.53/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.53/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.53/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.53/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.53/0.68 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.53/0.68 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.53/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.78/1.41 Prover 1: Preprocessing ... % 4.78/1.42 Prover 4: Preprocessing ... % 4.78/1.45 Prover 2: Preprocessing ... % 4.78/1.45 Prover 6: Preprocessing ... % 4.78/1.45 Prover 0: Preprocessing ... % 4.78/1.45 Prover 3: Preprocessing ... % 4.78/1.45 Prover 5: Preprocessing ... % 14.80/2.72 Prover 2: Proving ... % 15.29/2.80 Prover 5: Constructing countermodel ... % 15.29/2.83 Prover 1: Constructing countermodel ... % 15.29/2.85 Prover 6: Proving ... % 15.29/2.86 Prover 3: Constructing countermodel ... % 19.05/3.30 Prover 3: proved (2626ms) % 19.05/3.30 % 19.05/3.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 19.05/3.31 % 19.05/3.31 Prover 6: stopped % 19.05/3.31 Prover 2: stopped % 19.05/3.32 Prover 5: stopped % 19.05/3.33 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 19.05/3.33 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 19.05/3.33 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 19.05/3.33 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 21.12/3.55 Prover 4: Constructing countermodel ... % 21.67/3.64 Prover 0: Proving ... % 21.67/3.65 Prover 0: stopped % 21.67/3.65 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 21.67/3.65 Prover 11: Preprocessing ... % 21.67/3.66 Prover 8: Preprocessing ... % 21.67/3.68 Prover 7: Preprocessing ... % 21.67/3.70 Prover 10: Preprocessing ... % 23.22/3.81 Prover 13: Preprocessing ... % 23.85/3.92 Prover 10: Constructing countermodel ... % 23.85/3.92 Prover 7: Constructing countermodel ... % 23.85/3.95 Prover 1: Found proof (size 23) % 23.85/3.95 Prover 1: proved (3273ms) % 23.85/3.95 Prover 4: stopped % 23.85/3.95 Prover 11: stopped % 23.85/3.95 Prover 10: stopped % 23.85/3.96 Prover 7: stopped % 24.44/4.06 Prover 13: Constructing countermodel ... % 24.44/4.07 Prover 8: Warning: ignoring some quantifiers % 24.44/4.08 Prover 8: Constructing countermodel ... % 24.97/4.08 Prover 13: stopped % 24.97/4.09 Prover 8: stopped % 24.97/4.09 % 24.97/4.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 24.97/4.09 % 24.97/4.09 % SZS output start Proof for theBenchmark % 25.04/4.10 Assumptions after simplification: % 25.04/4.10 --------------------------------- % 25.04/4.10 % 25.04/4.10 (ax57) % 25.10/4.12 $i(nil) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (segmentP(v0, nil) = v1) | % 25.10/4.12 ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2)) % 25.10/4.12 % 25.10/4.12 (ax74) % 25.10/4.12 equalelemsP(nil) = 0 & $i(nil) % 25.10/4.12 % 25.10/4.12 (co1) % 25.10/4.13 $i(nil) & ? [v0: $i] : ? [v1: any] : (equalelemsP(v0) = v1 & ssList(v0) = 0 % 25.10/4.13 & $i(v0) & ? [v2: $i] : ? [v3: any] : (v0 = nil & segmentP(v2, nil) = v3 & % 25.10/4.13 ssList(v2) = 0 & ssList(nil) = 0 & $i(v2) & ( ~ (v3 = 0) | ~ (v1 = 0)))) % 25.10/4.13 % 25.10/4.13 (function-axioms) % 25.10/4.14 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 25.10/4.14 [v3: $i] : (v1 = v0 | ~ (gt(v3, v2) = v1) | ~ (gt(v3, v2) = v0)) & ! [v0: % 25.10/4.14 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 25.10/4.14 : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0: % 25.10/4.14 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 25.10/4.14 : (v1 = v0 | ~ (lt(v3, v2) = v1) | ~ (lt(v3, v2) = v0)) & ! [v0: % 25.10/4.14 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 25.10/4.14 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0: % 25.10/4.14 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 25.10/4.14 : (v1 = v0 | ~ (segmentP(v3, v2) = v1) | ~ (segmentP(v3, v2) = v0)) & ! % 25.10/4.14 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 25.10/4.14 $i] : (v1 = v0 | ~ (rearsegP(v3, v2) = v1) | ~ (rearsegP(v3, v2) = v0)) & % 25.10/4.14 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 25.10/4.14 $i] : (v1 = v0 | ~ (frontsegP(v3, v2) = v1) | ~ (frontsegP(v3, v2) = v0)) % 25.10/4.14 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 25.10/4.14 [v3: $i] : (v1 = v0 | ~ (memberP(v3, v2) = v1) | ~ (memberP(v3, v2) = v0)) & % 25.10/4.14 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 25.10/4.14 (cons(v3, v2) = v1) | ~ (cons(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 25.10/4.14 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (app(v3, v2) = v1) | ~ (app(v3, v2) % 25.10/4.14 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 25.10/4.14 $i] : ! [v3: $i] : (v1 = v0 | ~ (neq(v3, v2) = v1) | ~ (neq(v3, v2) = % 25.10/4.14 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (tl(v2) = % 25.10/4.14 v1) | ~ (tl(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 25.10/4.14 v0 | ~ (hd(v2) = v1) | ~ (hd(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 25.10/4.14 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (equalelemsP(v2) = v1) | % 25.10/4.14 ~ (equalelemsP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 25.10/4.14 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (duplicatefreeP(v2) = v1) | % 25.10/4.14 ~ (duplicatefreeP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 25.10/4.14 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (strictorderedP(v2) = v1) | % 25.10/4.14 ~ (strictorderedP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 25.10/4.14 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (totalorderedP(v2) = v1) | % 25.10/4.14 ~ (totalorderedP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 25.10/4.14 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (strictorderP(v2) = v1) | % 25.10/4.14 ~ (strictorderP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 25.10/4.14 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (totalorderP(v2) = v1) | ~ % 25.10/4.14 (totalorderP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 25.10/4.14 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cyclefreeP(v2) = v1) | ~ % 25.10/4.14 (cyclefreeP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 25.10/4.14 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (singletonP(v2) = v1) | ~ % 25.10/4.14 (singletonP(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 25.10/4.14 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ssList(v2) = v1) | ~ % 25.10/4.14 (ssList(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] % 25.10/4.14 : ! [v2: $i] : (v1 = v0 | ~ (ssItem(v2) = v1) | ~ (ssItem(v2) = v0)) % 25.10/4.14 % 25.10/4.14 Further assumptions not needed in the proof: % 25.10/4.14 -------------------------------------------- % 25.10/4.14 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 25.10/4.14 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 25.10/4.14 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 25.10/4.14 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, % 25.10/4.14 ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, % 25.10/4.14 ax7, ax70, ax71, ax72, ax73, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, % 25.10/4.14 ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, % 25.10/4.14 ax94, ax95 % 25.10/4.14 % 25.10/4.14 Those formulas are unsatisfiable: % 25.10/4.14 --------------------------------- % 25.10/4.14 % 25.10/4.14 Begin of proof % 25.10/4.14 | % 25.10/4.14 | ALPHA: (ax57) implies: % 25.10/4.14 | (1) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (segmentP(v0, nil) = v1) | ~ % 25.10/4.14 | $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & ssList(v0) = v2)) % 25.10/4.14 | % 25.10/4.14 | ALPHA: (ax74) implies: % 25.10/4.14 | (2) equalelemsP(nil) = 0 % 25.10/4.14 | % 25.10/4.14 | ALPHA: (co1) implies: % 25.10/4.14 | (3) ? [v0: $i] : ? [v1: any] : (equalelemsP(v0) = v1 & ssList(v0) = 0 & % 25.10/4.14 | $i(v0) & ? [v2: $i] : ? [v3: any] : (v0 = nil & segmentP(v2, nil) = % 25.10/4.14 | v3 & ssList(v2) = 0 & ssList(nil) = 0 & $i(v2) & ( ~ (v3 = 0) | ~ % 25.10/4.14 | (v1 = 0)))) % 25.10/4.14 | % 25.10/4.14 | ALPHA: (function-axioms) implies: % 25.10/4.14 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 25.10/4.14 | (v1 = v0 | ~ (ssList(v2) = v1) | ~ (ssList(v2) = v0)) % 25.10/4.14 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 25.10/4.14 | (v1 = v0 | ~ (equalelemsP(v2) = v1) | ~ (equalelemsP(v2) = v0)) % 25.10/4.14 | % 25.10/4.14 | DELTA: instantiating (3) with fresh symbols all_93_0, all_93_1 gives: % 25.10/4.15 | (6) equalelemsP(all_93_1) = all_93_0 & ssList(all_93_1) = 0 & $i(all_93_1) % 25.10/4.15 | & ? [v0: $i] : ? [v1: any] : (all_93_1 = nil & segmentP(v0, nil) = v1 % 25.10/4.15 | & ssList(v0) = 0 & ssList(nil) = 0 & $i(v0) & ( ~ (v1 = 0) | ~ % 25.10/4.15 | (all_93_0 = 0))) % 25.10/4.15 | % 25.10/4.15 | ALPHA: (6) implies: % 25.10/4.15 | (7) equalelemsP(all_93_1) = all_93_0 % 25.10/4.15 | (8) ? [v0: $i] : ? [v1: any] : (all_93_1 = nil & segmentP(v0, nil) = v1 & % 25.10/4.15 | ssList(v0) = 0 & ssList(nil) = 0 & $i(v0) & ( ~ (v1 = 0) | ~ % 25.10/4.15 | (all_93_0 = 0))) % 25.10/4.15 | % 25.10/4.15 | DELTA: instantiating (8) with fresh symbols all_97_0, all_97_1 gives: % 25.10/4.15 | (9) all_93_1 = nil & segmentP(all_97_1, nil) = all_97_0 & ssList(all_97_1) % 25.10/4.15 | = 0 & ssList(nil) = 0 & $i(all_97_1) & ( ~ (all_97_0 = 0) | ~ % 25.10/4.15 | (all_93_0 = 0)) % 25.10/4.15 | % 25.10/4.15 | ALPHA: (9) implies: % 25.10/4.15 | (10) all_93_1 = nil % 25.10/4.15 | (11) $i(all_97_1) % 25.10/4.15 | (12) ssList(all_97_1) = 0 % 25.10/4.15 | (13) segmentP(all_97_1, nil) = all_97_0 % 25.10/4.15 | (14) ~ (all_97_0 = 0) | ~ (all_93_0 = 0) % 25.10/4.15 | % 25.10/4.15 | REDUCE: (7), (10) imply: % 25.10/4.15 | (15) equalelemsP(nil) = all_93_0 % 25.10/4.15 | % 25.10/4.15 | GROUND_INST: instantiating (5) with 0, all_93_0, nil, simplifying with (2), % 25.10/4.15 | (15) gives: % 25.10/4.15 | (16) all_93_0 = 0 % 25.10/4.15 | % 25.10/4.15 | BETA: splitting (14) gives: % 25.10/4.15 | % 25.10/4.15 | Case 1: % 25.10/4.15 | | % 25.10/4.15 | | (17) ~ (all_97_0 = 0) % 25.10/4.15 | | % 25.10/4.15 | | GROUND_INST: instantiating (1) with all_97_1, all_97_0, simplifying with % 25.10/4.15 | | (11), (13) gives: % 25.10/4.15 | | (18) all_97_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & ssList(all_97_1) = v0) % 25.10/4.15 | | % 25.10/4.15 | | BETA: splitting (18) gives: % 25.10/4.15 | | % 25.10/4.15 | | Case 1: % 25.10/4.15 | | | % 25.10/4.15 | | | (19) all_97_0 = 0 % 25.10/4.15 | | | % 25.10/4.15 | | | REDUCE: (17), (19) imply: % 25.10/4.15 | | | (20) $false % 25.10/4.15 | | | % 25.10/4.15 | | | CLOSE: (20) is inconsistent. % 25.10/4.15 | | | % 25.10/4.15 | | Case 2: % 25.10/4.15 | | | % 25.10/4.15 | | | (21) ? [v0: int] : ( ~ (v0 = 0) & ssList(all_97_1) = v0) % 25.10/4.15 | | | % 25.10/4.15 | | | DELTA: instantiating (21) with fresh symbol all_234_0 gives: % 25.10/4.15 | | | (22) ~ (all_234_0 = 0) & ssList(all_97_1) = all_234_0 % 25.10/4.15 | | | % 25.10/4.15 | | | ALPHA: (22) implies: % 25.10/4.15 | | | (23) ~ (all_234_0 = 0) % 25.10/4.15 | | | (24) ssList(all_97_1) = all_234_0 % 25.10/4.15 | | | % 25.10/4.15 | | | GROUND_INST: instantiating (4) with 0, all_234_0, all_97_1, simplifying % 25.10/4.15 | | | with (12), (24) gives: % 25.10/4.15 | | | (25) all_234_0 = 0 % 25.10/4.15 | | | % 25.10/4.15 | | | REDUCE: (23), (25) imply: % 25.10/4.15 | | | (26) $false % 25.10/4.15 | | | % 25.10/4.15 | | | CLOSE: (26) is inconsistent. % 25.10/4.15 | | | % 25.10/4.15 | | End of split % 25.10/4.15 | | % 25.10/4.15 | Case 2: % 25.10/4.15 | | % 25.10/4.15 | | (27) ~ (all_93_0 = 0) % 25.10/4.15 | | % 25.10/4.15 | | REDUCE: (16), (27) imply: % 25.10/4.15 | | (28) $false % 25.10/4.15 | | % 25.10/4.15 | | CLOSE: (28) is inconsistent. % 25.10/4.15 | | % 25.10/4.15 | End of split % 25.10/4.15 | % 25.10/4.15 End of proof % 25.10/4.15 % SZS output end Proof for theBenchmark % 25.10/4.15 % 25.10/4.15 3500ms %------------------------------------------------------------------------------