%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC254+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 : n016.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:29 EDT 2023 % Result : Theorem 22.07s 3.58s % Output : Proof 28.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.12 % Problem : SWC254+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.34 % Computer : n016.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 16:42:44 EDT 2023 % 0.13/0.34 % CPUTime : % 0.60/0.61 ________ _____ % 0.60/0.61 ___ __ \_________(_)________________________________ % 0.60/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.60/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.60/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.60/0.61 % 0.60/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.60/0.61 (2023-06-19) % 0.60/0.61 % 0.60/0.61 (c) Philipp Rümmer, 2009-2023 % 0.60/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.60/0.61 Amanda Stjerna. % 0.60/0.61 Free software under BSD-3-Clause. % 0.60/0.61 % 0.60/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.60/0.61 % 0.60/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.60/0.62 Running up to 7 provers in parallel. % 0.60/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.60/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.60/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.60/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.60/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.60/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.60/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 6.50/1.55 Prover 1: Preprocessing ... % 6.50/1.56 Prover 4: Preprocessing ... % 6.50/1.61 Prover 5: Preprocessing ... % 6.50/1.61 Prover 0: Preprocessing ... % 6.50/1.61 Prover 3: Preprocessing ... % 6.50/1.61 Prover 2: Preprocessing ... % 6.50/1.61 Prover 6: Preprocessing ... % 15.26/2.75 Prover 2: Proving ... % 16.40/2.83 Prover 5: Constructing countermodel ... % 16.40/2.87 Prover 6: Proving ... % 16.40/2.89 Prover 1: Constructing countermodel ... % 17.02/2.92 Prover 3: Constructing countermodel ... % 21.63/3.55 Prover 4: Constructing countermodel ... % 22.07/3.57 Prover 3: proved (2947ms) % 22.07/3.58 % 22.07/3.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 22.07/3.58 % 22.07/3.58 Prover 5: stopped % 22.07/3.58 Prover 2: stopped % 22.07/3.58 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 22.07/3.58 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 22.07/3.58 Prover 6: stopped % 22.07/3.59 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 22.07/3.61 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 22.66/3.66 Prover 0: Proving ... % 22.66/3.66 Prover 0: stopped % 22.66/3.67 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 23.97/3.85 Prover 10: Preprocessing ... % 24.37/3.89 Prover 11: Preprocessing ... % 24.37/3.90 Prover 7: Preprocessing ... % 24.37/3.91 Prover 13: Preprocessing ... % 24.37/3.92 Prover 8: Preprocessing ... % 26.20/4.13 Prover 10: Constructing countermodel ... % 26.63/4.23 Prover 7: Constructing countermodel ... % 27.66/4.33 Prover 10: Found proof (size 7) % 27.66/4.33 Prover 10: proved (747ms) % 27.66/4.33 Prover 4: stopped % 27.66/4.33 Prover 11: stopped % 27.66/4.33 Prover 7: stopped % 28.02/4.34 Prover 1: stopped % 28.02/4.34 Prover 13: Constructing countermodel ... % 28.06/4.36 Prover 13: stopped % 28.06/4.37 Prover 8: Warning: ignoring some quantifiers % 28.06/4.37 Prover 8: Constructing countermodel ... % 28.06/4.38 Prover 8: stopped % 28.06/4.38 % 28.06/4.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 28.06/4.38 % 28.06/4.39 % SZS output start Proof for theBenchmark % 28.06/4.39 Assumptions after simplification: % 28.06/4.39 --------------------------------- % 28.06/4.39 % 28.06/4.39 (ax4) % 28.33/4.42 $i(nil) & ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v1, nil) = v0) | ~ $i(v1) | % 28.33/4.42 ~ $i(v0) | ~ ssList(v0) | ~ ssItem(v1) | singletonP(v0)) & ! [v0: $i] : ( % 28.33/4.42 ~ $i(v0) | ~ singletonP(v0) | ~ ssList(v0) | ? [v1: $i] : (cons(v1, nil) % 28.33/4.42 = v0 & $i(v1) & ssItem(v1))) % 28.33/4.42 % 28.33/4.42 (co1) % 28.33/4.42 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (cons(v2, % 28.33/4.42 nil) = v0 & app(v3, v0) = v1 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 28.33/4.42 ssList(v3) & ssList(v1) & ssList(v0) & neq(v1, nil) & ssItem(v2) & ~ % 28.33/4.42 singletonP(v0)) % 28.33/4.42 % 28.33/4.42 Further assumptions not needed in the proof: % 28.33/4.42 -------------------------------------------- % 28.33/4.42 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 28.33/4.42 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 28.33/4.42 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax40, ax41, ax42, ax43, ax44, ax45, % 28.33/4.42 ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, ax57, % 28.33/4.42 ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, ax69, % 28.33/4.42 ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, % 28.33/4.42 ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, % 28.33/4.42 ax93, ax94, ax95 % 28.33/4.42 % 28.33/4.42 Those formulas are unsatisfiable: % 28.33/4.42 --------------------------------- % 28.33/4.42 % 28.33/4.42 Begin of proof % 28.33/4.42 | % 28.33/4.42 | ALPHA: (ax4) implies: % 28.33/4.42 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v1, nil) = v0) | ~ $i(v1) | ~ % 28.33/4.42 | $i(v0) | ~ ssList(v0) | ~ ssItem(v1) | singletonP(v0)) % 28.33/4.42 | % 28.33/4.42 | ALPHA: (co1) implies: % 28.33/4.42 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (cons(v2, nil) % 28.33/4.42 | = v0 & app(v3, v0) = v1 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 28.33/4.42 | ssList(v3) & ssList(v1) & ssList(v0) & neq(v1, nil) & ssItem(v2) & ~ % 28.33/4.42 | singletonP(v0)) % 28.33/4.42 | % 28.33/4.42 | DELTA: instantiating (2) with fresh symbols all_91_0, all_91_1, all_91_2, % 28.33/4.42 | all_91_3 gives: % 28.33/4.42 | (3) cons(all_91_1, nil) = all_91_3 & app(all_91_0, all_91_3) = all_91_2 & % 28.33/4.42 | $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & $i(all_91_3) & % 28.33/4.42 | ssList(all_91_0) & ssList(all_91_2) & ssList(all_91_3) & neq(all_91_2, % 28.33/4.42 | nil) & ssItem(all_91_1) & ~ singletonP(all_91_3) % 28.33/4.42 | % 28.33/4.42 | ALPHA: (3) implies: % 28.33/4.43 | (4) ~ singletonP(all_91_3) % 28.33/4.43 | (5) ssItem(all_91_1) % 28.33/4.43 | (6) ssList(all_91_3) % 28.33/4.43 | (7) $i(all_91_3) % 28.33/4.43 | (8) $i(all_91_1) % 28.33/4.43 | (9) cons(all_91_1, nil) = all_91_3 % 28.33/4.43 | % 28.33/4.43 | GROUND_INST: instantiating (1) with all_91_3, all_91_1, simplifying with (4), % 28.33/4.43 | (5), (6), (7), (8), (9) gives: % 28.33/4.43 | (10) $false % 28.33/4.43 | % 28.33/4.43 | CLOSE: (10) is inconsistent. % 28.33/4.43 | % 28.33/4.43 End of proof % 28.33/4.43 % SZS output end Proof for theBenchmark % 28.33/4.43 % 28.33/4.43 3821ms %------------------------------------------------------------------------------