TSTP Solution File: ARI398_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI398_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 : n020.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:54 EDT 2023
% Result : Theorem 7.18s 1.67s
% Output : Proof 7.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ARI398_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.35 % Computer : n020.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:11:58 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.62 ________ _____
% 0.20/0.62 ___ __ \_________(_)________________________________
% 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.62
% 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.62 (2023-06-19)
% 0.20/0.62
% 0.20/0.62 (c) Philipp Rümmer, 2009-2023
% 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.62 Amanda Stjerna.
% 0.20/0.62 Free software under BSD-3-Clause.
% 0.20/0.62
% 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.62
% 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 1.26/0.90 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation
% 1.26/0.90 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation
% 1.26/0.90 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation
% 1.26/0.90 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation
% 1.26/0.90 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation
% 1.26/0.90 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation
% 1.26/0.90 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation
% 2.22/0.99 Prover 4: Preprocessing ...
% 2.22/1.00 Prover 1: Preprocessing ...
% 2.22/1.04 Prover 3: Preprocessing ...
% 2.22/1.04 Prover 6: Preprocessing ...
% 2.22/1.04 Prover 0: Preprocessing ...
% 2.22/1.04 Prover 5: Preprocessing ...
% 2.22/1.04 Prover 2: Preprocessing ...
% 5.84/1.48 Prover 1: Constructing countermodel ...
% 5.84/1.49 Prover 6: Proving ...
% 5.84/1.52 Prover 4: Constructing countermodel ...
% 5.84/1.52 Prover 0: Proving ...
% 5.84/1.53 Prover 3: Constructing countermodel ...
% 6.34/1.56 Prover 2: Proving ...
% 6.51/1.57 Prover 5: Proving ...
% 7.18/1.66 Prover 1: Found proof (size 3)
% 7.18/1.66 Prover 0: proved (1024ms)
% 7.18/1.67
% 7.18/1.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.18/1.67
% 7.18/1.67 Prover 1: proved (1027ms)
% 7.18/1.67 Prover 3: stopped
% 7.18/1.67 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 7.18/1.67 Prover 4: Found proof (size 3)
% 7.18/1.67 Prover 4: proved (1028ms)
% 7.18/1.67 Prover 6: stopped
% 7.18/1.67 Prover 5: stopped
% 7.18/1.67 Prover 2: stopped
% 7.18/1.67 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation
% 7.18/1.68 Prover 7: Preprocessing ...
% 7.18/1.73 Prover 7: stopped
% 7.18/1.73
% 7.18/1.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.18/1.73
% 7.18/1.73 % SZS output start Proof for theBenchmark
% 7.61/1.73 Assumptions after simplification:
% 7.61/1.73 ---------------------------------
% 7.61/1.73
% 7.61/1.73 (real_greatereq_problem_14)
% 7.61/1.75 ! [v0: $real] : ~ (real_$greatereq(v0, real_-13/4) = 0)
% 7.61/1.75
% 7.61/1.75 (input)
% 7.61/1.77 ~ (real_very_large = real_very_small) & ~ (real_very_large = real_-13/4) &
% 7.61/1.77 ~ (real_very_large = real_0) & ~ (real_very_small = real_-13/4) & ~
% 7.61/1.77 (real_very_small = real_0) & ~ (real_-13/4 = real_0) &
% 7.61/1.77 real_$is_int(real_-13/4) = 1 & real_$is_int(real_0) = 0 &
% 7.61/1.77 real_$is_rat(real_-13/4) = 0 & real_$is_rat(real_0) = 0 & real_$floor(real_0)
% 7.83/1.77 = real_0 & real_$ceiling(real_0) = real_0 & real_$truncate(real_0) = real_0 &
% 7.83/1.77 real_$round(real_0) = real_0 & real_$to_int(real_-13/4) = -4 &
% 7.83/1.77 real_$to_int(real_0) = 0 & real_$to_rat(real_-13/4) = rat_-13/4 &
% 7.83/1.77 real_$to_rat(real_0) = rat_0 & real_$to_real(real_-13/4) = real_-13/4 &
% 7.83/1.77 real_$to_real(real_0) = real_0 & int_$to_real(0) = real_0 &
% 7.83/1.77 real_$quotient(real_0, real_-13/4) = real_0 & real_$product(real_-13/4,
% 7.83/1.77 real_0) = real_0 & real_$product(real_0, real_-13/4) = real_0 &
% 7.83/1.77 real_$product(real_0, real_0) = real_0 & real_$difference(real_-13/4,
% 7.83/1.77 real_-13/4) = real_0 & real_$difference(real_-13/4, real_0) = real_-13/4 &
% 7.83/1.77 real_$difference(real_0, real_0) = real_0 & real_$uminus(real_0) = real_0 &
% 7.83/1.77 real_$sum(real_-13/4, real_0) = real_-13/4 & real_$sum(real_0, real_-13/4) =
% 7.83/1.77 real_-13/4 & real_$sum(real_0, real_0) = real_0 &
% 7.83/1.77 real_$lesseq(real_very_small, real_very_large) = 0 & real_$lesseq(real_-13/4,
% 7.83/1.77 real_-13/4) = 0 & real_$lesseq(real_-13/4, real_0) = 0 &
% 7.83/1.77 real_$lesseq(real_0, real_-13/4) = 1 & real_$lesseq(real_0, real_0) = 0 &
% 7.83/1.77 real_$greater(real_very_large, real_-13/4) = 0 &
% 7.83/1.77 real_$greater(real_very_large, real_0) = 0 & real_$greater(real_very_small,
% 7.83/1.77 real_very_large) = 1 & real_$greater(real_-13/4, real_very_small) = 0 &
% 7.83/1.77 real_$greater(real_-13/4, real_-13/4) = 1 & real_$greater(real_-13/4, real_0)
% 7.83/1.77 = 1 & real_$greater(real_0, real_very_small) = 0 & real_$greater(real_0,
% 7.83/1.77 real_-13/4) = 0 & real_$greater(real_0, real_0) = 1 &
% 7.83/1.78 real_$less(real_very_small, real_very_large) = 0 & real_$less(real_very_small,
% 7.83/1.78 real_-13/4) = 0 & real_$less(real_very_small, real_0) = 0 &
% 7.83/1.78 real_$less(real_-13/4, real_very_large) = 0 & real_$less(real_-13/4,
% 7.83/1.78 real_-13/4) = 1 & real_$less(real_-13/4, real_0) = 0 & real_$less(real_0,
% 7.83/1.78 real_very_large) = 0 & real_$less(real_0, real_-13/4) = 1 &
% 7.83/1.78 real_$less(real_0, real_0) = 1 & real_$greatereq(real_very_small,
% 7.83/1.78 real_very_large) = 1 & real_$greatereq(real_-13/4, real_-13/4) = 0 &
% 7.83/1.78 real_$greatereq(real_-13/4, real_0) = 1 & real_$greatereq(real_0, real_-13/4)
% 7.83/1.78 = 0 & real_$greatereq(real_0, real_0) = 0 & ! [v0: $real] : ! [v1: $real] :
% 7.83/1.78 ! [v2: $real] : ! [v3: $real] : ! [v4: $real] : ( ~ (real_$sum(v3, v0) = v4)
% 7.83/1.78 | ~ (real_$sum(v2, v1) = v3) | ? [v5: $real] : (real_$sum(v2, v5) = v4 &
% 7.83/1.78 real_$sum(v1, v0) = v5)) & ! [v0: $real] : ! [v1: $real] : ! [v2:
% 7.83/1.78 $real] : ! [v3: $real] : (v3 = v1 | v0 = real_0 | ~ (real_$quotient(v2,
% 7.83/1.78 v0) = v3) | ~ (real_$product(v1, v0) = v2)) & ! [v0: $real] : ! [v1:
% 7.83/1.78 $real] : ! [v2: $real] : ! [v3: int] : (v3 = 0 | ~ (real_$lesseq(v2, v0)
% 7.83/1.78 = v3) | ~ (real_$lesseq(v1, v0) = 0) | ? [v4: int] : ( ~ (v4 = 0) &
% 7.83/1.78 real_$lesseq(v2, v1) = v4)) & ! [v0: $real] : ! [v1: $real] : ! [v2:
% 7.83/1.78 $real] : ! [v3: int] : (v3 = 0 | ~ (real_$lesseq(v1, v0) = 0) | ~
% 7.83/1.78 (real_$less(v2, v0) = v3) | ? [v4: int] : ( ~ (v4 = 0) & real_$less(v2, v1)
% 7.83/1.78 = v4)) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: $real]
% 7.83/1.78 : ( ~ (real_$uminus(v0) = v2) | ~ (real_$sum(v1, v2) = v3) |
% 7.83/1.78 real_$difference(v1, v0) = v3) & ! [v0: $real] : ! [v1: $real] : ! [v2:
% 7.83/1.78 $real] : (v2 = real_0 | ~ (real_$uminus(v0) = v1) | ~ (real_$sum(v0, v1) =
% 7.83/1.78 v2)) & ! [v0: $real] : ! [v1: $real] : ! [v2: int] : (v2 = 0 | ~
% 7.83/1.78 (real_$lesseq(v1, v0) = v2) | ( ~ (v1 = v0) & ? [v3: int] : ( ~ (v3 = 0) &
% 7.83/1.78 real_$less(v1, v0) = v3))) & ! [v0: $real] : ! [v1: $real] : ! [v2:
% 7.83/1.78 int] : (v2 = 0 | ~ (real_$greater(v0, v1) = v2) | ? [v3: int] : ( ~ (v3 =
% 7.83/1.78 0) & real_$less(v1, v0) = v3)) & ! [v0: $real] : ! [v1: $real] : !
% 7.83/1.78 [v2: int] : (v2 = 0 | ~ (real_$greatereq(v0, v1) = v2) | ? [v3: int] : ( ~
% 7.83/1.78 (v3 = 0) & real_$lesseq(v1, v0) = v3)) & ! [v0: $real] : ! [v1: $real] :
% 7.83/1.78 ! [v2: $real] : ( ~ (real_$product(v0, v1) = v2) | real_$product(v1, v0) =
% 7.83/1.78 v2) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ( ~ (real_$sum(v0,
% 7.83/1.78 v1) = v2) | real_$sum(v1, v0) = v2) & ! [v0: $real] : ! [v1: $real] :
% 7.83/1.78 ! [v2: $real] : ( ~ (real_$lesseq(v2, v1) = 0) | ~ (real_$less(v1, v0) = 0) |
% 7.83/1.78 real_$less(v2, v0) = 0) & ! [v0: $real] : ! [v1: $real] : (v1 = v0 | ~
% 7.83/1.78 (real_$sum(v0, real_0) = v1)) & ! [v0: $real] : ! [v1: $real] : (v1 = v0 |
% 7.83/1.78 ~ (real_$lesseq(v1, v0) = 0) | real_$less(v1, v0) = 0) & ! [v0: $real] :
% 7.83/1.78 ! [v1: $real] : ( ~ (real_$uminus(v0) = v1) | real_$uminus(v1) = v0) & ! [v0:
% 7.83/1.78 $real] : ! [v1: $real] : ( ~ (real_$greater(v0, v1) = 0) | real_$less(v1,
% 7.83/1.78 v0) = 0) & ! [v0: $real] : ! [v1: $real] : ( ~ (real_$greatereq(v0, v1)
% 7.83/1.78 = 0) | real_$lesseq(v1, v0) = 0) & ! [v0: $real] : (v0 = real_0 | ~
% 7.83/1.78 (real_$uminus(v0) = v0))
% 7.83/1.78
% 7.83/1.78 Those formulas are unsatisfiable:
% 7.83/1.78 ---------------------------------
% 7.83/1.78
% 7.83/1.78 Begin of proof
% 7.83/1.78 |
% 7.83/1.78 | ALPHA: (input) implies:
% 7.83/1.78 | (1) real_$greatereq(real_-13/4, real_-13/4) = 0
% 7.83/1.78 |
% 7.83/1.78 | GROUND_INST: instantiating (real_greatereq_problem_14) with real_-13/4,
% 7.83/1.78 | simplifying with (1) gives:
% 7.83/1.78 | (2) $false
% 7.83/1.78 |
% 7.83/1.78 | CLOSE: (2) is inconsistent.
% 7.83/1.78 |
% 7.83/1.78 End of proof
% 7.83/1.78 % SZS output end Proof for theBenchmark
% 7.83/1.78
% 7.83/1.78 1163ms
%------------------------------------------------------------------------------