TSTP Solution File: LAT388+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : LAT388+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n021.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 06:25:19 EDT 2023
% Result : Theorem 10.66s 2.26s
% Output : Proof 13.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT388+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.17/0.34 % Computer : n021.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu Aug 24 04:48:55 EDT 2023
% 0.17/0.34 % CPUTime :
% 0.20/0.59 ________ _____
% 0.20/0.59 ___ __ \_________(_)________________________________
% 0.20/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.59
% 0.20/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.59 (2023-06-19)
% 0.20/0.59
% 0.20/0.59 (c) Philipp Rümmer, 2009-2023
% 0.20/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.59 Amanda Stjerna.
% 0.20/0.59 Free software under BSD-3-Clause.
% 0.20/0.59
% 0.20/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.59
% 0.20/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.61 Running up to 7 provers in parallel.
% 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.74/1.18 Prover 1: Preprocessing ...
% 2.74/1.18 Prover 4: Preprocessing ...
% 3.41/1.24 Prover 6: Preprocessing ...
% 3.41/1.24 Prover 2: Preprocessing ...
% 3.41/1.24 Prover 5: Preprocessing ...
% 3.41/1.24 Prover 0: Preprocessing ...
% 3.41/1.24 Prover 3: Preprocessing ...
% 9.06/2.01 Prover 2: Proving ...
% 9.06/2.03 Prover 1: Constructing countermodel ...
% 9.06/2.04 Prover 5: Constructing countermodel ...
% 9.56/2.14 Prover 3: Constructing countermodel ...
% 10.38/2.20 Prover 6: Proving ...
% 10.66/2.25 Prover 3: proved (1631ms)
% 10.66/2.25 Prover 5: proved (1628ms)
% 10.66/2.26
% 10.66/2.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.66/2.26
% 10.66/2.26
% 10.66/2.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.66/2.26
% 10.66/2.26 Prover 6: stopped
% 10.66/2.29 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 10.66/2.29 Prover 2: stopped
% 10.66/2.31 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 10.66/2.31 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 10.66/2.31 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 10.66/2.37 Prover 1: Found proof (size 4)
% 10.66/2.37 Prover 1: proved (1758ms)
% 10.66/2.38 Prover 7: Preprocessing ...
% 11.58/2.42 Prover 8: Preprocessing ...
% 11.58/2.42 Prover 7: stopped
% 11.58/2.43 Prover 10: Preprocessing ...
% 12.06/2.46 Prover 11: Preprocessing ...
% 12.06/2.48 Prover 10: stopped
% 12.56/2.55 Prover 11: stopped
% 12.89/2.57 Prover 4: Constructing countermodel ...
% 12.89/2.59 Prover 4: stopped
% 12.89/2.64 Prover 0: Proving ...
% 13.39/2.65 Prover 8: Warning: ignoring some quantifiers
% 13.39/2.65 Prover 0: stopped
% 13.39/2.66 Prover 8: Constructing countermodel ...
% 13.56/2.68 Prover 8: stopped
% 13.56/2.68
% 13.56/2.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.56/2.68
% 13.56/2.68 % SZS output start Proof for theBenchmark
% 13.56/2.69 Assumptions after simplification:
% 13.56/2.69 ---------------------------------
% 13.56/2.69
% 13.56/2.69 (m__)
% 13.56/2.72 $i(xT) & $i(xS) & ! [v0: $i] : ( ~ (aSupremumOfIn0(v0, xT, xS) = 0) | ~
% 13.56/2.72 $i(v0))
% 13.56/2.72
% 13.56/2.72 (m__1330)
% 13.56/2.72 aFixedPointOf0(xp, xf) = 0 & aSupremumOfIn0(xp, xT, xS) = 0 & $i(xp) & $i(xT)
% 13.56/2.72 & $i(xS) & $i(xf)
% 13.56/2.72
% 13.56/2.72 Further assumptions not needed in the proof:
% 13.56/2.72 --------------------------------------------
% 13.56/2.72 mARefl, mASymm, mConMap, mDefCLat, mDefDom, mDefEmpty, mDefFix, mDefInf, mDefLB,
% 13.56/2.72 mDefMonot, mDefSub, mDefSup, mDefUB, mDomSort, mEOfElem, mElmSort, mImgSort,
% 13.56/2.72 mInfUn, mLessRel, mRanSort, mSetSort, mSupUn, mTrans, m__1123, m__1144, m__1173,
% 13.56/2.72 m__1244, m__1261, m__1299
% 13.56/2.72
% 13.56/2.72 Those formulas are unsatisfiable:
% 13.56/2.72 ---------------------------------
% 13.56/2.72
% 13.56/2.72 Begin of proof
% 13.56/2.72 |
% 13.56/2.73 | ALPHA: (m__1330) implies:
% 13.56/2.73 | (1) $i(xp)
% 13.56/2.73 | (2) aSupremumOfIn0(xp, xT, xS) = 0
% 13.56/2.73 |
% 13.56/2.73 | ALPHA: (m__) implies:
% 13.56/2.73 | (3) ! [v0: $i] : ( ~ (aSupremumOfIn0(v0, xT, xS) = 0) | ~ $i(v0))
% 13.56/2.73 |
% 13.83/2.73 | GROUND_INST: instantiating (3) with xp, simplifying with (1), (2) gives:
% 13.83/2.73 | (4) $false
% 13.83/2.74 |
% 13.83/2.74 | CLOSE: (4) is inconsistent.
% 13.83/2.74 |
% 13.83/2.74 End of proof
% 13.83/2.74 % SZS output end Proof for theBenchmark
% 13.83/2.74
% 13.83/2.74 2146ms
%------------------------------------------------------------------------------