%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC097+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:49:38 EDT 2023 % Result : Theorem 18.58s 3.26s % Output : Proof 28.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SWC097+1 : TPTP v8.1.2. Released v2.4.0. % 0.08/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.36 % Computer : n017.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 300 % 0.14/0.36 % DateTime : Mon Aug 28 18:26:57 EDT 2023 % 0.14/0.36 % CPUTime : % 0.23/0.63 ________ _____ % 0.23/0.63 ___ __ \_________(_)________________________________ % 0.23/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.23/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.23/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.23/0.63 % 0.23/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.23/0.63 (2023-06-19) % 0.23/0.63 % 0.23/0.63 (c) Philipp Rümmer, 2009-2023 % 0.23/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.23/0.63 Amanda Stjerna. % 0.23/0.63 Free software under BSD-3-Clause. % 0.23/0.63 % 0.23/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.23/0.63 % 0.23/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.23/0.64 Running up to 7 provers in parallel. % 0.23/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.23/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.23/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.23/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.23/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.23/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.23/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.48/1.40 Prover 1: Preprocessing ... % 4.48/1.41 Prover 4: Preprocessing ... % 5.20/1.44 Prover 6: Preprocessing ... % 5.20/1.44 Prover 5: Preprocessing ... % 5.20/1.44 Prover 0: Preprocessing ... % 5.20/1.44 Prover 3: Preprocessing ... % 5.20/1.45 Prover 2: Preprocessing ... % 14.22/2.67 Prover 2: Proving ... % 14.22/2.72 Prover 1: Constructing countermodel ... % 14.86/2.73 Prover 5: Constructing countermodel ... % 15.29/2.81 Prover 6: Proving ... % 15.29/2.81 Prover 3: Constructing countermodel ... % 18.58/3.25 Prover 3: proved (2599ms) % 18.58/3.26 % 18.58/3.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 18.58/3.26 % 18.58/3.26 Prover 5: stopped % 18.58/3.26 Prover 6: stopped % 18.58/3.26 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 18.58/3.26 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 18.58/3.27 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 18.58/3.27 Prover 2: stopped % 18.58/3.27 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 20.47/3.51 Prover 0: Proving ... % 20.47/3.53 Prover 0: stopped % 20.47/3.53 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 20.47/3.55 Prover 4: Constructing countermodel ... % 21.54/3.67 Prover 7: Preprocessing ... % 21.54/3.70 Prover 8: Preprocessing ... % 21.54/3.70 Prover 11: Preprocessing ... % 22.20/3.73 Prover 10: Preprocessing ... % 23.14/3.90 Prover 13: Preprocessing ... % 23.14/3.91 Prover 10: Constructing countermodel ... % 23.14/3.95 Prover 7: Constructing countermodel ... % 25.41/4.16 Prover 8: Warning: ignoring some quantifiers % 25.41/4.18 Prover 10: Found proof (size 6) % 25.41/4.18 Prover 10: proved (915ms) % 25.41/4.18 Prover 7: stopped % 25.41/4.18 Prover 1: stopped % 25.41/4.18 Prover 8: Constructing countermodel ... % 25.81/4.19 Prover 4: stopped % 25.81/4.20 Prover 8: stopped % 25.81/4.20 Prover 13: Constructing countermodel ... % 25.81/4.22 Prover 13: stopped % 27.84/4.72 Prover 11: Constructing countermodel ... % 28.20/4.75 Prover 11: stopped % 28.20/4.75 % 28.20/4.75 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 28.20/4.75 % 28.20/4.76 % SZS output start Proof for theBenchmark % 28.20/4.76 Assumptions after simplification: % 28.20/4.76 --------------------------------- % 28.20/4.76 % 28.20/4.76 (co1) % 28.35/4.79 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (cons(v2, % 28.35/4.79 nil) = v3 & app(v0, v3) = v1 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 28.35/4.79 ssList(v1) & ssList(v0) & neq(v1, nil) & ssItem(v2) & ! [v4: $i] : ! [v5: % 28.35/4.79 $i] : ( ~ (cons(v4, nil) = v5) | ~ (app(v0, v5) = v1) | ~ $i(v4) | ~ % 28.35/4.79 ssItem(v4))) % 28.35/4.79 % 28.35/4.79 Further assumptions not needed in the proof: % 28.35/4.79 -------------------------------------------- % 28.35/4.79 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 28.35/4.79 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 28.35/4.79 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 28.35/4.79 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, % 28.35/4.79 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, % 28.35/4.79 ax69, ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, % 28.35/4.79 ax80, ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, % 28.35/4.79 ax92, ax93, ax94, ax95 % 28.35/4.79 % 28.35/4.79 Those formulas are unsatisfiable: % 28.35/4.79 --------------------------------- % 28.35/4.79 % 28.35/4.79 Begin of proof % 28.35/4.79 | % 28.35/4.79 | ALPHA: (co1) implies: % 28.35/4.80 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (cons(v2, nil) % 28.35/4.80 | = v3 & app(v0, v3) = v1 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 28.35/4.80 | ssList(v1) & ssList(v0) & neq(v1, nil) & ssItem(v2) & ! [v4: $i] : % 28.35/4.80 | ! [v5: $i] : ( ~ (cons(v4, nil) = v5) | ~ (app(v0, v5) = v1) | ~ % 28.35/4.80 | $i(v4) | ~ ssItem(v4))) % 28.35/4.80 | % 28.35/4.80 | DELTA: instantiating (1) with fresh symbols all_91_0, all_91_1, all_91_2, % 28.35/4.80 | all_91_3 gives: % 28.35/4.80 | (2) cons(all_91_1, nil) = all_91_0 & app(all_91_3, all_91_0) = all_91_2 & % 28.35/4.80 | $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & $i(all_91_3) & % 28.35/4.80 | ssList(all_91_2) & ssList(all_91_3) & neq(all_91_2, nil) & % 28.35/4.80 | ssItem(all_91_1) & ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v0, nil) = v1) % 28.35/4.80 | | ~ (app(all_91_3, v1) = all_91_2) | ~ $i(v0) | ~ ssItem(v0)) % 28.35/4.80 | % 28.35/4.80 | ALPHA: (2) implies: % 28.35/4.80 | (3) ssItem(all_91_1) % 28.35/4.80 | (4) $i(all_91_1) % 28.35/4.80 | (5) app(all_91_3, all_91_0) = all_91_2 % 28.35/4.80 | (6) cons(all_91_1, nil) = all_91_0 % 28.35/4.80 | (7) ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v0, nil) = v1) | ~ % 28.35/4.80 | (app(all_91_3, v1) = all_91_2) | ~ $i(v0) | ~ ssItem(v0)) % 28.35/4.80 | % 28.35/4.80 | GROUND_INST: instantiating (7) with all_91_1, all_91_0, simplifying with (3), % 28.35/4.80 | (4), (5), (6) gives: % 28.35/4.80 | (8) $false % 28.35/4.80 | % 28.35/4.80 | CLOSE: (8) is inconsistent. % 28.35/4.80 | % 28.35/4.80 End of proof % 28.35/4.80 % SZS output end Proof for theBenchmark % 28.35/4.80 % 28.35/4.80 4175ms %------------------------------------------------------------------------------