%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC272+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 : n002.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:34 EDT 2023 % Result : Theorem 140.49s 19.24s % Output : Proof 141.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWC272+1 : TPTP v8.1.2. Released v2.4.0. % 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n002.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 17:40:04 EDT 2023 % 0.13/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/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.62 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.15/1.53 Prover 1: Preprocessing ... % 6.15/1.53 Prover 4: Preprocessing ... % 6.15/1.55 Prover 5: Preprocessing ... % 6.15/1.55 Prover 2: Preprocessing ... % 6.15/1.55 Prover 6: Preprocessing ... % 6.15/1.55 Prover 3: Preprocessing ... % 6.15/1.55 Prover 0: Preprocessing ... % 16.40/2.94 Prover 2: Proving ... % 16.40/2.94 Prover 1: Constructing countermodel ... % 16.40/2.96 Prover 5: Constructing countermodel ... % 17.27/3.00 Prover 6: Proving ... % 17.48/3.06 Prover 3: Constructing countermodel ... % 24.54/4.02 Prover 4: Constructing countermodel ... % 25.77/4.13 Prover 0: Proving ... % 73.67/10.40 Prover 2: stopped % 73.67/10.40 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 74.67/10.54 Prover 7: Preprocessing ... % 76.01/10.76 Prover 7: Constructing countermodel ... % 100.47/13.98 Prover 5: stopped % 100.47/13.98 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 101.78/14.13 Prover 8: Preprocessing ... % 104.12/14.42 Prover 8: Warning: ignoring some quantifiers % 104.12/14.44 Prover 8: Constructing countermodel ... % 115.76/15.97 Prover 1: stopped % 115.76/15.97 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 116.84/16.10 Prover 9: Preprocessing ... % 122.73/16.85 Prover 9: Constructing countermodel ... % 129.98/17.88 Prover 6: stopped % 129.98/17.88 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 130.84/17.98 Prover 10: Preprocessing ... % 132.30/18.14 Prover 10: Constructing countermodel ... % 140.49/19.22 Prover 10: Found proof (size 20) % 140.49/19.23 Prover 10: proved (1341ms) % 140.49/19.24 Prover 9: stopped % 140.49/19.24 Prover 3: stopped % 140.49/19.24 Prover 7: stopped % 140.49/19.24 Prover 8: stopped % 140.49/19.24 Prover 0: stopped % 140.49/19.24 Prover 4: stopped % 140.49/19.24 % 140.49/19.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 140.49/19.24 % 140.49/19.24 % SZS output start Proof for theBenchmark % 140.49/19.25 Assumptions after simplification: % 140.49/19.25 --------------------------------- % 140.49/19.25 % 140.49/19.25 (ax11) % 141.07/19.28 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 141.07/19.28 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v2, v7) = v8) | ~ % 141.07/19.28 (cons(v1, v4) = v5) | ~ (app(v6, v8) = v0) | ~ (app(v3, v5) = v6) | ~ % 141.07/19.28 $i(v7) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 141.07/19.28 totalorderedP(v0) | ~ ssList(v7) | ~ ssList(v4) | ~ ssList(v3) | ~ % 141.07/19.28 ssList(v0) | ~ ssItem(v2) | ~ ssItem(v1) | leq(v1, v2)) & ! [v0: $i] : ( % 141.07/19.28 ~ $i(v0) | ~ ssList(v0) | totalorderedP(v0) | ? [v1: $i] : ? [v2: $i] : % 141.07/19.28 ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: % 141.07/19.28 $i] : (cons(v2, v7) = v8 & cons(v1, v4) = v5 & app(v6, v8) = v0 & app(v3, % 141.07/19.28 v5) = v6 & $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) % 141.07/19.28 & $i(v1) & ssList(v7) & ssList(v4) & ssList(v3) & ssItem(v2) & ssItem(v1) % 141.07/19.28 & ~ leq(v1, v2))) % 141.07/19.28 % 141.07/19.28 (ax12) % 141.07/19.28 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 141.07/19.28 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v2, v7) = v8) | ~ % 141.07/19.28 (cons(v1, v4) = v5) | ~ (app(v6, v8) = v0) | ~ (app(v3, v5) = v6) | ~ % 141.07/19.28 $i(v7) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 141.07/19.28 strictorderedP(v0) | ~ ssList(v7) | ~ ssList(v4) | ~ ssList(v3) | ~ % 141.07/19.28 ssList(v0) | ~ ssItem(v2) | ~ ssItem(v1) | lt(v1, v2)) & ! [v0: $i] : ( ~ % 141.07/19.28 $i(v0) | ~ ssList(v0) | strictorderedP(v0) | ? [v1: $i] : ? [v2: $i] : ? % 141.07/19.28 [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: % 141.07/19.28 $i] : (cons(v2, v7) = v8 & cons(v1, v4) = v5 & app(v6, v8) = v0 & app(v3, % 141.07/19.29 v5) = v6 & $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) % 141.07/19.29 & $i(v1) & ssList(v7) & ssList(v4) & ssList(v3) & ssItem(v2) & ssItem(v1) % 141.07/19.29 & ~ lt(v1, v2))) % 141.07/19.29 % 141.07/19.29 (ax17) % 141.07/19.29 $i(nil) & ssList(nil) % 141.07/19.29 % 141.07/19.29 (ax58) % 141.07/19.29 $i(nil) & ! [v0: $i] : (v0 = nil | ~ $i(v0) | ~ segmentP(nil, v0) | ~ % 141.07/19.29 ssList(v0)) & ( ~ ssList(nil) | segmentP(nil, nil)) % 141.07/19.29 % 141.07/19.29 (ax93) % 141.07/19.29 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ leq(v0, v1) % 141.07/19.29 | ~ ssItem(v1) | ~ ssItem(v0) | lt(v0, v1)) & ! [v0: $i] : ! [v1: $i] : % 141.07/19.29 ( ~ $i(v1) | ~ $i(v0) | ~ lt(v0, v1) | ~ ssItem(v1) | ~ ssItem(v0) | % 141.07/19.29 leq(v0, v1)) & ! [v0: $i] : ( ~ $i(v0) | ~ lt(v0, v0) | ~ ssItem(v0)) % 141.07/19.29 % 141.07/19.29 (co1) % 141.07/19.29 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (app(v0, v2) = v1 & $i(v2) % 141.07/19.29 & $i(v1) & $i(v0) & strictorderedP(v0) & ssList(v2) & ssList(v1) & % 141.07/19.29 ssList(v0) & ~ totalorderedP(v0) & ! [v3: $i] : ! [v4: $i] : ! [v5: $i] % 141.07/19.29 : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v6, nil) = v7) | ~ % 141.07/19.29 (cons(v3, nil) = v4) | ~ (app(v8, v7) = v0) | ~ (app(v4, v5) = v2) | ~ % 141.07/19.29 $i(v8) | ~ $i(v6) | ~ $i(v5) | ~ $i(v3) | ~ lt(v6, v3) | ~ ssList(v8) % 141.07/19.29 | ~ ssList(v5) | ~ ssItem(v6) | ~ ssItem(v3)) & ( ~ (v0 = nil) | v1 = % 141.07/19.29 nil)) % 141.07/19.29 % 141.07/19.29 Further assumptions not needed in the proof: % 141.07/19.29 -------------------------------------------- % 141.07/19.29 ax1, ax10, ax13, ax14, ax15, ax16, ax18, ax19, ax2, ax20, ax21, ax22, ax23, % 141.07/19.29 ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33, ax34, ax35, % 141.07/19.29 ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45, ax46, ax47, % 141.07/19.29 ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax59, ax6, % 141.07/19.29 ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax7, ax70, ax71, % 141.07/19.29 ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, ax83, % 141.07/19.29 ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax94, ax95 % 141.07/19.29 % 141.07/19.29 Those formulas are unsatisfiable: % 141.07/19.29 --------------------------------- % 141.07/19.29 % 141.07/19.29 Begin of proof % 141.07/19.29 | % 141.07/19.29 | ALPHA: (ax11) implies: % 141.07/19.30 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | totalorderedP(v0) | ? [v1: % 141.07/19.30 | $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? % 141.07/19.30 | [v6: $i] : ? [v7: $i] : ? [v8: $i] : (cons(v2, v7) = v8 & cons(v1, % 141.07/19.30 | v4) = v5 & app(v6, v8) = v0 & app(v3, v5) = v6 & $i(v8) & $i(v7) % 141.07/19.30 | & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & ssList(v7) % 141.07/19.30 | & ssList(v4) & ssList(v3) & ssItem(v2) & ssItem(v1) & ~ leq(v1, % 141.07/19.30 | v2))) % 141.07/19.30 | % 141.07/19.30 | ALPHA: (ax12) implies: % 141.07/19.30 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 141.07/19.30 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v2, % 141.07/19.30 | v7) = v8) | ~ (cons(v1, v4) = v5) | ~ (app(v6, v8) = v0) | ~ % 141.07/19.30 | (app(v3, v5) = v6) | ~ $i(v7) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | % 141.07/19.30 | ~ $i(v1) | ~ $i(v0) | ~ strictorderedP(v0) | ~ ssList(v7) | ~ % 141.07/19.30 | ssList(v4) | ~ ssList(v3) | ~ ssList(v0) | ~ ssItem(v2) | ~ % 141.07/19.30 | ssItem(v1) | lt(v1, v2)) % 141.07/19.30 | % 141.07/19.30 | ALPHA: (ax17) implies: % 141.07/19.30 | (3) ssList(nil) % 141.07/19.30 | % 141.07/19.30 | ALPHA: (ax58) implies: % 141.07/19.30 | (4) ~ ssList(nil) | segmentP(nil, nil) % 141.07/19.30 | % 141.07/19.30 | ALPHA: (ax93) implies: % 141.07/19.30 | (5) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ lt(v0, v1) | ~ % 141.07/19.30 | ssItem(v1) | ~ ssItem(v0) | leq(v0, v1)) % 141.07/19.30 | % 141.07/19.30 | ALPHA: (co1) implies: % 141.07/19.30 | (6) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (app(v0, v2) = v1 & $i(v2) & % 141.07/19.30 | $i(v1) & $i(v0) & strictorderedP(v0) & ssList(v2) & ssList(v1) & % 141.07/19.30 | ssList(v0) & ~ totalorderedP(v0) & ! [v3: $i] : ! [v4: $i] : ! % 141.07/19.30 | [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v6, % 141.07/19.30 | nil) = v7) | ~ (cons(v3, nil) = v4) | ~ (app(v8, v7) = v0) | % 141.07/19.30 | ~ (app(v4, v5) = v2) | ~ $i(v8) | ~ $i(v6) | ~ $i(v5) | ~ % 141.07/19.30 | $i(v3) | ~ lt(v6, v3) | ~ ssList(v8) | ~ ssList(v5) | ~ % 141.07/19.30 | ssItem(v6) | ~ ssItem(v3)) & ( ~ (v0 = nil) | v1 = nil)) % 141.07/19.30 | % 141.07/19.30 | DELTA: instantiating (6) with fresh symbols all_91_0, all_91_1, all_91_2 % 141.07/19.30 | gives: % 141.07/19.31 | (7) app(all_91_2, all_91_0) = all_91_1 & $i(all_91_0) & $i(all_91_1) & % 141.07/19.31 | $i(all_91_2) & strictorderedP(all_91_2) & ssList(all_91_0) & % 141.07/19.31 | ssList(all_91_1) & ssList(all_91_2) & ~ totalorderedP(all_91_2) & ! % 141.07/19.31 | [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! % 141.07/19.31 | [v5: $i] : ( ~ (cons(v3, nil) = v4) | ~ (cons(v0, nil) = v1) | ~ % 141.07/19.31 | (app(v5, v4) = all_91_2) | ~ (app(v1, v2) = all_91_0) | ~ $i(v5) | % 141.07/19.31 | ~ $i(v3) | ~ $i(v2) | ~ $i(v0) | ~ lt(v3, v0) | ~ ssList(v5) | ~ % 141.07/19.31 | ssList(v2) | ~ ssItem(v3) | ~ ssItem(v0)) & ( ~ (all_91_2 = nil) | % 141.07/19.31 | all_91_1 = nil) % 141.07/19.31 | % 141.07/19.31 | ALPHA: (7) implies: % 141.07/19.31 | (8) ~ totalorderedP(all_91_2) % 141.07/19.31 | (9) ssList(all_91_2) % 141.07/19.31 | (10) strictorderedP(all_91_2) % 141.07/19.31 | (11) $i(all_91_2) % 141.07/19.31 | % 141.07/19.31 | BETA: splitting (4) gives: % 141.07/19.31 | % 141.07/19.31 | Case 1: % 141.07/19.31 | | % 141.07/19.31 | | (12) ~ ssList(nil) % 141.07/19.31 | | % 141.07/19.31 | | PRED_UNIFY: (3), (12) imply: % 141.07/19.31 | | (13) $false % 141.07/19.31 | | % 141.07/19.31 | | CLOSE: (13) is inconsistent. % 141.07/19.31 | | % 141.07/19.31 | Case 2: % 141.07/19.31 | | % 141.07/19.31 | | % 141.07/19.31 | | GROUND_INST: instantiating (1) with all_91_2, simplifying with (8), (9), % 141.07/19.31 | | (11) gives: % 141.07/19.31 | | (14) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] % 141.07/19.31 | | : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : (cons(v1, v6) = v7 & % 141.07/19.31 | | cons(v0, v3) = v4 & app(v5, v7) = all_91_2 & app(v2, v4) = v5 & % 141.07/19.31 | | $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 141.07/19.31 | | $i(v0) & ssList(v6) & ssList(v3) & ssList(v2) & ssItem(v1) & % 141.07/19.31 | | ssItem(v0) & ~ leq(v0, v1)) % 141.07/19.31 | | % 141.07/19.31 | | DELTA: instantiating (14) with fresh symbols all_118_0, all_118_1, % 141.07/19.31 | | all_118_2, all_118_3, all_118_4, all_118_5, all_118_6, all_118_7 % 141.07/19.31 | | gives: % 141.30/19.31 | | (15) cons(all_118_6, all_118_1) = all_118_0 & cons(all_118_7, all_118_4) % 141.30/19.31 | | = all_118_3 & app(all_118_2, all_118_0) = all_91_2 & app(all_118_5, % 141.30/19.31 | | all_118_3) = all_118_2 & $i(all_118_0) & $i(all_118_1) & % 141.30/19.31 | | $i(all_118_2) & $i(all_118_3) & $i(all_118_4) & $i(all_118_5) & % 141.30/19.31 | | $i(all_118_6) & $i(all_118_7) & ssList(all_118_1) & % 141.30/19.31 | | ssList(all_118_4) & ssList(all_118_5) & ssItem(all_118_6) & % 141.30/19.31 | | ssItem(all_118_7) & ~ leq(all_118_7, all_118_6) % 141.30/19.31 | | % 141.30/19.31 | | ALPHA: (15) implies: % 141.30/19.31 | | (16) ~ leq(all_118_7, all_118_6) % 141.30/19.31 | | (17) ssItem(all_118_7) % 141.30/19.31 | | (18) ssItem(all_118_6) % 141.30/19.31 | | (19) ssList(all_118_5) % 141.30/19.32 | | (20) ssList(all_118_4) % 141.30/19.32 | | (21) ssList(all_118_1) % 141.30/19.32 | | (22) $i(all_118_7) % 141.30/19.32 | | (23) $i(all_118_6) % 141.30/19.32 | | (24) $i(all_118_5) % 141.30/19.32 | | (25) $i(all_118_4) % 141.30/19.32 | | (26) $i(all_118_1) % 141.30/19.32 | | (27) app(all_118_5, all_118_3) = all_118_2 % 141.30/19.32 | | (28) app(all_118_2, all_118_0) = all_91_2 % 141.30/19.32 | | (29) cons(all_118_7, all_118_4) = all_118_3 % 141.30/19.32 | | (30) cons(all_118_6, all_118_1) = all_118_0 % 141.30/19.32 | | % 141.30/19.32 | | GROUND_INST: instantiating (2) with all_91_2, all_118_7, all_118_6, % 141.30/19.32 | | all_118_5, all_118_4, all_118_3, all_118_2, all_118_1, % 141.30/19.32 | | all_118_0, simplifying with (9), (10), (11), (17), (18), (19), % 141.30/19.32 | | (20), (21), (22), (23), (24), (25), (26), (27), (28), (29), % 141.30/19.32 | | (30) gives: % 141.30/19.32 | | (31) lt(all_118_7, all_118_6) % 141.30/19.32 | | % 141.30/19.32 | | GROUND_INST: instantiating (5) with all_118_7, all_118_6, simplifying with % 141.30/19.32 | | (16), (17), (18), (22), (23), (31) gives: % 141.30/19.32 | | (32) $false % 141.30/19.32 | | % 141.30/19.32 | | CLOSE: (32) is inconsistent. % 141.30/19.32 | | % 141.30/19.32 | End of split % 141.30/19.32 | % 141.30/19.32 End of proof % 141.30/19.32 % SZS output end Proof for theBenchmark % 141.30/19.32 % 141.30/19.32 18716ms %------------------------------------------------------------------------------