TSTP Solution File: COM144+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : COM144+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 : n014.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.27s 2.52s
% Output : Proof 17.02s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM144+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.13/0.34 % Computer : n014.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 13:17:30 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.61 ________ _____
% 0.20/0.61 ___ __ \_________(_)________________________________
% 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61
% 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61 (2023-06-19)
% 0.20/0.61
% 0.20/0.61 (c) Philipp Rümmer, 2009-2023
% 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61 Amanda Stjerna.
% 0.20/0.61 Free software under BSD-3-Clause.
% 0.20/0.61
% 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61
% 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.11/1.37 Prover 1: Preprocessing ...
% 4.11/1.38 Prover 4: Preprocessing ...
% 5.21/1.42 Prover 6: Preprocessing ...
% 5.21/1.42 Prover 3: Preprocessing ...
% 5.21/1.42 Prover 5: Preprocessing ...
% 5.21/1.42 Prover 0: Preprocessing ...
% 5.21/1.42 Prover 2: Preprocessing ...
% 11.74/2.30 Prover 1: Constructing countermodel ...
% 12.05/2.33 Prover 3: Constructing countermodel ...
% 12.05/2.33 Prover 6: Proving ...
% 12.22/2.35 Prover 4: Constructing countermodel ...
% 12.22/2.40 Prover 5: Proving ...
% 12.22/2.41 Prover 0: Proving ...
% 13.27/2.52 Prover 5: proved (1870ms)
% 13.27/2.52 Prover 6: proved (1868ms)
% 13.27/2.52
% 13.27/2.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.27/2.52
% 13.27/2.52
% 13.27/2.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.27/2.52
% 13.27/2.53 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 13.27/2.53 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 13.27/2.55 Prover 3: stopped
% 13.27/2.55 Prover 0: stopped
% 13.27/2.55 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 13.27/2.55 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 13.84/2.56 Prover 2: Proving ...
% 13.84/2.56 Prover 2: stopped
% 13.84/2.56 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 13.84/2.58 Prover 1: Found proof (size 9)
% 13.84/2.58 Prover 1: proved (1940ms)
% 13.84/2.58 Prover 4: stopped
% 14.15/2.73 Prover 10: Preprocessing ...
% 14.15/2.74 Prover 7: Preprocessing ...
% 14.15/2.74 Prover 8: Preprocessing ...
% 14.15/2.75 Prover 13: Preprocessing ...
% 15.44/2.79 Prover 11: Preprocessing ...
% 15.44/2.81 Prover 10: stopped
% 15.74/2.83 Prover 7: stopped
% 15.87/2.87 Prover 11: stopped
% 15.87/2.89 Prover 13: stopped
% 16.63/2.99 Prover 8: Warning: ignoring some quantifiers
% 16.63/3.00 Prover 8: Constructing countermodel ...
% 16.63/3.01 Prover 8: stopped
% 16.63/3.01
% 16.63/3.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.63/3.01
% 16.63/3.02 % SZS output start Proof for theBenchmark
% 16.63/3.02 Assumptions after simplification:
% 16.63/3.02 ---------------------------------
% 16.63/3.02
% 16.63/3.02 (DIFF-noExp-someExp)
% 16.63/3.04 $i(vnoExp) & ! [v0: $i] : ( ~ (vsomeExp(v0) = vnoExp) | ~ $i(v0))
% 16.63/3.04
% 16.63/3.04 (T-Preservation-T-abs)
% 16.63/3.05 $i(ve1) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i]
% 16.63/3.05 : ? [v5: $i] : ? [v6: $i] : ? [v7: int] : ( ~ (v7 = 0) & vreduce(v5) = v6 &
% 16.63/3.05 vsomeExp(v3) = v6 & vtcheck(v2, v5, v4) = 0 & vtcheck(v2, v3, v4) = v7 &
% 16.63/3.05 vabs(v0, v1, ve1) = v5 & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1)
% 16.63/3.05 & $i(v0))
% 16.63/3.05
% 16.63/3.05 (reduce1)
% 16.63/3.05 $i(vnoExp) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4:
% 16.63/3.05 $i] : (v4 = vnoExp | ~ (vreduce(v3) = v4) | ~ (vabs(v0, v1, v2) = v3) | ~
% 16.63/3.05 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0))
% 16.63/3.05
% 16.63/3.05 Further assumptions not needed in the proof:
% 16.63/3.05 --------------------------------------------
% 16.63/3.05 DIFF-abs-app, DIFF-empty-bind, DIFF-noType-someType, DIFF-var-abs, DIFF-var-app,
% 16.63/3.05 EQ-abs, EQ-app, EQ-arrow, EQ-bind, EQ-empty, EQ-noExp, EQ-noType, EQ-someExp,
% 16.63/3.05 EQ-someType, EQ-var, T-Context-Duplicate, T-Context-Swap,
% 16.63/3.05 T-Preservation-T-abs-IH, T-Strong, T-Weak, T-Weak-FreeVar, T-abs, T-app, T-inv,
% 16.63/3.05 T-subst, T-var, gensym-is-fresh, getSomeExp0, getSomeType0, isFreeVar0,
% 16.63/3.05 isFreeVar1, isFreeVar2, isSomeExp0, isSomeExp1, isSomeType0, isSomeType1,
% 16.63/3.05 isValue0, isValue1, isValue2, lookup-INV, lookup0, lookup1, lookup2, reduce-INV,
% 16.63/3.05 reduce0, reduce2, reduce3, reduce4, reduce5, reduce6, subst-INV, subst0, subst1,
% 16.63/3.05 subst2, subst3, subst4, subst5
% 16.63/3.05
% 16.63/3.05 Those formulas are unsatisfiable:
% 16.63/3.05 ---------------------------------
% 16.63/3.05
% 16.63/3.05 Begin of proof
% 16.63/3.05 |
% 16.63/3.05 | ALPHA: (DIFF-noExp-someExp) implies:
% 16.63/3.05 | (1) ! [v0: $i] : ( ~ (vsomeExp(v0) = vnoExp) | ~ $i(v0))
% 16.63/3.05 |
% 16.63/3.05 | ALPHA: (reduce1) implies:
% 16.63/3.05 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] :
% 16.63/3.05 | (v4 = vnoExp | ~ (vreduce(v3) = v4) | ~ (vabs(v0, v1, v2) = v3) | ~
% 16.63/3.05 | $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0))
% 16.63/3.05 |
% 16.63/3.05 | ALPHA: (T-Preservation-T-abs) implies:
% 17.02/3.06 | (3) $i(ve1)
% 17.02/3.06 | (4) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] :
% 17.02/3.06 | ? [v5: $i] : ? [v6: $i] : ? [v7: int] : ( ~ (v7 = 0) & vreduce(v5) =
% 17.02/3.06 | v6 & vsomeExp(v3) = v6 & vtcheck(v2, v5, v4) = 0 & vtcheck(v2, v3,
% 17.02/3.06 | v4) = v7 & vabs(v0, v1, ve1) = v5 & $i(v6) & $i(v5) & $i(v4) &
% 17.02/3.06 | $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 17.02/3.06 |
% 17.02/3.06 | DELTA: instantiating (4) with fresh symbols all_60_0, all_60_1, all_60_2,
% 17.02/3.06 | all_60_3, all_60_4, all_60_5, all_60_6, all_60_7 gives:
% 17.02/3.06 | (5) ~ (all_60_0 = 0) & vreduce(all_60_2) = all_60_1 & vsomeExp(all_60_4) =
% 17.02/3.06 | all_60_1 & vtcheck(all_60_5, all_60_2, all_60_3) = 0 &
% 17.02/3.06 | vtcheck(all_60_5, all_60_4, all_60_3) = all_60_0 & vabs(all_60_7,
% 17.02/3.06 | all_60_6, ve1) = all_60_2 & $i(all_60_1) & $i(all_60_2) &
% 17.02/3.06 | $i(all_60_3) & $i(all_60_4) & $i(all_60_5) & $i(all_60_6) &
% 17.02/3.06 | $i(all_60_7)
% 17.02/3.06 |
% 17.02/3.06 | ALPHA: (5) implies:
% 17.02/3.06 | (6) $i(all_60_7)
% 17.02/3.06 | (7) $i(all_60_6)
% 17.02/3.06 | (8) $i(all_60_4)
% 17.02/3.06 | (9) $i(all_60_2)
% 17.02/3.06 | (10) $i(all_60_1)
% 17.02/3.06 | (11) vabs(all_60_7, all_60_6, ve1) = all_60_2
% 17.02/3.06 | (12) vsomeExp(all_60_4) = all_60_1
% 17.02/3.06 | (13) vreduce(all_60_2) = all_60_1
% 17.02/3.06 |
% 17.02/3.06 | GROUND_INST: instantiating (2) with all_60_7, all_60_6, ve1, all_60_2,
% 17.02/3.06 | all_60_1, simplifying with (3), (6), (7), (9), (10), (11), (13)
% 17.02/3.06 | gives:
% 17.02/3.07 | (14) all_60_1 = vnoExp
% 17.02/3.07 |
% 17.02/3.07 | REDUCE: (12), (14) imply:
% 17.02/3.07 | (15) vsomeExp(all_60_4) = vnoExp
% 17.02/3.07 |
% 17.02/3.07 | GROUND_INST: instantiating (1) with all_60_4, simplifying with (8), (15)
% 17.02/3.07 | gives:
% 17.02/3.07 | (16) $false
% 17.02/3.07 |
% 17.02/3.07 | CLOSE: (16) is inconsistent.
% 17.02/3.07 |
% 17.02/3.07 End of proof
% 17.02/3.07 % SZS output end Proof for theBenchmark
% 17.02/3.07
% 17.02/3.07 2456ms
%------------------------------------------------------------------------------