%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : COM146+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 : n019.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 13.55s 2.59s % Output : Proof 16.66s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : COM146+1 : TPTP v8.1.2. Released v6.4.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.18/0.36 % Computer : n019.cluster.edu % 0.18/0.36 % Model : x86_64 x86_64 % 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.36 % Memory : 8042.1875MB % 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.36 % CPULimit : 300 % 0.18/0.36 % WCLimit : 300 % 0.18/0.36 % DateTime : Tue Aug 29 13:14:43 EDT 2023 % 0.18/0.36 % CPUTime : % 0.21/0.63 ________ _____ % 0.21/0.63 ___ __ \_________(_)________________________________ % 0.21/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.63 % 0.21/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.63 (2023-06-19) % 0.21/0.63 % 0.21/0.63 (c) Philipp Rümmer, 2009-2023 % 0.21/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.63 Amanda Stjerna. % 0.21/0.63 Free software under BSD-3-Clause. % 0.21/0.63 % 0.21/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.63 % 0.21/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.65 Running up to 7 provers in parallel. % 0.21/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.21/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 4.59/1.41 Prover 4: Preprocessing ... % 4.59/1.43 Prover 1: Preprocessing ... % 4.59/1.48 Prover 2: Preprocessing ... % 4.59/1.48 Prover 5: Preprocessing ... % 4.59/1.48 Prover 6: Preprocessing ... % 4.59/1.48 Prover 3: Preprocessing ... % 4.59/1.49 Prover 0: Preprocessing ... % 12.09/2.39 Prover 3: Constructing countermodel ... % 12.09/2.40 Prover 1: Constructing countermodel ... % 12.09/2.40 Prover 6: Proving ... % 12.26/2.41 Prover 4: Constructing countermodel ... % 12.35/2.46 Prover 0: Proving ... % 12.35/2.48 Prover 5: Proving ... % 13.00/2.55 Prover 2: Proving ... % 13.00/2.58 Prover 3: proved (1917ms) % 13.00/2.58 % 13.55/2.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 13.55/2.59 % 13.55/2.59 Prover 0: stopped % 13.55/2.59 Prover 6: stopped % 13.55/2.60 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 13.55/2.60 Prover 2: stopped % 13.55/2.61 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 13.55/2.61 Prover 1: Found proof (size 8) % 13.55/2.61 Prover 1: proved (1950ms) % 13.55/2.61 Prover 5: proved (1943ms) % 13.55/2.61 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 13.55/2.61 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 13.55/2.62 Prover 4: stopped % 14.50/2.80 Prover 8: Preprocessing ... % 14.50/2.81 Prover 7: Preprocessing ... % 14.50/2.81 Prover 11: Preprocessing ... % 14.50/2.81 Prover 10: Preprocessing ... % 14.50/2.90 Prover 10: stopped % 14.50/2.90 Prover 7: stopped % 14.50/2.90 Prover 11: stopped % 16.28/3.02 Prover 8: Warning: ignoring some quantifiers % 16.28/3.03 Prover 8: Constructing countermodel ... % 16.28/3.04 Prover 8: stopped % 16.28/3.04 % 16.28/3.04 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 16.28/3.04 % 16.28/3.04 % SZS output start Proof for theBenchmark % 16.28/3.05 Assumptions after simplification: % 16.28/3.05 --------------------------------- % 16.28/3.05 % 16.28/3.05 (DIFF-noExp-someExp) % 16.28/3.08 $i(vnoExp) & ! [v0: $i] : ( ~ (vsomeExp(v0) = vnoExp) | ~ $i(v0)) % 16.28/3.08 % 16.28/3.08 (T-Preservation-T-var) % 16.28/3.08 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 16.28/3.08 $i] : ? [v6: int] : ( ~ (v6 = 0) & vreduce(v4) = v5 & vsomeExp(v2) = v5 & % 16.28/3.08 vtcheck(v1, v4, v3) = 0 & vtcheck(v1, v2, v3) = v6 & vvar(v0) = v4 & $i(v5) % 16.28/3.08 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 16.28/3.08 % 16.28/3.08 (reduce0) % 16.28/3.09 $i(vnoExp) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = vnoExp | ~ % 16.28/3.09 (vreduce(v1) = v2) | ~ (vvar(v0) = v1) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)) % 16.28/3.09 % 16.28/3.09 Further assumptions not needed in the proof: % 16.28/3.09 -------------------------------------------- % 16.28/3.09 DIFF-abs-app, DIFF-empty-bind, DIFF-noType-someType, DIFF-var-abs, DIFF-var-app, % 16.28/3.09 EQ-abs, EQ-app, EQ-arrow, EQ-bind, EQ-empty, EQ-noExp, EQ-noType, EQ-someExp, % 16.28/3.09 EQ-someType, EQ-var, T-Context-Duplicate, T-Context-Swap, T-Strong, T-Weak, % 16.28/3.09 T-Weak-FreeVar, T-abs, T-app, T-inv, T-subst, T-var, gensym-is-fresh, % 16.66/3.09 getSomeExp0, getSomeType0, isFreeVar0, isFreeVar1, isFreeVar2, isSomeExp0, % 16.66/3.09 isSomeExp1, isSomeType0, isSomeType1, isValue0, isValue1, isValue2, lookup-INV, % 16.66/3.09 lookup0, lookup1, lookup2, reduce-INV, reduce1, reduce2, reduce3, reduce4, % 16.66/3.09 reduce5, reduce6, subst-INV, subst0, subst1, subst2, subst3, subst4, subst5 % 16.66/3.09 % 16.66/3.09 Those formulas are unsatisfiable: % 16.66/3.09 --------------------------------- % 16.66/3.09 % 16.66/3.09 Begin of proof % 16.66/3.09 | % 16.66/3.09 | ALPHA: (DIFF-noExp-someExp) implies: % 16.66/3.09 | (1) ! [v0: $i] : ( ~ (vsomeExp(v0) = vnoExp) | ~ $i(v0)) % 16.66/3.09 | % 16.66/3.09 | ALPHA: (reduce0) implies: % 16.66/3.09 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = vnoExp | ~ % 16.66/3.09 | (vreduce(v1) = v2) | ~ (vvar(v0) = v1) | ~ $i(v2) | ~ $i(v1) | ~ % 16.66/3.09 | $i(v0)) % 16.66/3.09 | % 16.66/3.10 | DELTA: instantiating (T-Preservation-T-var) with fresh symbols all_57_0, % 16.66/3.10 | all_57_1, all_57_2, all_57_3, all_57_4, all_57_5, all_57_6 gives: % 16.66/3.10 | (3) ~ (all_57_0 = 0) & vreduce(all_57_2) = all_57_1 & vsomeExp(all_57_4) = % 16.66/3.10 | all_57_1 & vtcheck(all_57_5, all_57_2, all_57_3) = 0 & % 16.66/3.10 | vtcheck(all_57_5, all_57_4, all_57_3) = all_57_0 & vvar(all_57_6) = % 16.66/3.10 | all_57_2 & $i(all_57_1) & $i(all_57_2) & $i(all_57_3) & $i(all_57_4) & % 16.66/3.10 | $i(all_57_5) & $i(all_57_6) % 16.66/3.10 | % 16.66/3.10 | ALPHA: (3) implies: % 16.66/3.10 | (4) $i(all_57_6) % 16.66/3.10 | (5) $i(all_57_4) % 16.66/3.10 | (6) $i(all_57_2) % 16.66/3.10 | (7) $i(all_57_1) % 16.66/3.10 | (8) vvar(all_57_6) = all_57_2 % 16.66/3.10 | (9) vsomeExp(all_57_4) = all_57_1 % 16.66/3.10 | (10) vreduce(all_57_2) = all_57_1 % 16.66/3.10 | % 16.66/3.10 | GROUND_INST: instantiating (2) with all_57_6, all_57_2, all_57_1, simplifying % 16.66/3.10 | with (4), (6), (7), (8), (10) gives: % 16.66/3.10 | (11) all_57_1 = vnoExp % 16.66/3.10 | % 16.66/3.10 | REDUCE: (9), (11) imply: % 16.66/3.10 | (12) vsomeExp(all_57_4) = vnoExp % 16.66/3.10 | % 16.66/3.10 | GROUND_INST: instantiating (1) with all_57_4, simplifying with (5), (12) % 16.66/3.10 | gives: % 16.66/3.10 | (13) $false % 16.66/3.10 | % 16.66/3.10 | CLOSE: (13) is inconsistent. % 16.66/3.10 | % 16.66/3.10 End of proof % 16.66/3.11 % SZS output end Proof for theBenchmark % 16.66/3.11 % 16.66/3.11 2469ms %------------------------------------------------------------------------------