%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC041+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 : n028.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:20 EDT 2023 % Result : Theorem 21.44s 3.60s % Output : Proof 31.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWC041+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 : n028.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 17:31:54 EDT 2023 % 0.12/0.33 % CPUTime : % 0.19/0.58 ________ _____ % 0.19/0.58 ___ __ \_________(_)________________________________ % 0.19/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.58 % 0.19/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.58 (2023-06-19) % 0.19/0.58 % 0.19/0.58 (c) Philipp Rümmer, 2009-2023 % 0.19/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.58 Amanda Stjerna. % 0.19/0.58 Free software under BSD-3-Clause. % 0.19/0.58 % 0.19/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.58 % 0.19/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.60 Running up to 7 provers in parallel. % 0.19/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.70/1.38 Prover 4: Preprocessing ... % 4.70/1.40 Prover 6: Preprocessing ... % 4.70/1.40 Prover 0: Preprocessing ... % 4.70/1.41 Prover 3: Preprocessing ... % 5.28/1.41 Prover 1: Preprocessing ... % 5.28/1.42 Prover 2: Preprocessing ... % 5.28/1.43 Prover 5: Preprocessing ... % 14.48/2.65 Prover 2: Proving ... % 14.88/2.71 Prover 6: Proving ... % 14.88/2.72 Prover 1: Constructing countermodel ... % 14.88/2.72 Prover 5: Constructing countermodel ... % 15.79/2.81 Prover 3: Constructing countermodel ... % 21.44/3.59 Prover 3: proved (2987ms) % 21.44/3.60 % 21.44/3.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 21.44/3.60 % 21.44/3.60 Prover 5: stopped % 21.44/3.61 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 21.44/3.61 Prover 6: stopped % 21.44/3.61 Prover 2: stopped % 22.06/3.62 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 22.06/3.62 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 22.06/3.63 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 22.06/3.69 Prover 4: Constructing countermodel ... % 23.95/3.87 Prover 8: Preprocessing ... % 23.95/3.89 Prover 7: Preprocessing ... % 23.95/3.90 Prover 11: Preprocessing ... % 24.38/3.94 Prover 10: Preprocessing ... % 24.63/4.01 Prover 0: Proving ... % 24.63/4.02 Prover 0: stopped % 24.63/4.03 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 26.24/4.17 Prover 13: Preprocessing ... % 26.67/4.22 Prover 7: Constructing countermodel ... % 26.67/4.25 Prover 10: Constructing countermodel ... % 28.31/4.48 Prover 8: Warning: ignoring some quantifiers % 28.82/4.50 Prover 10: Found proof (size 8) % 28.82/4.50 Prover 10: proved (883ms) % 28.82/4.50 Prover 4: stopped % 28.82/4.50 Prover 7: Found proof (size 8) % 28.82/4.50 Prover 7: proved (896ms) % 28.82/4.50 Prover 1: stopped % 28.82/4.50 Prover 8: Constructing countermodel ... % 28.82/4.52 Prover 8: stopped % 29.23/4.58 Prover 13: Constructing countermodel ... % 29.41/4.60 Prover 13: stopped % 30.95/5.06 Prover 11: Constructing countermodel ... % 31.35/5.08 Prover 11: stopped % 31.35/5.08 % 31.35/5.08 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 31.35/5.08 % 31.35/5.09 % SZS output start Proof for theBenchmark % 31.35/5.09 Assumptions after simplification: % 31.35/5.09 --------------------------------- % 31.35/5.09 % 31.35/5.09 (ax83) % 31.55/5.13 $i(nil) & ! [v0: $i] : ! [v1: $i] : (v1 = nil | ~ (app(v0, v1) = nil) | ~ % 31.55/5.13 $i(v1) | ~ $i(v0) | ~ ssList(v1) | ~ ssList(v0)) & ! [v0: $i] : ! [v1: % 31.55/5.13 $i] : (v0 = nil | ~ (app(v0, v1) = nil) | ~ $i(v1) | ~ $i(v0) | ~ % 31.55/5.13 ssList(v1) | ~ ssList(v0)) & ! [v0: $i] : (v0 = nil | ~ (app(nil, nil) = % 31.55/5.13 v0) | ~ ssList(nil)) % 31.55/5.13 % 31.55/5.13 (co1) % 31.55/5.13 $i(nil) & ? [v0: $i] : ? [v1: $i] : ( ~ (v0 = nil) & app(v0, v1) = nil & % 31.55/5.13 $i(v1) & $i(v0) & equalelemsP(v0) & ssList(v1) & ssList(v0) & ssList(nil) & % 31.55/5.13 ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ( ~ (cons(v2, nil) = % 31.55/5.13 v3) | ~ (app(v5, v3) = v0) | ~ (app(v3, v4) = v1) | ~ $i(v5) | ~ % 31.55/5.13 $i(v4) | ~ $i(v2) | ~ ssList(v5) | ~ ssList(v4) | ~ ssItem(v2))) % 31.55/5.13 % 31.55/5.13 Further assumptions not needed in the proof: % 31.55/5.13 -------------------------------------------- % 31.55/5.13 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 31.55/5.13 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 31.55/5.13 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 31.55/5.13 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, % 31.55/5.13 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax68, % 31.55/5.13 ax69, ax7, ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, % 31.55/5.13 ax80, ax81, ax82, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, % 31.55/5.13 ax93, ax94, ax95 % 31.55/5.13 % 31.55/5.13 Those formulas are unsatisfiable: % 31.55/5.13 --------------------------------- % 31.55/5.13 % 31.55/5.13 Begin of proof % 31.55/5.13 | % 31.55/5.14 | ALPHA: (ax83) implies: % 31.55/5.14 | (1) ! [v0: $i] : ! [v1: $i] : (v0 = nil | ~ (app(v0, v1) = nil) | ~ % 31.55/5.14 | $i(v1) | ~ $i(v0) | ~ ssList(v1) | ~ ssList(v0)) % 31.55/5.14 | % 31.55/5.14 | ALPHA: (co1) implies: % 31.55/5.14 | (2) ? [v0: $i] : ? [v1: $i] : ( ~ (v0 = nil) & app(v0, v1) = nil & $i(v1) % 31.55/5.14 | & $i(v0) & equalelemsP(v0) & ssList(v1) & ssList(v0) & ssList(nil) & % 31.55/5.14 | ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ( ~ (cons(v2, % 31.55/5.14 | nil) = v3) | ~ (app(v5, v3) = v0) | ~ (app(v3, v4) = v1) | ~ % 31.55/5.14 | $i(v5) | ~ $i(v4) | ~ $i(v2) | ~ ssList(v5) | ~ ssList(v4) | ~ % 31.55/5.14 | ssItem(v2))) % 31.55/5.14 | % 31.55/5.14 | DELTA: instantiating (2) with fresh symbols all_91_0, all_91_1 gives: % 31.55/5.15 | (3) ~ (all_91_1 = nil) & app(all_91_1, all_91_0) = nil & $i(all_91_0) & % 31.55/5.15 | $i(all_91_1) & equalelemsP(all_91_1) & ssList(all_91_0) & % 31.55/5.15 | ssList(all_91_1) & ssList(nil) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 31.55/5.15 | $i] : ! [v3: $i] : ( ~ (cons(v0, nil) = v1) | ~ (app(v3, v1) = % 31.55/5.15 | all_91_1) | ~ (app(v1, v2) = all_91_0) | ~ $i(v3) | ~ $i(v2) | % 31.55/5.15 | ~ $i(v0) | ~ ssList(v3) | ~ ssList(v2) | ~ ssItem(v0)) % 31.55/5.15 | % 31.55/5.15 | ALPHA: (3) implies: % 31.55/5.15 | (4) ~ (all_91_1 = nil) % 31.55/5.15 | (5) ssList(all_91_1) % 31.55/5.15 | (6) ssList(all_91_0) % 31.55/5.15 | (7) $i(all_91_1) % 31.55/5.15 | (8) $i(all_91_0) % 31.55/5.15 | (9) app(all_91_1, all_91_0) = nil % 31.55/5.15 | % 31.55/5.15 | GROUND_INST: instantiating (1) with all_91_1, all_91_0, simplifying with (5), % 31.55/5.15 | (6), (7), (8), (9) gives: % 31.55/5.15 | (10) all_91_1 = nil % 31.55/5.15 | % 31.55/5.15 | REDUCE: (4), (10) imply: % 31.55/5.15 | (11) $false % 31.55/5.15 | % 31.55/5.15 | CLOSE: (11) is inconsistent. % 31.55/5.15 | % 31.55/5.15 End of proof % 31.55/5.15 % SZS output end Proof for theBenchmark % 31.55/5.15 % 31.55/5.15 4567ms %------------------------------------------------------------------------------