%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC118+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 : n029.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:45 EDT 2023 % Result : Theorem 29.94s 4.67s % Output : Proof 35.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWC118+1 : TPTP v8.1.2. Released v2.4.0. % 0.03/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n029.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Mon Aug 28 19:01:26 EDT 2023 % 0.13/0.33 % CPUTime : % 0.62/0.59 ________ _____ % 0.62/0.59 ___ __ \_________(_)________________________________ % 0.62/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.62/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.62/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.62/0.59 % 0.62/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.62/0.59 (2023-06-19) % 0.62/0.59 % 0.62/0.59 (c) Philipp Rümmer, 2009-2023 % 0.62/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.62/0.59 Amanda Stjerna. % 0.62/0.59 Free software under BSD-3-Clause. % 0.62/0.59 % 0.62/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.62/0.59 % 0.62/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.62/0.60 Running up to 7 provers in parallel. % 0.62/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.62/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.62/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.62/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.62/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.62/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.62/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.75/1.53 Prover 1: Preprocessing ... % 6.02/1.53 Prover 4: Preprocessing ... % 6.06/1.57 Prover 5: Preprocessing ... % 6.06/1.57 Prover 0: Preprocessing ... % 6.06/1.57 Prover 6: Preprocessing ... % 6.06/1.57 Prover 2: Preprocessing ... % 6.06/1.57 Prover 3: Preprocessing ... % 17.26/3.01 Prover 1: Constructing countermodel ... % 17.26/3.03 Prover 6: Proving ... % 17.26/3.03 Prover 2: Proving ... % 17.26/3.03 Prover 3: Constructing countermodel ... % 17.46/3.04 Prover 5: Constructing countermodel ... % 23.94/3.88 Prover 0: Proving ... % 24.97/4.01 Prover 4: Constructing countermodel ... % 29.94/4.67 Prover 3: proved (4052ms) % 29.94/4.67 % 29.94/4.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 29.94/4.67 % 29.94/4.67 Prover 5: stopped % 29.94/4.67 Prover 2: stopped % 29.94/4.67 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 29.94/4.67 Prover 0: stopped % 29.94/4.67 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 29.94/4.67 Prover 6: stopped % 29.94/4.67 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 29.94/4.67 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 29.94/4.67 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 31.25/4.84 Prover 13: Preprocessing ... % 31.80/4.94 Prover 10: Preprocessing ... % 31.80/4.95 Prover 7: Preprocessing ... % 31.80/4.95 Prover 11: Preprocessing ... % 31.80/4.97 Prover 8: Preprocessing ... % 33.50/5.13 Prover 10: Constructing countermodel ... % 33.50/5.15 Prover 7: Constructing countermodel ... % 34.11/5.20 Prover 13: Constructing countermodel ... % 34.68/5.31 Prover 10: Found proof (size 30) % 34.68/5.31 Prover 10: proved (642ms) % 34.68/5.31 Prover 4: stopped % 34.68/5.31 Prover 13: stopped % 34.68/5.31 Prover 7: stopped % 34.68/5.32 Prover 1: stopped % 34.68/5.32 Prover 11: stopped % 34.68/5.32 Prover 8: Warning: ignoring some quantifiers % 34.68/5.33 Prover 8: Constructing countermodel ... % 34.68/5.34 Prover 8: stopped % 34.68/5.34 % 34.68/5.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 34.68/5.34 % 34.68/5.34 % SZS output start Proof for theBenchmark % 34.68/5.35 Assumptions after simplification: % 34.68/5.35 --------------------------------- % 34.68/5.35 % 34.68/5.35 (ax15) % 34.68/5.35 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ ssList(v1) | % 34.68/5.35 ~ ssList(v0) | neq(v0, v1)) & ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | ~ % 34.68/5.35 neq(v0, v0)) % 34.68/5.35 % 34.68/5.35 (ax17) % 34.68/5.36 $i(nil) & ssList(nil) % 34.68/5.36 % 34.68/5.36 (ax52) % 34.68/5.36 $i(nil) & ! [v0: $i] : (v0 = nil | ~ $i(v0) | ~ rearsegP(nil, v0) | ~ % 34.68/5.36 ssList(v0)) & ( ~ ssList(nil) | rearsegP(nil, nil)) % 34.68/5.36 % 34.68/5.36 (ax7) % 35.26/5.38 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 35.26/5.38 (app(v3, v4) = v0) | ~ (app(v2, v1) = v3) | ~ $i(v4) | ~ $i(v2) | ~ % 35.26/5.38 $i(v1) | ~ $i(v0) | ~ ssList(v4) | ~ ssList(v2) | ~ ssList(v1) | ~ % 35.26/5.38 ssList(v0) | segmentP(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ % 35.26/5.38 $i(v0) | ~ segmentP(v0, v1) | ~ ssList(v1) | ~ ssList(v0) | ? [v2: $i] : % 35.26/5.38 ? [v3: $i] : ? [v4: $i] : (app(v3, v4) = v0 & app(v2, v1) = v3 & $i(v4) & % 35.26/5.38 $i(v3) & $i(v2) & ssList(v4) & ssList(v2))) % 35.26/5.38 % 35.26/5.38 (co1) % 35.26/5.38 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] % 35.26/5.38 : (app(v3, v4) = v1 & app(v2, v0) = v3 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 35.26/5.38 $i(v0) & totalorderedP(v0) & ssList(v4) & ssList(v2) & ssList(v1) & % 35.26/5.38 ssList(v0) & ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: % 35.26/5.38 $i] : ! [v10: $i] : ( ~ (cons(v8, nil) = v9) | ~ (cons(v5, nil) = v6) | % 35.26/5.38 ~ (app(v10, v9) = v0) | ~ (app(v6, v7) = v4) | ~ $i(v10) | ~ $i(v8) | % 35.26/5.38 ~ $i(v7) | ~ $i(v5) | ~ leq(v8, v5) | ~ ssList(v10) | ~ ssList(v7) | % 35.26/5.38 ~ ssItem(v8) | ~ ssItem(v5)) & ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : % 35.26/5.38 ! [v8: $i] : ! [v9: $i] : ! [v10: $i] : ( ~ (cons(v8, nil) = v9) | ~ % 35.26/5.38 (cons(v5, nil) = v6) | ~ (app(v9, v10) = v0) | ~ (app(v7, v6) = v2) | ~ % 35.26/5.38 $i(v10) | ~ $i(v8) | ~ $i(v7) | ~ $i(v5) | ~ leq(v5, v8) | ~ % 35.26/5.38 ssList(v10) | ~ ssList(v7) | ~ ssItem(v8) | ~ ssItem(v5)) & ( ~ (v1 = % 35.26/5.38 nil) | ~ (v0 = nil)) & ( ~ (v0 = nil) | v1 = nil) & ( ~ segmentP(v1, % 35.26/5.38 v0) | ~ neq(v0, nil))) % 35.26/5.38 % 35.26/5.38 Further assumptions not needed in the proof: % 35.26/5.38 -------------------------------------------- % 35.26/5.38 ax1, ax10, ax11, ax12, ax13, ax14, ax16, ax18, ax19, ax2, ax20, ax21, ax22, % 35.26/5.38 ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33, ax34, % 35.26/5.38 ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45, ax46, % 35.26/5.38 ax47, ax48, ax49, ax5, ax50, ax51, ax53, ax54, ax55, ax56, ax57, ax58, ax59, % 35.26/5.38 ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax70, ax71, % 35.26/5.38 ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, ax83, % 35.26/5.38 ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, ax94, ax95 % 35.26/5.38 % 35.26/5.38 Those formulas are unsatisfiable: % 35.26/5.38 --------------------------------- % 35.26/5.38 % 35.26/5.38 Begin of proof % 35.26/5.39 | % 35.26/5.39 | ALPHA: (ax7) implies: % 35.26/5.39 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( % 35.26/5.39 | ~ (app(v3, v4) = v0) | ~ (app(v2, v1) = v3) | ~ $i(v4) | ~ $i(v2) % 35.26/5.39 | | ~ $i(v1) | ~ $i(v0) | ~ ssList(v4) | ~ ssList(v2) | ~ % 35.26/5.39 | ssList(v1) | ~ ssList(v0) | segmentP(v0, v1)) % 35.26/5.39 | % 35.26/5.39 | ALPHA: (ax15) implies: % 35.26/5.39 | (2) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ % 35.26/5.39 | ssList(v1) | ~ ssList(v0) | neq(v0, v1)) % 35.26/5.39 | % 35.26/5.39 | ALPHA: (ax17) implies: % 35.26/5.39 | (3) ssList(nil) % 35.26/5.39 | % 35.26/5.39 | ALPHA: (ax52) implies: % 35.26/5.39 | (4) ~ ssList(nil) | rearsegP(nil, nil) % 35.26/5.39 | % 35.26/5.39 | ALPHA: (co1) implies: % 35.26/5.39 | (5) $i(nil) % 35.37/5.39 | (6) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 35.37/5.39 | (app(v3, v4) = v1 & app(v2, v0) = v3 & $i(v4) & $i(v3) & $i(v2) & % 35.37/5.39 | $i(v1) & $i(v0) & totalorderedP(v0) & ssList(v4) & ssList(v2) & % 35.37/5.39 | ssList(v1) & ssList(v0) & ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : % 35.37/5.39 | ! [v8: $i] : ! [v9: $i] : ! [v10: $i] : ( ~ (cons(v8, nil) = v9) | % 35.37/5.39 | ~ (cons(v5, nil) = v6) | ~ (app(v10, v9) = v0) | ~ (app(v6, v7) = % 35.37/5.39 | v4) | ~ $i(v10) | ~ $i(v8) | ~ $i(v7) | ~ $i(v5) | ~ leq(v8, % 35.37/5.39 | v5) | ~ ssList(v10) | ~ ssList(v7) | ~ ssItem(v8) | ~ % 35.37/5.39 | ssItem(v5)) & ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] % 35.37/5.39 | : ! [v9: $i] : ! [v10: $i] : ( ~ (cons(v8, nil) = v9) | ~ % 35.37/5.39 | (cons(v5, nil) = v6) | ~ (app(v9, v10) = v0) | ~ (app(v7, v6) = % 35.37/5.39 | v2) | ~ $i(v10) | ~ $i(v8) | ~ $i(v7) | ~ $i(v5) | ~ leq(v5, % 35.37/5.39 | v8) | ~ ssList(v10) | ~ ssList(v7) | ~ ssItem(v8) | ~ % 35.37/5.39 | ssItem(v5)) & ( ~ (v1 = nil) | ~ (v0 = nil)) & ( ~ (v0 = nil) | v1 % 35.37/5.39 | = nil) & ( ~ segmentP(v1, v0) | ~ neq(v0, nil))) % 35.37/5.39 | % 35.37/5.39 | DELTA: instantiating (6) with fresh symbols all_91_0, all_91_1, all_91_2, % 35.37/5.39 | all_91_3, all_91_4 gives: % 35.37/5.40 | (7) app(all_91_1, all_91_0) = all_91_3 & app(all_91_2, all_91_4) = all_91_1 % 35.37/5.40 | & $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & $i(all_91_3) & % 35.37/5.40 | $i(all_91_4) & totalorderedP(all_91_4) & ssList(all_91_0) & % 35.37/5.40 | ssList(all_91_2) & ssList(all_91_3) & ssList(all_91_4) & ! [v0: $i] : % 35.37/5.40 | ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ( % 35.37/5.40 | ~ (cons(v3, nil) = v4) | ~ (cons(v0, nil) = v1) | ~ (app(v5, v4) = % 35.37/5.40 | all_91_4) | ~ (app(v1, v2) = all_91_0) | ~ $i(v5) | ~ $i(v3) | % 35.37/5.40 | ~ $i(v2) | ~ $i(v0) | ~ leq(v3, v0) | ~ ssList(v5) | ~ ssList(v2) % 35.37/5.40 | | ~ ssItem(v3) | ~ ssItem(v0)) & ! [v0: $i] : ! [v1: $i] : ! % 35.37/5.40 | [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ( ~ (cons(v3, nil) % 35.37/5.40 | = v4) | ~ (cons(v0, nil) = v1) | ~ (app(v4, v5) = all_91_4) | ~ % 35.37/5.40 | (app(v2, v1) = all_91_2) | ~ $i(v5) | ~ $i(v3) | ~ $i(v2) | ~ % 35.37/5.40 | $i(v0) | ~ leq(v0, v3) | ~ ssList(v5) | ~ ssList(v2) | ~ % 35.37/5.40 | ssItem(v3) | ~ ssItem(v0)) & ( ~ (all_91_3 = nil) | ~ (all_91_4 = % 35.37/5.40 | nil)) & ( ~ (all_91_4 = nil) | all_91_3 = nil) & ( ~ % 35.37/5.40 | segmentP(all_91_3, all_91_4) | ~ neq(all_91_4, nil)) % 35.37/5.40 | % 35.37/5.40 | ALPHA: (7) implies: % 35.37/5.40 | (8) ssList(all_91_4) % 35.37/5.40 | (9) ssList(all_91_3) % 35.37/5.40 | (10) ssList(all_91_2) % 35.37/5.40 | (11) ssList(all_91_0) % 35.37/5.40 | (12) $i(all_91_4) % 35.37/5.40 | (13) $i(all_91_3) % 35.37/5.40 | (14) $i(all_91_2) % 35.37/5.40 | (15) $i(all_91_0) % 35.37/5.40 | (16) app(all_91_2, all_91_4) = all_91_1 % 35.37/5.40 | (17) app(all_91_1, all_91_0) = all_91_3 % 35.37/5.40 | (18) ~ segmentP(all_91_3, all_91_4) | ~ neq(all_91_4, nil) % 35.37/5.40 | (19) ~ (all_91_4 = nil) | all_91_3 = nil % 35.37/5.40 | (20) ~ (all_91_3 = nil) | ~ (all_91_4 = nil) % 35.37/5.40 | % 35.37/5.40 | BETA: splitting (4) gives: % 35.37/5.40 | % 35.37/5.40 | Case 1: % 35.37/5.40 | | % 35.37/5.40 | | (21) ~ ssList(nil) % 35.37/5.40 | | % 35.37/5.40 | | PRED_UNIFY: (3), (21) imply: % 35.37/5.40 | | (22) $false % 35.37/5.41 | | % 35.37/5.41 | | CLOSE: (22) is inconsistent. % 35.37/5.41 | | % 35.37/5.41 | Case 2: % 35.37/5.41 | | % 35.37/5.41 | | % 35.37/5.41 | | GROUND_INST: instantiating (2) with all_91_4, nil, simplifying with (3), % 35.37/5.41 | | (5), (8), (12) gives: % 35.37/5.41 | | (23) all_91_4 = nil | neq(all_91_4, nil) % 35.37/5.41 | | % 35.37/5.41 | | GROUND_INST: instantiating (1) with all_91_3, all_91_4, all_91_2, all_91_1, % 35.37/5.41 | | all_91_0, simplifying with (8), (9), (10), (11), (12), (13), % 35.37/5.41 | | (14), (15), (16), (17) gives: % 35.37/5.41 | | (24) segmentP(all_91_3, all_91_4) % 35.37/5.41 | | % 35.37/5.41 | | BETA: splitting (18) gives: % 35.37/5.41 | | % 35.37/5.41 | | Case 1: % 35.37/5.41 | | | % 35.37/5.41 | | | (25) ~ neq(all_91_4, nil) % 35.37/5.41 | | | % 35.37/5.41 | | | BETA: splitting (23) gives: % 35.37/5.41 | | | % 35.37/5.41 | | | Case 1: % 35.37/5.41 | | | | % 35.37/5.41 | | | | (26) neq(all_91_4, nil) % 35.37/5.41 | | | | % 35.37/5.41 | | | | PRED_UNIFY: (25), (26) imply: % 35.37/5.41 | | | | (27) $false % 35.37/5.41 | | | | % 35.37/5.41 | | | | CLOSE: (27) is inconsistent. % 35.37/5.41 | | | | % 35.37/5.41 | | | Case 2: % 35.37/5.41 | | | | % 35.37/5.41 | | | | (28) all_91_4 = nil % 35.37/5.41 | | | | % 35.37/5.41 | | | | BETA: splitting (19) gives: % 35.37/5.41 | | | | % 35.37/5.41 | | | | Case 1: % 35.37/5.41 | | | | | % 35.37/5.41 | | | | | (29) ~ (all_91_4 = nil) % 35.37/5.41 | | | | | % 35.37/5.41 | | | | | REDUCE: (28), (29) imply: % 35.37/5.41 | | | | | (30) $false % 35.37/5.41 | | | | | % 35.37/5.41 | | | | | CLOSE: (30) is inconsistent. % 35.37/5.41 | | | | | % 35.37/5.41 | | | | Case 2: % 35.37/5.41 | | | | | % 35.37/5.41 | | | | | (31) all_91_3 = nil % 35.37/5.41 | | | | | % 35.37/5.41 | | | | | BETA: splitting (20) gives: % 35.37/5.41 | | | | | % 35.37/5.41 | | | | | Case 1: % 35.37/5.41 | | | | | | % 35.37/5.41 | | | | | | (32) ~ (all_91_3 = nil) % 35.37/5.41 | | | | | | % 35.37/5.41 | | | | | | REDUCE: (31), (32) imply: % 35.37/5.41 | | | | | | (33) $false % 35.37/5.41 | | | | | | % 35.37/5.41 | | | | | | CLOSE: (33) is inconsistent. % 35.37/5.41 | | | | | | % 35.37/5.41 | | | | | Case 2: % 35.37/5.41 | | | | | | % 35.37/5.41 | | | | | | (34) ~ (all_91_4 = nil) % 35.37/5.41 | | | | | | % 35.37/5.41 | | | | | | REDUCE: (28), (34) imply: % 35.37/5.41 | | | | | | (35) $false % 35.37/5.41 | | | | | | % 35.37/5.41 | | | | | | CLOSE: (35) is inconsistent. % 35.37/5.41 | | | | | | % 35.37/5.41 | | | | | End of split % 35.37/5.41 | | | | | % 35.37/5.41 | | | | End of split % 35.37/5.41 | | | | % 35.37/5.41 | | | End of split % 35.37/5.41 | | | % 35.37/5.41 | | Case 2: % 35.37/5.41 | | | % 35.37/5.41 | | | (36) ~ segmentP(all_91_3, all_91_4) % 35.37/5.41 | | | % 35.37/5.41 | | | PRED_UNIFY: (24), (36) imply: % 35.37/5.41 | | | (37) $false % 35.37/5.41 | | | % 35.37/5.41 | | | CLOSE: (37) is inconsistent. % 35.37/5.41 | | | % 35.37/5.41 | | End of split % 35.37/5.41 | | % 35.37/5.41 | End of split % 35.37/5.41 | % 35.37/5.41 End of proof % 35.37/5.41 % SZS output end Proof for theBenchmark % 35.37/5.41 % 35.37/5.41 4822ms %------------------------------------------------------------------------------