%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC406+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 : n020.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:51:17 EDT 2023 % Result : Theorem 19.90s 3.38s % Output : Proof 28.66s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWC406+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 : n020.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:22:43 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.65/1.51 Prover 4: Preprocessing ... % 5.65/1.52 Prover 5: Preprocessing ... % 5.65/1.54 Prover 1: Preprocessing ... % 5.65/1.54 Prover 3: Preprocessing ... % 5.65/1.54 Prover 6: Preprocessing ... % 5.65/1.54 Prover 2: Preprocessing ... % 5.65/1.56 Prover 0: Preprocessing ... % 15.79/2.83 Prover 6: Proving ... % 15.79/2.84 Prover 5: Constructing countermodel ... % 15.79/2.84 Prover 2: Proving ... % 16.89/2.96 Prover 1: Constructing countermodel ... % 16.89/2.96 Prover 3: Constructing countermodel ... % 19.90/3.37 Prover 3: proved (2736ms) % 19.90/3.37 % 19.90/3.38 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 19.90/3.38 % 19.90/3.39 Prover 5: stopped % 19.90/3.39 Prover 2: stopped % 19.90/3.39 Prover 6: stopped % 20.20/3.40 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 20.20/3.40 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 20.20/3.41 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 20.20/3.41 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 22.07/3.68 Prover 8: Preprocessing ... % 22.07/3.70 Prover 11: Preprocessing ... % 22.07/3.72 Prover 10: Preprocessing ... % 22.07/3.73 Prover 7: Preprocessing ... % 22.07/3.74 Prover 4: Constructing countermodel ... % 22.87/3.75 Prover 0: Proving ... % 22.87/3.76 Prover 0: stopped % 22.87/3.76 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 23.25/3.90 Prover 13: Preprocessing ... % 24.75/4.02 Prover 10: Constructing countermodel ... % 24.75/4.03 Prover 7: Constructing countermodel ... % 25.86/4.17 Prover 8: Warning: ignoring some quantifiers % 25.86/4.18 Prover 8: Constructing countermodel ... % 26.17/4.19 Prover 10: Found proof (size 5) % 26.17/4.19 Prover 10: proved (786ms) % 26.17/4.19 Prover 7: stopped % 26.17/4.19 Prover 1: stopped % 26.17/4.20 Prover 4: stopped % 26.17/4.20 Prover 8: stopped % 26.17/4.21 Prover 13: Constructing countermodel ... % 26.17/4.23 Prover 13: stopped % 28.23/4.69 Prover 11: Constructing countermodel ... % 28.23/4.71 Prover 11: stopped % 28.23/4.71 % 28.23/4.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 28.23/4.71 % 28.23/4.72 % SZS output start Proof for theBenchmark % 28.50/4.73 Assumptions after simplification: % 28.50/4.73 --------------------------------- % 28.50/4.73 % 28.50/4.73 (co1) % 28.50/4.75 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) & % 28.50/4.75 memberP(v0, v2) & ssList(v1) & ssList(v0) & ssItem(v2) & ~ memberP(v1, v2) % 28.50/4.75 & ! [v3: $i] : ! [v4: $i] : (v4 = v3 | ~ $i(v4) | ~ $i(v3) | ~ leq(v4, % 28.50/4.75 v3) | ~ memberP(v1, v4) | ~ memberP(v0, v3) | ~ ssItem(v4) | ~ % 28.50/4.75 ssItem(v3)) & ! [v3: $i] : ( ~ $i(v3) | ~ memberP(v1, v3) | ~ % 28.50/4.75 ssItem(v3) | memberP(v0, v3) | ? [v4: $i] : ( ~ (v4 = v3) & $i(v4) & % 28.50/4.75 leq(v4, v3) & memberP(v1, v4) & ssItem(v4))) & ! [v3: $i] : ( ~ $i(v3) % 28.50/4.75 | ~ memberP(v0, v3) | ~ ssItem(v3) | memberP(v1, v3))) % 28.50/4.75 % 28.50/4.75 Further assumptions not needed in the proof: % 28.50/4.75 -------------------------------------------- % 28.50/4.75 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 28.50/4.75 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 28.50/4.75 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 28.50/4.75 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, % 28.50/4.75 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, % 28.50/4.75 ax69, ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, % 28.50/4.75 ax80, ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, % 28.50/4.75 ax92, ax93, ax94, ax95 % 28.50/4.75 % 28.50/4.75 Those formulas are unsatisfiable: % 28.50/4.75 --------------------------------- % 28.50/4.75 % 28.50/4.75 Begin of proof % 28.50/4.75 | % 28.50/4.75 | DELTA: instantiating (co1) with fresh symbols all_91_0, all_91_1, all_91_2 % 28.50/4.75 | gives: % 28.50/4.76 | (1) $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & memberP(all_91_2, % 28.50/4.76 | all_91_0) & ssList(all_91_1) & ssList(all_91_2) & ssItem(all_91_0) & % 28.50/4.76 | ~ memberP(all_91_1, all_91_0) & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | % 28.50/4.76 | ~ $i(v1) | ~ $i(v0) | ~ leq(v1, v0) | ~ memberP(all_91_1, v1) | ~ % 28.50/4.76 | memberP(all_91_2, v0) | ~ ssItem(v1) | ~ ssItem(v0)) & ! [v0: $i] % 28.50/4.76 | : ( ~ $i(v0) | ~ memberP(all_91_1, v0) | ~ ssItem(v0) | % 28.50/4.76 | memberP(all_91_2, v0) | ? [v1: $i] : ( ~ (v1 = v0) & $i(v1) & % 28.50/4.76 | leq(v1, v0) & memberP(all_91_1, v1) & ssItem(v1))) & ! [v0: $i] : % 28.50/4.76 | ( ~ $i(v0) | ~ memberP(all_91_2, v0) | ~ ssItem(v0) | % 28.50/4.76 | memberP(all_91_1, v0)) % 28.50/4.76 | % 28.66/4.76 | ALPHA: (1) implies: % 28.66/4.76 | (2) ~ memberP(all_91_1, all_91_0) % 28.66/4.76 | (3) ssItem(all_91_0) % 28.66/4.76 | (4) memberP(all_91_2, all_91_0) % 28.66/4.76 | (5) $i(all_91_0) % 28.66/4.76 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ memberP(all_91_2, v0) | ~ ssItem(v0) | % 28.66/4.76 | memberP(all_91_1, v0)) % 28.66/4.76 | % 28.66/4.77 | GROUND_INST: instantiating (6) with all_91_0, simplifying with (2), (3), (4), % 28.66/4.77 | (5) gives: % 28.66/4.77 | (7) $false % 28.66/4.77 | % 28.66/4.77 | CLOSE: (7) is inconsistent. % 28.66/4.77 | % 28.66/4.77 End of proof % 28.66/4.77 % SZS output end Proof for theBenchmark % 28.66/4.77 % 28.66/4.77 4160ms %------------------------------------------------------------------------------