TSTP Solution File: ARI424_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI424_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 : n003.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:59 EDT 2023
% Result : Theorem 5.32s 1.49s
% Output : Proof 6.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI424_1 : TPTP v8.1.2. Released v5.0.0.
% 0.03/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n003.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:16:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.53/0.63 ________ _____
% 0.53/0.63 ___ __ \_________(_)________________________________
% 0.53/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.53/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.53/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.53/0.63
% 0.53/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.53/0.63 (2023-06-19)
% 0.53/0.63
% 0.53/0.63 (c) Philipp Rümmer, 2009-2023
% 0.53/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.53/0.63 Amanda Stjerna.
% 0.53/0.63 Free software under BSD-3-Clause.
% 0.53/0.63
% 0.53/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.53/0.63
% 0.53/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.53/0.65 Running up to 7 provers in parallel.
% 0.53/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.53/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.76/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.76/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.76/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.76/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.76/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.54/0.91 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation
% 1.54/0.91 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation
% 1.54/0.91 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation
% 1.54/0.91 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation
% 1.54/0.91 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation
% 1.54/0.92 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation
% 1.54/0.92 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation
% 2.06/1.00 Prover 1: Preprocessing ...
% 2.06/1.00 Prover 4: Preprocessing ...
% 2.36/1.04 Prover 6: Preprocessing ...
% 2.36/1.04 Prover 0: Preprocessing ...
% 2.36/1.04 Prover 5: Preprocessing ...
% 2.36/1.04 Prover 3: Preprocessing ...
% 2.36/1.04 Prover 2: Preprocessing ...
% 4.60/1.38 Prover 6: Proving ...
% 4.60/1.39 Prover 2: Proving ...
% 4.60/1.39 Prover 5: Proving ...
% 4.60/1.39 Prover 1: Constructing countermodel ...
% 4.60/1.40 Prover 3: Constructing countermodel ...
% 5.32/1.41 Prover 4: Constructing countermodel ...
% 5.32/1.48 Prover 0: Proving ...
% 5.32/1.49 Prover 3: proved (826ms)
% 5.32/1.49
% 5.32/1.49 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.32/1.49
% 5.32/1.49 Prover 6: stopped
% 5.32/1.49 Prover 2: stopped
% 5.32/1.49 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.32/1.49 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.00/1.50 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.00/1.50 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation
% 6.00/1.50 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation
% 6.00/1.50 Prover 10: Warning: Problem contains reals, using incomplete axiomatisation
% 6.00/1.50 Prover 8: Preprocessing ...
% 6.00/1.50 Prover 7: Preprocessing ...
% 6.00/1.50 Prover 10: Preprocessing ...
% 6.00/1.50 Prover 0: stopped
% 6.00/1.51 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.00/1.51 Prover 5: proved (853ms)
% 6.00/1.51
% 6.00/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.00/1.51
% 6.00/1.52 Prover 11: Warning: Problem contains reals, using incomplete axiomatisation
% 6.00/1.52 Prover 11: Preprocessing ...
% 6.00/1.52 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.00/1.52 Prover 13: Warning: Problem contains reals, using incomplete axiomatisation
% 6.00/1.53 Prover 4: Found proof (size 3)
% 6.00/1.53 Prover 1: Found proof (size 3)
% 6.00/1.53 Prover 4: proved (867ms)
% 6.00/1.53 Prover 1: proved (871ms)
% 6.00/1.53 Prover 13: Preprocessing ...
% 6.00/1.55 Prover 11: stopped
% 6.00/1.56 Prover 13: stopped
% 6.00/1.57 Prover 10: Warning: ignoring some quantifiers
% 6.00/1.58 Prover 10: Constructing countermodel ...
% 6.00/1.58 Prover 7: Warning: ignoring some quantifiers
% 6.00/1.58 Prover 7: Constructing countermodel ...
% 6.00/1.58 Prover 10: stopped
% 6.70/1.59 Prover 7: stopped
% 6.73/1.60 Prover 8: Warning: ignoring some quantifiers
% 6.78/1.60 Prover 8: Constructing countermodel ...
% 6.81/1.61 Prover 8: stopped
% 6.81/1.61
% 6.81/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.81/1.61
% 6.81/1.62 % SZS output start Proof for theBenchmark
% 6.81/1.62 Assumptions after simplification:
% 6.81/1.62 ---------------------------------
% 6.81/1.62
% 6.81/1.62 (real_sum_problem_24)
% 6.81/1.64 ! [v0: $real] : ~ (real_$sum(v0, real_0) = v0)
% 6.81/1.64
% 6.81/1.64 (input)
% 6.81/1.66 ~ (real_very_large = real_very_small) & ~ (real_very_large = real_0) & ~
% 6.81/1.66 (real_very_small = real_0) & real_$is_int(real_0) = 0 & real_$is_rat(real_0) =
% 6.81/1.66 0 & real_$floor(real_0) = real_0 & real_$ceiling(real_0) = real_0 &
% 6.81/1.66 real_$truncate(real_0) = real_0 & real_$round(real_0) = real_0 &
% 6.81/1.66 real_$to_int(real_0) = 0 & real_$to_rat(real_0) = rat_0 &
% 6.81/1.66 real_$to_real(real_0) = real_0 & int_$to_real(0) = real_0 &
% 6.81/1.66 real_$product(real_0, real_0) = real_0 & real_$difference(real_0, real_0) =
% 6.81/1.66 real_0 & real_$uminus(real_0) = real_0 & real_$greatereq(real_very_small,
% 6.81/1.66 real_very_large) = 1 & real_$greatereq(real_0, real_0) = 0 &
% 6.81/1.66 real_$lesseq(real_very_small, real_very_large) = 0 & real_$lesseq(real_0,
% 6.81/1.66 real_0) = 0 & real_$greater(real_very_large, real_0) = 0 &
% 6.81/1.66 real_$greater(real_very_small, real_very_large) = 1 & real_$greater(real_0,
% 6.81/1.66 real_very_small) = 0 & real_$greater(real_0, real_0) = 1 &
% 6.81/1.66 real_$less(real_very_small, real_very_large) = 0 & real_$less(real_very_small,
% 6.81/1.66 real_0) = 0 & real_$less(real_0, real_very_large) = 0 & real_$less(real_0,
% 6.81/1.66 real_0) = 1 & real_$sum(real_0, real_0) = real_0 & ! [v0: $real] : ! [v1:
% 6.81/1.66 $real] : ! [v2: $real] : ! [v3: $real] : ! [v4: $real] : ( ~
% 6.81/1.66 (real_$sum(v3, v0) = v4) | ~ (real_$sum(v2, v1) = v3) | ? [v5: $real] :
% 6.81/1.66 (real_$sum(v2, v5) = v4 & real_$sum(v1, v0) = v5)) & ! [v0: $real] : !
% 6.81/1.66 [v1: $real] : ! [v2: $real] : ! [v3: $real] : (v3 = v1 | v0 = real_0 | ~
% 6.81/1.66 (real_$quotient(v2, v0) = v3) | ~ (real_$product(v1, v0) = v2)) & ! [v0:
% 6.81/1.66 $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: int] : (v3 = 0 | ~
% 6.81/1.66 (real_$lesseq(v2, v0) = v3) | ~ (real_$lesseq(v1, v0) = 0) | ? [v4: int] :
% 6.81/1.66 ( ~ (v4 = 0) & real_$lesseq(v2, v1) = v4)) & ! [v0: $real] : ! [v1: $real]
% 6.81/1.66 : ! [v2: $real] : ! [v3: int] : (v3 = 0 | ~ (real_$lesseq(v1, v0) = 0) | ~
% 6.81/1.66 (real_$less(v2, v0) = v3) | ? [v4: int] : ( ~ (v4 = 0) & real_$less(v2, v1)
% 6.81/1.66 = v4)) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: $real]
% 6.81/1.66 : ( ~ (real_$uminus(v0) = v2) | ~ (real_$sum(v1, v2) = v3) |
% 6.81/1.66 real_$difference(v1, v0) = v3) & ! [v0: $real] : ! [v1: $real] : ! [v2:
% 6.81/1.66 $real] : (v2 = real_0 | ~ (real_$uminus(v0) = v1) | ~ (real_$sum(v0, v1) =
% 6.81/1.67 v2)) & ! [v0: $real] : ! [v1: $real] : ! [v2: int] : (v2 = 0 | ~
% 6.81/1.67 (real_$greatereq(v0, v1) = v2) | ? [v3: int] : ( ~ (v3 = 0) &
% 6.81/1.67 real_$lesseq(v1, v0) = v3)) & ! [v0: $real] : ! [v1: $real] : ! [v2:
% 6.81/1.67 int] : (v2 = 0 | ~ (real_$lesseq(v1, v0) = v2) | ( ~ (v1 = v0) & ? [v3:
% 6.81/1.67 int] : ( ~ (v3 = 0) & real_$less(v1, v0) = v3))) & ! [v0: $real] : !
% 6.81/1.67 [v1: $real] : ! [v2: int] : (v2 = 0 | ~ (real_$greater(v0, v1) = v2) | ?
% 6.81/1.67 [v3: int] : ( ~ (v3 = 0) & real_$less(v1, v0) = v3)) & ! [v0: $real] : !
% 6.81/1.67 [v1: $real] : ! [v2: $real] : ( ~ (real_$product(v0, v1) = v2) |
% 6.81/1.67 real_$product(v1, v0) = v2) & ! [v0: $real] : ! [v1: $real] : ! [v2:
% 6.81/1.67 $real] : ( ~ (real_$lesseq(v2, v1) = 0) | ~ (real_$less(v1, v0) = 0) |
% 6.81/1.67 real_$less(v2, v0) = 0) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] :
% 6.81/1.67 ( ~ (real_$sum(v0, v1) = v2) | real_$sum(v1, v0) = v2) & ! [v0: $real] : !
% 6.81/1.67 [v1: $real] : (v1 = v0 | ~ (real_$lesseq(v1, v0) = 0) | real_$less(v1, v0) =
% 6.81/1.67 0) & ! [v0: $real] : ! [v1: $real] : (v1 = v0 | ~ (real_$sum(v0, real_0)
% 6.81/1.67 = v1)) & ! [v0: $real] : ! [v1: $real] : ( ~ (real_$uminus(v0) = v1) |
% 6.81/1.67 real_$uminus(v1) = v0) & ! [v0: $real] : ! [v1: $real] : ( ~
% 6.81/1.67 (real_$greatereq(v0, v1) = 0) | real_$lesseq(v1, v0) = 0) & ! [v0: $real] :
% 6.81/1.67 ! [v1: $real] : ( ~ (real_$greater(v0, v1) = 0) | real_$less(v1, v0) = 0) &
% 6.81/1.67 ! [v0: $real] : (v0 = real_0 | ~ (real_$uminus(v0) = v0))
% 6.81/1.67
% 6.81/1.67 Those formulas are unsatisfiable:
% 6.81/1.67 ---------------------------------
% 6.81/1.67
% 6.81/1.67 Begin of proof
% 6.81/1.67 |
% 6.81/1.67 | ALPHA: (input) implies:
% 6.81/1.67 | (1) real_$sum(real_0, real_0) = real_0
% 6.81/1.67 |
% 6.81/1.67 | GROUND_INST: instantiating (real_sum_problem_24) with real_0, simplifying with
% 6.81/1.67 | (1) gives:
% 6.81/1.67 | (2) $false
% 6.81/1.67 |
% 6.81/1.67 | CLOSE: (2) is inconsistent.
% 6.81/1.67 |
% 6.81/1.67 End of proof
% 6.81/1.67 % SZS output end Proof for theBenchmark
% 6.81/1.67
% 6.81/1.67 1037ms
%------------------------------------------------------------------------------