%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC271+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 136.32s 18.72s % Output : Proof 136.93s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWC271+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 : n002.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 18:33:19 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.61 ________ _____ % 0.19/0.61 ___ __ \_________(_)________________________________ % 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.61 % 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.61 (2023-06-19) % 0.19/0.61 % 0.19/0.61 (c) Philipp Rümmer, 2009-2023 % 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.61 Amanda Stjerna. % 0.19/0.61 Free software under BSD-3-Clause. % 0.19/0.61 % 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.61 % 0.19/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.79/1.48 Prover 1: Preprocessing ... % 4.79/1.49 Prover 4: Preprocessing ... % 5.44/1.53 Prover 5: Preprocessing ... % 5.44/1.53 Prover 6: Preprocessing ... % 5.44/1.53 Prover 2: Preprocessing ... % 5.44/1.53 Prover 3: Preprocessing ... % 5.44/1.53 Prover 0: Preprocessing ... % 14.75/2.83 Prover 2: Proving ... % 15.46/2.89 Prover 5: Constructing countermodel ... % 16.10/2.95 Prover 6: Proving ... % 16.10/2.96 Prover 1: Constructing countermodel ... % 16.10/2.98 Prover 3: Constructing countermodel ... % 20.72/3.59 Prover 4: Constructing countermodel ... % 22.46/3.81 Prover 0: Proving ... % 72.02/10.31 Prover 2: stopped % 72.02/10.31 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 74.35/10.55 Prover 7: Preprocessing ... % 75.86/10.83 Prover 7: Constructing countermodel ... % 100.48/13.98 Prover 5: stopped % 100.48/13.98 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 101.42/14.15 Prover 8: Preprocessing ... % 104.29/14.44 Prover 8: Warning: ignoring some quantifiers % 104.29/14.45 Prover 8: Constructing countermodel ... % 116.03/15.97 Prover 1: stopped % 116.03/15.97 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 116.64/16.07 Prover 9: Preprocessing ... % 122.04/16.77 Prover 9: Constructing countermodel ... % 130.45/17.88 Prover 6: stopped % 130.45/17.88 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 130.94/17.98 Prover 10: Preprocessing ... % 131.73/18.10 Prover 10: Constructing countermodel ... % 136.32/18.71 Prover 10: Found proof (size 19) % 136.32/18.71 Prover 10: proved (827ms) % 136.32/18.71 Prover 3: stopped % 136.32/18.71 Prover 9: stopped % 136.32/18.71 Prover 7: stopped % 136.32/18.71 Prover 0: stopped % 136.32/18.71 Prover 8: stopped % 136.32/18.72 Prover 4: stopped % 136.32/18.72 % 136.32/18.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 136.32/18.72 % 136.54/18.72 % SZS output start Proof for theBenchmark % 136.54/18.73 Assumptions after simplification: % 136.54/18.73 --------------------------------- % 136.54/18.73 % 136.54/18.73 (ax11) % 136.54/18.76 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 136.54/18.76 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v2, v7) = v8) | ~ % 136.54/18.76 (cons(v1, v4) = v5) | ~ (app(v6, v8) = v0) | ~ (app(v3, v5) = v6) | ~ % 136.54/18.76 $i(v7) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 136.54/18.76 totalorderedP(v0) | ~ ssList(v7) | ~ ssList(v4) | ~ ssList(v3) | ~ % 136.54/18.76 ssList(v0) | ~ ssItem(v2) | ~ ssItem(v1) | leq(v1, v2)) & ! [v0: $i] : ( % 136.54/18.76 ~ $i(v0) | ~ ssList(v0) | totalorderedP(v0) | ? [v1: $i] : ? [v2: $i] : % 136.54/18.76 ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: % 136.54/18.76 $i] : (cons(v2, v7) = v8 & cons(v1, v4) = v5 & app(v6, v8) = v0 & app(v3, % 136.54/18.76 v5) = v6 & $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) % 136.54/18.76 & $i(v1) & ssList(v7) & ssList(v4) & ssList(v3) & ssItem(v2) & ssItem(v1) % 136.54/18.76 & ~ leq(v1, v2))) % 136.54/18.76 % 136.54/18.76 (ax12) % 136.93/18.77 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 136.93/18.77 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v2, v7) = v8) | ~ % 136.93/18.77 (cons(v1, v4) = v5) | ~ (app(v6, v8) = v0) | ~ (app(v3, v5) = v6) | ~ % 136.93/18.77 $i(v7) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 136.93/18.77 strictorderedP(v0) | ~ ssList(v7) | ~ ssList(v4) | ~ ssList(v3) | ~ % 136.93/18.77 ssList(v0) | ~ ssItem(v2) | ~ ssItem(v1) | lt(v1, v2)) & ! [v0: $i] : ( ~ % 136.93/18.77 $i(v0) | ~ ssList(v0) | strictorderedP(v0) | ? [v1: $i] : ? [v2: $i] : ? % 136.93/18.77 [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: % 136.93/18.77 $i] : (cons(v2, v7) = v8 & cons(v1, v4) = v5 & app(v6, v8) = v0 & app(v3, % 136.93/18.77 v5) = v6 & $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) % 136.93/18.77 & $i(v1) & ssList(v7) & ssList(v4) & ssList(v3) & ssItem(v2) & ssItem(v1) % 136.93/18.77 & ~ lt(v1, v2))) % 136.93/18.77 % 136.93/18.77 (ax17) % 136.93/18.77 $i(nil) & ssList(nil) % 136.93/18.77 % 136.93/18.77 (ax58) % 136.93/18.77 $i(nil) & ! [v0: $i] : (v0 = nil | ~ $i(v0) | ~ segmentP(nil, v0) | ~ % 136.93/18.77 ssList(v0)) & ( ~ ssList(nil) | segmentP(nil, nil)) % 136.93/18.77 % 136.93/18.77 (ax93) % 136.93/18.77 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ leq(v0, v1) % 136.93/18.77 | ~ ssItem(v1) | ~ ssItem(v0) | lt(v0, v1)) & ! [v0: $i] : ! [v1: $i] : % 136.93/18.77 ( ~ $i(v1) | ~ $i(v0) | ~ lt(v0, v1) | ~ ssItem(v1) | ~ ssItem(v0) | % 136.93/18.77 leq(v0, v1)) & ! [v0: $i] : ( ~ $i(v0) | ~ lt(v0, v0) | ~ ssItem(v0)) % 136.93/18.77 % 136.93/18.77 (co1) % 136.93/18.77 ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & strictorderedP(v0) & % 136.93/18.77 frontsegP(v1, v0) & ssList(v1) & ssList(v0) & ~ totalorderedP(v0) & ! [v2: % 136.93/18.77 $i] : ( ~ $i(v2) | ~ strictorderedP(v2) | ~ segmentP(v2, v0) | ~ % 136.93/18.77 frontsegP(v1, v2) | ~ ssList(v2) | ~ neq(v0, v2))) % 136.93/18.77 % 136.93/18.77 Further assumptions not needed in the proof: % 136.93/18.77 -------------------------------------------- % 136.93/18.77 ax1, ax10, ax13, ax14, ax15, ax16, ax18, ax19, ax2, ax20, ax21, ax22, ax23, % 136.93/18.77 ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, ax33, ax34, ax35, % 136.93/18.77 ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, ax45, ax46, ax47, % 136.93/18.77 ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, ax59, ax6, % 136.93/18.77 ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, ax7, ax70, ax71, % 136.93/18.77 ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, ax82, ax83, % 136.93/18.77 ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax94, ax95 % 136.93/18.77 % 136.93/18.77 Those formulas are unsatisfiable: % 136.93/18.77 --------------------------------- % 136.93/18.77 % 136.93/18.77 Begin of proof % 136.93/18.77 | % 136.93/18.77 | ALPHA: (ax11) implies: % 136.93/18.78 | (1) ! [v0: $i] : ( ~ $i(v0) | ~ ssList(v0) | totalorderedP(v0) | ? [v1: % 136.93/18.78 | $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: $i] : ? % 136.93/18.78 | [v6: $i] : ? [v7: $i] : ? [v8: $i] : (cons(v2, v7) = v8 & cons(v1, % 136.93/18.78 | v4) = v5 & app(v6, v8) = v0 & app(v3, v5) = v6 & $i(v8) & $i(v7) % 136.93/18.78 | & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & ssList(v7) % 136.93/18.78 | & ssList(v4) & ssList(v3) & ssItem(v2) & ssItem(v1) & ~ leq(v1, % 136.93/18.78 | v2))) % 136.93/18.78 | % 136.93/18.78 | ALPHA: (ax12) implies: % 136.93/18.78 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 136.93/18.78 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (cons(v2, % 136.93/18.78 | v7) = v8) | ~ (cons(v1, v4) = v5) | ~ (app(v6, v8) = v0) | ~ % 136.93/18.78 | (app(v3, v5) = v6) | ~ $i(v7) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | % 136.93/18.78 | ~ $i(v1) | ~ $i(v0) | ~ strictorderedP(v0) | ~ ssList(v7) | ~ % 136.93/18.78 | ssList(v4) | ~ ssList(v3) | ~ ssList(v0) | ~ ssItem(v2) | ~ % 136.93/18.78 | ssItem(v1) | lt(v1, v2)) % 136.93/18.78 | % 136.93/18.78 | ALPHA: (ax17) implies: % 136.93/18.78 | (3) ssList(nil) % 136.93/18.78 | % 136.93/18.78 | ALPHA: (ax58) implies: % 136.93/18.78 | (4) ~ ssList(nil) | segmentP(nil, nil) % 136.93/18.78 | % 136.93/18.78 | ALPHA: (ax93) implies: % 136.93/18.78 | (5) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ lt(v0, v1) | ~ % 136.93/18.78 | ssItem(v1) | ~ ssItem(v0) | leq(v0, v1)) % 136.93/18.78 | % 136.93/18.78 | DELTA: instantiating (co1) with fresh symbols all_91_0, all_91_1 gives: % 136.93/18.78 | (6) $i(all_91_0) & $i(all_91_1) & strictorderedP(all_91_1) & % 136.93/18.78 | frontsegP(all_91_0, all_91_1) & ssList(all_91_0) & ssList(all_91_1) & % 136.93/18.78 | ~ totalorderedP(all_91_1) & ! [v0: $i] : ( ~ $i(v0) | ~ % 136.93/18.78 | strictorderedP(v0) | ~ segmentP(v0, all_91_1) | ~ % 136.93/18.78 | frontsegP(all_91_0, v0) | ~ ssList(v0) | ~ neq(all_91_1, v0)) % 136.93/18.78 | % 136.93/18.78 | ALPHA: (6) implies: % 136.93/18.78 | (7) ~ totalorderedP(all_91_1) % 136.93/18.78 | (8) ssList(all_91_1) % 136.93/18.78 | (9) strictorderedP(all_91_1) % 136.93/18.78 | (10) $i(all_91_1) % 136.93/18.78 | % 136.93/18.78 | BETA: splitting (4) gives: % 136.93/18.78 | % 136.93/18.78 | Case 1: % 136.93/18.78 | | % 136.93/18.78 | | (11) ~ ssList(nil) % 136.93/18.78 | | % 136.93/18.78 | | PRED_UNIFY: (3), (11) imply: % 136.93/18.78 | | (12) $false % 136.93/18.78 | | % 136.93/18.78 | | CLOSE: (12) is inconsistent. % 136.93/18.78 | | % 136.93/18.78 | Case 2: % 136.93/18.78 | | % 136.93/18.78 | | % 136.93/18.78 | | GROUND_INST: instantiating (1) with all_91_1, simplifying with (7), (8), % 136.93/18.78 | | (10) gives: % 136.93/18.79 | | (13) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] % 136.93/18.79 | | : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : (cons(v1, v6) = v7 & % 136.93/18.79 | | cons(v0, v3) = v4 & app(v5, v7) = all_91_1 & app(v2, v4) = v5 & % 136.93/18.79 | | $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 136.93/18.79 | | $i(v0) & ssList(v6) & ssList(v3) & ssList(v2) & ssItem(v1) & % 136.93/18.79 | | ssItem(v0) & ~ leq(v0, v1)) % 136.93/18.79 | | % 136.93/18.79 | | DELTA: instantiating (13) with fresh symbols all_120_0, all_120_1, % 136.93/18.79 | | all_120_2, all_120_3, all_120_4, all_120_5, all_120_6, all_120_7 % 136.93/18.79 | | gives: % 136.93/18.79 | | (14) cons(all_120_6, all_120_1) = all_120_0 & cons(all_120_7, all_120_4) % 136.93/18.79 | | = all_120_3 & app(all_120_2, all_120_0) = all_91_1 & app(all_120_5, % 136.93/18.79 | | all_120_3) = all_120_2 & $i(all_120_0) & $i(all_120_1) & % 136.93/18.79 | | $i(all_120_2) & $i(all_120_3) & $i(all_120_4) & $i(all_120_5) & % 136.93/18.79 | | $i(all_120_6) & $i(all_120_7) & ssList(all_120_1) & % 136.93/18.79 | | ssList(all_120_4) & ssList(all_120_5) & ssItem(all_120_6) & % 136.93/18.79 | | ssItem(all_120_7) & ~ leq(all_120_7, all_120_6) % 136.93/18.79 | | % 136.93/18.79 | | ALPHA: (14) implies: % 136.93/18.79 | | (15) ~ leq(all_120_7, all_120_6) % 136.93/18.79 | | (16) ssItem(all_120_7) % 136.93/18.79 | | (17) ssItem(all_120_6) % 136.93/18.79 | | (18) ssList(all_120_5) % 136.93/18.79 | | (19) ssList(all_120_4) % 136.93/18.79 | | (20) ssList(all_120_1) % 136.93/18.79 | | (21) $i(all_120_7) % 136.93/18.79 | | (22) $i(all_120_6) % 136.93/18.79 | | (23) $i(all_120_5) % 136.93/18.79 | | (24) $i(all_120_4) % 136.93/18.79 | | (25) $i(all_120_1) % 136.93/18.79 | | (26) app(all_120_5, all_120_3) = all_120_2 % 136.93/18.79 | | (27) app(all_120_2, all_120_0) = all_91_1 % 136.93/18.79 | | (28) cons(all_120_7, all_120_4) = all_120_3 % 136.93/18.79 | | (29) cons(all_120_6, all_120_1) = all_120_0 % 136.93/18.79 | | % 136.93/18.79 | | GROUND_INST: instantiating (2) with all_91_1, all_120_7, all_120_6, % 136.93/18.79 | | all_120_5, all_120_4, all_120_3, all_120_2, all_120_1, % 136.93/18.79 | | all_120_0, simplifying with (8), (9), (10), (16), (17), (18), % 136.93/18.79 | | (19), (20), (21), (22), (23), (24), (25), (26), (27), (28), % 136.93/18.79 | | (29) gives: % 136.93/18.79 | | (30) lt(all_120_7, all_120_6) % 136.93/18.79 | | % 136.93/18.79 | | GROUND_INST: instantiating (5) with all_120_7, all_120_6, simplifying with % 136.93/18.79 | | (15), (16), (17), (21), (22), (30) gives: % 136.93/18.79 | | (31) $false % 136.93/18.79 | | % 136.93/18.79 | | CLOSE: (31) is inconsistent. % 136.93/18.79 | | % 136.93/18.79 | End of split % 136.93/18.79 | % 136.93/18.79 End of proof % 136.93/18.79 % SZS output end Proof for theBenchmark % 136.93/18.79 % 136.93/18.79 18184ms %------------------------------------------------------------------------------