TSTP Solution File: ARI202_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : ARI202_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 : n028.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:15 EDT 2023
% Result : Theorem 8.32s 1.87s
% Output : Proof 8.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ARI202_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 : n028.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 19:08:56 EDT 2023
% 0.13/0.34 % 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.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.66/0.93 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.66/0.93 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.66/0.93 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.66/0.93 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.66/0.93 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.66/0.93 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation
% 1.66/0.94 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation
% 2.07/1.02 Prover 4: Preprocessing ...
% 2.07/1.02 Prover 1: Preprocessing ...
% 2.71/1.08 Prover 5: Preprocessing ...
% 2.71/1.08 Prover 2: Preprocessing ...
% 2.71/1.08 Prover 6: Preprocessing ...
% 2.71/1.08 Prover 3: Preprocessing ...
% 2.71/1.08 Prover 0: Preprocessing ...
% 6.69/1.67 Prover 6: Proving ...
% 6.69/1.68 Prover 1: Constructing countermodel ...
% 6.69/1.68 Prover 4: Constructing countermodel ...
% 7.27/1.73 Prover 0: Proving ...
% 7.27/1.73 Prover 3: Constructing countermodel ...
% 7.27/1.75 Prover 2: Proving ...
% 7.71/1.78 Prover 5: Proving ...
% 8.32/1.86 Prover 1: Found proof (size 3)
% 8.32/1.86 Prover 1: proved (1220ms)
% 8.32/1.86 Prover 4: Found proof (size 3)
% 8.32/1.86 Prover 4: proved (1220ms)
% 8.32/1.86 Prover 3: stopped
% 8.32/1.86 Prover 0: proved (1224ms)
% 8.32/1.86 Prover 5: stopped
% 8.32/1.86 Prover 2: stopped
% 8.32/1.86 Prover 6: stopped
% 8.32/1.86
% 8.32/1.87 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.32/1.87
% 8.32/1.87 % SZS output start Proof for theBenchmark
% 8.32/1.87 Assumptions after simplification:
% 8.32/1.87 ---------------------------------
% 8.32/1.87
% 8.32/1.87 (rat_less_problem_13)
% 8.32/1.89 ! [v0: $rat] : ~ (rat_$less(rat_-13/4, v0) = 0)
% 8.32/1.89
% 8.32/1.89 (input)
% 8.32/1.91 ~ (rat_very_large = rat_very_small) & ~ (rat_very_large = rat_-13/4) & ~
% 8.32/1.91 (rat_very_large = rat_0) & ~ (rat_very_small = rat_-13/4) & ~
% 8.32/1.91 (rat_very_small = rat_0) & ~ (rat_-13/4 = rat_0) & rat_$is_int(rat_-13/4) = 1
% 8.32/1.91 & rat_$is_int(rat_0) = 0 & rat_$is_rat(rat_-13/4) = 0 & rat_$is_rat(rat_0) = 0
% 8.32/1.91 & rat_$floor(rat_0) = rat_0 & rat_$ceiling(rat_0) = rat_0 &
% 8.32/1.91 rat_$truncate(rat_0) = rat_0 & rat_$round(rat_0) = rat_0 &
% 8.32/1.91 rat_$to_int(rat_-13/4) = -4 & rat_$to_int(rat_0) = 0 & rat_$to_rat(rat_-13/4)
% 8.32/1.91 = rat_-13/4 & rat_$to_rat(rat_0) = rat_0 & rat_$to_real(rat_-13/4) =
% 8.32/1.91 real_-13/4 & rat_$to_real(rat_0) = real_0 & int_$to_rat(0) = rat_0 &
% 8.32/1.91 rat_$quotient(rat_0, rat_-13/4) = rat_0 & rat_$product(rat_-13/4, rat_0) =
% 8.32/1.91 rat_0 & rat_$product(rat_0, rat_-13/4) = rat_0 & rat_$product(rat_0, rat_0) =
% 8.32/1.91 rat_0 & rat_$difference(rat_-13/4, rat_-13/4) = rat_0 &
% 8.32/1.91 rat_$difference(rat_-13/4, rat_0) = rat_-13/4 & rat_$difference(rat_0, rat_0)
% 8.32/1.91 = rat_0 & rat_$uminus(rat_0) = rat_0 & rat_$sum(rat_-13/4, rat_0) = rat_-13/4
% 8.32/1.91 & rat_$sum(rat_0, rat_-13/4) = rat_-13/4 & rat_$sum(rat_0, rat_0) = rat_0 &
% 8.32/1.91 rat_$greatereq(rat_very_small, rat_very_large) = 1 & rat_$greatereq(rat_-13/4,
% 8.32/1.91 rat_-13/4) = 0 & rat_$greatereq(rat_-13/4, rat_0) = 1 &
% 8.32/1.91 rat_$greatereq(rat_0, rat_-13/4) = 0 & rat_$greatereq(rat_0, rat_0) = 0 &
% 8.32/1.91 rat_$lesseq(rat_very_small, rat_very_large) = 0 & rat_$lesseq(rat_-13/4,
% 8.32/1.91 rat_-13/4) = 0 & rat_$lesseq(rat_-13/4, rat_0) = 0 & rat_$lesseq(rat_0,
% 8.32/1.91 rat_-13/4) = 1 & rat_$lesseq(rat_0, rat_0) = 0 &
% 8.32/1.91 rat_$greater(rat_very_large, rat_-13/4) = 0 & rat_$greater(rat_very_large,
% 8.32/1.91 rat_0) = 0 & rat_$greater(rat_very_small, rat_very_large) = 1 &
% 8.32/1.91 rat_$greater(rat_-13/4, rat_very_small) = 0 & rat_$greater(rat_-13/4,
% 8.32/1.91 rat_-13/4) = 1 & rat_$greater(rat_-13/4, rat_0) = 1 & rat_$greater(rat_0,
% 8.32/1.91 rat_very_small) = 0 & rat_$greater(rat_0, rat_-13/4) = 0 &
% 8.32/1.91 rat_$greater(rat_0, rat_0) = 1 & rat_$less(rat_very_small, rat_very_large) = 0
% 8.32/1.91 & rat_$less(rat_very_small, rat_-13/4) = 0 & rat_$less(rat_very_small, rat_0)
% 8.32/1.91 = 0 & rat_$less(rat_-13/4, rat_very_large) = 0 & rat_$less(rat_-13/4,
% 8.32/1.91 rat_-13/4) = 1 & rat_$less(rat_-13/4, rat_0) = 0 & rat_$less(rat_0,
% 8.32/1.91 rat_very_large) = 0 & rat_$less(rat_0, rat_-13/4) = 1 & rat_$less(rat_0,
% 8.32/1.91 rat_0) = 1 & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] :
% 8.32/1.91 ! [v4: $rat] : ( ~ (rat_$sum(v3, v0) = v4) | ~ (rat_$sum(v2, v1) = v3) | ?
% 8.32/1.91 [v5: $rat] : (rat_$sum(v2, v5) = v4 & rat_$sum(v1, v0) = v5)) & ! [v0:
% 8.32/1.91 $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : (v3 = v1 | v0 =
% 8.32/1.91 rat_0 | ~ (rat_$quotient(v2, v0) = v3) | ~ (rat_$product(v1, v0) = v2)) &
% 8.32/1.91 ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: int] : (v3 = 0 | ~
% 8.32/1.92 (rat_$lesseq(v2, v0) = v3) | ~ (rat_$lesseq(v1, v0) = 0) | ? [v4: int] : (
% 8.32/1.92 ~ (v4 = 0) & rat_$lesseq(v2, v1) = v4)) & ! [v0: $rat] : ! [v1: $rat] :
% 8.32/1.92 ! [v2: $rat] : ! [v3: int] : (v3 = 0 | ~ (rat_$lesseq(v1, v0) = 0) | ~
% 8.32/1.92 (rat_$less(v2, v0) = v3) | ? [v4: int] : ( ~ (v4 = 0) & rat_$less(v2, v1) =
% 8.32/1.92 v4)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: $rat] : ( ~
% 8.32/1.92 (rat_$uminus(v0) = v2) | ~ (rat_$sum(v1, v2) = v3) | rat_$difference(v1,
% 8.32/1.92 v0) = v3) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : (v2 = rat_0 |
% 8.32/1.92 ~ (rat_$uminus(v0) = v1) | ~ (rat_$sum(v0, v1) = v2)) & ! [v0: $rat] : !
% 8.32/1.92 [v1: $rat] : ! [v2: int] : (v2 = 0 | ~ (rat_$greatereq(v0, v1) = v2) | ?
% 8.32/1.92 [v3: int] : ( ~ (v3 = 0) & rat_$lesseq(v1, v0) = v3)) & ! [v0: $rat] : !
% 8.32/1.92 [v1: $rat] : ! [v2: int] : (v2 = 0 | ~ (rat_$lesseq(v1, v0) = v2) | ( ~ (v1
% 8.32/1.92 = v0) & ? [v3: int] : ( ~ (v3 = 0) & rat_$less(v1, v0) = v3))) & !
% 8.32/1.92 [v0: $rat] : ! [v1: $rat] : ! [v2: int] : (v2 = 0 | ~ (rat_$greater(v0, v1)
% 8.32/1.92 = v2) | ? [v3: int] : ( ~ (v3 = 0) & rat_$less(v1, v0) = v3)) & ! [v0:
% 8.32/1.92 $rat] : ! [v1: $rat] : ! [v2: $rat] : ( ~ (rat_$product(v0, v1) = v2) |
% 8.32/1.92 rat_$product(v1, v0) = v2) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] :
% 8.32/1.92 ( ~ (rat_$sum(v0, v1) = v2) | rat_$sum(v1, v0) = v2) & ! [v0: $rat] : ! [v1:
% 8.32/1.92 $rat] : ! [v2: $rat] : ( ~ (rat_$lesseq(v2, v1) = 0) | ~ (rat_$less(v1,
% 8.32/1.92 v0) = 0) | rat_$less(v2, v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : (v1
% 8.32/1.92 = v0 | ~ (rat_$sum(v0, rat_0) = v1)) & ! [v0: $rat] : ! [v1: $rat] : (v1
% 8.32/1.92 = v0 | ~ (rat_$lesseq(v1, v0) = 0) | rat_$less(v1, v0) = 0) & ! [v0: $rat]
% 8.32/1.92 : ! [v1: $rat] : ( ~ (rat_$uminus(v0) = v1) | rat_$uminus(v1) = v0) & ! [v0:
% 8.32/1.92 $rat] : ! [v1: $rat] : ( ~ (rat_$greatereq(v0, v1) = 0) | rat_$lesseq(v1,
% 8.32/1.92 v0) = 0) & ! [v0: $rat] : ! [v1: $rat] : ( ~ (rat_$greater(v0, v1) = 0)
% 8.32/1.92 | rat_$less(v1, v0) = 0) & ! [v0: $rat] : (v0 = rat_0 | ~ (rat_$uminus(v0)
% 8.32/1.92 = v0))
% 8.32/1.92
% 8.32/1.92 Those formulas are unsatisfiable:
% 8.32/1.92 ---------------------------------
% 8.32/1.92
% 8.32/1.92 Begin of proof
% 8.32/1.92 |
% 8.32/1.92 | ALPHA: (input) implies:
% 8.32/1.92 | (1) rat_$less(rat_-13/4, rat_very_large) = 0
% 8.32/1.92 |
% 8.32/1.92 | GROUND_INST: instantiating (rat_less_problem_13) with rat_very_large,
% 8.32/1.92 | simplifying with (1) gives:
% 8.32/1.92 | (2) $false
% 8.32/1.92 |
% 8.32/1.92 | CLOSE: (2) is inconsistent.
% 8.32/1.92 |
% 8.32/1.92 End of proof
% 8.32/1.92 % SZS output end Proof for theBenchmark
% 8.32/1.92
% 8.32/1.92 1302ms
%------------------------------------------------------------------------------