%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC189+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 : n017.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:09 EDT 2023 % Result : Theorem 25.61s 4.23s % Output : Proof 34.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWC189+1 : TPTP v8.1.2. Released v2.4.0. % 0.06/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n017.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Mon Aug 28 16:58:12 EDT 2023 % 0.12/0.33 % CPUTime : % 0.50/0.64 ________ _____ % 0.50/0.64 ___ __ \_________(_)________________________________ % 0.50/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.50/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.50/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.50/0.64 % 0.50/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.50/0.64 (2023-06-19) % 0.50/0.64 % 0.50/0.64 (c) Philipp Rümmer, 2009-2023 % 0.50/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.50/0.64 Amanda Stjerna. % 0.50/0.64 Free software under BSD-3-Clause. % 0.50/0.64 % 0.50/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.50/0.64 % 0.50/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.50/0.65 Running up to 7 provers in parallel. % 0.50/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.50/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.50/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.50/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.50/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.50/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.50/0.68 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.09/1.48 Prover 1: Preprocessing ... % 5.38/1.49 Prover 4: Preprocessing ... % 5.38/1.51 Prover 6: Preprocessing ... % 5.38/1.51 Prover 3: Preprocessing ... % 5.38/1.51 Prover 0: Preprocessing ... % 5.38/1.51 Prover 2: Preprocessing ... % 5.38/1.51 Prover 5: Preprocessing ... % 15.11/2.87 Prover 2: Proving ... % 16.08/2.95 Prover 6: Proving ... % 16.08/2.98 Prover 1: Constructing countermodel ... % 16.08/2.98 Prover 5: Constructing countermodel ... % 16.79/3.03 Prover 3: Constructing countermodel ... % 22.58/3.82 Prover 4: Constructing countermodel ... % 23.28/3.93 Prover 0: Proving ... % 25.61/4.23 Prover 0: proved (3559ms) % 25.61/4.23 % 25.61/4.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 25.61/4.23 % 25.61/4.23 Prover 3: stopped % 25.61/4.24 Prover 5: stopped % 25.61/4.24 Prover 2: stopped % 25.61/4.24 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 25.61/4.24 Prover 6: stopped % 25.61/4.25 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 25.61/4.25 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 26.26/4.26 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 26.26/4.26 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 27.68/4.49 Prover 7: Preprocessing ... % 27.68/4.49 Prover 8: Preprocessing ... % 27.68/4.53 Prover 11: Preprocessing ... % 27.68/4.53 Prover 10: Preprocessing ... % 27.68/4.53 Prover 13: Preprocessing ... % 29.05/4.72 Prover 7: Constructing countermodel ... % 29.68/4.75 Prover 10: Constructing countermodel ... % 30.54/4.90 Prover 13: Constructing countermodel ... % 31.03/5.01 Prover 8: Warning: ignoring some quantifiers % 31.03/5.02 Prover 8: Constructing countermodel ... % 31.76/5.04 Prover 10: Found proof (size 7) % 31.76/5.04 Prover 10: proved (778ms) % 31.76/5.04 Prover 4: stopped % 31.76/5.04 Prover 13: stopped % 31.76/5.04 Prover 1: stopped % 31.76/5.04 Prover 7: stopped % 31.76/5.05 Prover 8: stopped % 33.61/5.49 Prover 11: Constructing countermodel ... % 33.61/5.51 Prover 11: stopped % 33.61/5.51 % 33.61/5.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 33.61/5.52 % 33.61/5.52 % SZS output start Proof for theBenchmark % 33.61/5.53 Assumptions after simplification: % 33.61/5.53 --------------------------------- % 33.61/5.53 % 33.61/5.53 (co1) % 34.17/5.58 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] % 34.17/5.58 : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ( ~ % 34.17/5.58 (v4 = v2) & cons(v4, nil) = v5 & cons(v2, nil) = v3 & app(v8, v9) = v0 & % 34.17/5.58 app(v7, v5) = v8 & app(v6, v3) = v7 & $i(v9) & $i(v8) & $i(v7) & $i(v6) & % 34.17/5.58 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & ssList(v9) & % 34.17/5.58 ssList(v6) & ssList(v1) & ssList(v0) & ssItem(v4) & ssItem(v2) & ! [v10: % 34.17/5.58 $i] : ! [v11: $i] : ! [v12: $i] : ! [v13: $i] : ! [v14: $i] : ! [v15: % 34.17/5.58 $i] : ! [v16: $i] : ! [v17: $i] : (v12 = v10 | ~ (cons(v12, nil) = v13) % 34.17/5.58 | ~ (cons(v10, nil) = v11) | ~ (app(v16, v17) = v0) | ~ (app(v15, v13) % 34.17/5.58 = v16) | ~ (app(v14, v11) = v15) | ~ $i(v17) | ~ $i(v14) | ~ $i(v12) % 34.17/5.58 | ~ $i(v10) | ~ ssList(v17) | ~ ssList(v14) | ~ ssItem(v12) | ~ % 34.17/5.58 ssItem(v10))) % 34.17/5.58 % 34.17/5.58 Further assumptions not needed in the proof: % 34.17/5.58 -------------------------------------------- % 34.17/5.58 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 34.17/5.58 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 34.17/5.58 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 34.17/5.58 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, % 34.17/5.58 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, % 34.17/5.58 ax69, ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, % 34.17/5.58 ax80, ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, % 34.17/5.58 ax92, ax93, ax94, ax95 % 34.17/5.58 % 34.17/5.58 Those formulas are unsatisfiable: % 34.17/5.58 --------------------------------- % 34.17/5.58 % 34.17/5.58 Begin of proof % 34.17/5.58 | % 34.17/5.59 | ALPHA: (co1) implies: % 34.17/5.59 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 34.17/5.59 | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ( % 34.17/5.59 | ~ (v4 = v2) & cons(v4, nil) = v5 & cons(v2, nil) = v3 & app(v8, v9) = % 34.17/5.59 | v0 & app(v7, v5) = v8 & app(v6, v3) = v7 & $i(v9) & $i(v8) & $i(v7) & % 34.17/5.59 | $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 34.17/5.59 | ssList(v9) & ssList(v6) & ssList(v1) & ssList(v0) & ssItem(v4) & % 34.17/5.60 | ssItem(v2) & ! [v10: $i] : ! [v11: $i] : ! [v12: $i] : ! [v13: % 34.17/5.60 | $i] : ! [v14: $i] : ! [v15: $i] : ! [v16: $i] : ! [v17: $i] : % 34.17/5.60 | (v12 = v10 | ~ (cons(v12, nil) = v13) | ~ (cons(v10, nil) = v11) | % 34.17/5.60 | ~ (app(v16, v17) = v0) | ~ (app(v15, v13) = v16) | ~ (app(v14, % 34.17/5.60 | v11) = v15) | ~ $i(v17) | ~ $i(v14) | ~ $i(v12) | ~ $i(v10) % 34.17/5.60 | | ~ ssList(v17) | ~ ssList(v14) | ~ ssItem(v12) | ~ % 34.17/5.60 | ssItem(v10))) % 34.17/5.60 | % 34.17/5.60 | DELTA: instantiating (1) with fresh symbols all_91_0, all_91_1, all_91_2, % 34.17/5.60 | all_91_3, all_91_4, all_91_5, all_91_6, all_91_7, all_91_8, all_91_9 % 34.17/5.60 | gives: % 34.17/5.60 | (2) ~ (all_91_5 = all_91_7) & cons(all_91_5, nil) = all_91_4 & % 34.17/5.60 | cons(all_91_7, nil) = all_91_6 & app(all_91_1, all_91_0) = all_91_9 & % 34.17/5.60 | app(all_91_2, all_91_4) = all_91_1 & app(all_91_3, all_91_6) = all_91_2 % 34.17/5.60 | & $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & $i(all_91_3) & % 34.17/5.60 | $i(all_91_4) & $i(all_91_5) & $i(all_91_6) & $i(all_91_7) & % 34.17/5.60 | $i(all_91_8) & $i(all_91_9) & ssList(all_91_0) & ssList(all_91_3) & % 34.17/5.60 | ssList(all_91_8) & ssList(all_91_9) & ssItem(all_91_5) & % 34.17/5.60 | ssItem(all_91_7) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: % 34.17/5.60 | $i] : ! [v4: $i] : ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : (v2 = % 34.17/5.60 | v0 | ~ (cons(v2, nil) = v3) | ~ (cons(v0, nil) = v1) | ~ (app(v6, % 34.17/5.60 | v7) = all_91_9) | ~ (app(v5, v3) = v6) | ~ (app(v4, v1) = v5) | % 34.17/5.60 | ~ $i(v7) | ~ $i(v4) | ~ $i(v2) | ~ $i(v0) | ~ ssList(v7) | ~ % 34.17/5.60 | ssList(v4) | ~ ssItem(v2) | ~ ssItem(v0)) % 34.17/5.60 | % 34.17/5.60 | ALPHA: (2) implies: % 34.17/5.61 | (3) ~ (all_91_5 = all_91_7) % 34.17/5.61 | (4) ssItem(all_91_7) % 34.17/5.61 | (5) ssItem(all_91_5) % 34.17/5.61 | (6) ssList(all_91_3) % 34.17/5.61 | (7) ssList(all_91_0) % 34.17/5.61 | (8) $i(all_91_7) % 34.17/5.61 | (9) $i(all_91_5) % 34.17/5.61 | (10) $i(all_91_3) % 34.17/5.61 | (11) $i(all_91_0) % 34.17/5.61 | (12) app(all_91_3, all_91_6) = all_91_2 % 34.17/5.61 | (13) app(all_91_2, all_91_4) = all_91_1 % 34.17/5.61 | (14) app(all_91_1, all_91_0) = all_91_9 % 34.17/5.61 | (15) cons(all_91_7, nil) = all_91_6 % 34.17/5.61 | (16) cons(all_91_5, nil) = all_91_4 % 34.17/5.61 | (17) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 34.17/5.61 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : (v2 = v0 | ~ (cons(v2, nil) % 34.17/5.61 | = v3) | ~ (cons(v0, nil) = v1) | ~ (app(v6, v7) = all_91_9) | ~ % 34.17/5.61 | (app(v5, v3) = v6) | ~ (app(v4, v1) = v5) | ~ $i(v7) | ~ $i(v4) | % 34.17/5.61 | ~ $i(v2) | ~ $i(v0) | ~ ssList(v7) | ~ ssList(v4) | ~ % 34.17/5.61 | ssItem(v2) | ~ ssItem(v0)) % 34.17/5.61 | % 34.17/5.62 | GROUND_INST: instantiating (17) with all_91_7, all_91_6, all_91_5, all_91_4, % 34.17/5.62 | all_91_3, all_91_2, all_91_1, all_91_0, simplifying with (4), % 34.17/5.62 | (5), (6), (7), (8), (9), (10), (11), (12), (13), (14), (15), (16) % 34.17/5.62 | gives: % 34.17/5.62 | (18) all_91_5 = all_91_7 % 34.17/5.62 | % 34.17/5.62 | REDUCE: (3), (18) imply: % 34.17/5.62 | (19) $false % 34.17/5.62 | % 34.17/5.62 | CLOSE: (19) is inconsistent. % 34.17/5.62 | % 34.17/5.62 End of proof % 34.17/5.62 % SZS output end Proof for theBenchmark % 34.17/5.62 % 34.17/5.62 4979ms %------------------------------------------------------------------------------