%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWC288+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:39 EDT 2023 % Result : Theorem 20.50s 3.43s % Output : Proof 40.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWC288+1 : TPTP v8.1.2. Released v2.4.0. % 0.03/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:11:59 EDT 2023 % 0.13/0.35 % CPUTime : % 0.56/0.61 ________ _____ % 0.56/0.61 ___ __ \_________(_)________________________________ % 0.56/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.56/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.56/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.56/0.61 % 0.56/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.56/0.61 (2023-06-19) % 0.56/0.61 % 0.56/0.61 (c) Philipp Rümmer, 2009-2023 % 0.56/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.56/0.61 Amanda Stjerna. % 0.56/0.61 Free software under BSD-3-Clause. % 0.56/0.61 % 0.56/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.56/0.61 % 0.56/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.56/0.62 Running up to 7 provers in parallel. % 0.56/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.56/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.56/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.56/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.56/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.56/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.56/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.94/1.50 Prover 1: Preprocessing ... % 5.94/1.51 Prover 4: Preprocessing ... % 6.27/1.55 Prover 2: Preprocessing ... % 6.27/1.55 Prover 0: Preprocessing ... % 6.27/1.55 Prover 5: Preprocessing ... % 6.27/1.55 Prover 3: Preprocessing ... % 6.27/1.55 Prover 6: Preprocessing ... % 14.80/2.71 Prover 2: Proving ... % 15.28/2.82 Prover 1: Constructing countermodel ... % 15.28/2.82 Prover 5: Constructing countermodel ... % 15.93/2.88 Prover 6: Proving ... % 16.34/2.90 Prover 3: Constructing countermodel ... % 19.92/3.41 Prover 4: Constructing countermodel ... % 20.50/3.43 Prover 6: proved (2799ms) % 20.50/3.43 % 20.50/3.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 20.50/3.43 % 20.50/3.43 Prover 5: stopped % 20.50/3.43 Prover 3: stopped % 20.50/3.45 Prover 2: stopped % 20.84/3.48 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 20.84/3.48 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 20.84/3.48 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 20.84/3.48 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 21.96/3.62 Prover 0: Proving ... % 21.96/3.63 Prover 0: stopped % 21.96/3.65 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 23.16/3.83 Prover 10: Preprocessing ... % 23.16/3.84 Prover 7: Preprocessing ... % 23.16/3.84 Prover 8: Preprocessing ... % 23.76/3.87 Prover 11: Preprocessing ... % 24.52/3.97 Prover 13: Preprocessing ... % 25.37/4.11 Prover 7: Constructing countermodel ... % 25.37/4.12 Prover 10: Constructing countermodel ... % 26.65/4.24 Prover 13: Constructing countermodel ... % 27.74/4.42 Prover 8: Warning: ignoring some quantifiers % 28.39/4.47 Prover 8: Constructing countermodel ... % 33.62/5.12 Prover 11: Constructing countermodel ... % 39.63/5.94 Prover 7: Found proof (size 14) % 39.63/5.95 Prover 7: proved (2511ms) % 39.63/5.95 Prover 11: stopped % 39.63/5.95 Prover 1: stopped % 39.63/5.95 Prover 8: stopped % 39.63/5.95 Prover 10: stopped % 39.63/5.95 Prover 4: stopped % 39.63/5.95 Prover 13: stopped % 39.63/5.95 % 39.63/5.95 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 39.63/5.95 % 39.63/5.95 % SZS output start Proof for theBenchmark % 40.24/5.96 Assumptions after simplification: % 40.24/5.96 --------------------------------- % 40.24/5.96 % 40.24/5.96 (ax68) % 40.33/5.98 $i(nil) & ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v0, nil) = v1) | ~ $i(v0) | % 40.33/5.98 ~ ssItem(v0) | strictorderedP(v1)) % 40.33/5.98 % 40.33/5.98 (ax69) % 40.33/5.98 $i(nil) & strictorderedP(nil) % 40.33/5.98 % 40.33/5.98 (co1) % 40.33/5.99 $i(nil) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] % 40.33/5.99 : ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ($i(v6) & $i(v4) & $i(v2) & $i(v1) % 40.33/5.99 & $i(v0) & ssList(v1) & ssList(v0) & ~ strictorderedP(v0) & ((v7 = v1 & v3 % 40.33/5.99 = v0 & cons(v2, nil) = v0 & app(v5, v6) = v1 & app(v4, v0) = v5 & $i(v5) % 40.33/5.99 & ssList(v6) & ssList(v4) & ssItem(v2) & ! [v8: $i] : ( ~ $i(v8) | ~ % 40.33/5.99 lt(v8, v2) | ~ memberP(v6, v8) | ~ ssItem(v8)) & ! [v8: $i] : ( ~ % 40.33/5.99 $i(v8) | ~ lt(v2, v8) | ~ memberP(v4, v8) | ~ ssItem(v8))) | (v1 = % 40.33/5.99 nil & v0 = nil))) % 40.33/5.99 % 40.33/5.99 Further assumptions not needed in the proof: % 40.33/5.99 -------------------------------------------- % 40.33/5.99 ax1, ax10, ax11, ax12, ax13, ax14, ax15, ax16, ax17, ax18, ax19, ax2, ax20, % 40.33/5.99 ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax3, ax30, ax31, ax32, % 40.33/5.99 ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax4, ax40, ax41, ax42, ax43, ax44, % 40.33/5.99 ax45, ax46, ax47, ax48, ax49, ax5, ax50, ax51, ax52, ax53, ax54, ax55, ax56, % 40.33/5.99 ax57, ax58, ax59, ax6, ax60, ax61, ax62, ax63, ax64, ax65, ax66, ax67, ax7, % 40.33/5.99 ax70, ax71, ax72, ax73, ax74, ax75, ax76, ax77, ax78, ax79, ax8, ax80, ax81, % 40.33/5.99 ax82, ax83, ax84, ax85, ax86, ax87, ax88, ax89, ax9, ax90, ax91, ax92, ax93, % 40.33/5.99 ax94, ax95 % 40.33/5.99 % 40.33/5.99 Those formulas are unsatisfiable: % 40.33/5.99 --------------------------------- % 40.33/5.99 % 40.33/5.99 Begin of proof % 40.33/5.99 | % 40.33/5.99 | ALPHA: (ax68) implies: % 40.33/5.99 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (cons(v0, nil) = v1) | ~ $i(v0) | ~ % 40.33/5.99 | ssItem(v0) | strictorderedP(v1)) % 40.33/5.99 | % 40.33/5.99 | ALPHA: (ax69) implies: % 40.33/5.99 | (2) strictorderedP(nil) % 40.33/5.99 | % 40.33/5.99 | ALPHA: (co1) implies: % 40.33/5.99 | (3) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 40.33/5.99 | ? [v5: $i] : ? [v6: $i] : ? [v7: $i] : ($i(v6) & $i(v4) & $i(v2) & % 40.33/5.99 | $i(v1) & $i(v0) & ssList(v1) & ssList(v0) & ~ strictorderedP(v0) & % 40.33/5.99 | ((v7 = v1 & v3 = v0 & cons(v2, nil) = v0 & app(v5, v6) = v1 & app(v4, % 40.33/5.99 | v0) = v5 & $i(v5) & ssList(v6) & ssList(v4) & ssItem(v2) & ! % 40.33/5.99 | [v8: $i] : ( ~ $i(v8) | ~ lt(v8, v2) | ~ memberP(v6, v8) | ~ % 40.33/5.99 | ssItem(v8)) & ! [v8: $i] : ( ~ $i(v8) | ~ lt(v2, v8) | ~ % 40.33/5.99 | memberP(v4, v8) | ~ ssItem(v8))) | (v1 = nil & v0 = nil))) % 40.33/5.99 | % 40.33/6.00 | DELTA: instantiating (3) with fresh symbols all_91_0, all_91_1, all_91_2, % 40.33/6.00 | all_91_3, all_91_4, all_91_5, all_91_6, all_91_7 gives: % 40.33/6.00 | (4) $i(all_91_1) & $i(all_91_3) & $i(all_91_5) & $i(all_91_6) & % 40.33/6.00 | $i(all_91_7) & ssList(all_91_6) & ssList(all_91_7) & ~ % 40.33/6.00 | strictorderedP(all_91_7) & ((all_91_0 = all_91_6 & all_91_4 = all_91_7 % 40.33/6.00 | & cons(all_91_5, nil) = all_91_7 & app(all_91_2, all_91_1) = % 40.33/6.00 | all_91_6 & app(all_91_3, all_91_7) = all_91_2 & $i(all_91_2) & % 40.33/6.00 | ssList(all_91_1) & ssList(all_91_3) & ssItem(all_91_5) & ! [v0: % 40.33/6.00 | $i] : ( ~ $i(v0) | ~ lt(v0, all_91_5) | ~ memberP(all_91_1, v0) % 40.33/6.00 | | ~ ssItem(v0)) & ! [v0: $i] : ( ~ $i(v0) | ~ lt(all_91_5, v0) % 40.33/6.00 | | ~ memberP(all_91_3, v0) | ~ ssItem(v0))) | (all_91_6 = nil & % 40.33/6.00 | all_91_7 = nil)) % 40.33/6.00 | % 40.33/6.00 | ALPHA: (4) implies: % 40.33/6.00 | (5) ~ strictorderedP(all_91_7) % 40.33/6.00 | (6) $i(all_91_5) % 40.33/6.00 | (7) (all_91_0 = all_91_6 & all_91_4 = all_91_7 & cons(all_91_5, nil) = % 40.33/6.00 | all_91_7 & app(all_91_2, all_91_1) = all_91_6 & app(all_91_3, % 40.33/6.00 | all_91_7) = all_91_2 & $i(all_91_2) & ssList(all_91_1) & % 40.33/6.00 | ssList(all_91_3) & ssItem(all_91_5) & ! [v0: $i] : ( ~ $i(v0) | ~ % 40.33/6.00 | lt(v0, all_91_5) | ~ memberP(all_91_1, v0) | ~ ssItem(v0)) & ! % 40.33/6.00 | [v0: $i] : ( ~ $i(v0) | ~ lt(all_91_5, v0) | ~ memberP(all_91_3, % 40.33/6.00 | v0) | ~ ssItem(v0))) | (all_91_6 = nil & all_91_7 = nil) % 40.33/6.00 | % 40.33/6.00 | PRED_UNIFY: (2), (5) imply: % 40.33/6.00 | (8) ~ (all_91_7 = nil) % 40.33/6.00 | % 40.33/6.00 | BETA: splitting (7) gives: % 40.33/6.00 | % 40.33/6.00 | Case 1: % 40.33/6.00 | | % 40.33/6.00 | | (9) all_91_0 = all_91_6 & all_91_4 = all_91_7 & cons(all_91_5, nil) = % 40.33/6.00 | | all_91_7 & app(all_91_2, all_91_1) = all_91_6 & app(all_91_3, % 40.33/6.00 | | all_91_7) = all_91_2 & $i(all_91_2) & ssList(all_91_1) & % 40.33/6.00 | | ssList(all_91_3) & ssItem(all_91_5) & ! [v0: $i] : ( ~ $i(v0) | ~ % 40.33/6.00 | | lt(v0, all_91_5) | ~ memberP(all_91_1, v0) | ~ ssItem(v0)) & ! % 40.33/6.00 | | [v0: $i] : ( ~ $i(v0) | ~ lt(all_91_5, v0) | ~ memberP(all_91_3, % 40.33/6.00 | | v0) | ~ ssItem(v0)) % 40.33/6.00 | | % 40.33/6.00 | | ALPHA: (9) implies: % 40.33/6.00 | | (10) ssItem(all_91_5) % 40.33/6.00 | | (11) cons(all_91_5, nil) = all_91_7 % 40.33/6.00 | | % 40.33/6.00 | | GROUND_INST: instantiating (1) with all_91_5, all_91_7, simplifying with % 40.33/6.00 | | (5), (6), (10), (11) gives: % 40.33/6.00 | | (12) $false % 40.33/6.00 | | % 40.33/6.00 | | CLOSE: (12) is inconsistent. % 40.33/6.00 | | % 40.33/6.00 | Case 2: % 40.33/6.00 | | % 40.33/6.00 | | (13) all_91_6 = nil & all_91_7 = nil % 40.33/6.00 | | % 40.33/6.00 | | ALPHA: (13) implies: % 40.33/6.00 | | (14) all_91_7 = nil % 40.33/6.00 | | % 40.33/6.00 | | REDUCE: (8), (14) imply: % 40.33/6.00 | | (15) $false % 40.33/6.00 | | % 40.33/6.00 | | CLOSE: (15) is inconsistent. % 40.33/6.00 | | % 40.33/6.00 | End of split % 40.33/6.00 | % 40.33/6.00 End of proof % 40.33/6.00 % SZS output end Proof for theBenchmark % 40.33/6.01 % 40.33/6.01 5398ms %------------------------------------------------------------------------------