TSTP Solution File: ARI241_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI241_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 : n032.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:24 EDT 2023
% Result : Theorem 5.15s 1.32s
% Output : Proof 6.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : ARI241_1 : TPTP v8.1.2. Released v5.0.0.
% 0.09/0.09 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 300
% 0.10/0.28 % DateTime : Tue Aug 29 17:55:01 EDT 2023
% 0.10/0.28 % CPUTime :
% 0.13/0.50 ________ _____
% 0.13/0.50 ___ __ \_________(_)________________________________
% 0.13/0.50 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.13/0.50 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.13/0.50 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.13/0.50
% 0.13/0.50 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.13/0.50 (2023-06-19)
% 0.13/0.50
% 0.13/0.50 (c) Philipp Rümmer, 2009-2023
% 0.13/0.50 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.13/0.50 Amanda Stjerna.
% 0.13/0.50 Free software under BSD-3-Clause.
% 0.13/0.50
% 0.13/0.50 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.13/0.50
% 0.13/0.50 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.13/0.51 Running up to 7 provers in parallel.
% 0.13/0.53 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.13/0.53 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.13/0.53 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.13/0.53 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.13/0.53 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.13/0.53 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.13/0.53 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.04/0.77 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.04/0.77 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.04/0.77 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.04/0.77 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.04/0.77 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.04/0.77 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.04/0.77 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.43/0.85 Prover 4: Preprocessing ...
% 1.43/0.85 Prover 1: Preprocessing ...
% 1.93/0.88 Prover 0: Preprocessing ...
% 1.93/0.88 Prover 3: Preprocessing ...
% 1.93/0.88 Prover 5: Preprocessing ...
% 1.93/0.88 Prover 2: Preprocessing ...
% 1.93/0.88 Prover 6: Preprocessing ...
% 4.15/1.21 Prover 1: Constructing countermodel ...
% 4.15/1.23 Prover 6: Proving ...
% 4.42/1.24 Prover 5: Proving ...
% 4.42/1.26 Prover 2: Proving ...
% 4.42/1.26 Prover 3: Constructing countermodel ...
% 5.15/1.30 Prover 4: Constructing countermodel ...
% 5.15/1.31 Prover 0: Proving ...
% 5.15/1.32 Prover 2: proved (797ms)
% 5.15/1.32
% 5.15/1.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.15/1.32
% 5.15/1.32 Prover 3: stopped
% 5.15/1.32 Prover 5: stopped
% 5.15/1.32 Prover 6: stopped
% 5.15/1.32 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.15/1.32 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.35/1.32 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.35/1.33 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.35/1.33 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation
% 5.35/1.33 Prover 10: Warning: Problem contains rationals, using incomplete axiomatisation
% 5.35/1.33 Prover 0: stopped
% 5.35/1.33 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation
% 5.35/1.33 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.35/1.33 Prover 11: Warning: Problem contains rationals, using incomplete axiomatisation
% 5.35/1.34 Prover 13: Warning: Problem contains rationals, using incomplete axiomatisation
% 5.35/1.34 Prover 10: Preprocessing ...
% 5.35/1.34 Prover 13: Preprocessing ...
% 5.35/1.34 Prover 11: Preprocessing ...
% 5.35/1.34 Prover 7: Preprocessing ...
% 5.35/1.35 Prover 8: Preprocessing ...
% 5.35/1.36 Prover 1: Found proof (size 3)
% 5.35/1.36 Prover 1: proved (844ms)
% 5.35/1.37 Prover 4: stopped
% 5.35/1.37 Prover 10: stopped
% 5.35/1.38 Prover 7: stopped
% 5.35/1.39 Prover 13: stopped
% 5.35/1.39 Prover 11: stopped
% 6.00/1.44 Prover 8: Warning: ignoring some quantifiers
% 6.00/1.44 Prover 8: Constructing countermodel ...
% 6.00/1.45 Prover 8: stopped
% 6.00/1.45
% 6.00/1.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.00/1.45
% 6.00/1.46 % SZS output start Proof for theBenchmark
% 6.00/1.46 Assumptions after simplification:
% 6.00/1.46 ---------------------------------
% 6.00/1.46
% 6.00/1.46 (rat_greatereq_problem_12)
% 6.35/1.50 ! [v0: $rat] : ~ (rat_$greatereq(v0, rat_0) = 0)
% 6.35/1.50
% 6.35/1.50 (input)
% 6.35/1.53 ~ (rat_very_large = rat_very_small) & ~ (rat_very_large = rat_0) & ~
% 6.35/1.53 (rat_very_small = rat_0) & rat_$is_int(rat_0) = 0 & rat_$is_rat(rat_0) = 0 &
% 6.35/1.53 rat_$floor(rat_0) = rat_0 & rat_$ceiling(rat_0) = rat_0 & rat_$truncate(rat_0)
% 6.35/1.53 = rat_0 & rat_$round(rat_0) = rat_0 & rat_$to_int(rat_0) = 0 &
% 6.35/1.53 rat_$to_rat(rat_0) = rat_0 & rat_$to_real(rat_0) = real_0 & int_$to_rat(0) =
% 6.35/1.53 rat_0 & rat_$product(rat_0, rat_0) = rat_0 & rat_$difference(rat_0, rat_0) =
% 6.35/1.53 rat_0 & rat_$uminus(rat_0) = rat_0 & rat_$sum(rat_0, rat_0) = rat_0 &
% 6.35/1.53 rat_$lesseq(rat_very_small, rat_very_large) = 0 & rat_$lesseq(rat_0, rat_0) =
% 6.35/1.53 0 & rat_$greater(rat_very_large, rat_0) = 0 & rat_$greater(rat_very_small,
% 6.35/1.53 rat_very_large) = 1 & rat_$greater(rat_0, rat_very_small) = 0 &
% 6.35/1.53 rat_$greater(rat_0, rat_0) = 1 & rat_$less(rat_very_small, rat_very_large) = 0
% 6.35/1.53 & rat_$less(rat_very_small, rat_0) = 0 & rat_$less(rat_0, rat_very_large) = 0
% 6.35/1.53 & rat_$less(rat_0, rat_0) = 1 & rat_$greatereq(rat_very_small, rat_very_large)
% 6.35/1.53 = 1 & rat_$greatereq(rat_0, rat_0) = 0 & ! [v0: $rat] : ! [v1: $rat] : !
% 6.35/1.53 [v2: $rat] : ! [v3: $rat] : ! [v4: $rat] : ( ~ (rat_$sum(v3, v0) = v4) | ~
% 6.35/1.53 (rat_$sum(v2, v1) = v3) | ? [v5: $rat] : (rat_$sum(v2, v5) = v4 &
% 6.35/1.53 rat_$sum(v1, v0) = v5)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] :
% 6.35/1.53 ! [v3: $rat] : (v3 = v1 | v0 = rat_0 | ~ (rat_$quotient(v2, v0) = v3) | ~
% 6.35/1.53 (rat_$product(v1, v0) = v2)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat]
% 6.35/1.53 : ! [v3: int] : (v3 = 0 | ~ (rat_$lesseq(v2, v0) = v3) | ~ (rat_$lesseq(v1,
% 6.35/1.53 v0) = 0) | ? [v4: int] : ( ~ (v4 = 0) & rat_$lesseq(v2, v1) = v4)) & !
% 6.35/1.53 [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: int] : (v3 = 0 | ~
% 6.35/1.53 (rat_$lesseq(v1, v0) = 0) | ~ (rat_$less(v2, v0) = v3) | ? [v4: int] : ( ~
% 6.35/1.53 (v4 = 0) & rat_$less(v2, v1) = v4)) & ! [v0: $rat] : ! [v1: $rat] : !
% 6.35/1.53 [v2: $rat] : ! [v3: $rat] : ( ~ (rat_$uminus(v0) = v2) | ~ (rat_$sum(v1, v2)
% 6.35/1.53 = v3) | rat_$difference(v1, v0) = v3) & ! [v0: $rat] : ! [v1: $rat] : !
% 6.35/1.53 [v2: $rat] : (v2 = rat_0 | ~ (rat_$uminus(v0) = v1) | ~ (rat_$sum(v0, v1) =
% 6.35/1.53 v2)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: int] : (v2 = 0 | ~
% 6.35/1.53 (rat_$lesseq(v1, v0) = v2) | ( ~ (v1 = v0) & ? [v3: int] : ( ~ (v3 = 0) &
% 6.35/1.53 rat_$less(v1, v0) = v3))) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: int]
% 6.35/1.53 : (v2 = 0 | ~ (rat_$greater(v0, v1) = v2) | ? [v3: int] : ( ~ (v3 = 0) &
% 6.35/1.53 rat_$less(v1, v0) = v3)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: int] :
% 6.35/1.53 (v2 = 0 | ~ (rat_$greatereq(v0, v1) = v2) | ? [v3: int] : ( ~ (v3 = 0) &
% 6.35/1.53 rat_$lesseq(v1, v0) = v3)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat]
% 6.35/1.53 : ( ~ (rat_$product(v0, v1) = v2) | rat_$product(v1, v0) = v2) & ! [v0: $rat]
% 6.35/1.53 : ! [v1: $rat] : ! [v2: $rat] : ( ~ (rat_$sum(v0, v1) = v2) | rat_$sum(v1,
% 6.35/1.53 v0) = v2) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ( ~
% 6.35/1.53 (rat_$lesseq(v2, v1) = 0) | ~ (rat_$less(v1, v0) = 0) | rat_$less(v2, v0) =
% 6.35/1.53 0) & ! [v0: $rat] : ! [v1: $rat] : (v1 = v0 | ~ (rat_$sum(v0, rat_0) =
% 6.35/1.53 v1)) & ! [v0: $rat] : ! [v1: $rat] : (v1 = v0 | ~ (rat_$lesseq(v1, v0)
% 6.35/1.53 = 0) | rat_$less(v1, v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : ( ~
% 6.35/1.53 (rat_$uminus(v0) = v1) | rat_$uminus(v1) = v0) & ! [v0: $rat] : ! [v1:
% 6.35/1.53 $rat] : ( ~ (rat_$greater(v0, v1) = 0) | rat_$less(v1, v0) = 0) & ! [v0:
% 6.35/1.53 $rat] : ! [v1: $rat] : ( ~ (rat_$greatereq(v0, v1) = 0) | rat_$lesseq(v1,
% 6.35/1.53 v0) = 0) & ! [v0: $rat] : (v0 = rat_0 | ~ (rat_$uminus(v0) = v0))
% 6.35/1.53
% 6.35/1.53 Those formulas are unsatisfiable:
% 6.35/1.53 ---------------------------------
% 6.35/1.53
% 6.35/1.53 Begin of proof
% 6.35/1.53 |
% 6.35/1.53 | ALPHA: (input) implies:
% 6.35/1.53 | (1) rat_$greatereq(rat_0, rat_0) = 0
% 6.35/1.53 |
% 6.35/1.53 | GROUND_INST: instantiating (rat_greatereq_problem_12) with rat_0, simplifying
% 6.35/1.53 | with (1) gives:
% 6.35/1.53 | (2) $false
% 6.35/1.54 |
% 6.35/1.54 | CLOSE: (2) is inconsistent.
% 6.35/1.54 |
% 6.35/1.54 End of proof
% 6.35/1.54 % SZS output end Proof for theBenchmark
% 6.35/1.54
% 6.35/1.54 1033ms
%------------------------------------------------------------------------------