%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : COM128+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 : n009.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:32 EDT 2023 % Result : Theorem 14.57s 2.67s % Output : Proof 18.95s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : COM128+1 : TPTP v8.1.2. Released v6.4.0. % 0.08/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n009.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Tue Aug 29 12:51:50 EDT 2023 % 0.14/0.35 % CPUTime : % 0.76/0.69 ________ _____ % 0.76/0.69 ___ __ \_________(_)________________________________ % 0.76/0.69 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.76/0.69 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.76/0.69 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.76/0.69 % 0.76/0.69 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.76/0.69 (2023-06-19) % 0.76/0.69 % 0.76/0.69 (c) Philipp Rümmer, 2009-2023 % 0.76/0.69 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.76/0.69 Amanda Stjerna. % 0.76/0.69 Free software under BSD-3-Clause. % 0.76/0.69 % 0.76/0.69 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.76/0.69 % 0.76/0.69 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.76/0.70 Running up to 7 provers in parallel. % 0.76/0.71 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.76/0.71 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.76/0.71 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.76/0.71 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.76/0.71 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.76/0.71 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.76/0.71 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.16/1.44 Prover 1: Preprocessing ... % 5.16/1.45 Prover 4: Preprocessing ... % 5.53/1.47 Prover 6: Preprocessing ... % 5.53/1.47 Prover 5: Preprocessing ... % 5.53/1.47 Prover 2: Preprocessing ... % 5.53/1.47 Prover 0: Preprocessing ... % 5.53/1.47 Prover 3: Preprocessing ... % 11.59/2.27 Prover 6: Proving ... % 11.59/2.28 Prover 3: Constructing countermodel ... % 11.59/2.28 Prover 1: Constructing countermodel ... % 11.85/2.32 Prover 4: Constructing countermodel ... % 12.20/2.34 Prover 0: Proving ... % 12.28/2.36 Prover 5: Proving ... % 12.28/2.39 Prover 3: gave up % 12.28/2.41 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.80/2.43 Prover 1: gave up % 12.80/2.44 Prover 6: gave up % 12.80/2.44 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.80/2.44 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 12.80/2.44 Prover 2: Proving ... % 12.80/2.45 Prover 4: gave up % 12.80/2.45 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 13.86/2.55 Prover 8: Preprocessing ... % 13.86/2.55 Prover 9: Preprocessing ... % 13.86/2.57 Prover 7: Preprocessing ... % 14.10/2.60 Prover 10: Preprocessing ... % 14.57/2.67 Prover 2: proved (1955ms) % 14.57/2.67 % 14.57/2.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.57/2.67 % 14.57/2.67 Prover 0: stopped % 14.57/2.67 Prover 5: stopped % 14.57/2.68 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 14.57/2.68 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 14.57/2.68 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 15.59/2.82 Prover 16: Preprocessing ... % 15.59/2.82 Prover 11: Preprocessing ... % 15.59/2.84 Prover 13: Preprocessing ... % 15.59/2.84 Prover 8: Warning: ignoring some quantifiers % 16.27/2.88 Prover 8: Constructing countermodel ... % 16.43/2.90 Prover 10: Warning: ignoring some quantifiers % 16.43/2.90 Prover 7: Warning: ignoring some quantifiers % 16.43/2.92 Prover 10: Constructing countermodel ... % 16.79/2.94 Prover 7: Constructing countermodel ... % 16.79/2.95 Prover 9: Constructing countermodel ... % 16.79/2.96 Prover 9: stopped % 16.79/2.96 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 17.42/3.02 Prover 19: Preprocessing ... % 17.42/3.04 Prover 10: Found proof (size 8) % 17.42/3.04 Prover 10: proved (593ms) % 17.42/3.05 Prover 8: stopped % 17.42/3.05 Prover 7: stopped % 17.96/3.11 Prover 16: Warning: ignoring some quantifiers % 17.96/3.13 Prover 13: Warning: ignoring some quantifiers % 17.96/3.13 Prover 16: Constructing countermodel ... % 17.96/3.14 Prover 11: Constructing countermodel ... % 17.96/3.14 Prover 16: stopped % 17.96/3.15 Prover 13: Constructing countermodel ... % 17.96/3.15 Prover 11: stopped % 17.96/3.16 Prover 13: stopped % 18.86/3.22 Prover 19: Warning: ignoring some quantifiers % 18.86/3.23 Prover 19: Constructing countermodel ... % 18.95/3.24 Prover 19: stopped % 18.95/3.24 % 18.95/3.24 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 18.95/3.24 % 18.95/3.24 % SZS output start Proof for theBenchmark % 18.95/3.25 Assumptions after simplification: % 18.95/3.25 --------------------------------- % 18.95/3.25 % 18.95/3.25 (fresh-unequal-var-3) % 18.95/3.27 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 18.95/3.27 $i] : (vgensym(v5) = v2 & vapp(v3, v4) = v5 & vapp(v0, v1) = v3 & vvar(v2) = % 18.95/3.27 v4 & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 18.95/3.27 % 18.95/3.27 (gensym-is-fresh) % 18.95/3.27 ! [v0: $i] : ! [v1: $i] : ( ~ (vgensym(v1) = v0) | ~ $i(v1) | ~ $i(v0) | % 18.95/3.27 ~ visFreeVar(v0, v1)) % 18.95/3.27 % 18.95/3.27 (isFreeVar0) % 18.95/3.27 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (vvar(v2) = v1) | ~ % 18.95/3.27 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ visFreeVar(v0, v1)) & ! [v0: $i] : ! % 18.95/3.27 [v1: $i] : ( ~ (vvar(v0) = v1) | ~ $i(v1) | ~ $i(v0) | visFreeVar(v0, v1)) % 18.95/3.27 % 18.95/3.27 (isFreeVar2) % 18.95/3.28 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (vapp(v2, v3) = % 18.95/3.28 v1) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ visFreeVar(v0, % 18.95/3.28 v3) | visFreeVar(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 18.95/3.28 [v3: $i] : ( ~ (vapp(v2, v3) = v1) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 18.95/3.28 $i(v0) | ~ visFreeVar(v0, v2) | visFreeVar(v0, v1)) & ! [v0: $i] : ! [v1: % 18.95/3.28 $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (vapp(v2, v3) = v1) | ~ $i(v3) | ~ % 18.95/3.28 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ visFreeVar(v0, v1) | visFreeVar(v0, v3) % 18.95/3.28 | visFreeVar(v0, v2)) % 18.95/3.28 % 18.95/3.28 Further assumptions not needed in the proof: % 18.95/3.28 -------------------------------------------- % 18.95/3.28 DIFF-abs-app, DIFF-empty-bind, DIFF-noExp-someExp, DIFF-noType-someType, % 18.95/3.28 DIFF-var-abs, DIFF-var-app, EQ-abs, EQ-app, EQ-arrow, EQ-bind, EQ-empty, % 18.95/3.28 EQ-noExp, EQ-noType, EQ-someExp, EQ-someType, EQ-var, T-Context-Duplicate, % 18.95/3.28 T-Context-Swap, T-Strong, T-Weak, T-Weak-FreeVar, T-abs, T-app, T-inv, % 18.95/3.28 T-subst-abs-2-gen, T-var, alpha-equiv-FreeVar, alpha-equiv-refl, % 18.95/3.28 alpha-equiv-subst-abs, alpha-equiv-sym, alpha-equiv-trans, alpha-equiv-typing, % 18.95/3.28 getSomeExp0, getSomeType0, isFreeVar1, isSomeExp0, isSomeExp1, isSomeType0, % 18.95/3.28 isSomeType1, isValue0, isValue1, isValue2, lookup-INV, lookup0, lookup1, % 18.95/3.28 lookup2, reduce-INV, reduce0, reduce1, reduce2, reduce3, reduce4, reduce5, % 18.95/3.28 reduce6, subst-INV, subst0, subst1, subst2, subst3, subst4, subst5 % 18.95/3.28 % 18.95/3.28 Those formulas are unsatisfiable: % 18.95/3.28 --------------------------------- % 18.95/3.28 % 18.95/3.28 Begin of proof % 18.95/3.28 | % 18.95/3.28 | ALPHA: (isFreeVar0) implies: % 18.95/3.28 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (vvar(v0) = v1) | ~ $i(v1) | ~ $i(v0) % 18.95/3.28 | | visFreeVar(v0, v1)) % 18.95/3.28 | % 18.95/3.28 | ALPHA: (isFreeVar2) implies: % 18.95/3.28 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (vapp(v2, % 18.95/3.28 | v3) = v1) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 18.95/3.28 | visFreeVar(v0, v3) | visFreeVar(v0, v1)) % 18.95/3.28 | % 18.95/3.28 | DELTA: instantiating (fresh-unequal-var-3) with fresh symbols all_59_0, % 18.95/3.28 | all_59_1, all_59_2, all_59_3, all_59_4, all_59_5 gives: % 18.95/3.28 | (3) vgensym(all_59_0) = all_59_3 & vapp(all_59_2, all_59_1) = all_59_0 & % 18.95/3.28 | vapp(all_59_5, all_59_4) = all_59_2 & vvar(all_59_3) = all_59_1 & % 18.95/3.28 | $i(all_59_0) & $i(all_59_1) & $i(all_59_2) & $i(all_59_3) & % 18.95/3.28 | $i(all_59_4) & $i(all_59_5) % 18.95/3.28 | % 18.95/3.28 | ALPHA: (3) implies: % 18.95/3.28 | (4) $i(all_59_3) % 18.95/3.28 | (5) $i(all_59_2) % 18.95/3.28 | (6) $i(all_59_1) % 18.95/3.28 | (7) $i(all_59_0) % 18.95/3.28 | (8) vvar(all_59_3) = all_59_1 % 18.95/3.28 | (9) vapp(all_59_2, all_59_1) = all_59_0 % 18.95/3.28 | (10) vgensym(all_59_0) = all_59_3 % 18.95/3.28 | % 18.95/3.28 | GROUND_INST: instantiating (1) with all_59_3, all_59_1, simplifying with (4), % 18.95/3.28 | (6), (8) gives: % 18.95/3.29 | (11) visFreeVar(all_59_3, all_59_1) % 18.95/3.29 | % 18.95/3.29 | GROUND_INST: instantiating (2) with all_59_3, all_59_0, all_59_2, all_59_1, % 18.95/3.29 | simplifying with (4), (5), (6), (7), (9), (11) gives: % 18.95/3.29 | (12) visFreeVar(all_59_3, all_59_0) % 18.95/3.29 | % 18.95/3.29 | GROUND_INST: instantiating (gensym-is-fresh) with all_59_3, all_59_0, % 18.95/3.29 | simplifying with (4), (7), (10), (12) gives: % 18.95/3.29 | (13) $false % 18.95/3.29 | % 18.95/3.29 | CLOSE: (13) is inconsistent. % 18.95/3.29 | % 18.95/3.29 End of proof % 18.95/3.29 % SZS output end Proof for theBenchmark % 18.95/3.29 % 18.95/3.29 2596ms %------------------------------------------------------------------------------