%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : COM147+1 : TPTP v8.1.2. Released v6.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 : Wed Aug 30 18:44:36 EDT 2023 % Result : Theorem 12.19s 2.38s % Output : Proof 15.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : COM147+1 : TPTP v8.1.2. Released v6.4.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.33 % Computer : n018.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Tue Aug 29 13:30:18 EDT 2023 % 0.11/0.33 % CPUTime : % 0.17/0.59 ________ _____ % 0.17/0.59 ___ __ \_________(_)________________________________ % 0.17/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.17/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.17/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.17/0.59 % 0.17/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.17/0.59 (2023-06-19) % 0.17/0.59 % 0.17/0.59 (c) Philipp Rümmer, 2009-2023 % 0.17/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.17/0.59 Amanda Stjerna. % 0.17/0.59 Free software under BSD-3-Clause. % 0.17/0.59 % 0.17/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.17/0.59 % 0.17/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.17/0.60 Running up to 7 provers in parallel. % 0.17/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.17/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.17/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.17/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.17/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.17/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.17/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 4.02/1.32 Prover 1: Preprocessing ... % 4.02/1.32 Prover 4: Preprocessing ... % 4.34/1.36 Prover 5: Preprocessing ... % 4.34/1.36 Prover 6: Preprocessing ... % 4.34/1.36 Prover 2: Preprocessing ... % 4.34/1.36 Prover 0: Preprocessing ... % 4.34/1.36 Prover 3: Preprocessing ... % 11.03/2.22 Prover 1: Constructing countermodel ... % 11.03/2.23 Prover 3: Constructing countermodel ... % 11.03/2.23 Prover 6: Proving ... % 11.03/2.26 Prover 4: Constructing countermodel ... % 11.55/2.29 Prover 5: Proving ... % 11.55/2.30 Prover 0: Proving ... % 12.16/2.38 Prover 3: proved (1765ms) % 12.19/2.38 % 12.19/2.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 12.19/2.38 % 12.19/2.38 Prover 6: stopped % 12.19/2.38 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.19/2.38 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.19/2.39 Prover 0: stopped % 12.19/2.39 Prover 5: stopped % 12.19/2.40 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 12.19/2.40 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.48/2.49 Prover 1: Found proof (size 6) % 12.48/2.49 Prover 1: proved (1884ms) % 12.48/2.51 Prover 4: stopped % 12.48/2.52 Prover 2: Proving ... % 12.48/2.53 Prover 2: stopped % 13.42/2.60 Prover 8: Preprocessing ... % 13.42/2.61 Prover 10: Preprocessing ... % 13.42/2.62 Prover 7: Preprocessing ... % 13.42/2.64 Prover 11: Preprocessing ... % 14.26/2.67 Prover 10: stopped % 14.26/2.68 Prover 7: stopped % 14.26/2.70 Prover 11: stopped % 14.73/2.76 Prover 8: Warning: ignoring some quantifiers % 14.73/2.78 Prover 8: Constructing countermodel ... % 14.92/2.79 Prover 8: stopped % 14.92/2.79 % 14.92/2.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 14.92/2.79 % 14.92/2.79 % SZS output start Proof for theBenchmark % 14.92/2.80 Assumptions after simplification: % 14.92/2.80 --------------------------------- % 14.92/2.80 % 14.92/2.80 (T-Progress-T-abs) % 14.92/2.82 $i(ve1) & $i(vempty) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : % 14.92/2.82 ? [v4: int] : ? [v5: $i] : ( ~ (v4 = 0) & vreduce(v3) = v5 & vtcheck(vempty, % 14.92/2.82 v3, v0) = 0 & visValue(v3) = v4 & vabs(v1, v2, ve1) = v3 & $i(v5) & $i(v3) % 14.92/2.82 & $i(v2) & $i(v1) & $i(v0) & ! [v6: $i] : ( ~ (vsomeExp(v6) = v5) | ~ % 14.92/2.82 $i(v6))) % 14.92/2.82 % 14.92/2.82 (isValue0) % 14.92/2.82 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : (v4 = 0 % 14.92/2.82 | ~ (visValue(v3) = v4) | ~ (vabs(v0, v1, v2) = v3) | ~ $i(v3) | ~ % 14.92/2.82 $i(v2) | ~ $i(v1) | ~ $i(v0)) % 14.92/2.82 % 14.92/2.82 Further assumptions not needed in the proof: % 14.92/2.82 -------------------------------------------- % 14.92/2.82 DIFF-abs-app, DIFF-empty-bind, DIFF-noExp-someExp, DIFF-noType-someType, % 14.92/2.82 DIFF-var-abs, DIFF-var-app, EQ-abs, EQ-app, EQ-arrow, EQ-bind, EQ-empty, % 14.92/2.82 EQ-noExp, EQ-noType, EQ-someExp, EQ-someType, EQ-var, T-Context-Duplicate, % 14.92/2.82 T-Context-Swap, T-Progress-T-abs-IH, T-Strong, T-Weak, T-abs, T-app, T-inv, % 14.92/2.82 T-var, gensym-is-fresh, getSomeExp0, getSomeType0, isFreeVar0, isFreeVar1, % 14.92/2.82 isFreeVar2, isSomeExp0, isSomeExp1, isSomeType0, isSomeType1, isValue1, % 14.92/2.82 isValue2, lookup-INV, lookup0, lookup1, lookup2, reduce-INV, reduce0, reduce1, % 14.92/2.82 reduce2, reduce3, reduce4, reduce5, reduce6, subst-INV, subst0, subst1, subst2, % 14.92/2.82 subst3, subst4, subst5 % 14.92/2.82 % 14.92/2.82 Those formulas are unsatisfiable: % 14.92/2.82 --------------------------------- % 14.92/2.82 % 14.92/2.82 Begin of proof % 14.92/2.82 | % 14.92/2.82 | ALPHA: (T-Progress-T-abs) implies: % 14.92/2.83 | (1) $i(ve1) % 14.92/2.83 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : % 14.92/2.83 | ? [v5: $i] : ( ~ (v4 = 0) & vreduce(v3) = v5 & vtcheck(vempty, v3, v0) % 14.92/2.83 | = 0 & visValue(v3) = v4 & vabs(v1, v2, ve1) = v3 & $i(v5) & $i(v3) & % 14.92/2.83 | $i(v2) & $i(v1) & $i(v0) & ! [v6: $i] : ( ~ (vsomeExp(v6) = v5) | ~ % 14.92/2.83 | $i(v6))) % 14.92/2.83 | % 14.92/2.83 | DELTA: instantiating (2) with fresh symbols all_58_0, all_58_1, all_58_2, % 14.92/2.83 | all_58_3, all_58_4, all_58_5 gives: % 14.92/2.83 | (3) ~ (all_58_1 = 0) & vreduce(all_58_2) = all_58_0 & vtcheck(vempty, % 14.92/2.83 | all_58_2, all_58_5) = 0 & visValue(all_58_2) = all_58_1 & % 14.92/2.83 | vabs(all_58_4, all_58_3, ve1) = all_58_2 & $i(all_58_0) & $i(all_58_2) % 14.92/2.83 | & $i(all_58_3) & $i(all_58_4) & $i(all_58_5) & ! [v0: $i] : ( ~ % 14.92/2.83 | (vsomeExp(v0) = all_58_0) | ~ $i(v0)) % 14.92/2.83 | % 14.92/2.83 | ALPHA: (3) implies: % 14.92/2.83 | (4) ~ (all_58_1 = 0) % 14.92/2.83 | (5) $i(all_58_4) % 14.92/2.83 | (6) $i(all_58_3) % 14.92/2.83 | (7) $i(all_58_2) % 14.92/2.83 | (8) vabs(all_58_4, all_58_3, ve1) = all_58_2 % 14.92/2.83 | (9) visValue(all_58_2) = all_58_1 % 14.92/2.83 | % 15.16/2.83 | GROUND_INST: instantiating (isValue0) with all_58_4, all_58_3, ve1, all_58_2, % 15.16/2.83 | all_58_1, simplifying with (1), (5), (6), (7), (8), (9) gives: % 15.16/2.83 | (10) all_58_1 = 0 % 15.16/2.83 | % 15.16/2.83 | REDUCE: (4), (10) imply: % 15.16/2.83 | (11) $false % 15.16/2.83 | % 15.16/2.83 | CLOSE: (11) is inconsistent. % 15.16/2.83 | % 15.16/2.83 End of proof % 15.16/2.83 % SZS output end Proof for theBenchmark % 15.16/2.83 % 15.16/2.83 2244ms %------------------------------------------------------------------------------