%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC002+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 : n027.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:07 EDT 2023 % Result : Theorem 25.03s 4.15s % Output : Proof 35.03s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SWC002+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 : n027.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 17:25:37 EDT 2023 % 0.11/0.33 % 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/sandbox/benchmark/theBenchmark.p ... % 0.19/0.61 Running up to 7 provers in parallel. % 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.25/1.46 Prover 1: Preprocessing ... % 4.25/1.46 Prover 4: Preprocessing ... % 5.22/1.50 Prover 0: Preprocessing ... % 5.22/1.50 Prover 6: Preprocessing ... % 5.22/1.50 Prover 3: Preprocessing ... % 5.22/1.50 Prover 2: Preprocessing ... % 5.22/1.50 Prover 5: Preprocessing ... % 15.34/2.85 Prover 2: Proving ... % 15.34/2.86 Prover 5: Constructing countermodel ... % 15.88/2.88 Prover 1: Constructing countermodel ... % 15.88/2.92 Prover 3: Constructing countermodel ... % 15.88/2.92 Prover 6: Proving ... % 20.95/3.63 Prover 4: Constructing countermodel ... % 20.95/3.71 Prover 0: Proving ... % 25.03/4.14 Prover 0: proved (3527ms) % 25.03/4.14 % 25.03/4.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 25.03/4.15 % 25.03/4.15 Prover 5: stopped % 25.03/4.16 Prover 3: stopped % 25.03/4.16 Prover 2: stopped % 25.62/4.17 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 25.62/4.17 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 25.62/4.17 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 25.62/4.17 Prover 6: stopped % 25.70/4.18 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 25.70/4.19 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 25.91/4.37 Prover 13: Preprocessing ... % 25.91/4.37 Prover 7: Preprocessing ... % 25.91/4.38 Prover 8: Preprocessing ... % 26.86/4.43 Prover 10: Preprocessing ... % 26.86/4.44 Prover 11: Preprocessing ... % 29.14/4.65 Prover 7: Constructing countermodel ... % 29.14/4.69 Prover 10: Constructing countermodel ... % 29.78/4.72 Prover 13: Constructing countermodel ... % 30.27/4.80 Prover 8: Warning: ignoring some quantifiers % 30.27/4.82 Prover 8: Constructing countermodel ... % 33.45/5.22 Prover 10: Found proof (size 24) % 33.45/5.22 Prover 10: proved (1059ms) % 33.45/5.23 Prover 4: stopped % 33.45/5.23 Prover 13: stopped % 33.45/5.23 Prover 7: stopped % 33.45/5.23 Prover 8: stopped % 33.45/5.23 Prover 1: stopped % 34.49/5.49 Prover 11: Constructing countermodel ... % 34.76/5.51 Prover 11: stopped % 34.76/5.51 % 34.76/5.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 34.76/5.51 % 34.76/5.52 % SZS output start Proof for theBenchmark % 34.76/5.53 Assumptions after simplification: % 34.76/5.53 --------------------------------- % 34.76/5.53 % 34.76/5.53 (ax17) % 34.76/5.53 $i(nil) & ssList(nil) % 34.76/5.53 % 34.76/5.53 (ax58) % 34.76/5.54 $i(nil) & ! [v0: $i] : (v0 = nil | ~ $i(v0) | ~ segmentP(nil, v0) | ~ % 34.76/5.54 ssList(v0)) & ( ~ ssList(nil) | segmentP(nil, nil)) % 34.76/5.54 % 34.76/5.54 (co1) % 35.03/5.58 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] % 35.03/5.58 : ? [v5: $i] : ? [v6: $i] : (cons(v2, nil) = v3 & app(v5, v6) = v1 & app(v4, % 35.03/5.58 v6) = v0 & app(v4, v3) = v5 & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & % 35.03/5.58 $i(v1) & $i(v0) & ssList(v6) & ssList(v4) & ssList(v1) & ssList(v0) & % 35.03/5.58 neq(v1, nil) & ssItem(v2) & ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ! % 35.03/5.58 [v10: $i] : ! [v11: $i] : ( ~ (cons(v7, nil) = v8) | ~ (app(v10, v11) = % 35.03/5.58 v1) | ~ (app(v9, v8) = v10) | ~ $i(v11) | ~ $i(v9) | ~ $i(v7) | ~ % 35.03/5.58 ssList(v11) | ~ ssList(v9) | ~ ssItem(v7) | ? [v12: $i] : ? [v13: $i] % 35.03/5.58 : ($i(v13) & (( ~ (v13 = v7) & geq(v13, v7) & memberP(v1, v13) & % 35.03/5.58 ssItem(v13)) | ( ~ (v12 = v0) & app(v9, v11) = v12 & $i(v12))))) & % 35.03/5.58 ! [v7: $i] : (v7 = v2 | ~ $i(v7) | ~ geq(v7, v2) | ~ memberP(v1, v7) | ~ % 35.03/5.58 ssItem(v7))) % 35.03/5.58 % 35.03/5.58 (function-axioms) % 35.03/5.59 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 35.03/5.59 (cons(v3, v2) = v1) | ~ (cons(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 35.03/5.59 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (app(v3, v2) = v1) | ~ (app(v3, v2) % 35.03/5.59 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (tl(v2) = % 35.03/5.59 v1) | ~ (tl(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 35.03/5.59 v0 | ~ (hd(v2) = v1) | ~ (hd(v2) = v0)) % 35.03/5.59 % 35.03/5.59 Further assumptions not needed in the proof: % 35.03/5.59 -------------------------------------------- % 35.03/5.59 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax18, ax19, ax2, ax20, ax21, % 35.03/5.59 ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33, % 35.03/5.59 ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45, % 35.03/5.59 ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, % 35.03/5.59 ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax7, % 35.03/5.59 ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, % 35.03/5.59 ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, % 35.03/5.59 ax94, ax95 % 35.03/5.59 % 35.03/5.59 Those formulas are unsatisfiable: % 35.03/5.59 --------------------------------- % 35.03/5.59 % 35.03/5.59 Begin of proof % 35.03/5.59 | % 35.03/5.59 | ALPHA: (ax17) implies: % 35.03/5.59 | (1) ssList(nil) % 35.03/5.59 | % 35.03/5.59 | ALPHA: (ax58) implies: % 35.03/5.59 | (2) ~ ssList(nil) | segmentP(nil, nil) % 35.03/5.59 | % 35.03/5.59 | ALPHA: (co1) implies: % 35.03/5.59 | (3) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 35.03/5.59 | ? [v5: $i] : ? [v6: $i] : (cons(v2, nil) = v3 & app(v5, v6) = v1 & % 35.03/5.59 | app(v4, v6) = v0 & app(v4, v3) = v5 & $i(v6) & $i(v5) & $i(v4) & % 35.03/5.59 | $i(v3) & $i(v2) & $i(v1) & $i(v0) & ssList(v6) & ssList(v4) & % 35.03/5.59 | ssList(v1) & ssList(v0) & neq(v1, nil) & ssItem(v2) & ! [v7: $i] : % 35.03/5.59 | ! [v8: $i] : ! [v9: $i] : ! [v10: $i] : ! [v11: $i] : ( ~ % 35.03/5.59 | (cons(v7, nil) = v8) | ~ (app(v10, v11) = v1) | ~ (app(v9, v8) = % 35.03/5.59 | v10) | ~ $i(v11) | ~ $i(v9) | ~ $i(v7) | ~ ssList(v11) | ~ % 35.03/5.59 | ssList(v9) | ~ ssItem(v7) | ? [v12: $i] : ? [v13: $i] : ($i(v13) % 35.03/5.59 | & (( ~ (v13 = v7) & geq(v13, v7) & memberP(v1, v13) & % 35.03/5.59 | ssItem(v13)) | ( ~ (v12 = v0) & app(v9, v11) = v12 & % 35.03/5.59 | $i(v12))))) & ! [v7: $i] : (v7 = v2 | ~ $i(v7) | ~ geq(v7, % 35.03/5.59 | v2) | ~ memberP(v1, v7) | ~ ssItem(v7))) % 35.03/5.59 | % 35.03/5.59 | ALPHA: (function-axioms) implies: % 35.03/5.59 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 35.03/5.59 | (app(v3, v2) = v1) | ~ (app(v3, v2) = v0)) % 35.03/5.59 | % 35.03/5.59 | DELTA: instantiating (3) with fresh symbols all_91_0, all_91_1, all_91_2, % 35.03/5.59 | all_91_3, all_91_4, all_91_5, all_91_6 gives: % 35.03/5.60 | (5) cons(all_91_4, nil) = all_91_3 & app(all_91_1, all_91_0) = all_91_5 & % 35.03/5.60 | app(all_91_2, all_91_0) = all_91_6 & app(all_91_2, all_91_3) = all_91_1 % 35.03/5.60 | & $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & $i(all_91_3) & % 35.03/5.60 | $i(all_91_4) & $i(all_91_5) & $i(all_91_6) & ssList(all_91_0) & % 35.03/5.60 | ssList(all_91_2) & ssList(all_91_5) & ssList(all_91_6) & neq(all_91_5, % 35.03/5.60 | nil) & ssItem(all_91_4) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 35.03/5.60 | ! [v3: $i] : ! [v4: $i] : ( ~ (cons(v0, nil) = v1) | ~ (app(v3, v4) = % 35.03/5.60 | all_91_5) | ~ (app(v2, v1) = v3) | ~ $i(v4) | ~ $i(v2) | ~ % 35.03/5.60 | $i(v0) | ~ ssList(v4) | ~ ssList(v2) | ~ ssItem(v0) | ? [v5: any] % 35.03/5.60 | : ? [v6: $i] : ($i(v6) & (( ~ (v6 = v0) & geq(v6, v0) & % 35.03/5.60 | memberP(all_91_5, v6) & ssItem(v6)) | ( ~ (v5 = all_91_6) & % 35.03/5.60 | app(v2, v4) = v5 & $i(v5))))) & ! [v0: any] : (v0 = all_91_4 | % 35.03/5.60 | ~ $i(v0) | ~ geq(v0, all_91_4) | ~ memberP(all_91_5, v0) | ~ % 35.03/5.60 | ssItem(v0)) % 35.03/5.60 | % 35.03/5.60 | ALPHA: (5) implies: % 35.03/5.60 | (6) ssItem(all_91_4) % 35.03/5.60 | (7) ssList(all_91_2) % 35.03/5.60 | (8) ssList(all_91_0) % 35.03/5.60 | (9) $i(all_91_4) % 35.03/5.60 | (10) $i(all_91_2) % 35.03/5.60 | (11) $i(all_91_0) % 35.03/5.60 | (12) app(all_91_2, all_91_3) = all_91_1 % 35.03/5.60 | (13) app(all_91_2, all_91_0) = all_91_6 % 35.03/5.60 | (14) app(all_91_1, all_91_0) = all_91_5 % 35.03/5.60 | (15) cons(all_91_4, nil) = all_91_3 % 35.03/5.60 | (16) ! [v0: any] : (v0 = all_91_4 | ~ $i(v0) | ~ geq(v0, all_91_4) | ~ % 35.03/5.60 | memberP(all_91_5, v0) | ~ ssItem(v0)) % 35.03/5.60 | (17) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 35.03/5.60 | ( ~ (cons(v0, nil) = v1) | ~ (app(v3, v4) = all_91_5) | ~ (app(v2, % 35.03/5.60 | v1) = v3) | ~ $i(v4) | ~ $i(v2) | ~ $i(v0) | ~ ssList(v4) | % 35.03/5.60 | ~ ssList(v2) | ~ ssItem(v0) | ? [v5: any] : ? [v6: $i] : ($i(v6) % 35.03/5.60 | & (( ~ (v6 = v0) & geq(v6, v0) & memberP(all_91_5, v6) & % 35.03/5.60 | ssItem(v6)) | ( ~ (v5 = all_91_6) & app(v2, v4) = v5 & % 35.03/5.60 | $i(v5))))) % 35.03/5.60 | % 35.03/5.60 | BETA: splitting (2) gives: % 35.03/5.60 | % 35.03/5.60 | Case 1: % 35.03/5.60 | | % 35.03/5.60 | | (18) ~ ssList(nil) % 35.03/5.60 | | % 35.03/5.60 | | PRED_UNIFY: (1), (18) imply: % 35.03/5.60 | | (19) $false % 35.03/5.61 | | % 35.03/5.61 | | CLOSE: (19) is inconsistent. % 35.03/5.61 | | % 35.03/5.61 | Case 2: % 35.03/5.61 | | % 35.03/5.61 | | % 35.03/5.61 | | GROUND_INST: instantiating (17) with all_91_4, all_91_3, all_91_2, all_91_1, % 35.03/5.61 | | all_91_0, simplifying with (6), (7), (8), (9), (10), (11), % 35.03/5.61 | | (12), (14), (15) gives: % 35.03/5.61 | | (20) ? [v0: any] : ? [v1: $i] : ($i(v1) & (( ~ (v1 = all_91_4) & % 35.03/5.61 | | geq(v1, all_91_4) & memberP(all_91_5, v1) & ssItem(v1)) | ( ~ % 35.03/5.61 | | (v0 = all_91_6) & app(all_91_2, all_91_0) = v0 & $i(v0)))) % 35.03/5.61 | | % 35.03/5.61 | | DELTA: instantiating (20) with fresh symbols all_118_0, all_118_1 gives: % 35.03/5.61 | | (21) $i(all_118_0) & (( ~ (all_118_0 = all_91_4) & geq(all_118_0, % 35.03/5.61 | | all_91_4) & memberP(all_91_5, all_118_0) & ssItem(all_118_0)) % 35.03/5.61 | | | ( ~ (all_118_1 = all_91_6) & app(all_91_2, all_91_0) = all_118_1 % 35.03/5.61 | | & $i(all_118_1))) % 35.03/5.61 | | % 35.03/5.61 | | ALPHA: (21) implies: % 35.03/5.61 | | (22) $i(all_118_0) % 35.03/5.61 | | (23) ( ~ (all_118_0 = all_91_4) & geq(all_118_0, all_91_4) & % 35.03/5.61 | | memberP(all_91_5, all_118_0) & ssItem(all_118_0)) | ( ~ (all_118_1 % 35.03/5.61 | | = all_91_6) & app(all_91_2, all_91_0) = all_118_1 & % 35.03/5.61 | | $i(all_118_1)) % 35.03/5.61 | | % 35.03/5.61 | | BETA: splitting (23) gives: % 35.03/5.61 | | % 35.03/5.61 | | Case 1: % 35.03/5.61 | | | % 35.03/5.61 | | | (24) ~ (all_118_0 = all_91_4) & geq(all_118_0, all_91_4) & % 35.03/5.61 | | | memberP(all_91_5, all_118_0) & ssItem(all_118_0) % 35.03/5.61 | | | % 35.03/5.61 | | | ALPHA: (24) implies: % 35.03/5.61 | | | (25) ~ (all_118_0 = all_91_4) % 35.03/5.61 | | | (26) ssItem(all_118_0) % 35.03/5.61 | | | (27) memberP(all_91_5, all_118_0) % 35.03/5.61 | | | (28) geq(all_118_0, all_91_4) % 35.03/5.61 | | | % 35.03/5.61 | | | GROUND_INST: instantiating (16) with all_118_0, simplifying with (22), % 35.03/5.61 | | | (26), (27), (28) gives: % 35.03/5.61 | | | (29) all_118_0 = all_91_4 % 35.03/5.61 | | | % 35.03/5.61 | | | REDUCE: (25), (29) imply: % 35.03/5.61 | | | (30) $false % 35.03/5.61 | | | % 35.03/5.61 | | | CLOSE: (30) is inconsistent. % 35.03/5.61 | | | % 35.03/5.61 | | Case 2: % 35.03/5.61 | | | % 35.03/5.61 | | | (31) ~ (all_118_1 = all_91_6) & app(all_91_2, all_91_0) = all_118_1 & % 35.03/5.61 | | | $i(all_118_1) % 35.03/5.61 | | | % 35.03/5.61 | | | ALPHA: (31) implies: % 35.03/5.61 | | | (32) ~ (all_118_1 = all_91_6) % 35.03/5.61 | | | (33) app(all_91_2, all_91_0) = all_118_1 % 35.03/5.61 | | | % 35.03/5.61 | | | GROUND_INST: instantiating (4) with all_91_6, all_118_1, all_91_0, % 35.03/5.61 | | | all_91_2, simplifying with (13), (33) gives: % 35.03/5.61 | | | (34) all_118_1 = all_91_6 % 35.03/5.61 | | | % 35.03/5.61 | | | REDUCE: (32), (34) imply: % 35.03/5.61 | | | (35) $false % 35.03/5.61 | | | % 35.03/5.61 | | | CLOSE: (35) is inconsistent. % 35.03/5.61 | | | % 35.03/5.61 | | End of split % 35.03/5.61 | | % 35.03/5.61 | End of split % 35.03/5.61 | % 35.03/5.61 End of proof % 35.03/5.61 % SZS output end Proof for theBenchmark % 35.03/5.61 % 35.03/5.61 5015ms %------------------------------------------------------------------------------