%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : COM239_1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n003.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 : Tue May 5 06:21:37 PM UTC 2026 % Result : Theorem 59.20s 8.44s % Output : Proof 106.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.16 % Problem : COM239_1 : TPTP v9.3.0. Released v9.3.0. % 0.11/0.16 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.18/0.38 % Computer : n003.cluster.edu % 0.18/0.38 % Model : x86_64 x86_64 % 0.18/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.38 % Memory : 8042.1875MB % 0.18/0.38 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.38 % CPULimit : 300 % 0.18/0.38 % WCLimit : 300 % 0.18/0.38 % DateTime : Mon May 4 19:25:26 EDT 2026 % 0.18/0.39 % CPUTime : % 0.59/0.65 ________ _____ % 0.59/0.65 ___ __ \_________(_)________________________________ % 0.59/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.59/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.59/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.59/0.65 % 0.59/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.59/0.65 (2023-06-19) % 0.59/0.65 % 0.59/0.65 (c) Philipp Rümmer, 2009-2023 % 0.59/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.59/0.65 Amanda Stjerna. % 0.59/0.65 Free software under BSD-3-Clause. % 0.59/0.65 % 0.59/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.59/0.65 % 0.59/0.65 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.59/0.66 Running up to 7 provers in parallel. % 0.59/0.68 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.59/0.68 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.59/0.68 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.59/0.68 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.59/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.59/0.69 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.59/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.66/1.48 Prover 4: Preprocessing ... % 5.41/1.50 Prover 1: Preprocessing ... % 5.41/1.52 Prover 3: Preprocessing ... % 5.41/1.52 Prover 0: Preprocessing ... % 5.41/1.52 Prover 2: Preprocessing ... % 5.41/1.52 Prover 6: Preprocessing ... % 5.41/1.53 Prover 5: Preprocessing ... % 12.26/2.42 Prover 1: Warning: ignoring some quantifiers % 12.26/2.47 Prover 1: Constructing countermodel ... % 12.26/2.49 Prover 3: Warning: ignoring some quantifiers % 13.03/2.51 Prover 3: Constructing countermodel ... % 13.03/2.51 Prover 6: Proving ... % 13.03/2.56 Prover 5: Proving ... % 13.78/2.61 Prover 4: Warning: ignoring some quantifiers % 13.78/2.66 Prover 4: Constructing countermodel ... % 14.50/2.70 Prover 0: Proving ... % 15.99/2.91 Prover 2: Proving ... % 59.20/8.44 Prover 2: proved (7706ms) % 59.20/8.44 % 59.20/8.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 59.20/8.44 % 59.20/8.45 Prover 5: stopped % 59.20/8.45 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 59.20/8.45 Prover 0: stopped % 59.20/8.45 Prover 3: stopped % 59.20/8.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 59.20/8.47 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 59.20/8.47 Prover 6: stopped % 59.20/8.47 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 59.20/8.47 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 61.50/8.73 Prover 11: Preprocessing ... % 62.29/8.86 Prover 13: Preprocessing ... % 62.29/8.86 Prover 8: Preprocessing ... % 62.29/8.88 Prover 7: Preprocessing ... % 63.08/8.91 Prover 10: Preprocessing ... % 64.00/9.07 Prover 11: Warning: ignoring some quantifiers % 64.00/9.08 Prover 8: Warning: ignoring some quantifiers % 64.00/9.08 Prover 11: Constructing countermodel ... % 64.00/9.10 Prover 8: Constructing countermodel ... % 65.37/9.28 Prover 10: Warning: ignoring some quantifiers % 65.37/9.29 Prover 10: Constructing countermodel ... % 66.16/9.35 Prover 13: Warning: ignoring some quantifiers % 66.16/9.35 Prover 7: Warning: ignoring some quantifiers % 66.16/9.36 Prover 13: Constructing countermodel ... % 66.16/9.36 Prover 7: Constructing countermodel ... % 94.39/12.90 Prover 13: stopped % 94.39/12.91 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 94.39/13.02 Prover 16: Preprocessing ... % 96.13/13.19 Prover 16: Warning: ignoring some quantifiers % 96.13/13.19 Prover 16: Constructing countermodel ... % 106.03/14.49 Prover 10: Found proof (size 37) % 106.03/14.49 Prover 10: proved (6034ms) % 106.03/14.49 Prover 16: stopped % 106.03/14.50 Prover 11: stopped % 106.83/14.50 Prover 1: stopped % 106.83/14.50 Prover 7: stopped % 106.83/14.50 Prover 8: stopped % 106.83/14.51 Prover 4: stopped % 106.83/14.51 % 106.83/14.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 106.83/14.51 % 106.83/14.51 % SZS output start Proof for theBenchmark % 106.83/14.52 Assumptions after simplification: % 106.83/14.52 --------------------------------- % 106.83/14.52 % 106.83/14.52 (Progress-Pred-IH0) % 106.83/14.54 vOptTerm(vnoTerm) & vTerm(vt1) & ? [v0: vOptTerm] : (vreduce(vt1) = v0 & % 106.83/14.54 vOptTerm(v0) & ! [v1: vTy] : ( ~ (v0 = vnoTerm) | ~ vTy(v1) | ~ % 106.83/14.54 vptchecksimple(vt1, v1) | visValue(vt1))) % 106.83/14.54 % 106.83/14.54 (Progress-Pred-t1-isSomeTerm-True) % 106.83/14.54 vOptTerm(vnoTerm) & vTerm(vt1) & vTerm(vZero) & ? [v0: vOptTerm] : ? [v1: % 106.83/14.54 vTerm] : ? [v2: vTy] : ( ~ (vt1 = vZero) & vreduce(v1) = vnoTerm & % 106.83/14.54 vreduce(vt1) = v0 & vPred(vt1) = v1 & vTy(v2) & vOptTerm(v0) & vTerm(v1) & % 106.83/14.54 vptchecksimple(v1, v2) & visSomeTerm(v0) & ~ visValue(v1) & ! [v3: vTerm] % 106.83/14.54 : ( ~ (vSucc(v3) = vt1) | ~ vTerm(v3))) % 106.83/14.54 % 106.83/14.54 (isSomeTerm-0) % 106.83/14.54 vOptTerm(vnoTerm) & ~ visSomeTerm(vnoTerm) % 106.83/14.54 % 106.83/14.54 (isSomeTerm-1) % 106.83/14.54 ! [v0: vTerm] : ! [v1: vOptTerm] : ( ~ (vsomeTerm(v0) = v1) | ~ vTerm(v0) | % 106.83/14.54 visSomeTerm(v1)) % 106.83/14.55 % 106.83/14.55 (reduce-10) % 106.83/14.55 vTerm(vZero) & ! [v0: vTerm] : ! [v1: vTerm] : (v0 = vZero | ~ (vPred(v0) = % 106.83/14.55 v1) | ~ vTerm(v0) | ? [v2: vOptTerm] : ? [v3: vOptTerm] : ? [v4: % 106.83/14.55 vTerm] : ? [v5: vTerm] : ? [v6: vOptTerm] : ? [v7: vTerm] : ? [v8: % 106.83/14.55 vTerm] : (vTerm(v7) & ((v8 = v0 & vSucc(v7) = v0) | (vreduce(v0) = v2 & % 106.83/14.55 vOptTerm(v2) & ( ~ visSomeTerm(v2) | (v6 = v3 & vreduce(v1) = v3 & % 106.83/14.55 vgetTerm(v2) = v4 & vsomeTerm(v5) = v3 & vPred(v4) = v5 & % 106.83/14.55 vOptTerm(v3) & vTerm(v5) & vTerm(v4))))))) % 106.83/14.55 % 106.83/14.55 (function-axioms) % 106.83/14.55 ! [v0: vTerm] : ! [v1: vTerm] : ! [v2: vTerm] : ! [v3: vTerm] : ! [v4: % 106.83/14.55 vTerm] : (v1 = v0 | ~ (vIfelse(v4, v3, v2) = v1) | ~ (vIfelse(v4, v3, v2) % 106.83/14.55 = v0)) & ! [v0: vTerm] : ! [v1: vTerm] : ! [v2: vTerm] : ! [v3: vTerm] % 106.83/14.55 : (v1 = v0 | ~ (vplusop(v3, v2) = v1) | ~ (vplusop(v3, v2) = v0)) & ! [v0: % 106.83/14.55 vTerm] : ! [v1: vTerm] : ! [v2: vTerm] : ! [v3: vTerm] : (v1 = v0 | ~ % 106.83/14.55 (vPlus(v3, v2) = v1) | ~ (vPlus(v3, v2) = v0)) & ! [v0: vOptTerm] : ! % 106.83/14.55 [v1: vOptTerm] : ! [v2: vTerm] : (v1 = v0 | ~ (vreduce(v2) = v1) | ~ % 106.83/14.55 (vreduce(v2) = v0)) & ! [v0: vTerm] : ! [v1: vTerm] : ! [v2: vOptTerm] : % 106.83/14.55 (v1 = v0 | ~ (vgetTerm(v2) = v1) | ~ (vgetTerm(v2) = v0)) & ! [v0: % 106.83/14.55 vOptTerm] : ! [v1: vOptTerm] : ! [v2: vTerm] : (v1 = v0 | ~ % 106.83/14.55 (vsomeTerm(v2) = v1) | ~ (vsomeTerm(v2) = v0)) & ! [v0: vTerm] : ! [v1: % 106.83/14.55 vTerm] : ! [v2: vTerm] : (v1 = v0 | ~ (vIszero(v2) = v1) | ~ (vIszero(v2) % 106.83/14.55 = v0)) & ! [v0: vTerm] : ! [v1: vTerm] : ! [v2: vTerm] : (v1 = v0 | ~ % 106.83/14.55 (vPred(v2) = v1) | ~ (vPred(v2) = v0)) & ! [v0: vTerm] : ! [v1: vTerm] : % 106.83/14.55 ! [v2: vTerm] : (v1 = v0 | ~ (vSucc(v2) = v1) | ~ (vSucc(v2) = v0)) % 106.83/14.55 % 106.83/14.55 Further assumptions not needed in the proof: % 106.83/14.55 -------------------------------------------- % 106.83/14.55 DIFF-B-Nat, DIFF-False-Ifelse, DIFF-False-Iszero, DIFF-False-Plus, % 106.83/14.55 DIFF-False-Pred, DIFF-False-Succ, DIFF-False-Zero, DIFF-Ifelse-Iszero, % 106.83/14.55 DIFF-Ifelse-Plus, DIFF-Ifelse-Pred, DIFF-Ifelse-Succ, DIFF-Ifelse-Zero, % 106.83/14.55 DIFF-Iszero-Plus, DIFF-Pred-Iszero, DIFF-Pred-Plus, DIFF-Succ-Iszero, % 106.83/14.56 DIFF-Succ-Plus, DIFF-Succ-Pred, DIFF-True-False, DIFF-True-Ifelse, % 106.83/14.56 DIFF-True-Iszero, DIFF-True-Plus, DIFF-True-Pred, DIFF-True-Succ, % 106.83/14.56 DIFF-True-Zero, DIFF-Zero-Iszero, DIFF-Zero-Plus, DIFF-Zero-Pred, % 106.83/14.56 DIFF-Zero-Succ, DIFF-noTerm-someTerm, EQ-Ifelse, EQ-Iszero, EQ-Plus, EQ-Pred, % 106.83/14.56 EQ-Succ, EQ-someTerm, TPlus, TPlus_inv0, TPlus_inv1, TPlus_inv2, TPred, % 106.83/14.56 TPred_inv1, TPred_inv2, TSucc, TSucc_inv1, TSucc_inv2, TZero, TZero_inv, Tfalse, % 106.83/14.56 Tif, Tif_inv1, Tif_inv2, Tif_inv3, Tiszero, Tiszero_inv1, Tiszero_inv2, Ttrue, % 106.83/14.56 dom-OptTerm, dom-Term, dom-Ty, getTerm-0, isNV-0, isNV-1, isNV-2, % 106.83/14.56 isNV-false-INV, isNV-true-INV, isSomeTerm-false-INV, isSomeTerm-true-INV, % 106.83/14.56 isValue-0, isValue-1, isValue-2, isValue-false-INV, isValue-true-INV, plusop-0, % 106.83/14.56 plusop-1, plusop-2, plusop-INV, reduce-0, reduce-1, reduce-11, reduce-12, % 106.83/14.56 reduce-13, reduce-14, reduce-15, reduce-16, reduce-17, reduce-18, reduce-19, % 106.83/14.56 reduce-2, reduce-20, reduce-21, reduce-22, reduce-23, reduce-3, reduce-4, % 106.83/14.56 reduce-5, reduce-6, reduce-7, reduce-8, reduce-9, reduce-INV % 106.83/14.56 % 106.83/14.56 Those formulas are unsatisfiable: % 106.83/14.56 --------------------------------- % 106.83/14.56 % 106.83/14.56 Begin of proof % 106.83/14.56 | % 106.83/14.56 | ALPHA: (isSomeTerm-0) implies: % 106.83/14.56 | (1) ~ visSomeTerm(vnoTerm) % 106.83/14.56 | % 106.83/14.56 | ALPHA: (reduce-10) implies: % 106.83/14.56 | (2) ! [v0: vTerm] : ! [v1: vTerm] : (v0 = vZero | ~ (vPred(v0) = v1) | % 106.83/14.56 | ~ vTerm(v0) | ? [v2: vOptTerm] : ? [v3: vOptTerm] : ? [v4: vTerm] % 106.83/14.56 | : ? [v5: vTerm] : ? [v6: vOptTerm] : ? [v7: vTerm] : ? [v8: % 106.83/14.56 | vTerm] : (vTerm(v7) & ((v8 = v0 & vSucc(v7) = v0) | (vreduce(v0) = % 106.83/14.56 | v2 & vOptTerm(v2) & ( ~ visSomeTerm(v2) | (v6 = v3 & % 106.83/14.56 | vreduce(v1) = v3 & vgetTerm(v2) = v4 & vsomeTerm(v5) = v3 & % 106.83/14.56 | vPred(v4) = v5 & vOptTerm(v3) & vTerm(v5) & vTerm(v4))))))) % 106.83/14.56 | % 106.83/14.56 | ALPHA: (Progress-Pred-IH0) implies: % 106.83/14.56 | (3) ? [v0: vOptTerm] : (vreduce(vt1) = v0 & vOptTerm(v0) & ! [v1: vTy] : % 106.83/14.56 | ( ~ (v0 = vnoTerm) | ~ vTy(v1) | ~ vptchecksimple(vt1, v1) | % 106.83/14.56 | visValue(vt1))) % 106.83/14.56 | % 106.83/14.56 | ALPHA: (Progress-Pred-t1-isSomeTerm-True) implies: % 106.83/14.56 | (4) vTerm(vt1) % 106.83/14.56 | (5) ? [v0: vOptTerm] : ? [v1: vTerm] : ? [v2: vTy] : ( ~ (vt1 = vZero) & % 106.83/14.56 | vreduce(v1) = vnoTerm & vreduce(vt1) = v0 & vPred(vt1) = v1 & vTy(v2) % 106.83/14.56 | & vOptTerm(v0) & vTerm(v1) & vptchecksimple(v1, v2) & visSomeTerm(v0) % 106.83/14.56 | & ~ visValue(v1) & ! [v3: vTerm] : ( ~ (vSucc(v3) = vt1) | ~ % 106.83/14.56 | vTerm(v3))) % 106.83/14.56 | % 106.83/14.56 | ALPHA: (function-axioms) implies: % 106.83/14.56 | (6) ! [v0: vOptTerm] : ! [v1: vOptTerm] : ! [v2: vTerm] : (v1 = v0 | ~ % 106.83/14.56 | (vreduce(v2) = v1) | ~ (vreduce(v2) = v0)) % 106.83/14.56 | % 106.83/14.56 | DELTA: instantiating (3) with fresh symbol all_100_0 gives: % 106.83/14.57 | (7) vreduce(vt1) = all_100_0 & vOptTerm(all_100_0) & ! [v0: vTy] : ( ~ % 106.83/14.57 | (all_100_0 = vnoTerm) | ~ vTy(v0) | ~ vptchecksimple(vt1, v0) | % 106.83/14.57 | visValue(vt1)) % 106.83/14.57 | % 106.83/14.57 | ALPHA: (7) implies: % 106.83/14.57 | (8) vreduce(vt1) = all_100_0 % 106.83/14.57 | % 106.83/14.57 | DELTA: instantiating (5) with fresh symbols all_107_0, all_107_1, all_107_2 % 106.83/14.57 | gives: % 106.83/14.57 | (9) ~ (vt1 = vZero) & vreduce(all_107_1) = vnoTerm & vreduce(vt1) = % 106.83/14.57 | all_107_2 & vPred(vt1) = all_107_1 & vTy(all_107_0) & % 106.83/14.57 | vOptTerm(all_107_2) & vTerm(all_107_1) & vptchecksimple(all_107_1, % 106.83/14.57 | all_107_0) & visSomeTerm(all_107_2) & ~ visValue(all_107_1) & ! % 106.83/14.57 | [v0: vTerm] : ( ~ (vSucc(v0) = vt1) | ~ vTerm(v0)) % 106.83/14.57 | % 106.83/14.57 | ALPHA: (9) implies: % 106.83/14.57 | (10) ~ (vt1 = vZero) % 106.83/14.57 | (11) visSomeTerm(all_107_2) % 106.83/14.57 | (12) vPred(vt1) = all_107_1 % 106.83/14.57 | (13) vreduce(vt1) = all_107_2 % 106.83/14.57 | (14) vreduce(all_107_1) = vnoTerm % 106.83/14.57 | (15) ! [v0: vTerm] : ( ~ (vSucc(v0) = vt1) | ~ vTerm(v0)) % 106.83/14.57 | % 106.83/14.57 | GROUND_INST: instantiating (6) with all_100_0, all_107_2, vt1, simplifying % 106.83/14.57 | with (8), (13) gives: % 106.83/14.57 | (16) all_107_2 = all_100_0 % 106.83/14.57 | % 106.83/14.57 | REDUCE: (11), (16) imply: % 106.83/14.57 | (17) visSomeTerm(all_100_0) % 106.83/14.57 | % 106.83/14.57 | GROUND_INST: instantiating (2) with vt1, all_107_1, simplifying with (4), (12) % 106.83/14.57 | gives: % 106.83/14.57 | (18) vt1 = vZero | ? [v0: vOptTerm] : ? [v1: vOptTerm] : ? [v2: vTerm] : % 106.83/14.57 | ? [v3: vTerm] : ? [v4: vOptTerm] : ? [v5: vTerm] : ? [v6: vTerm] : % 106.83/14.57 | (vTerm(v5) & ((v6 = vt1 & vSucc(v5) = vt1) | (vreduce(vt1) = v0 & % 106.83/14.57 | vOptTerm(v0) & ( ~ visSomeTerm(v0) | (v4 = v1 & % 106.83/14.57 | vreduce(all_107_1) = v1 & vgetTerm(v0) = v2 & vsomeTerm(v3) % 106.83/14.57 | = v1 & vPred(v2) = v3 & vOptTerm(v1) & vTerm(v3) & % 106.83/14.57 | vTerm(v2)))))) % 106.83/14.57 | % 106.83/14.57 | BETA: splitting (18) gives: % 106.83/14.57 | % 106.83/14.57 | Case 1: % 106.83/14.57 | | % 106.83/14.57 | | (19) vt1 = vZero % 106.83/14.57 | | % 106.83/14.57 | | REDUCE: (10), (19) imply: % 106.83/14.57 | | (20) $false % 106.83/14.57 | | % 106.83/14.57 | | CLOSE: (20) is inconsistent. % 106.83/14.57 | | % 106.83/14.57 | Case 2: % 106.83/14.57 | | % 106.83/14.57 | | (21) ? [v0: vOptTerm] : ? [v1: vOptTerm] : ? [v2: vTerm] : ? [v3: % 106.83/14.57 | | vTerm] : ? [v4: vOptTerm] : ? [v5: vTerm] : ? [v6: vTerm] : % 106.83/14.57 | | (vTerm(v5) & ((v6 = vt1 & vSucc(v5) = vt1) | (vreduce(vt1) = v0 & % 106.83/14.57 | | vOptTerm(v0) & ( ~ visSomeTerm(v0) | (v4 = v1 & % 106.83/14.57 | | vreduce(all_107_1) = v1 & vgetTerm(v0) = v2 & % 106.83/14.57 | | vsomeTerm(v3) = v1 & vPred(v2) = v3 & vOptTerm(v1) & % 106.83/14.57 | | vTerm(v3) & vTerm(v2)))))) % 106.83/14.57 | | % 106.83/14.57 | | DELTA: instantiating (21) with fresh symbols all_144_0, all_144_1, % 106.83/14.57 | | all_144_2, all_144_3, all_144_4, all_144_5, all_144_6 gives: % 106.83/14.58 | | (22) vTerm(all_144_1) & ((all_144_0 = vt1 & vSucc(all_144_1) = vt1) | % 106.83/14.58 | | (vreduce(vt1) = all_144_6 & vOptTerm(all_144_6) & ( ~ % 106.83/14.58 | | visSomeTerm(all_144_6) | (all_144_2 = all_144_5 & % 106.83/14.58 | | vreduce(all_107_1) = all_144_5 & vgetTerm(all_144_6) = % 106.83/14.58 | | all_144_4 & vsomeTerm(all_144_3) = all_144_5 & % 106.83/14.58 | | vPred(all_144_4) = all_144_3 & vOptTerm(all_144_5) & % 106.83/14.58 | | vTerm(all_144_3) & vTerm(all_144_4))))) % 106.83/14.58 | | % 106.83/14.58 | | ALPHA: (22) implies: % 106.83/14.58 | | (23) vTerm(all_144_1) % 106.83/14.58 | | (24) (all_144_0 = vt1 & vSucc(all_144_1) = vt1) | (vreduce(vt1) = % 106.83/14.58 | | all_144_6 & vOptTerm(all_144_6) & ( ~ visSomeTerm(all_144_6) | % 106.83/14.58 | | (all_144_2 = all_144_5 & vreduce(all_107_1) = all_144_5 & % 106.83/14.58 | | vgetTerm(all_144_6) = all_144_4 & vsomeTerm(all_144_3) = % 106.83/14.58 | | all_144_5 & vPred(all_144_4) = all_144_3 & vOptTerm(all_144_5) % 106.83/14.58 | | & vTerm(all_144_3) & vTerm(all_144_4)))) % 106.83/14.58 | | % 106.83/14.58 | | BETA: splitting (24) gives: % 106.83/14.58 | | % 106.83/14.58 | | Case 1: % 106.83/14.58 | | | % 106.83/14.58 | | | (25) all_144_0 = vt1 & vSucc(all_144_1) = vt1 % 106.83/14.58 | | | % 106.83/14.58 | | | ALPHA: (25) implies: % 106.83/14.58 | | | (26) vSucc(all_144_1) = vt1 % 106.83/14.58 | | | % 106.83/14.58 | | | GROUND_INST: instantiating (15) with all_144_1, simplifying with (23), % 106.83/14.58 | | | (26) gives: % 106.83/14.58 | | | (27) $false % 106.83/14.58 | | | % 106.83/14.58 | | | CLOSE: (27) is inconsistent. % 106.83/14.58 | | | % 106.83/14.58 | | Case 2: % 106.83/14.58 | | | % 106.83/14.58 | | | (28) vreduce(vt1) = all_144_6 & vOptTerm(all_144_6) & ( ~ % 106.83/14.58 | | | visSomeTerm(all_144_6) | (all_144_2 = all_144_5 & % 106.83/14.58 | | | vreduce(all_107_1) = all_144_5 & vgetTerm(all_144_6) = % 106.83/14.58 | | | all_144_4 & vsomeTerm(all_144_3) = all_144_5 & % 106.83/14.58 | | | vPred(all_144_4) = all_144_3 & vOptTerm(all_144_5) & % 106.83/14.58 | | | vTerm(all_144_3) & vTerm(all_144_4))) % 106.83/14.58 | | | % 106.83/14.58 | | | ALPHA: (28) implies: % 106.83/14.58 | | | (29) vreduce(vt1) = all_144_6 % 106.83/14.58 | | | (30) ~ visSomeTerm(all_144_6) | (all_144_2 = all_144_5 & % 106.83/14.58 | | | vreduce(all_107_1) = all_144_5 & vgetTerm(all_144_6) = all_144_4 % 106.83/14.58 | | | & vsomeTerm(all_144_3) = all_144_5 & vPred(all_144_4) = % 106.83/14.58 | | | all_144_3 & vOptTerm(all_144_5) & vTerm(all_144_3) & % 106.83/14.58 | | | vTerm(all_144_4)) % 106.83/14.58 | | | % 106.83/14.58 | | | GROUND_INST: instantiating (6) with all_100_0, all_144_6, vt1, simplifying % 106.83/14.58 | | | with (8), (29) gives: % 106.83/14.58 | | | (31) all_144_6 = all_100_0 % 106.83/14.58 | | | % 106.83/14.58 | | | BETA: splitting (30) gives: % 106.83/14.58 | | | % 106.83/14.58 | | | Case 1: % 106.83/14.58 | | | | % 106.83/14.58 | | | | (32) ~ visSomeTerm(all_144_6) % 106.83/14.58 | | | | % 106.83/14.58 | | | | REDUCE: (31), (32) imply: % 106.83/14.58 | | | | (33) ~ visSomeTerm(all_100_0) % 106.83/14.58 | | | | % 106.83/14.58 | | | | PRED_UNIFY: (17), (33) imply: % 106.83/14.58 | | | | (34) $false % 106.83/14.58 | | | | % 106.83/14.58 | | | | CLOSE: (34) is inconsistent. % 106.83/14.58 | | | | % 106.83/14.58 | | | Case 2: % 106.83/14.58 | | | | % 106.83/14.58 | | | | (35) all_144_2 = all_144_5 & vreduce(all_107_1) = all_144_5 & % 106.83/14.58 | | | | vgetTerm(all_144_6) = all_144_4 & vsomeTerm(all_144_3) = % 106.83/14.58 | | | | all_144_5 & vPred(all_144_4) = all_144_3 & vOptTerm(all_144_5) & % 106.83/14.58 | | | | vTerm(all_144_3) & vTerm(all_144_4) % 106.83/14.58 | | | | % 106.83/14.58 | | | | ALPHA: (35) implies: % 106.83/14.58 | | | | (36) vTerm(all_144_3) % 106.83/14.58 | | | | (37) vsomeTerm(all_144_3) = all_144_5 % 106.83/14.58 | | | | (38) vreduce(all_107_1) = all_144_5 % 106.83/14.58 | | | | % 106.83/14.58 | | | | GROUND_INST: instantiating (6) with vnoTerm, all_144_5, all_107_1, % 106.83/14.58 | | | | simplifying with (14), (38) gives: % 106.83/14.58 | | | | (39) all_144_5 = vnoTerm % 106.83/14.58 | | | | % 106.83/14.58 | | | | REDUCE: (37), (39) imply: % 106.83/14.58 | | | | (40) vsomeTerm(all_144_3) = vnoTerm % 106.83/14.58 | | | | % 106.83/14.58 | | | | GROUND_INST: instantiating (isSomeTerm-1) with all_144_3, vnoTerm, % 106.83/14.58 | | | | simplifying with (1), (36), (40) gives: % 106.83/14.58 | | | | (41) $false % 106.83/14.58 | | | | % 106.83/14.58 | | | | CLOSE: (41) is inconsistent. % 106.83/14.58 | | | | % 106.83/14.58 | | | End of split % 106.83/14.58 | | | % 106.83/14.58 | | End of split % 106.83/14.58 | | % 106.83/14.58 | End of split % 106.83/14.58 | % 106.83/14.58 End of proof % 106.83/14.58 % SZS output end Proof for theBenchmark % 106.83/14.58 % 106.83/14.58 13934ms %------------------------------------------------------------------------------