%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC096+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 : n018.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:37 EDT 2023 % Result : Theorem 25.40s 4.16s % Output : Proof 34.82s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWC096+1 : TPTP v8.1.2. Released v2.4.0. % 0.06/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.33 % Computer : n018.cluster.edu % 0.14/0.33 % Model : x86_64 x86_64 % 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.33 % Memory : 8042.1875MB % 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Mon Aug 28 15:31:32 EDT 2023 % 0.14/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.87/1.37 Prover 4: Preprocessing ... % 4.87/1.38 Prover 1: Preprocessing ... % 4.87/1.42 Prover 5: Preprocessing ... % 4.87/1.42 Prover 2: Preprocessing ... % 4.87/1.42 Prover 0: Preprocessing ... % 4.87/1.42 Prover 3: Preprocessing ... % 5.42/1.44 Prover 6: Preprocessing ... % 15.90/2.84 Prover 2: Proving ... % 16.21/2.88 Prover 5: Constructing countermodel ... % 16.21/2.91 Prover 1: Constructing countermodel ... % 17.55/3.14 Prover 3: Constructing countermodel ... % 17.55/3.18 Prover 6: Proving ... % 25.40/4.09 Prover 4: Constructing countermodel ... % 25.40/4.09 Prover 0: Proving ... % 25.40/4.16 Prover 3: proved (3541ms) % 25.40/4.16 % 25.40/4.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 25.40/4.16 % 25.40/4.17 Prover 2: stopped % 25.40/4.17 Prover 6: stopped % 25.40/4.17 Prover 5: stopped % 26.27/4.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 26.27/4.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 26.27/4.20 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 26.27/4.21 Prover 0: stopped % 26.27/4.21 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 26.27/4.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 27.08/4.44 Prover 7: Preprocessing ... % 27.08/4.46 Prover 8: Preprocessing ... % 27.08/4.47 Prover 13: Preprocessing ... % 27.08/4.48 Prover 10: Preprocessing ... % 27.78/4.50 Prover 11: Preprocessing ... % 29.40/4.67 Prover 7: Constructing countermodel ... % 30.17/4.73 Prover 10: Constructing countermodel ... % 31.72/4.96 Prover 13: Constructing countermodel ... % 31.72/4.98 Prover 10: Found proof (size 6) % 31.72/4.98 Prover 10: proved (809ms) % 31.72/4.98 Prover 4: stopped % 31.72/4.98 Prover 7: stopped % 31.72/4.98 Prover 1: stopped % 31.72/4.99 Prover 13: stopped % 31.72/5.00 Prover 8: Warning: ignoring some quantifiers % 31.72/5.01 Prover 8: Constructing countermodel ... % 32.42/5.02 Prover 8: stopped % 34.37/5.53 Prover 11: Constructing countermodel ... % 34.57/5.55 Prover 11: stopped % 34.57/5.55 % 34.57/5.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 34.57/5.55 % 34.57/5.56 % SZS output start Proof for theBenchmark % 34.57/5.57 Assumptions after simplification: % 34.57/5.57 --------------------------------- % 34.57/5.57 % 34.57/5.57 (co1) % 34.82/5.62 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (cons(v2, % 34.82/5.62 nil) = v0 & app(v3, v0) = v1 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 34.82/5.62 ssList(v3) & ssList(v1) & ssList(v0) & neq(v1, nil) & ssItem(v2) & ! [v4: % 34.82/5.62 $i] : ! [v5: $i] : ( ~ (cons(v4, nil) = v0) | ~ (app(v5, v0) = v1) | ~ % 34.82/5.62 $i(v5) | ~ $i(v4) | ~ ssList(v5) | ~ ssItem(v4))) % 34.82/5.62 % 34.82/5.62 Further assumptions not needed in the proof: % 34.82/5.62 -------------------------------------------- % 34.82/5.62 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 34.82/5.62 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 34.82/5.62 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 34.82/5.62 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, % 34.82/5.62 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, % 34.82/5.62 ax69, ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, % 34.82/5.62 ax80, ax81, ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, % 34.82/5.62 ax92, ax93, ax94, ax95 % 34.82/5.62 % 34.82/5.62 Those formulas are unsatisfiable: % 34.82/5.62 --------------------------------- % 34.82/5.62 % 34.82/5.62 Begin of proof % 34.82/5.62 | % 34.82/5.62 | ALPHA: (co1) implies: % 34.82/5.63 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (cons(v2, nil) % 34.82/5.63 | = v0 & app(v3, v0) = v1 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 34.82/5.63 | ssList(v3) & ssList(v1) & ssList(v0) & neq(v1, nil) & ssItem(v2) & ! % 34.82/5.63 | [v4: $i] : ! [v5: $i] : ( ~ (cons(v4, nil) = v0) | ~ (app(v5, v0) = % 34.82/5.63 | v1) | ~ $i(v5) | ~ $i(v4) | ~ ssList(v5) | ~ ssItem(v4))) % 34.82/5.63 | % 34.82/5.63 | DELTA: instantiating (1) with fresh symbols all_91_0, all_91_1, all_91_2, % 34.82/5.63 | all_91_3 gives: % 34.82/5.63 | (2) cons(all_91_1, nil) = all_91_3 & app(all_91_0, all_91_3) = all_91_2 & % 34.82/5.63 | $i(all_91_0) & $i(all_91_1) & $i(all_91_2) & $i(all_91_3) & % 34.82/5.63 | ssList(all_91_0) & ssList(all_91_2) & ssList(all_91_3) & neq(all_91_2, % 34.82/5.63 | nil) & ssItem(all_91_1) & ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v0, % 34.82/5.63 | nil) = all_91_3) | ~ (app(v1, all_91_3) = all_91_2) | ~ $i(v1) % 34.82/5.63 | | ~ $i(v0) | ~ ssList(v1) | ~ ssItem(v0)) % 34.82/5.63 | % 34.82/5.63 | ALPHA: (2) implies: % 34.82/5.63 | (3) ssItem(all_91_1) % 34.82/5.63 | (4) ssList(all_91_0) % 34.82/5.63 | (5) $i(all_91_1) % 34.82/5.63 | (6) $i(all_91_0) % 34.82/5.64 | (7) app(all_91_0, all_91_3) = all_91_2 % 34.82/5.64 | (8) cons(all_91_1, nil) = all_91_3 % 34.82/5.64 | (9) ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v0, nil) = all_91_3) | ~ % 34.82/5.64 | (app(v1, all_91_3) = all_91_2) | ~ $i(v1) | ~ $i(v0) | ~ % 34.82/5.64 | ssList(v1) | ~ ssItem(v0)) % 34.82/5.64 | % 34.82/5.64 | GROUND_INST: instantiating (9) with all_91_1, all_91_0, simplifying with (3), % 34.82/5.64 | (4), (5), (6), (7), (8) gives: % 34.82/5.64 | (10) $false % 34.82/5.64 | % 34.82/5.64 | CLOSE: (10) is inconsistent. % 34.82/5.64 | % 34.82/5.64 End of proof % 34.82/5.64 % SZS output end Proof for theBenchmark % 34.82/5.64 % 34.82/5.64 5043ms %------------------------------------------------------------------------------