TSTP Solution File: ARI350_1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : ARI350_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n016.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 17:47:43 EDT 2023

% Result   : Theorem 5.88s 1.58s
% Output   : Proof 6.73s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : ARI350_1 : TPTP v8.1.2. Released v5.0.0.
% 0.11/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34  % Computer : n016.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Aug 29 18:32:01 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.67/0.65  ________       _____
% 0.67/0.65  ___  __ \_________(_)________________________________
% 0.67/0.65  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.67/0.65  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.67/0.65  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.67/0.65  
% 0.67/0.65  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.67/0.65  (2023-06-19)
% 0.67/0.65  
% 0.67/0.65  (c) Philipp Rümmer, 2009-2023
% 0.67/0.65  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.67/0.65                Amanda Stjerna.
% 0.67/0.65  Free software under BSD-3-Clause.
% 0.67/0.65  
% 0.67/0.65  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.67/0.65  
% 0.67/0.65  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.67/0.67  Running up to 7 provers in parallel.
% 0.67/0.70  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.67/0.70  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.67/0.70  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.67/0.70  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.67/0.70  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.67/0.70  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.67/0.70  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.40/1.00  Prover 6: Warning: Problem contains reals, using incomplete axiomatisation
% 1.40/1.00  Prover 3: Warning: Problem contains reals, using incomplete axiomatisation
% 1.40/1.00  Prover 1: Warning: Problem contains reals, using incomplete axiomatisation
% 1.40/1.00  Prover 5: Warning: Problem contains reals, using incomplete axiomatisation
% 1.40/1.00  Prover 2: Warning: Problem contains reals, using incomplete axiomatisation
% 1.40/1.00  Prover 0: Warning: Problem contains reals, using incomplete axiomatisation
% 1.40/1.00  Prover 4: Warning: Problem contains reals, using incomplete axiomatisation
% 2.29/1.08  Prover 1: Preprocessing ...
% 2.29/1.09  Prover 4: Preprocessing ...
% 2.29/1.13  Prover 5: Preprocessing ...
% 2.29/1.13  Prover 2: Preprocessing ...
% 2.29/1.13  Prover 0: Preprocessing ...
% 2.29/1.13  Prover 6: Preprocessing ...
% 2.29/1.13  Prover 3: Preprocessing ...
% 5.17/1.47  Prover 5: Proving ...
% 5.17/1.47  Prover 6: Proving ...
% 5.17/1.47  Prover 3: Constructing countermodel ...
% 5.17/1.47  Prover 1: Constructing countermodel ...
% 5.17/1.49  Prover 2: Proving ...
% 5.17/1.53  Prover 4: Constructing countermodel ...
% 5.17/1.56  Prover 0: Proving ...
% 5.88/1.57  Prover 2: proved (888ms)
% 5.88/1.57  Prover 5: proved (883ms)
% 5.88/1.57  
% 5.88/1.58  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.88/1.58  
% 5.88/1.58  
% 5.88/1.58  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.88/1.58  
% 5.88/1.59  Prover 3: stopped
% 5.88/1.59  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.88/1.59  Prover 7: Warning: Problem contains reals, using incomplete axiomatisation
% 5.88/1.59  Prover 0: stopped
% 5.88/1.59  Prover 6: stopped
% 5.88/1.59  Prover 7: Preprocessing ...
% 5.88/1.59  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.88/1.59  Prover 8: Warning: Problem contains reals, using incomplete axiomatisation
% 5.88/1.59  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.88/1.59  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.88/1.59  Prover 10: Warning: Problem contains reals, using incomplete axiomatisation
% 5.88/1.59  Prover 11: Warning: Problem contains reals, using incomplete axiomatisation
% 5.88/1.59  Prover 8: Preprocessing ...
% 6.10/1.60  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.10/1.60  Prover 13: Warning: Problem contains reals, using incomplete axiomatisation
% 6.10/1.60  Prover 11: Preprocessing ...
% 6.10/1.60  Prover 10: Preprocessing ...
% 6.10/1.61  Prover 1: Found proof (size 3)
% 6.10/1.61  Prover 4: Found proof (size 3)
% 6.10/1.61  Prover 1: proved (924ms)
% 6.10/1.61  Prover 4: proved (919ms)
% 6.10/1.61  Prover 7: stopped
% 6.10/1.61  Prover 13: Preprocessing ...
% 6.10/1.62  Prover 10: stopped
% 6.32/1.63  Prover 11: stopped
% 6.32/1.63  Prover 13: stopped
% 6.32/1.68  Prover 8: Warning: ignoring some quantifiers
% 6.32/1.69  Prover 8: Constructing countermodel ...
% 6.32/1.70  Prover 8: stopped
% 6.32/1.70  
% 6.32/1.70  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.32/1.70  
% 6.32/1.70  % SZS output start Proof for theBenchmark
% 6.32/1.70  Assumptions after simplification:
% 6.32/1.70  ---------------------------------
% 6.32/1.70  
% 6.32/1.70    (real_less_problem_6)
% 6.73/1.73     ! [v0: $real] :  ! [v1: $real] :  ~ (real_$less(v0, v1) = 0)
% 6.73/1.73  
% 6.73/1.73    (input)
% 6.73/1.76     ~ (real_very_large = real_very_small) &  ~ (real_very_large = real_0) &  ~
% 6.73/1.76    (real_very_small = real_0) & real_$is_int(real_0) = 0 & real_$is_rat(real_0) =
% 6.73/1.76    0 & real_$floor(real_0) = real_0 & real_$ceiling(real_0) = real_0 &
% 6.73/1.76    real_$truncate(real_0) = real_0 & real_$round(real_0) = real_0 &
% 6.73/1.76    real_$to_int(real_0) = 0 & real_$to_rat(real_0) = rat_0 &
% 6.73/1.76    real_$to_real(real_0) = real_0 & int_$to_real(0) = real_0 &
% 6.73/1.76    real_$product(real_0, real_0) = real_0 & real_$difference(real_0, real_0) =
% 6.73/1.76    real_0 & real_$uminus(real_0) = real_0 & real_$sum(real_0, real_0) = real_0 &
% 6.73/1.76    real_$greatereq(real_very_small, real_very_large) = 1 &
% 6.73/1.76    real_$greatereq(real_0, real_0) = 0 & real_$lesseq(real_very_small,
% 6.73/1.76      real_very_large) = 0 & real_$lesseq(real_0, real_0) = 0 &
% 6.73/1.76    real_$greater(real_very_large, real_0) = 0 & real_$greater(real_very_small,
% 6.73/1.76      real_very_large) = 1 & real_$greater(real_0, real_very_small) = 0 &
% 6.73/1.76    real_$greater(real_0, real_0) = 1 & real_$less(real_very_small,
% 6.73/1.76      real_very_large) = 0 & real_$less(real_very_small, real_0) = 0 &
% 6.73/1.76    real_$less(real_0, real_very_large) = 0 & real_$less(real_0, real_0) = 1 &  !
% 6.73/1.76    [v0: $real] :  ! [v1: $real] :  ! [v2: $real] :  ! [v3: $real] :  ! [v4:
% 6.73/1.76      $real] : ( ~ (real_$sum(v3, v0) = v4) |  ~ (real_$sum(v2, v1) = v3) |  ?
% 6.73/1.76      [v5: $real] : (real_$sum(v2, v5) = v4 & real_$sum(v1, v0) = v5)) &  ! [v0:
% 6.73/1.76      $real] :  ! [v1: $real] :  ! [v2: $real] :  ! [v3: $real] :  ! [v4: $real] :
% 6.73/1.76    ( ~ (real_$sum(v2, v3) = v4) |  ~ (real_$sum(v1, v0) = v3) |  ? [v5: $real] :
% 6.73/1.76      (real_$sum(v5, v0) = v4 & real_$sum(v2, v1) = v5)) &  ! [v0: $real] :  !
% 6.73/1.76    [v1: $real] :  ! [v2: $real] :  ! [v3: int] : (v3 = 0 |  ~ (real_$lesseq(v2,
% 6.73/1.76          v1) = 0) |  ~ (real_$lesseq(v2, v0) = v3) |  ? [v4: int] : ( ~ (v4 = 0)
% 6.73/1.76        & real_$lesseq(v1, v0) = v4)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2:
% 6.73/1.76      $real] :  ! [v3: int] : (v3 = 0 |  ~ (real_$lesseq(v2, v1) = 0) |  ~
% 6.73/1.76      (real_$less(v2, v0) = v3) |  ? [v4: int] : ( ~ (v4 = 0) & real_$less(v1, v0)
% 6.73/1.76        = v4)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2: $real] :  ! [v3: int] :
% 6.73/1.76    (v3 = 0 |  ~ (real_$lesseq(v2, v0) = v3) |  ~ (real_$lesseq(v1, v0) = 0) |  ?
% 6.73/1.76      [v4: int] : ( ~ (v4 = 0) & real_$lesseq(v2, v1) = v4)) &  ! [v0: $real] :  !
% 6.73/1.76    [v1: $real] :  ! [v2: $real] :  ! [v3: int] : (v3 = 0 |  ~ (real_$lesseq(v1,
% 6.73/1.76          v0) = 0) |  ~ (real_$less(v2, v0) = v3) |  ? [v4: int] : ( ~ (v4 = 0) &
% 6.73/1.76        real_$less(v2, v1) = v4)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2:
% 6.73/1.76      $real] :  ! [v3: int] : (v3 = 0 |  ~ (real_$less(v2, v1) = 0) |  ~
% 6.73/1.76      (real_$less(v2, v0) = v3) |  ? [v4: int] : ( ~ (v4 = 0) & real_$lesseq(v1,
% 6.73/1.76          v0) = v4)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2: $real] :  ! [v3:
% 6.73/1.76      int] : (v3 = 0 |  ~ (real_$less(v2, v0) = v3) |  ~ (real_$less(v1, v0) = 0)
% 6.73/1.76      |  ? [v4: int] : ( ~ (v4 = 0) & real_$lesseq(v2, v1) = v4)) &  ! [v0: $real]
% 6.73/1.76    :  ! [v1: $real] :  ! [v2: $real] :  ! [v3: $real] : ( ~ (real_$uminus(v0) =
% 6.73/1.76        v2) |  ~ (real_$sum(v1, v2) = v3) | real_$difference(v1, v0) = v3) &  !
% 6.73/1.76    [v0: $real] :  ! [v1: $real] :  ! [v2: int] : (v2 = 0 | v1 = v0 |  ~
% 6.73/1.76      (real_$less(v1, v0) = v2) |  ? [v3: int] : ( ~ (v3 = 0) & real_$lesseq(v1,
% 6.73/1.77          v0) = v3)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2: int] : (v2 = 0 | 
% 6.73/1.77      ~ (real_$greatereq(v0, v1) = v2) |  ? [v3: int] : ( ~ (v3 = 0) &
% 6.73/1.77        real_$lesseq(v1, v0) = v3)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2:
% 6.73/1.77      int] : (v2 = 0 |  ~ (real_$lesseq(v1, v0) = v2) |  ? [v3: int] : ( ~ (v3 =
% 6.73/1.77          0) & real_$greatereq(v0, v1) = v3)) &  ! [v0: $real] :  ! [v1: $real] : 
% 6.73/1.77    ! [v2: int] : (v2 = 0 |  ~ (real_$lesseq(v1, v0) = v2) |  ? [v3: int] : ( ~
% 6.73/1.77        (v3 = 0) & real_$less(v1, v0) = v3)) &  ! [v0: $real] :  ! [v1: $real] : 
% 6.73/1.77    ! [v2: int] : (v2 = 0 |  ~ (real_$greater(v0, v1) = v2) |  ? [v3: int] : ( ~
% 6.73/1.77        (v3 = 0) & real_$less(v1, v0) = v3)) &  ! [v0: $real] :  ! [v1: $real] : 
% 6.73/1.77    ! [v2: int] : (v2 = 0 |  ~ (real_$less(v1, v0) = v2) |  ? [v3: int] : ( ~ (v3
% 6.73/1.77          = 0) & real_$greater(v0, v1) = v3)) &  ! [v0: $real] :  ! [v1: $real] : 
% 6.73/1.77    ! [v2: $real] : (v0 = real_0 |  ~ (real_$product(v1, v0) = v2) |
% 6.73/1.77      real_$quotient(v2, v0) = v1) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2:
% 6.73/1.77      $real] : ( ~ (real_$product(v1, v0) = v2) | real_$product(v0, v1) = v2) &  !
% 6.73/1.77    [v0: $real] :  ! [v1: $real] :  ! [v2: $real] : ( ~ (real_$product(v0, v1) =
% 6.73/1.77        v2) | real_$product(v1, v0) = v2) &  ! [v0: $real] :  ! [v1: $real] :  !
% 6.73/1.77    [v2: $real] : ( ~ (real_$difference(v1, v0) = v2) |  ? [v3: $real] :
% 6.73/1.77      (real_$uminus(v0) = v3 & real_$sum(v1, v3) = v2)) &  ! [v0: $real] :  ! [v1:
% 6.73/1.77      $real] :  ! [v2: $real] : ( ~ (real_$sum(v1, v0) = v2) | real_$sum(v0, v1) =
% 6.73/1.77      v2) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2: $real] : ( ~ (real_$sum(v0,
% 6.73/1.77          v1) = v2) | real_$sum(v1, v0) = v2) &  ! [v0: $real] :  ! [v1: $real] : 
% 6.73/1.77    ! [v2: $real] : ( ~ (real_$lesseq(v2, v1) = 0) |  ~ (real_$lesseq(v1, v0) = 0)
% 6.73/1.77      | real_$lesseq(v2, v0) = 0) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2:
% 6.73/1.77      $real] : ( ~ (real_$lesseq(v2, v1) = 0) |  ~ (real_$less(v1, v0) = 0) |
% 6.73/1.77      real_$less(v2, v0) = 0) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2: $real] :
% 6.73/1.77    ( ~ (real_$lesseq(v1, v0) = 0) |  ~ (real_$less(v2, v1) = 0) | real_$less(v2,
% 6.73/1.77        v0) = 0) &  ! [v0: $real] :  ! [v1: $real] : (v1 = v0 |  ~ (real_$sum(v0,
% 6.73/1.77          real_0) = v1)) &  ! [v0: $real] :  ! [v1: $real] : (v1 = v0 |  ~
% 6.73/1.77      (real_$lesseq(v1, v0) = 0) | real_$less(v1, v0) = 0) &  ! [v0: $real] :  !
% 6.73/1.77    [v1: int] : (v1 = 0 |  ~ (real_$lesseq(v0, v0) = v1)) &  ! [v0: $real] :  !
% 6.73/1.77    [v1: $real] : ( ~ (real_$uminus(v0) = v1) | real_$uminus(v1) = v0) &  ! [v0:
% 6.73/1.77      $real] :  ! [v1: $real] : ( ~ (real_$uminus(v0) = v1) | real_$sum(v0, v1) =
% 6.73/1.77      real_0) &  ! [v0: $real] :  ! [v1: $real] : ( ~ (real_$greatereq(v0, v1) =
% 6.73/1.77        0) | real_$lesseq(v1, v0) = 0) &  ! [v0: $real] :  ! [v1: $real] : ( ~
% 6.73/1.77      (real_$lesseq(v1, v0) = 0) | real_$greatereq(v0, v1) = 0) &  ! [v0: $real] :
% 6.73/1.77     ! [v1: $real] : ( ~ (real_$greater(v0, v1) = 0) | real_$less(v1, v0) = 0) & 
% 6.73/1.77    ! [v0: $real] :  ! [v1: $real] : ( ~ (real_$less(v1, v0) = 0) |
% 6.73/1.77      real_$lesseq(v1, v0) = 0) &  ! [v0: $real] :  ! [v1: $real] : ( ~
% 6.73/1.77      (real_$less(v1, v0) = 0) | real_$greater(v0, v1) = 0) &  ! [v0: $real] :  !
% 6.73/1.77    [v1: MultipleValueBool] : ( ~ (real_$less(v0, v0) = v1) | real_$lesseq(v0, v0)
% 6.73/1.77      = 0) &  ! [v0: $real] : (v0 = real_0 |  ~ (real_$uminus(v0) = v0))
% 6.73/1.77  
% 6.73/1.77  Those formulas are unsatisfiable:
% 6.73/1.77  ---------------------------------
% 6.73/1.77  
% 6.73/1.77  Begin of proof
% 6.73/1.77  | 
% 6.73/1.77  | ALPHA: (input) implies:
% 6.73/1.77  |   (1)  real_$less(real_very_small, real_very_large) = 0
% 6.73/1.77  | 
% 6.73/1.77  | GROUND_INST: instantiating (real_less_problem_6) with real_very_small,
% 6.73/1.77  |              real_very_large, simplifying with (1) gives:
% 6.73/1.77  |   (2)  $false
% 6.73/1.77  | 
% 6.73/1.77  | CLOSE: (2) is inconsistent.
% 6.73/1.77  | 
% 6.73/1.77  End of proof
% 6.73/1.77  % SZS output end Proof for theBenchmark
% 6.73/1.77  
% 6.73/1.77  1120ms
%------------------------------------------------------------------------------