TSTP Solution File: ARI233_1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : ARI233_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 : n006.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:22 EDT 2023

% Result   : Theorem 7.01s 1.68s
% Output   : Proof 7.49s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : ARI233_1 : TPTP v8.1.2. Released v5.0.0.
% 0.12/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n006.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Aug 29 18:33:36 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.65  ________       _____
% 0.20/0.65  ___  __ \_________(_)________________________________
% 0.20/0.65  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.20/0.65  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.20/0.65  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.20/0.65  
% 0.20/0.65  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.65  (2023-06-19)
% 0.20/0.65  
% 0.20/0.65  (c) Philipp Rümmer, 2009-2023
% 0.20/0.65  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.65                Amanda Stjerna.
% 0.20/0.65  Free software under BSD-3-Clause.
% 0.20/0.65  
% 0.20/0.65  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.65  
% 0.20/0.65  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.67  Running up to 7 provers in parallel.
% 0.58/0.68  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.58/0.68  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.58/0.68  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.58/0.68  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.58/0.68  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.58/0.68  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.58/0.68  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.70/0.93  Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.70/0.93  Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.70/0.93  Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.70/0.93  Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.70/0.93  Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.70/0.93  Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.70/0.93  Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation
% 2.13/1.02  Prover 4: Preprocessing ...
% 2.13/1.02  Prover 1: Preprocessing ...
% 2.70/1.06  Prover 2: Preprocessing ...
% 2.70/1.06  Prover 6: Preprocessing ...
% 2.70/1.06  Prover 3: Preprocessing ...
% 2.70/1.06  Prover 5: Preprocessing ...
% 2.70/1.06  Prover 0: Preprocessing ...
% 5.34/1.47  Prover 6: Proving ...
% 5.34/1.47  Prover 1: Constructing countermodel ...
% 5.80/1.51  Prover 4: Constructing countermodel ...
% 6.41/1.56  Prover 2: Proving ...
% 6.41/1.56  Prover 3: Constructing countermodel ...
% 6.41/1.57  Prover 0: Proving ...
% 7.01/1.65  Prover 5: Proving ...
% 7.01/1.67  Prover 1: Found proof (size 3)
% 7.01/1.67  Prover 4: Found proof (size 3)
% 7.01/1.67  Prover 4: proved (994ms)
% 7.01/1.67  Prover 1: proved (995ms)
% 7.01/1.67  Prover 3: stopped
% 7.01/1.67  Prover 6: stopped
% 7.01/1.67  Prover 0: proved (993ms)
% 7.01/1.67  Prover 2: stopped
% 7.01/1.67  Prover 5: stopped
% 7.01/1.68  
% 7.01/1.68  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.01/1.68  
% 7.01/1.68  % SZS output start Proof for theBenchmark
% 7.01/1.68  Assumptions after simplification:
% 7.01/1.68  ---------------------------------
% 7.01/1.68  
% 7.01/1.68    (rat_greatereq_problem_4)
% 7.01/1.70     ! [v0: $rat] :  ~ (rat_$greatereq(rat_19/25, v0) = 0)
% 7.01/1.70  
% 7.01/1.71    (input)
% 7.49/1.73     ~ (rat_very_large = rat_very_small) &  ~ (rat_very_large = rat_19/25) &  ~
% 7.49/1.73    (rat_very_large = rat_0) &  ~ (rat_very_small = rat_19/25) &  ~
% 7.49/1.73    (rat_very_small = rat_0) &  ~ (rat_19/25 = rat_0) & rat_$is_int(rat_19/25) = 1
% 7.49/1.73    & rat_$is_int(rat_0) = 0 & rat_$is_rat(rat_19/25) = 0 & rat_$is_rat(rat_0) = 0
% 7.49/1.73    & rat_$floor(rat_19/25) = rat_0 & rat_$floor(rat_0) = rat_0 &
% 7.49/1.73    rat_$ceiling(rat_0) = rat_0 & rat_$truncate(rat_19/25) = rat_0 &
% 7.49/1.73    rat_$truncate(rat_0) = rat_0 & rat_$round(rat_0) = rat_0 &
% 7.49/1.73    rat_$to_int(rat_19/25) = 0 & rat_$to_int(rat_0) = 0 & rat_$to_rat(rat_19/25) =
% 7.49/1.73    rat_19/25 & rat_$to_rat(rat_0) = rat_0 & rat_$to_real(rat_19/25) = real_19/25
% 7.49/1.73    & rat_$to_real(rat_0) = real_0 & int_$to_rat(0) = rat_0 & rat_$quotient(rat_0,
% 7.49/1.73      rat_19/25) = rat_0 & rat_$product(rat_19/25, rat_0) = rat_0 &
% 7.49/1.73    rat_$product(rat_0, rat_19/25) = rat_0 & rat_$product(rat_0, rat_0) = rat_0 &
% 7.49/1.73    rat_$difference(rat_19/25, rat_19/25) = rat_0 & rat_$difference(rat_19/25,
% 7.49/1.73      rat_0) = rat_19/25 & rat_$difference(rat_0, rat_0) = rat_0 &
% 7.49/1.73    rat_$uminus(rat_0) = rat_0 & rat_$sum(rat_19/25, rat_0) = rat_19/25 &
% 7.49/1.73    rat_$sum(rat_0, rat_19/25) = rat_19/25 & rat_$sum(rat_0, rat_0) = rat_0 &
% 7.49/1.73    rat_$lesseq(rat_very_small, rat_very_large) = 0 & rat_$lesseq(rat_19/25,
% 7.49/1.73      rat_19/25) = 0 & rat_$lesseq(rat_19/25, rat_0) = 1 & rat_$lesseq(rat_0,
% 7.49/1.73      rat_19/25) = 0 & rat_$lesseq(rat_0, rat_0) = 0 &
% 7.49/1.73    rat_$greater(rat_very_large, rat_19/25) = 0 & rat_$greater(rat_very_large,
% 7.49/1.73      rat_0) = 0 & rat_$greater(rat_very_small, rat_very_large) = 1 &
% 7.49/1.73    rat_$greater(rat_19/25, rat_very_small) = 0 & rat_$greater(rat_19/25,
% 7.49/1.73      rat_19/25) = 1 & rat_$greater(rat_19/25, rat_0) = 0 & rat_$greater(rat_0,
% 7.49/1.73      rat_very_small) = 0 & rat_$greater(rat_0, rat_19/25) = 1 &
% 7.49/1.73    rat_$greater(rat_0, rat_0) = 1 & rat_$less(rat_very_small, rat_very_large) = 0
% 7.49/1.73    & rat_$less(rat_very_small, rat_19/25) = 0 & rat_$less(rat_very_small, rat_0)
% 7.49/1.73    = 0 & rat_$less(rat_19/25, rat_very_large) = 0 & rat_$less(rat_19/25,
% 7.49/1.73      rat_19/25) = 1 & rat_$less(rat_19/25, rat_0) = 1 & rat_$less(rat_0,
% 7.49/1.73      rat_very_large) = 0 & rat_$less(rat_0, rat_19/25) = 0 & rat_$less(rat_0,
% 7.49/1.73      rat_0) = 1 & rat_$greatereq(rat_very_small, rat_very_large) = 1 &
% 7.49/1.73    rat_$greatereq(rat_19/25, rat_19/25) = 0 & rat_$greatereq(rat_19/25, rat_0) =
% 7.49/1.73    0 & rat_$greatereq(rat_0, rat_19/25) = 1 & rat_$greatereq(rat_0, rat_0) = 0 & 
% 7.49/1.73    ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: $rat] :  ! [v3: $rat] :  ! [v4: $rat] :
% 7.49/1.73    ( ~ (rat_$sum(v3, v0) = v4) |  ~ (rat_$sum(v2, v1) = v3) |  ? [v5: $rat] :
% 7.49/1.73      (rat_$sum(v2, v5) = v4 & rat_$sum(v1, v0) = v5)) &  ! [v0: $rat] :  ! [v1:
% 7.49/1.73      $rat] :  ! [v2: $rat] :  ! [v3: $rat] :  ! [v4: $rat] : ( ~ (rat_$sum(v2,
% 7.49/1.73          v3) = v4) |  ~ (rat_$sum(v1, v0) = v3) |  ? [v5: $rat] : (rat_$sum(v5,
% 7.49/1.73          v0) = v4 & rat_$sum(v2, v1) = v5)) &  ! [v0: $rat] :  ! [v1: $rat] :  !
% 7.49/1.73    [v2: $rat] :  ! [v3: int] : (v3 = 0 |  ~ (rat_$lesseq(v2, v1) = 0) |  ~
% 7.49/1.73      (rat_$lesseq(v2, v0) = v3) |  ? [v4: int] : ( ~ (v4 = 0) & rat_$lesseq(v1,
% 7.49/1.73          v0) = v4)) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: $rat] :  ! [v3:
% 7.49/1.73      int] : (v3 = 0 |  ~ (rat_$lesseq(v2, v1) = 0) |  ~ (rat_$less(v2, v0) = v3)
% 7.49/1.74      |  ? [v4: int] : ( ~ (v4 = 0) & rat_$less(v1, v0) = v4)) &  ! [v0: $rat] : 
% 7.49/1.74    ! [v1: $rat] :  ! [v2: $rat] :  ! [v3: int] : (v3 = 0 |  ~ (rat_$lesseq(v2,
% 7.49/1.74          v0) = v3) |  ~ (rat_$lesseq(v1, v0) = 0) |  ? [v4: int] : ( ~ (v4 = 0) &
% 7.49/1.74        rat_$lesseq(v2, v1) = v4)) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: $rat]
% 7.49/1.74    :  ! [v3: int] : (v3 = 0 |  ~ (rat_$lesseq(v1, v0) = 0) |  ~ (rat_$less(v2,
% 7.49/1.74          v0) = v3) |  ? [v4: int] : ( ~ (v4 = 0) & rat_$less(v2, v1) = v4)) &  !
% 7.49/1.74    [v0: $rat] :  ! [v1: $rat] :  ! [v2: $rat] :  ! [v3: int] : (v3 = 0 |  ~
% 7.49/1.74      (rat_$less(v2, v1) = 0) |  ~ (rat_$less(v2, v0) = v3) |  ? [v4: int] : ( ~
% 7.49/1.74        (v4 = 0) & rat_$lesseq(v1, v0) = v4)) &  ! [v0: $rat] :  ! [v1: $rat] :  !
% 7.49/1.74    [v2: $rat] :  ! [v3: int] : (v3 = 0 |  ~ (rat_$less(v2, v0) = v3) |  ~
% 7.49/1.74      (rat_$less(v1, v0) = 0) |  ? [v4: int] : ( ~ (v4 = 0) & rat_$lesseq(v2, v1)
% 7.49/1.74        = v4)) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: $rat] :  ! [v3: $rat] : (
% 7.49/1.74      ~ (rat_$uminus(v0) = v2) |  ~ (rat_$sum(v1, v2) = v3) | rat_$difference(v1,
% 7.49/1.74        v0) = v3) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: int] : (v2 = 0 | v1 =
% 7.49/1.74      v0 |  ~ (rat_$less(v1, v0) = v2) |  ? [v3: int] : ( ~ (v3 = 0) &
% 7.49/1.74        rat_$lesseq(v1, v0) = v3)) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: int]
% 7.49/1.74    : (v2 = 0 |  ~ (rat_$lesseq(v1, v0) = v2) |  ? [v3: int] : ( ~ (v3 = 0) &
% 7.49/1.74        rat_$less(v1, v0) = v3)) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: int] :
% 7.49/1.74    (v2 = 0 |  ~ (rat_$lesseq(v1, v0) = v2) |  ? [v3: int] : ( ~ (v3 = 0) &
% 7.49/1.74        rat_$greatereq(v0, v1) = v3)) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2:
% 7.49/1.74      int] : (v2 = 0 |  ~ (rat_$greater(v0, v1) = v2) |  ? [v3: int] : ( ~ (v3 =
% 7.49/1.74          0) & rat_$less(v1, v0) = v3)) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2:
% 7.49/1.74      int] : (v2 = 0 |  ~ (rat_$less(v1, v0) = v2) |  ? [v3: int] : ( ~ (v3 = 0) &
% 7.49/1.74        rat_$greater(v0, v1) = v3)) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: int]
% 7.49/1.74    : (v2 = 0 |  ~ (rat_$greatereq(v0, v1) = v2) |  ? [v3: int] : ( ~ (v3 = 0) &
% 7.49/1.74        rat_$lesseq(v1, v0) = v3)) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: $rat]
% 7.49/1.74    : (v0 = rat_0 |  ~ (rat_$product(v1, v0) = v2) | rat_$quotient(v2, v0) = v1) &
% 7.49/1.74     ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: $rat] : ( ~ (rat_$product(v1, v0) =
% 7.49/1.74        v2) | rat_$product(v0, v1) = v2) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2:
% 7.49/1.74      $rat] : ( ~ (rat_$product(v0, v1) = v2) | rat_$product(v1, v0) = v2) &  !
% 7.49/1.74    [v0: $rat] :  ! [v1: $rat] :  ! [v2: $rat] : ( ~ (rat_$difference(v1, v0) =
% 7.49/1.74        v2) |  ? [v3: $rat] : (rat_$uminus(v0) = v3 & rat_$sum(v1, v3) = v2)) &  !
% 7.49/1.74    [v0: $rat] :  ! [v1: $rat] :  ! [v2: $rat] : ( ~ (rat_$sum(v1, v0) = v2) |
% 7.49/1.74      rat_$sum(v0, v1) = v2) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: $rat] : ( ~
% 7.49/1.74      (rat_$sum(v0, v1) = v2) | rat_$sum(v1, v0) = v2) &  ! [v0: $rat] :  ! [v1:
% 7.49/1.74      $rat] :  ! [v2: $rat] : ( ~ (rat_$lesseq(v2, v1) = 0) |  ~ (rat_$lesseq(v1,
% 7.49/1.74          v0) = 0) | rat_$lesseq(v2, v0) = 0) &  ! [v0: $rat] :  ! [v1: $rat] :  !
% 7.49/1.74    [v2: $rat] : ( ~ (rat_$lesseq(v2, v1) = 0) |  ~ (rat_$less(v1, v0) = 0) |
% 7.49/1.74      rat_$less(v2, v0) = 0) &  ! [v0: $rat] :  ! [v1: $rat] :  ! [v2: $rat] : ( ~
% 7.49/1.74      (rat_$lesseq(v1, v0) = 0) |  ~ (rat_$less(v2, v1) = 0) | rat_$less(v2, v0) =
% 7.49/1.74      0) &  ! [v0: $rat] :  ! [v1: $rat] : (v1 = v0 |  ~ (rat_$sum(v0, rat_0) =
% 7.49/1.74        v1)) &  ! [v0: $rat] :  ! [v1: $rat] : (v1 = v0 |  ~ (rat_$lesseq(v1, v0)
% 7.49/1.74        = 0) | rat_$less(v1, v0) = 0) &  ! [v0: $rat] :  ! [v1: int] : (v1 = 0 | 
% 7.49/1.74      ~ (rat_$lesseq(v0, v0) = v1)) &  ! [v0: $rat] :  ! [v1: $rat] : ( ~
% 7.49/1.74      (rat_$uminus(v0) = v1) | rat_$uminus(v1) = v0) &  ! [v0: $rat] :  ! [v1:
% 7.49/1.74      $rat] : ( ~ (rat_$uminus(v0) = v1) | rat_$sum(v0, v1) = rat_0) &  ! [v0:
% 7.49/1.74      $rat] :  ! [v1: $rat] : ( ~ (rat_$lesseq(v1, v0) = 0) | rat_$greatereq(v0,
% 7.49/1.74        v1) = 0) &  ! [v0: $rat] :  ! [v1: $rat] : ( ~ (rat_$greater(v0, v1) = 0)
% 7.49/1.74      | rat_$less(v1, v0) = 0) &  ! [v0: $rat] :  ! [v1: $rat] : ( ~
% 7.49/1.74      (rat_$less(v1, v0) = 0) | rat_$lesseq(v1, v0) = 0) &  ! [v0: $rat] :  ! [v1:
% 7.49/1.74      $rat] : ( ~ (rat_$less(v1, v0) = 0) | rat_$greater(v0, v1) = 0) &  ! [v0:
% 7.49/1.74      $rat] :  ! [v1: MultipleValueBool] : ( ~ (rat_$less(v0, v0) = v1) |
% 7.49/1.74      rat_$lesseq(v0, v0) = 0) &  ! [v0: $rat] :  ! [v1: $rat] : ( ~
% 7.49/1.74      (rat_$greatereq(v0, v1) = 0) | rat_$lesseq(v1, v0) = 0) &  ! [v0: $rat] :
% 7.49/1.74    (v0 = rat_0 |  ~ (rat_$uminus(v0) = v0))
% 7.49/1.74  
% 7.49/1.74  Those formulas are unsatisfiable:
% 7.49/1.74  ---------------------------------
% 7.49/1.74  
% 7.49/1.74  Begin of proof
% 7.49/1.74  | 
% 7.49/1.74  | ALPHA: (input) implies:
% 7.49/1.74  |   (1)  rat_$greatereq(rat_19/25, rat_19/25) = 0
% 7.49/1.74  | 
% 7.49/1.74  | GROUND_INST: instantiating (rat_greatereq_problem_4) with rat_19/25,
% 7.49/1.74  |              simplifying with (1) gives:
% 7.49/1.74  |   (2)  $false
% 7.49/1.75  | 
% 7.49/1.75  | CLOSE: (2) is inconsistent.
% 7.49/1.75  | 
% 7.49/1.75  End of proof
% 7.49/1.75  % SZS output end Proof for theBenchmark
% 7.49/1.75  
% 7.49/1.75  1092ms
%------------------------------------------------------------------------------