TSTP Solution File: ARI209_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI209_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 : n002.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:17 EDT 2023
% Result : Theorem 6.25s 1.64s
% Output : Proof 9.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : ARI209_1 : TPTP v8.1.2. Released v5.0.0.
% 0.09/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.10/0.32 % Computer : n002.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.16/0.32 % WCLimit : 300
% 0.16/0.32 % DateTime : Tue Aug 29 19:05:50 EDT 2023
% 0.16/0.32 % CPUTime :
% 0.16/0.58 ________ _____
% 0.16/0.58 ___ __ \_________(_)________________________________
% 0.16/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.16/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.16/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.16/0.58
% 0.16/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.16/0.58 (2023-06-19)
% 0.16/0.58
% 0.16/0.58 (c) Philipp Rümmer, 2009-2023
% 0.16/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.16/0.58 Amanda Stjerna.
% 0.16/0.59 Free software under BSD-3-Clause.
% 0.16/0.59
% 0.16/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.16/0.59
% 0.16/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.16/0.60 Running up to 7 provers in parallel.
% 0.16/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.16/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.16/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.16/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.16/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.16/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.16/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.32/0.92 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.32/0.92 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.32/0.92 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.32/0.93 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.32/0.93 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.32/0.93 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.32/0.93 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation
% 2.01/0.99 Prover 4: Preprocessing ...
% 2.01/0.99 Prover 1: Preprocessing ...
% 2.30/1.07 Prover 3: Preprocessing ...
% 2.30/1.07 Prover 6: Preprocessing ...
% 2.30/1.07 Prover 2: Preprocessing ...
% 2.30/1.07 Prover 0: Preprocessing ...
% 2.30/1.07 Prover 5: Preprocessing ...
% 5.69/1.58 Prover 6: Constructing countermodel ...
% 6.25/1.62 Prover 2: Constructing countermodel ...
% 6.25/1.64 Prover 6: proved (1022ms)
% 6.25/1.64 Prover 2: proved (1027ms)
% 6.25/1.64
% 6.25/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.25/1.64
% 6.25/1.64
% 6.25/1.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.25/1.64
% 6.25/1.65 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.25/1.65 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation
% 6.25/1.65 Prover 5: Constructing countermodel ...
% 6.25/1.65 Prover 5: stopped
% 6.25/1.66 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.25/1.66 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation
% 6.25/1.67 Prover 8: Preprocessing ...
% 6.25/1.67 Prover 1: Constructing countermodel ...
% 6.25/1.67 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.25/1.67 Prover 7: Preprocessing ...
% 6.92/1.68 Prover 10: Warning: Problem contains rationals, using incomplete axiomatisation
% 7.04/1.69 Prover 0: Constructing countermodel ...
% 7.04/1.69 Prover 0: stopped
% 7.04/1.70 Prover 10: Preprocessing ...
% 7.04/1.70 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 7.04/1.71 Prover 11: Warning: Problem contains rationals, using incomplete axiomatisation
% 7.29/1.73 Prover 4: Constructing countermodel ...
% 7.29/1.74 Prover 3: Constructing countermodel ...
% 7.29/1.74 Prover 3: stopped
% 7.29/1.75 Prover 11: Preprocessing ...
% 7.29/1.76 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 7.29/1.76 Prover 13: Warning: Problem contains rationals, using incomplete axiomatisation
% 7.29/1.76 Prover 13: Preprocessing ...
% 8.37/1.88 Prover 8: Warning: ignoring some quantifiers
% 8.37/1.91 Prover 8: Constructing countermodel ...
% 8.37/1.97 Prover 4: Found proof (size 6)
% 8.37/1.97 Prover 4: proved (1360ms)
% 8.37/1.97 Prover 8: stopped
% 8.37/1.98 Prover 1: Found proof (size 7)
% 8.37/1.98 Prover 1: proved (1364ms)
% 8.37/1.98 Prover 11: stopped
% 8.37/2.00 Prover 13: Warning: ignoring some quantifiers
% 8.37/2.01 Prover 13: Constructing countermodel ...
% 8.37/2.03 Prover 13: stopped
% 8.37/2.04 Prover 7: Warning: ignoring some quantifiers
% 8.37/2.05 Prover 10: Warning: ignoring some quantifiers
% 9.37/2.06 Prover 7: Constructing countermodel ...
% 9.37/2.07 Prover 10: Constructing countermodel ...
% 9.65/2.08 Prover 7: stopped
% 9.65/2.09 Prover 10: stopped
% 9.65/2.09
% 9.65/2.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.65/2.09
% 9.65/2.09 % SZS output start Proof for theBenchmark
% 9.65/2.09 Assumptions after simplification:
% 9.65/2.09 ---------------------------------
% 9.65/2.09
% 9.65/2.09 (rat_lesseq_problem_7)
% 9.79/2.12 ? [v0: int] : ( ~ (v0 = 0) & rat_$lesseq(rat_-3/4, rat_-3/4) = v0)
% 9.79/2.12
% 9.79/2.12 (input)
% 9.93/2.16 ~ (rat_very_large = rat_very_small) & ~ (rat_very_large = rat_-3/4) & ~
% 9.93/2.16 (rat_very_large = rat_0) & ~ (rat_very_small = rat_-3/4) & ~ (rat_very_small
% 9.93/2.16 = rat_0) & ~ (rat_-3/4 = rat_0) & rat_$is_int(rat_-3/4) = 1 &
% 9.93/2.16 rat_$is_int(rat_0) = 0 & rat_$is_rat(rat_-3/4) = 0 & rat_$is_rat(rat_0) = 0 &
% 9.93/2.16 rat_$floor(rat_0) = rat_0 & rat_$ceiling(rat_-3/4) = rat_0 &
% 9.93/2.16 rat_$ceiling(rat_0) = rat_0 & rat_$truncate(rat_-3/4) = rat_0 &
% 9.93/2.16 rat_$truncate(rat_0) = rat_0 & rat_$round(rat_0) = rat_0 &
% 9.93/2.16 rat_$to_int(rat_-3/4) = -1 & rat_$to_int(rat_0) = 0 & rat_$to_rat(rat_-3/4) =
% 9.93/2.16 rat_-3/4 & rat_$to_rat(rat_0) = rat_0 & rat_$to_real(rat_-3/4) = real_-3/4 &
% 9.93/2.16 rat_$to_real(rat_0) = real_0 & int_$to_rat(0) = rat_0 & rat_$quotient(rat_0,
% 9.93/2.16 rat_-3/4) = rat_0 & rat_$product(rat_-3/4, rat_0) = rat_0 &
% 9.93/2.16 rat_$product(rat_0, rat_-3/4) = rat_0 & rat_$product(rat_0, rat_0) = rat_0 &
% 9.93/2.16 rat_$difference(rat_-3/4, rat_-3/4) = rat_0 & rat_$difference(rat_-3/4, rat_0)
% 9.93/2.16 = rat_-3/4 & rat_$difference(rat_0, rat_0) = rat_0 & rat_$uminus(rat_0) =
% 9.93/2.16 rat_0 & rat_$sum(rat_-3/4, rat_0) = rat_-3/4 & rat_$sum(rat_0, rat_-3/4) =
% 9.93/2.16 rat_-3/4 & rat_$sum(rat_0, rat_0) = rat_0 & rat_$greatereq(rat_very_small,
% 9.93/2.16 rat_very_large) = 1 & rat_$greatereq(rat_-3/4, rat_-3/4) = 0 &
% 9.93/2.16 rat_$greatereq(rat_-3/4, rat_0) = 1 & rat_$greatereq(rat_0, rat_-3/4) = 0 &
% 9.93/2.16 rat_$greatereq(rat_0, rat_0) = 0 & rat_$greater(rat_very_large, rat_-3/4) = 0
% 9.93/2.16 & rat_$greater(rat_very_large, rat_0) = 0 & rat_$greater(rat_very_small,
% 9.93/2.16 rat_very_large) = 1 & rat_$greater(rat_-3/4, rat_very_small) = 0 &
% 9.93/2.16 rat_$greater(rat_-3/4, rat_-3/4) = 1 & rat_$greater(rat_-3/4, rat_0) = 1 &
% 9.93/2.16 rat_$greater(rat_0, rat_very_small) = 0 & rat_$greater(rat_0, rat_-3/4) = 0 &
% 9.93/2.16 rat_$greater(rat_0, rat_0) = 1 & rat_$less(rat_very_small, rat_very_large) = 0
% 9.93/2.16 & rat_$less(rat_very_small, rat_-3/4) = 0 & rat_$less(rat_very_small, rat_0) =
% 9.93/2.16 0 & rat_$less(rat_-3/4, rat_very_large) = 0 & rat_$less(rat_-3/4, rat_-3/4) =
% 9.93/2.16 1 & rat_$less(rat_-3/4, rat_0) = 0 & rat_$less(rat_0, rat_very_large) = 0 &
% 9.93/2.16 rat_$less(rat_0, rat_-3/4) = 1 & rat_$less(rat_0, rat_0) = 1 &
% 9.93/2.16 rat_$lesseq(rat_very_small, rat_very_large) = 0 & rat_$lesseq(rat_-3/4,
% 9.93/2.16 rat_-3/4) = 0 & rat_$lesseq(rat_-3/4, rat_0) = 0 & rat_$lesseq(rat_0,
% 9.93/2.16 rat_-3/4) = 1 & rat_$lesseq(rat_0, rat_0) = 0 & ! [v0: $rat] : ! [v1:
% 9.93/2.16 $rat] : ! [v2: $rat] : ! [v3: $rat] : ! [v4: $rat] : ( ~ (rat_$sum(v3,
% 9.93/2.16 v0) = v4) | ~ (rat_$sum(v2, v1) = v3) | ? [v5: $rat] : (rat_$sum(v2,
% 9.93/2.16 v5) = v4 & rat_$sum(v1, v0) = v5)) & ! [v0: $rat] : ! [v1: $rat] : !
% 9.93/2.16 [v2: $rat] : ! [v3: $rat] : ! [v4: $rat] : ( ~ (rat_$sum(v2, v3) = v4) | ~
% 9.93/2.16 (rat_$sum(v1, v0) = v3) | ? [v5: $rat] : (rat_$sum(v5, v0) = v4 &
% 9.93/2.16 rat_$sum(v2, v1) = v5)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] :
% 9.93/2.16 ! [v3: int] : (v3 = 0 | ~ (rat_$less(v2, v1) = 0) | ~ (rat_$less(v2, v0) =
% 9.93/2.17 v3) | ? [v4: int] : ( ~ (v4 = 0) & rat_$lesseq(v1, v0) = v4)) & ! [v0:
% 9.93/2.17 $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: int] : (v3 = 0 | ~
% 9.93/2.17 (rat_$less(v2, v0) = v3) | ~ (rat_$less(v1, v0) = 0) | ? [v4: int] : ( ~
% 9.93/2.17 (v4 = 0) & rat_$lesseq(v2, v1) = v4)) & ! [v0: $rat] : ! [v1: $rat] : !
% 9.93/2.17 [v2: $rat] : ! [v3: int] : (v3 = 0 | ~ (rat_$less(v2, v0) = v3) | ~
% 9.93/2.17 (rat_$lesseq(v2, v1) = 0) | ? [v4: int] : ( ~ (v4 = 0) & rat_$less(v1, v0)
% 9.93/2.17 = v4)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: int] :
% 9.93/2.17 (v3 = 0 | ~ (rat_$less(v2, v0) = v3) | ~ (rat_$lesseq(v1, v0) = 0) | ? [v4:
% 9.93/2.17 int] : ( ~ (v4 = 0) & rat_$less(v2, v1) = v4)) & ! [v0: $rat] : ! [v1:
% 9.93/2.17 $rat] : ! [v2: $rat] : ! [v3: int] : (v3 = 0 | ~ (rat_$lesseq(v2, v1) =
% 9.93/2.17 0) | ~ (rat_$lesseq(v2, v0) = v3) | ? [v4: int] : ( ~ (v4 = 0) &
% 9.93/2.17 rat_$lesseq(v1, v0) = v4)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat]
% 9.93/2.17 : ! [v3: int] : (v3 = 0 | ~ (rat_$lesseq(v2, v0) = v3) | ~ (rat_$lesseq(v1,
% 9.93/2.17 v0) = 0) | ? [v4: int] : ( ~ (v4 = 0) & rat_$lesseq(v2, v1) = v4)) & !
% 9.93/2.17 [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : ( ~
% 9.93/2.17 (rat_$uminus(v0) = v2) | ~ (rat_$sum(v1, v2) = v3) | rat_$difference(v1,
% 9.93/2.17 v0) = v3) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: int] : (v2 = 0 | v1 =
% 9.93/2.17 v0 | ~ (rat_$less(v1, v0) = v2) | ? [v3: int] : ( ~ (v3 = 0) &
% 9.93/2.17 rat_$lesseq(v1, v0) = v3)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: int]
% 9.93/2.17 : (v2 = 0 | ~ (rat_$greatereq(v0, v1) = v2) | ? [v3: int] : ( ~ (v3 = 0) &
% 9.93/2.17 rat_$lesseq(v1, v0) = v3)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: int]
% 9.93/2.17 : (v2 = 0 | ~ (rat_$greater(v0, v1) = v2) | ? [v3: int] : ( ~ (v3 = 0) &
% 9.93/2.17 rat_$less(v1, v0) = v3)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: int] :
% 9.93/2.17 (v2 = 0 | ~ (rat_$less(v1, v0) = v2) | ? [v3: int] : ( ~ (v3 = 0) &
% 9.93/2.17 rat_$greater(v0, v1) = v3)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: int]
% 9.93/2.17 : (v2 = 0 | ~ (rat_$lesseq(v1, v0) = v2) | ? [v3: int] : ( ~ (v3 = 0) &
% 9.93/2.17 rat_$greatereq(v0, v1) = v3)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2:
% 9.93/2.17 int] : (v2 = 0 | ~ (rat_$lesseq(v1, v0) = v2) | ? [v3: int] : ( ~ (v3 = 0)
% 9.93/2.17 & rat_$less(v1, v0) = v3)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat]
% 9.93/2.17 : (v0 = rat_0 | ~ (rat_$product(v1, v0) = v2) | rat_$quotient(v2, v0) = v1) &
% 9.93/2.17 ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ( ~ (rat_$product(v1, v0) =
% 9.93/2.17 v2) | rat_$product(v0, v1) = v2) & ! [v0: $rat] : ! [v1: $rat] : ! [v2:
% 9.93/2.17 $rat] : ( ~ (rat_$product(v0, v1) = v2) | rat_$product(v1, v0) = v2) & !
% 9.93/2.17 [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ( ~ (rat_$difference(v1, v0) =
% 9.93/2.17 v2) | ? [v3: $rat] : (rat_$uminus(v0) = v3 & rat_$sum(v1, v3) = v2)) & !
% 9.93/2.17 [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ( ~ (rat_$sum(v1, v0) = v2) |
% 9.93/2.17 rat_$sum(v0, v1) = v2) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ( ~
% 9.93/2.17 (rat_$sum(v0, v1) = v2) | rat_$sum(v1, v0) = v2) & ! [v0: $rat] : ! [v1:
% 9.93/2.17 $rat] : ! [v2: $rat] : ( ~ (rat_$less(v2, v1) = 0) | ~ (rat_$lesseq(v1,
% 9.93/2.17 v0) = 0) | rat_$less(v2, v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : !
% 9.93/2.17 [v2: $rat] : ( ~ (rat_$less(v1, v0) = 0) | ~ (rat_$lesseq(v2, v1) = 0) |
% 9.93/2.17 rat_$less(v2, v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ( ~
% 9.93/2.17 (rat_$lesseq(v2, v1) = 0) | ~ (rat_$lesseq(v1, v0) = 0) | rat_$lesseq(v2,
% 9.93/2.17 v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : (v1 = v0 | ~ (rat_$sum(v0,
% 9.93/2.17 rat_0) = v1)) & ! [v0: $rat] : ! [v1: $rat] : (v1 = v0 | ~
% 9.93/2.17 (rat_$lesseq(v1, v0) = 0) | rat_$less(v1, v0) = 0) & ! [v0: $rat] : ! [v1:
% 9.93/2.17 int] : (v1 = 0 | ~ (rat_$lesseq(v0, v0) = v1)) & ! [v0: $rat] : ! [v1:
% 9.93/2.17 $rat] : ( ~ (rat_$uminus(v0) = v1) | rat_$uminus(v1) = v0) & ! [v0: $rat] :
% 9.93/2.17 ! [v1: $rat] : ( ~ (rat_$uminus(v0) = v1) | rat_$sum(v0, v1) = rat_0) & !
% 9.93/2.17 [v0: $rat] : ! [v1: $rat] : ( ~ (rat_$greatereq(v0, v1) = 0) |
% 9.93/2.17 rat_$lesseq(v1, v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : ( ~
% 9.93/2.17 (rat_$greater(v0, v1) = 0) | rat_$less(v1, v0) = 0) & ! [v0: $rat] : !
% 9.93/2.17 [v1: $rat] : ( ~ (rat_$less(v1, v0) = 0) | rat_$greater(v0, v1) = 0) & ! [v0:
% 9.93/2.17 $rat] : ! [v1: $rat] : ( ~ (rat_$less(v1, v0) = 0) | rat_$lesseq(v1, v0) =
% 9.93/2.17 0) & ! [v0: $rat] : ! [v1: MultipleValueBool] : ( ~ (rat_$less(v0, v0) =
% 9.93/2.17 v1) | rat_$lesseq(v0, v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : ( ~
% 9.93/2.17 (rat_$lesseq(v1, v0) = 0) | rat_$greatereq(v0, v1) = 0) & ! [v0: $rat] :
% 9.93/2.17 (v0 = rat_0 | ~ (rat_$uminus(v0) = v0))
% 9.93/2.17
% 9.93/2.17 Those formulas are unsatisfiable:
% 9.93/2.17 ---------------------------------
% 9.93/2.17
% 9.93/2.17 Begin of proof
% 9.93/2.17 |
% 9.93/2.17 | ALPHA: (input) implies:
% 9.93/2.17 | (1) ! [v0: $rat] : ! [v1: int] : (v1 = 0 | ~ (rat_$lesseq(v0, v0) = v1))
% 9.93/2.17 |
% 9.93/2.17 | DELTA: instantiating (rat_lesseq_problem_7) with fresh symbol all_5_0 gives:
% 9.93/2.18 | (2) ~ (all_5_0 = 0) & rat_$lesseq(rat_-3/4, rat_-3/4) = all_5_0
% 9.93/2.18 |
% 9.93/2.18 | ALPHA: (2) implies:
% 9.93/2.18 | (3) ~ (all_5_0 = 0)
% 9.93/2.18 | (4) rat_$lesseq(rat_-3/4, rat_-3/4) = all_5_0
% 9.93/2.18 |
% 9.93/2.18 | GROUND_INST: instantiating (1) with rat_-3/4, all_5_0, simplifying with (4)
% 9.93/2.18 | gives:
% 9.93/2.18 | (5) all_5_0 = 0
% 9.93/2.18 |
% 9.93/2.18 | REDUCE: (3), (5) imply:
% 9.93/2.18 | (6) $false
% 9.93/2.18 |
% 9.93/2.18 | CLOSE: (6) is inconsistent.
% 9.93/2.18 |
% 9.93/2.18 End of proof
% 9.93/2.18 % SZS output end Proof for theBenchmark
% 9.93/2.18
% 9.93/2.18 1593ms
%------------------------------------------------------------------------------