TSTP Solution File: RNG116+4 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : RNG116+4 : TPTP v8.1.2. Released v4.0.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 : Thu Aug 31 13:57:58 EDT 2023
% Result : Theorem 18.86s 3.19s
% Output : Proof 25.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG116+4 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun Aug 27 02:12:50 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.67/0.63 ________ _____
% 0.67/0.63 ___ __ \_________(_)________________________________
% 0.67/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.67/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.67/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.67/0.63
% 0.67/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.67/0.63 (2023-06-19)
% 0.67/0.63
% 0.67/0.63 (c) Philipp Rümmer, 2009-2023
% 0.67/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.67/0.63 Amanda Stjerna.
% 0.67/0.63 Free software under BSD-3-Clause.
% 0.67/0.63
% 0.67/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.67/0.63
% 0.67/0.64 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.67/0.65 Running up to 7 provers in parallel.
% 0.67/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.67/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.67/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.67/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.67/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.67/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.67/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.10/1.26 Prover 1: Preprocessing ...
% 4.10/1.27 Prover 4: Preprocessing ...
% 4.10/1.31 Prover 5: Preprocessing ...
% 4.10/1.31 Prover 3: Preprocessing ...
% 4.10/1.31 Prover 6: Preprocessing ...
% 4.10/1.31 Prover 0: Preprocessing ...
% 4.10/1.31 Prover 2: Preprocessing ...
% 10.95/2.18 Prover 1: Constructing countermodel ...
% 10.95/2.23 Prover 3: Constructing countermodel ...
% 11.87/2.32 Prover 6: Proving ...
% 12.32/2.34 Prover 5: Proving ...
% 12.85/2.42 Prover 2: Proving ...
% 13.84/2.57 Prover 4: Constructing countermodel ...
% 14.15/2.58 Prover 0: Proving ...
% 18.86/3.19 Prover 3: proved (2536ms)
% 18.86/3.19
% 18.86/3.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.86/3.19
% 18.86/3.21 Prover 0: stopped
% 18.86/3.21 Prover 2: stopped
% 18.86/3.21 Prover 5: stopped
% 18.86/3.21 Prover 6: stopped
% 18.86/3.22 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 18.86/3.22 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 18.86/3.22 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 18.86/3.22 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 18.86/3.22 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 20.27/3.42 Prover 13: Preprocessing ...
% 20.27/3.43 Prover 8: Preprocessing ...
% 20.27/3.43 Prover 7: Preprocessing ...
% 20.27/3.43 Prover 10: Preprocessing ...
% 20.27/3.45 Prover 11: Preprocessing ...
% 22.65/3.71 Prover 7: Constructing countermodel ...
% 22.65/3.72 Prover 10: Constructing countermodel ...
% 22.65/3.72 Prover 8: Warning: ignoring some quantifiers
% 22.65/3.74 Prover 8: Constructing countermodel ...
% 24.07/3.87 Prover 13: Warning: ignoring some quantifiers
% 24.07/3.89 Prover 13: Constructing countermodel ...
% 24.96/3.97 Prover 10: Found proof (size 6)
% 24.96/3.97 Prover 10: proved (764ms)
% 24.96/3.97 Prover 4: stopped
% 24.96/3.97 Prover 13: stopped
% 24.96/3.97 Prover 8: stopped
% 24.96/3.97 Prover 7: stopped
% 24.96/3.97 Prover 1: stopped
% 24.96/4.00 Prover 11: Constructing countermodel ...
% 24.96/4.01 Prover 11: stopped
% 24.96/4.01
% 24.96/4.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 24.96/4.01
% 24.96/4.02 % SZS output start Proof for theBenchmark
% 24.96/4.02 Assumptions after simplification:
% 24.96/4.02 ---------------------------------
% 24.96/4.02
% 24.96/4.02 (m__)
% 25.25/4.04 $i(xu) & $i(xb) & $i(xa) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3:
% 25.25/4.04 $i] : ( ~ (sdtasdt0(xb, v1) = v3) | ~ (sdtasdt0(xa, v0) = v2) | ~
% 25.25/4.04 (sdtpldt0(v2, v3) = xu) | ~ $i(v1) | ~ $i(v0) | ~ aElement0(v1) | ~
% 25.25/4.04 aElement0(v0))
% 25.25/4.04
% 25.25/4.04 (m__2456)
% 25.25/4.05 $i(xl) & $i(xk) & $i(xu) & $i(xb) & $i(xa) & ? [v0: $i] : ? [v1: $i] : ?
% 25.25/4.05 [v2: $i] : ? [v3: $i] : (slsdtgt0(xb) = v1 & slsdtgt0(xa) = v0 & sdtasdt0(xb,
% 25.25/4.05 v2) = xl & sdtasdt0(xa, v3) = xk & sdtpldt0(xk, xl) = xu & $i(v3) & $i(v2)
% 25.25/4.05 & $i(v1) & $i(v0) & aElementOf0(xl, v1) & aElementOf0(xk, v0) &
% 25.25/4.05 aElement0(v3) & aElement0(v2))
% 25.25/4.05
% 25.25/4.05 Further assumptions not needed in the proof:
% 25.25/4.05 --------------------------------------------
% 25.25/4.05 mAMDistr, mAddAsso, mAddComm, mAddInvr, mAddZero, mCancel, mChineseRemainder,
% 25.25/4.05 mDefDiv, mDefDvs, mDefGCD, mDefIdeal, mDefMod, mDefPrIdeal, mDefRel, mDefSInt,
% 25.25/4.05 mDefSSum, mDivision, mEOfElem, mElmSort, mEucSort, mIdeInt, mIdeSum, mMulAsso,
% 25.25/4.05 mMulComm, mMulMnOne, mMulUnit, mMulZero, mNatLess, mNatSort, mPrIdeal, mSetEq,
% 25.25/4.05 mSetSort, mSortsB, mSortsB_02, mSortsC, mSortsC_01, mSortsU, mUnNeZr, m__2091,
% 25.25/4.05 m__2110, m__2129, m__2174, m__2203, m__2228, m__2273, m__2383
% 25.25/4.05
% 25.25/4.05 Those formulas are unsatisfiable:
% 25.25/4.05 ---------------------------------
% 25.25/4.05
% 25.25/4.05 Begin of proof
% 25.25/4.05 |
% 25.25/4.05 | ALPHA: (m__2456) implies:
% 25.25/4.05 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : (slsdtgt0(xb) =
% 25.25/4.05 | v1 & slsdtgt0(xa) = v0 & sdtasdt0(xb, v2) = xl & sdtasdt0(xa, v3) =
% 25.25/4.05 | xk & sdtpldt0(xk, xl) = xu & $i(v3) & $i(v2) & $i(v1) & $i(v0) &
% 25.25/4.05 | aElementOf0(xl, v1) & aElementOf0(xk, v0) & aElement0(v3) &
% 25.25/4.05 | aElement0(v2))
% 25.25/4.05 |
% 25.25/4.05 | ALPHA: (m__) implies:
% 25.25/4.05 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~
% 25.25/4.05 | (sdtasdt0(xb, v1) = v3) | ~ (sdtasdt0(xa, v0) = v2) | ~
% 25.25/4.05 | (sdtpldt0(v2, v3) = xu) | ~ $i(v1) | ~ $i(v0) | ~ aElement0(v1) |
% 25.25/4.05 | ~ aElement0(v0))
% 25.25/4.05 |
% 25.25/4.05 | DELTA: instantiating (1) with fresh symbols all_38_0, all_38_1, all_38_2,
% 25.25/4.05 | all_38_3 gives:
% 25.25/4.05 | (3) slsdtgt0(xb) = all_38_2 & slsdtgt0(xa) = all_38_3 & sdtasdt0(xb,
% 25.25/4.05 | all_38_1) = xl & sdtasdt0(xa, all_38_0) = xk & sdtpldt0(xk, xl) = xu
% 25.25/4.05 | & $i(all_38_0) & $i(all_38_1) & $i(all_38_2) & $i(all_38_3) &
% 25.25/4.05 | aElementOf0(xl, all_38_2) & aElementOf0(xk, all_38_3) &
% 25.25/4.05 | aElement0(all_38_0) & aElement0(all_38_1)
% 25.25/4.05 |
% 25.25/4.05 | ALPHA: (3) implies:
% 25.25/4.06 | (4) aElement0(all_38_1)
% 25.25/4.06 | (5) aElement0(all_38_0)
% 25.25/4.06 | (6) $i(all_38_1)
% 25.25/4.06 | (7) $i(all_38_0)
% 25.25/4.06 | (8) sdtpldt0(xk, xl) = xu
% 25.25/4.06 | (9) sdtasdt0(xa, all_38_0) = xk
% 25.25/4.06 | (10) sdtasdt0(xb, all_38_1) = xl
% 25.25/4.06 |
% 25.25/4.06 | GROUND_INST: instantiating (2) with all_38_0, all_38_1, xk, xl, simplifying
% 25.25/4.06 | with (4), (5), (6), (7), (8), (9), (10) gives:
% 25.25/4.06 | (11) $false
% 25.25/4.06 |
% 25.25/4.06 | CLOSE: (11) is inconsistent.
% 25.25/4.06 |
% 25.25/4.06 End of proof
% 25.25/4.06 % SZS output end Proof for theBenchmark
% 25.25/4.06
% 25.25/4.06 3423ms
%------------------------------------------------------------------------------