TSTP Solution File: ARI349_1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : ARI349_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 : 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 : Wed Aug 30 17:47:43 EDT 2023

% Result   : Theorem 7.09s 1.63s
% Output   : Proof 7.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ARI349_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35  % Computer : n021.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % 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 18:32:59 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.45/0.62  ________       _____
% 0.45/0.62  ___  __ \_________(_)________________________________
% 0.45/0.62  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.45/0.62  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.45/0.62  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.45/0.62  
% 0.45/0.62  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.45/0.62  (2023-06-19)
% 0.45/0.62  
% 0.45/0.62  (c) Philipp Rümmer, 2009-2023
% 0.45/0.62  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.45/0.62                Amanda Stjerna.
% 0.45/0.62  Free software under BSD-3-Clause.
% 0.45/0.62  
% 0.45/0.62  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.45/0.62  
% 0.45/0.62  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.45/0.63  Running up to 7 provers in parallel.
% 0.45/0.64  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.45/0.64  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.45/0.64  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.45/0.64  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.45/0.64  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.45/0.64  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.45/0.64  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 1.60/0.90  Prover 5: Warning: Problem contains reals, using incomplete axiomatisation
% 1.60/0.90  Prover 3: Warning: Problem contains reals, using incomplete axiomatisation
% 1.60/0.90  Prover 0: Warning: Problem contains reals, using incomplete axiomatisation
% 1.60/0.90  Prover 6: Warning: Problem contains reals, using incomplete axiomatisation
% 1.60/0.90  Prover 2: Warning: Problem contains reals, using incomplete axiomatisation
% 1.60/0.90  Prover 1: Warning: Problem contains reals, using incomplete axiomatisation
% 1.60/0.90  Prover 4: Warning: Problem contains reals, using incomplete axiomatisation
% 1.86/0.98  Prover 1: Preprocessing ...
% 1.86/0.99  Prover 4: Preprocessing ...
% 2.55/1.03  Prover 6: Preprocessing ...
% 2.55/1.03  Prover 2: Preprocessing ...
% 2.55/1.03  Prover 3: Preprocessing ...
% 2.55/1.03  Prover 0: Preprocessing ...
% 2.55/1.03  Prover 5: Preprocessing ...
% 4.86/1.46  Prover 1: Constructing countermodel ...
% 5.88/1.47  Prover 4: Constructing countermodel ...
% 5.88/1.48  Prover 6: Proving ...
% 5.88/1.52  Prover 0: Proving ...
% 5.88/1.52  Prover 3: Constructing countermodel ...
% 6.48/1.55  Prover 2: Proving ...
% 6.71/1.59  Prover 5: Proving ...
% 6.71/1.62  Prover 4: Found proof (size 3)
% 6.71/1.62  Prover 4: proved (986ms)
% 7.09/1.63  Prover 3: stopped
% 7.09/1.63  Prover 1: stopped
% 7.09/1.63  Prover 0: stopped
% 7.09/1.63  Prover 2: stopped
% 7.09/1.63  Prover 6: stopped
% 7.09/1.63  Prover 5: stopped
% 7.09/1.63  
% 7.09/1.63  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.09/1.63  
% 7.09/1.63  % SZS output start Proof for theBenchmark
% 7.09/1.63  Assumptions after simplification:
% 7.09/1.63  ---------------------------------
% 7.09/1.63  
% 7.09/1.63    (real_less_problem_5)
% 7.19/1.66     ! [v0: $real] :  ~ (real_$less(real_7, v0) = 0)
% 7.19/1.66  
% 7.19/1.66    (input)
% 7.19/1.69     ~ (real_very_large = real_very_small) &  ~ (real_very_large = real_7) &  ~
% 7.19/1.69    (real_very_large = real_0) &  ~ (real_very_small = real_7) &  ~
% 7.19/1.69    (real_very_small = real_0) &  ~ (real_7 = real_0) & real_$is_int(real_7) = 0 &
% 7.19/1.69    real_$is_int(real_0) = 0 & real_$is_rat(real_7) = 0 & real_$is_rat(real_0) = 0
% 7.19/1.69    & real_$floor(real_7) = real_7 & real_$floor(real_0) = real_0 &
% 7.19/1.69    real_$ceiling(real_7) = real_7 & real_$ceiling(real_0) = real_0 &
% 7.19/1.69    real_$truncate(real_7) = real_7 & real_$truncate(real_0) = real_0 &
% 7.19/1.69    real_$round(real_7) = real_7 & real_$round(real_0) = real_0 &
% 7.19/1.69    real_$to_int(real_7) = 7 & real_$to_int(real_0) = 0 & real_$to_rat(real_7) =
% 7.19/1.69    rat_7 & real_$to_rat(real_0) = rat_0 & real_$to_real(real_7) = real_7 &
% 7.19/1.69    real_$to_real(real_0) = real_0 & int_$to_real(7) = real_7 & int_$to_real(0) =
% 7.19/1.69    real_0 & real_$quotient(real_0, real_7) = real_0 & real_$product(real_7,
% 7.19/1.69      real_0) = real_0 & real_$product(real_0, real_7) = real_0 &
% 7.19/1.69    real_$product(real_0, real_0) = real_0 & real_$difference(real_7, real_7) =
% 7.19/1.69    real_0 & real_$difference(real_7, real_0) = real_7 & real_$difference(real_0,
% 7.19/1.69      real_0) = real_0 & real_$uminus(real_0) = real_0 & real_$sum(real_7, real_0)
% 7.19/1.69    = real_7 & real_$sum(real_0, real_7) = real_7 & real_$sum(real_0, real_0) =
% 7.19/1.69    real_0 & real_$greatereq(real_very_small, real_very_large) = 1 &
% 7.19/1.69    real_$greatereq(real_7, real_7) = 0 & real_$greatereq(real_7, real_0) = 0 &
% 7.19/1.69    real_$greatereq(real_0, real_7) = 1 & real_$greatereq(real_0, real_0) = 0 &
% 7.19/1.69    real_$lesseq(real_very_small, real_very_large) = 0 & real_$lesseq(real_7,
% 7.19/1.69      real_7) = 0 & real_$lesseq(real_7, real_0) = 1 & real_$lesseq(real_0,
% 7.19/1.69      real_7) = 0 & real_$lesseq(real_0, real_0) = 0 &
% 7.19/1.69    real_$greater(real_very_large, real_7) = 0 & real_$greater(real_very_large,
% 7.19/1.69      real_0) = 0 & real_$greater(real_very_small, real_very_large) = 1 &
% 7.19/1.69    real_$greater(real_7, real_very_small) = 0 & real_$greater(real_7, real_7) = 1
% 7.19/1.69    & real_$greater(real_7, real_0) = 0 & real_$greater(real_0, real_very_small) =
% 7.19/1.69    0 & real_$greater(real_0, real_7) = 1 & real_$greater(real_0, real_0) = 1 &
% 7.19/1.69    real_$less(real_very_small, real_very_large) = 0 & real_$less(real_very_small,
% 7.19/1.69      real_7) = 0 & real_$less(real_very_small, real_0) = 0 & real_$less(real_7,
% 7.19/1.69      real_very_large) = 0 & real_$less(real_7, real_7) = 1 & real_$less(real_7,
% 7.19/1.69      real_0) = 1 & real_$less(real_0, real_very_large) = 0 & real_$less(real_0,
% 7.19/1.69      real_7) = 0 & real_$less(real_0, real_0) = 1 &  ! [v0: $real] :  ! [v1:
% 7.19/1.69      $real] :  ! [v2: $real] :  ! [v3: $real] :  ! [v4: $real] : ( ~
% 7.19/1.69      (real_$sum(v3, v0) = v4) |  ~ (real_$sum(v2, v1) = v3) |  ? [v5: $real] :
% 7.19/1.69      (real_$sum(v2, v5) = v4 & real_$sum(v1, v0) = v5)) &  ! [v0: $real] :  !
% 7.19/1.69    [v1: $real] :  ! [v2: $real] :  ! [v3: $real] :  ! [v4: $real] : ( ~
% 7.19/1.69      (real_$sum(v2, v3) = v4) |  ~ (real_$sum(v1, v0) = v3) |  ? [v5: $real] :
% 7.19/1.69      (real_$sum(v5, v0) = v4 & real_$sum(v2, v1) = v5)) &  ! [v0: $real] :  !
% 7.19/1.69    [v1: $real] :  ! [v2: $real] :  ! [v3: int] : (v3 = 0 |  ~ (real_$lesseq(v2,
% 7.19/1.69          v1) = 0) |  ~ (real_$lesseq(v2, v0) = v3) |  ? [v4: int] : ( ~ (v4 = 0)
% 7.19/1.69        & real_$lesseq(v1, v0) = v4)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2:
% 7.19/1.69      $real] :  ! [v3: int] : (v3 = 0 |  ~ (real_$lesseq(v2, v1) = 0) |  ~
% 7.19/1.69      (real_$less(v2, v0) = v3) |  ? [v4: int] : ( ~ (v4 = 0) & real_$less(v1, v0)
% 7.19/1.69        = v4)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2: $real] :  ! [v3: int] :
% 7.19/1.69    (v3 = 0 |  ~ (real_$lesseq(v2, v0) = v3) |  ~ (real_$lesseq(v1, v0) = 0) |  ?
% 7.19/1.69      [v4: int] : ( ~ (v4 = 0) & real_$lesseq(v2, v1) = v4)) &  ! [v0: $real] :  !
% 7.19/1.69    [v1: $real] :  ! [v2: $real] :  ! [v3: int] : (v3 = 0 |  ~ (real_$lesseq(v1,
% 7.19/1.69          v0) = 0) |  ~ (real_$less(v2, v0) = v3) |  ? [v4: int] : ( ~ (v4 = 0) &
% 7.19/1.69        real_$less(v2, v1) = v4)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2:
% 7.19/1.69      $real] :  ! [v3: int] : (v3 = 0 |  ~ (real_$less(v2, v1) = 0) |  ~
% 7.19/1.69      (real_$less(v2, v0) = v3) |  ? [v4: int] : ( ~ (v4 = 0) & real_$lesseq(v1,
% 7.19/1.69          v0) = v4)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2: $real] :  ! [v3:
% 7.19/1.69      int] : (v3 = 0 |  ~ (real_$less(v2, v0) = v3) |  ~ (real_$less(v1, v0) = 0)
% 7.19/1.69      |  ? [v4: int] : ( ~ (v4 = 0) & real_$lesseq(v2, v1) = v4)) &  ! [v0: $real]
% 7.19/1.69    :  ! [v1: $real] :  ! [v2: $real] :  ! [v3: $real] : ( ~ (real_$uminus(v0) =
% 7.19/1.69        v2) |  ~ (real_$sum(v1, v2) = v3) | real_$difference(v1, v0) = v3) &  !
% 7.19/1.69    [v0: $real] :  ! [v1: $real] :  ! [v2: int] : (v2 = 0 | v1 = v0 |  ~
% 7.19/1.69      (real_$less(v1, v0) = v2) |  ? [v3: int] : ( ~ (v3 = 0) & real_$lesseq(v1,
% 7.19/1.69          v0) = v3)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2: int] : (v2 = 0 | 
% 7.19/1.69      ~ (real_$greatereq(v0, v1) = v2) |  ? [v3: int] : ( ~ (v3 = 0) &
% 7.19/1.69        real_$lesseq(v1, v0) = v3)) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2:
% 7.19/1.69      int] : (v2 = 0 |  ~ (real_$lesseq(v1, v0) = v2) |  ? [v3: int] : ( ~ (v3 =
% 7.19/1.69          0) & real_$greatereq(v0, v1) = v3)) &  ! [v0: $real] :  ! [v1: $real] : 
% 7.19/1.69    ! [v2: int] : (v2 = 0 |  ~ (real_$lesseq(v1, v0) = v2) |  ? [v3: int] : ( ~
% 7.19/1.69        (v3 = 0) & real_$less(v1, v0) = v3)) &  ! [v0: $real] :  ! [v1: $real] : 
% 7.19/1.69    ! [v2: int] : (v2 = 0 |  ~ (real_$greater(v0, v1) = v2) |  ? [v3: int] : ( ~
% 7.19/1.69        (v3 = 0) & real_$less(v1, v0) = v3)) &  ! [v0: $real] :  ! [v1: $real] : 
% 7.19/1.69    ! [v2: int] : (v2 = 0 |  ~ (real_$less(v1, v0) = v2) |  ? [v3: int] : ( ~ (v3
% 7.19/1.69          = 0) & real_$greater(v0, v1) = v3)) &  ! [v0: $real] :  ! [v1: $real] : 
% 7.19/1.69    ! [v2: $real] : (v0 = real_0 |  ~ (real_$product(v1, v0) = v2) |
% 7.19/1.69      real_$quotient(v2, v0) = v1) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2:
% 7.19/1.69      $real] : ( ~ (real_$product(v1, v0) = v2) | real_$product(v0, v1) = v2) &  !
% 7.19/1.69    [v0: $real] :  ! [v1: $real] :  ! [v2: $real] : ( ~ (real_$product(v0, v1) =
% 7.19/1.69        v2) | real_$product(v1, v0) = v2) &  ! [v0: $real] :  ! [v1: $real] :  !
% 7.19/1.69    [v2: $real] : ( ~ (real_$difference(v1, v0) = v2) |  ? [v3: $real] :
% 7.19/1.69      (real_$uminus(v0) = v3 & real_$sum(v1, v3) = v2)) &  ! [v0: $real] :  ! [v1:
% 7.19/1.69      $real] :  ! [v2: $real] : ( ~ (real_$sum(v1, v0) = v2) | real_$sum(v0, v1) =
% 7.19/1.69      v2) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2: $real] : ( ~ (real_$sum(v0,
% 7.19/1.69          v1) = v2) | real_$sum(v1, v0) = v2) &  ! [v0: $real] :  ! [v1: $real] : 
% 7.19/1.69    ! [v2: $real] : ( ~ (real_$lesseq(v2, v1) = 0) |  ~ (real_$lesseq(v1, v0) = 0)
% 7.19/1.69      | real_$lesseq(v2, v0) = 0) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2:
% 7.19/1.69      $real] : ( ~ (real_$lesseq(v2, v1) = 0) |  ~ (real_$less(v1, v0) = 0) |
% 7.19/1.69      real_$less(v2, v0) = 0) &  ! [v0: $real] :  ! [v1: $real] :  ! [v2: $real] :
% 7.19/1.69    ( ~ (real_$lesseq(v1, v0) = 0) |  ~ (real_$less(v2, v1) = 0) | real_$less(v2,
% 7.19/1.69        v0) = 0) &  ! [v0: $real] :  ! [v1: $real] : (v1 = v0 |  ~ (real_$sum(v0,
% 7.19/1.69          real_0) = v1)) &  ! [v0: $real] :  ! [v1: $real] : (v1 = v0 |  ~
% 7.19/1.69      (real_$lesseq(v1, v0) = 0) | real_$less(v1, v0) = 0) &  ! [v0: $real] :  !
% 7.19/1.69    [v1: int] : (v1 = 0 |  ~ (real_$lesseq(v0, v0) = v1)) &  ! [v0: $real] :  !
% 7.19/1.69    [v1: $real] : ( ~ (real_$uminus(v0) = v1) | real_$uminus(v1) = v0) &  ! [v0:
% 7.19/1.69      $real] :  ! [v1: $real] : ( ~ (real_$uminus(v0) = v1) | real_$sum(v0, v1) =
% 7.19/1.69      real_0) &  ! [v0: $real] :  ! [v1: $real] : ( ~ (real_$greatereq(v0, v1) =
% 7.19/1.69        0) | real_$lesseq(v1, v0) = 0) &  ! [v0: $real] :  ! [v1: $real] : ( ~
% 7.19/1.69      (real_$lesseq(v1, v0) = 0) | real_$greatereq(v0, v1) = 0) &  ! [v0: $real] :
% 7.19/1.69     ! [v1: $real] : ( ~ (real_$greater(v0, v1) = 0) | real_$less(v1, v0) = 0) & 
% 7.19/1.69    ! [v0: $real] :  ! [v1: $real] : ( ~ (real_$less(v1, v0) = 0) |
% 7.19/1.69      real_$lesseq(v1, v0) = 0) &  ! [v0: $real] :  ! [v1: $real] : ( ~
% 7.19/1.69      (real_$less(v1, v0) = 0) | real_$greater(v0, v1) = 0) &  ! [v0: $real] :  !
% 7.19/1.69    [v1: MultipleValueBool] : ( ~ (real_$less(v0, v0) = v1) | real_$lesseq(v0, v0)
% 7.19/1.69      = 0) &  ! [v0: $real] : (v0 = real_0 |  ~ (real_$uminus(v0) = v0))
% 7.19/1.69  
% 7.19/1.69  Those formulas are unsatisfiable:
% 7.19/1.69  ---------------------------------
% 7.19/1.69  
% 7.19/1.69  Begin of proof
% 7.19/1.69  | 
% 7.19/1.70  | ALPHA: (input) implies:
% 7.19/1.70  |   (1)  real_$less(real_7, real_very_large) = 0
% 7.19/1.70  | 
% 7.19/1.70  | GROUND_INST: instantiating (real_less_problem_5) with real_very_large,
% 7.19/1.70  |              simplifying with (1) gives:
% 7.19/1.70  |   (2)  $false
% 7.19/1.70  | 
% 7.19/1.70  | CLOSE: (2) is inconsistent.
% 7.19/1.70  | 
% 7.19/1.70  End of proof
% 7.19/1.70  % SZS output end Proof for theBenchmark
% 7.19/1.70  
% 7.19/1.70  1084ms
%------------------------------------------------------------------------------