%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC181+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 : n024.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:06 EDT 2023 % Result : Theorem 144.42s 19.60s % Output : Proof 144.98s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWC181+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.14/0.34 % Computer : n024.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Mon Aug 28 14:35:08 EDT 2023 % 0.14/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 6.30/1.59 Prover 1: Preprocessing ... % 6.30/1.60 Prover 4: Preprocessing ... % 6.30/1.63 Prover 5: Preprocessing ... % 6.30/1.63 Prover 3: Preprocessing ... % 6.30/1.63 Prover 0: Preprocessing ... % 6.30/1.63 Prover 6: Preprocessing ... % 6.30/1.63 Prover 2: Preprocessing ... % 17.01/2.98 Prover 2: Proving ... % 17.01/3.08 Prover 5: Constructing countermodel ... % 17.01/3.10 Prover 6: Proving ... % 17.01/3.13 Prover 3: Constructing countermodel ... % 17.01/3.13 Prover 1: Constructing countermodel ... % 24.89/4.02 Prover 4: Constructing countermodel ... % 24.89/4.04 Prover 0: Proving ... % 73.30/10.33 Prover 2: stopped % 73.30/10.34 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 75.60/10.57 Prover 7: Preprocessing ... % 77.76/10.92 Prover 7: Constructing countermodel ... % 101.14/13.96 Prover 5: stopped % 101.14/13.96 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 103.10/14.18 Prover 8: Preprocessing ... % 104.80/14.41 Prover 8: Warning: ignoring some quantifiers % 104.80/14.42 Prover 8: Constructing countermodel ... % 116.56/15.96 Prover 1: stopped % 116.56/15.96 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 117.61/16.09 Prover 9: Preprocessing ... % 124.64/16.92 Prover 9: Constructing countermodel ... % 131.40/17.87 Prover 6: stopped % 131.40/17.87 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 132.52/18.00 Prover 10: Preprocessing ... % 133.41/18.14 Prover 10: Constructing countermodel ... % 144.42/19.56 Prover 10: Found proof (size 19) % 144.42/19.58 Prover 10: proved (1684ms) % 144.42/19.59 Prover 3: stopped % 144.42/19.59 Prover 9: stopped % 144.42/19.59 Prover 8: stopped % 144.42/19.59 Prover 7: stopped % 144.42/19.60 Prover 0: stopped % 144.42/19.60 Prover 4: stopped % 144.42/19.60 % 144.42/19.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 144.42/19.60 % 144.42/19.61 % SZS output start Proof for theBenchmark % 144.42/19.61 Assumptions after simplification: % 144.42/19.61 --------------------------------- % 144.42/19.61 % 144.42/19.61 (ax12) % 144.98/19.64 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 144.98/19.64 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v2, v7) = v8) | ~ % 144.98/19.65 (cons(v1, v4) = v5) | ~ (app(v6, v8) = v0) | ~ (app(v3, v5) = v6) | ~ % 144.98/19.65 $i(v7) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 144.98/19.65 strictorderedP(v0) | ~ ssList(v7) | ~ ssList(v4) | ~ ssList(v3) | ~ % 144.98/19.65 ssList(v0) | ~ ssItem(v2) | ~ ssItem(v1) | lt(v1, v2)) & ! [v0: $i] : ( ~ % 144.98/19.65 $i(v0) | ~ ssList(v0) | strictorderedP(v0) | ? [v1: $i] : ? [v2: $i] : ? % 144.98/19.65 [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: % 144.98/19.65 $i] : (cons(v2, v7) = v8 & cons(v1, v4) = v5 & app(v6, v8) = v0 & app(v3, % 144.98/19.65 v5) = v6 & $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) % 144.98/19.65 & $i(v1) & ssList(v7) & ssList(v4) & ssList(v3) & ssItem(v2) & ssItem(v1) % 144.98/19.65 & ~ lt(v1, v2))) % 144.98/19.65 % 144.98/19.65 (ax13) % 144.98/19.65 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 144.98/19.65 $i] : ! [v6: $i] : ! [v7: $i] : ( ~ (cons(v1, v6) = v7) | ~ (cons(v1, v3) % 144.98/19.65 = v4) | ~ (app(v5, v7) = v0) | ~ (app(v2, v4) = v5) | ~ $i(v6) | ~ % 144.98/19.65 $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ duplicatefreeP(v0) | ~ % 144.98/19.65 ssList(v6) | ~ ssList(v3) | ~ ssList(v2) | ~ ssList(v0) | ~ ssItem(v1)) % 144.98/19.65 & ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | duplicatefreeP(v0) | ? [v1: $i] % 144.98/19.65 : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? [v6: $i] : ? % 144.98/19.65 [v7: $i] : (cons(v1, v6) = v7 & cons(v1, v3) = v4 & app(v5, v7) = v0 & % 144.98/19.65 app(v2, v4) = v5 & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & % 144.98/19.65 $i(v1) & ssList(v6) & ssList(v3) & ssList(v2) & ssItem(v1))) % 144.98/19.65 % 144.98/19.65 (ax17) % 144.98/19.65 $i(nil) & ssList(nil) % 144.98/19.65 % 144.98/19.65 (ax33) % 144.98/19.65 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ lt(v1, v0) | ~ lt(v0, % 144.98/19.65 v1) | ~ ssItem(v1) | ~ ssItem(v0)) % 144.98/19.65 % 144.98/19.65 (ax58) % 144.98/19.65 $i(nil) & ! [v0: $i] : (v0 = nil | ~ $i(v0) | ~ segmentP(nil, v0) | ~ % 144.98/19.65 ssList(v0)) & ( ~ ssList(nil) | segmentP(nil, nil)) % 144.98/19.65 % 144.98/19.65 (co1) % 144.98/19.66 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] % 144.98/19.66 : (app(v3, v4) = v1 & app(v2, v0) = v3 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 144.98/19.66 $i(v0) & strictorderedP(v0) & ssList(v4) & ssList(v2) & ssList(v1) & % 144.98/19.66 ssList(v0) & ~ duplicatefreeP(v0) & ! [v5: $i] : ! [v6: $i] : ! [v7: $i] % 144.98/19.66 : ! [v8: $i] : ! [v9: $i] : ! [v10: $i] : ( ~ (cons(v8, nil) = v9) | ~ % 144.98/19.66 (cons(v5, nil) = v6) | ~ (app(v10, v9) = v0) | ~ (app(v6, v7) = v4) | ~ % 144.98/19.66 $i(v10) | ~ $i(v8) | ~ $i(v7) | ~ $i(v5) | ~ lt(v8, v5) | ~ % 144.98/19.66 ssList(v10) | ~ ssList(v7) | ~ ssItem(v8) | ~ ssItem(v5)) & ! [v5: $i] % 144.98/19.66 : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ! [v10: $i] : ( ~ % 144.98/19.66 (cons(v8, nil) = v9) | ~ (cons(v5, nil) = v6) | ~ (app(v9, v10) = v0) | % 144.98/19.66 ~ (app(v7, v6) = v2) | ~ $i(v10) | ~ $i(v8) | ~ $i(v7) | ~ $i(v5) | ~ % 144.98/19.66 lt(v5, v8) | ~ ssList(v10) | ~ ssList(v7) | ~ ssItem(v8) | ~ % 144.98/19.66 ssItem(v5)) & ( ~ (v0 = nil) | v1 = nil)) % 144.98/19.66 % 144.98/19.66 Further assumptions not needed in the proof: % 144.98/19.66 -------------------------------------------- % 144.98/19.66 ax1, ax10, ax11, ax14, ax15, ax16, ax18, ax19, ax2, ax20, ax21, ax22, ax23, % 144.98/19.66 ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax34, ax35, ax36, % 144.98/19.66 ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45, ax46, ax47, ax48, % 144.98/19.66 ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax59, ax6, ax60, % 144.98/19.66 ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax7, ax70, ax71, ax72, % 144.98/19.66 ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, ax83, ax84, % 144.98/19.66 ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, ax94, ax95 % 144.98/19.66 % 144.98/19.66 Those formulas are unsatisfiable: % 144.98/19.66 --------------------------------- % 144.98/19.66 % 144.98/19.66 Begin of proof % 144.98/19.66 | % 144.98/19.66 | ALPHA: (ax12) implies: % 144.98/19.66 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 144.98/19.66 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v2, % 144.98/19.66 | v7) = v8) | ~ (cons(v1, v4) = v5) | ~ (app(v6, v8) = v0) | ~ % 144.98/19.66 | (app(v3, v5) = v6) | ~ $i(v7) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | % 144.98/19.66 | ~ $i(v1) | ~ $i(v0) | ~ strictorderedP(v0) | ~ ssList(v7) | ~ % 144.98/19.66 | ssList(v4) | ~ ssList(v3) | ~ ssList(v0) | ~ ssItem(v2) | ~ % 144.98/19.66 | ssItem(v1) | lt(v1, v2)) % 144.98/19.66 | % 144.98/19.66 | ALPHA: (ax13) implies: % 144.98/19.66 | (2) ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | duplicatefreeP(v0) | ? [v1: % 144.98/19.66 | $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? % 144.98/19.66 | [v6: $i] : ? [v7: $i] : (cons(v1, v6) = v7 & cons(v1, v3) = v4 & % 144.98/19.66 | app(v5, v7) = v0 & app(v2, v4) = v5 & $i(v7) & $i(v6) & $i(v5) & % 144.98/19.66 | $i(v4) & $i(v3) & $i(v2) & $i(v1) & ssList(v6) & ssList(v3) & % 144.98/19.66 | ssList(v2) & ssItem(v1))) % 144.98/19.66 | % 144.98/19.66 | ALPHA: (ax17) implies: % 144.98/19.67 | (3) ssList(nil) % 144.98/19.67 | % 144.98/19.67 | ALPHA: (ax58) implies: % 144.98/19.67 | (4) ~ ssList(nil) | segmentP(nil, nil) % 144.98/19.67 | % 144.98/19.67 | ALPHA: (co1) implies: % 144.98/19.67 | (5) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 144.98/19.67 | (app(v3, v4) = v1 & app(v2, v0) = v3 & $i(v4) & $i(v3) & $i(v2) & % 144.98/19.67 | $i(v1) & $i(v0) & strictorderedP(v0) & ssList(v4) & ssList(v2) & % 144.98/19.67 | ssList(v1) & ssList(v0) & ~ duplicatefreeP(v0) & ! [v5: $i] : ! % 144.98/19.67 | [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ! [v10: $i] : ( % 144.98/19.67 | ~ (cons(v8, nil) = v9) | ~ (cons(v5, nil) = v6) | ~ (app(v10, v9) % 144.98/19.67 | = v0) | ~ (app(v6, v7) = v4) | ~ $i(v10) | ~ $i(v8) | ~ % 144.98/19.67 | $i(v7) | ~ $i(v5) | ~ lt(v8, v5) | ~ ssList(v10) | ~ ssList(v7) % 144.98/19.67 | | ~ ssItem(v8) | ~ ssItem(v5)) & ! [v5: $i] : ! [v6: $i] : ! % 144.98/19.67 | [v7: $i] : ! [v8: $i] : ! [v9: $i] : ! [v10: $i] : ( ~ (cons(v8, % 144.98/19.67 | nil) = v9) | ~ (cons(v5, nil) = v6) | ~ (app(v9, v10) = v0) | % 144.98/19.67 | ~ (app(v7, v6) = v2) | ~ $i(v10) | ~ $i(v8) | ~ $i(v7) | ~ % 144.98/19.67 | $i(v5) | ~ lt(v5, v8) | ~ ssList(v10) | ~ ssList(v7) | ~ % 144.98/19.67 | ssItem(v8) | ~ ssItem(v5)) & ( ~ (v0 = nil) | v1 = nil)) % 144.98/19.67 | % 144.98/19.67 | DELTA: instantiating (5) with fresh symbols all_91_0, all_91_1, all_91_2, % 144.98/19.67 | all_91_3, all_91_4 gives: % 144.98/19.67 | (6) app(all_91_1, all_91_0) = all_91_3 & app(all_91_2, all_91_4) = all_91_1 % 144.98/19.67 | & $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & $i(all_91_3) & % 144.98/19.67 | $i(all_91_4) & strictorderedP(all_91_4) & ssList(all_91_0) & % 144.98/19.67 | ssList(all_91_2) & ssList(all_91_3) & ssList(all_91_4) & ~ % 144.98/19.67 | duplicatefreeP(all_91_4) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 144.98/19.67 | [v3: $i] : ! [v4: $i] : ! [v5: $i] : ( ~ (cons(v3, nil) = v4) | ~ % 144.98/19.67 | (cons(v0, nil) = v1) | ~ (app(v5, v4) = all_91_4) | ~ (app(v1, v2) % 144.98/19.67 | = all_91_0) | ~ $i(v5) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ~ % 144.98/19.67 | lt(v3, v0) | ~ ssList(v5) | ~ ssList(v2) | ~ ssItem(v3) | ~ % 144.98/19.67 | ssItem(v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : % 144.98/19.67 | ! [v4: $i] : ! [v5: $i] : ( ~ (cons(v3, nil) = v4) | ~ (cons(v0, % 144.98/19.67 | nil) = v1) | ~ (app(v4, v5) = all_91_4) | ~ (app(v2, v1) = % 144.98/19.67 | all_91_2) | ~ $i(v5) | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ~ % 144.98/19.67 | lt(v0, v3) | ~ ssList(v5) | ~ ssList(v2) | ~ ssItem(v3) | ~ % 144.98/19.67 | ssItem(v0)) & ( ~ (all_91_4 = nil) | all_91_3 = nil) % 144.98/19.67 | % 144.98/19.67 | ALPHA: (6) implies: % 144.98/19.67 | (7) ~ duplicatefreeP(all_91_4) % 144.98/19.67 | (8) ssList(all_91_4) % 144.98/19.67 | (9) strictorderedP(all_91_4) % 144.98/19.67 | (10) $i(all_91_4) % 144.98/19.67 | % 144.98/19.67 | BETA: splitting (4) gives: % 144.98/19.67 | % 144.98/19.67 | Case 1: % 144.98/19.67 | | % 144.98/19.68 | | (11) ~ ssList(nil) % 144.98/19.68 | | % 144.98/19.68 | | PRED_UNIFY: (3), (11) imply: % 144.98/19.68 | | (12) $false % 144.98/19.68 | | % 144.98/19.68 | | CLOSE: (12) is inconsistent. % 144.98/19.68 | | % 144.98/19.68 | Case 2: % 144.98/19.68 | | % 144.98/19.68 | | % 144.98/19.68 | | GROUND_INST: instantiating (2) with all_91_4, simplifying with (7), (8), % 144.98/19.68 | | (10) gives: % 144.98/19.68 | | (13) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] % 144.98/19.68 | | : ? [v5: $i] : ? [v6: $i] : (cons(v0, v5) = v6 & cons(v0, v2) = v3 % 144.98/19.68 | | & app(v4, v6) = all_91_4 & app(v1, v3) = v4 & $i(v6) & $i(v5) & % 144.98/19.68 | | $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ssList(v5) & % 144.98/19.68 | | ssList(v2) & ssList(v1) & ssItem(v0)) % 144.98/19.68 | | % 144.98/19.68 | | DELTA: instantiating (13) with fresh symbols all_120_0, all_120_1, % 144.98/19.68 | | all_120_2, all_120_3, all_120_4, all_120_5, all_120_6 gives: % 144.98/19.68 | | (14) cons(all_120_6, all_120_1) = all_120_0 & cons(all_120_6, all_120_4) % 144.98/19.68 | | = all_120_3 & app(all_120_2, all_120_0) = all_91_4 & app(all_120_5, % 144.98/19.68 | | all_120_3) = all_120_2 & $i(all_120_0) & $i(all_120_1) & % 144.98/19.68 | | $i(all_120_2) & $i(all_120_3) & $i(all_120_4) & $i(all_120_5) & % 144.98/19.68 | | $i(all_120_6) & ssList(all_120_1) & ssList(all_120_4) & % 144.98/19.68 | | ssList(all_120_5) & ssItem(all_120_6) % 144.98/19.68 | | % 144.98/19.68 | | ALPHA: (14) implies: % 144.98/19.68 | | (15) ssItem(all_120_6) % 144.98/19.68 | | (16) ssList(all_120_5) % 144.98/19.68 | | (17) ssList(all_120_4) % 144.98/19.68 | | (18) ssList(all_120_1) % 144.98/19.68 | | (19) $i(all_120_6) % 144.98/19.68 | | (20) $i(all_120_5) % 144.98/19.68 | | (21) $i(all_120_4) % 144.98/19.68 | | (22) $i(all_120_1) % 144.98/19.68 | | (23) app(all_120_5, all_120_3) = all_120_2 % 144.98/19.68 | | (24) app(all_120_2, all_120_0) = all_91_4 % 144.98/19.68 | | (25) cons(all_120_6, all_120_4) = all_120_3 % 144.98/19.68 | | (26) cons(all_120_6, all_120_1) = all_120_0 % 144.98/19.68 | | % 144.98/19.68 | | GROUND_INST: instantiating (1) with all_91_4, all_120_6, all_120_6, % 144.98/19.68 | | all_120_5, all_120_4, all_120_3, all_120_2, all_120_1, % 144.98/19.68 | | all_120_0, simplifying with (8), (9), (10), (15), (16), (17), % 144.98/19.68 | | (18), (19), (20), (21), (22), (23), (24), (25), (26) gives: % 144.98/19.68 | | (27) lt(all_120_6, all_120_6) % 144.98/19.68 | | % 144.98/19.68 | | GROUND_INST: instantiating (ax33) with all_120_6, all_120_6, simplifying % 144.98/19.68 | | with (15), (19), (27) gives: % 144.98/19.68 | | (28) $false % 144.98/19.68 | | % 144.98/19.68 | | CLOSE: (28) is inconsistent. % 144.98/19.68 | | % 144.98/19.68 | End of split % 144.98/19.68 | % 144.98/19.68 End of proof % 144.98/19.69 % SZS output end Proof for theBenchmark % 144.98/19.69 % 144.98/19.69 19087ms %------------------------------------------------------------------------------