%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI375_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 : n025.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:49 EDT 2023 % Result : Theorem 8.43s 2.08s % Output : Proof 10.74s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : ARI375_1 : TPTP v8.1.2. Released v5.0.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.32 % Computer : n025.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 300 % 0.11/0.32 % DateTime : Tue Aug 29 18:26:55 EDT 2023 % 0.11/0.33 % CPUTime : % 0.17/0.61 ________ _____ % 0.17/0.61 ___ __ \_________(_)________________________________ % 0.17/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.17/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.17/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.17/0.61 % 0.17/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.17/0.61 (2023-06-19) % 0.17/0.61 % 0.17/0.61 (c) Philipp Rümmer, 2009-2023 % 0.17/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.17/0.61 Amanda Stjerna. % 0.17/0.61 Free software under BSD-3-Clause. % 0.17/0.61 % 0.17/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.17/0.61 % 0.17/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.17/0.62 Running up to 7 provers in parallel. % 0.17/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.17/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.17/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.17/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.17/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.17/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.17/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.47/0.97 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation % 1.47/0.97 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation % 1.47/0.97 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation % 1.47/0.97 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation % 1.47/0.97 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation % 1.47/0.97 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation % 1.47/0.97 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation % 2.23/1.10 Prover 4: Preprocessing ... % 2.23/1.10 Prover 1: Preprocessing ... % 2.62/1.17 Prover 6: Preprocessing ... % 2.62/1.17 Prover 2: Preprocessing ... % 2.62/1.17 Prover 3: Preprocessing ... % 2.62/1.17 Prover 5: Preprocessing ... % 2.62/1.17 Prover 0: Preprocessing ... % 6.22/1.77 Prover 1: Constructing countermodel ... % 6.77/1.86 Prover 6: Proving ... % 7.63/1.90 Prover 4: Constructing countermodel ... % 7.79/1.96 Prover 0: Proving ... % 7.79/2.00 Prover 2: Proving ... % 7.79/2.00 Prover 3: Constructing countermodel ... % 8.43/2.07 Prover 0: proved (1444ms) % 8.43/2.08 % 8.43/2.08 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.43/2.08 % 8.43/2.08 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.43/2.08 Prover 2: stopped % 9.06/2.09 Prover 3: stopped % 9.06/2.10 Prover 6: stopped % 9.06/2.12 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation % 9.06/2.12 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.06/2.12 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation % 9.06/2.12 Prover 7: Preprocessing ... % 9.06/2.12 Prover 8: Preprocessing ... % 9.06/2.12 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.06/2.12 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.06/2.12 Prover 11: Warning: Problem contains reals, using incomplete axiomatisation % 9.06/2.12 Prover 10: Warning: Problem contains reals, using incomplete axiomatisation % 9.06/2.15 Prover 4: Found proof (size 3) % 9.06/2.15 Prover 11: Preprocessing ... % 9.06/2.15 Prover 10: Preprocessing ... % 9.06/2.15 Prover 1: Found proof (size 3) % 9.06/2.16 Prover 1: proved (1522ms) % 9.06/2.16 Prover 4: proved (1517ms) % 9.06/2.17 Prover 5: Proving ... % 9.06/2.18 Prover 5: stopped % 9.06/2.20 Prover 7: stopped % 9.06/2.25 Prover 10: stopped % 9.06/2.26 Prover 8: Warning: ignoring some quantifiers % 9.06/2.27 Prover 11: stopped % 9.06/2.28 Prover 8: Constructing countermodel ... % 9.06/2.29 Prover 8: stopped % 9.06/2.29 % 9.06/2.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.06/2.29 % 9.06/2.30 % SZS output start Proof for theBenchmark % 9.06/2.30 Assumptions after simplification: % 9.06/2.30 --------------------------------- % 9.06/2.30 % 9.06/2.30 (real_greater_problem_4) % 10.64/2.34 ! [v0: $real] : ~ (real_$greater(real_64/5, v0) = 0) % 10.64/2.34 % 10.64/2.35 (input) % 10.74/2.37 ~ (real_very_large = real_very_small) & ~ (real_very_large = real_64/5) & ~ % 10.74/2.38 (real_very_large = real_0) & ~ (real_very_small = real_64/5) & ~ % 10.74/2.38 (real_very_small = real_0) & ~ (real_64/5 = real_0) & real_$is_int(real_64/5) % 10.74/2.38 = 1 & real_$is_int(real_0) = 0 & real_$is_rat(real_64/5) = 0 & % 10.74/2.38 real_$is_rat(real_0) = 0 & real_$floor(real_0) = real_0 & % 10.74/2.38 real_$ceiling(real_0) = real_0 & real_$truncate(real_0) = real_0 & % 10.74/2.38 real_$round(real_0) = real_0 & real_$to_int(real_64/5) = 12 & % 10.74/2.38 real_$to_int(real_0) = 0 & real_$to_rat(real_64/5) = rat_64/5 & % 10.74/2.38 real_$to_rat(real_0) = rat_0 & real_$to_real(real_64/5) = real_64/5 & % 10.74/2.38 real_$to_real(real_0) = real_0 & int_$to_real(0) = real_0 & % 10.74/2.38 real_$quotient(real_0, real_64/5) = real_0 & real_$product(real_64/5, real_0) % 10.74/2.38 = real_0 & real_$product(real_0, real_64/5) = real_0 & real_$product(real_0, % 10.74/2.38 real_0) = real_0 & real_$difference(real_64/5, real_64/5) = real_0 & % 10.74/2.38 real_$difference(real_64/5, real_0) = real_64/5 & real_$difference(real_0, % 10.74/2.38 real_0) = real_0 & real_$uminus(real_0) = real_0 & real_$sum(real_64/5, % 10.74/2.38 real_0) = real_64/5 & real_$sum(real_0, real_64/5) = real_64/5 & % 10.74/2.38 real_$sum(real_0, real_0) = real_0 & real_$greatereq(real_very_small, % 10.74/2.38 real_very_large) = 1 & real_$greatereq(real_64/5, real_64/5) = 0 & % 10.74/2.38 real_$greatereq(real_64/5, real_0) = 0 & real_$greatereq(real_0, real_64/5) = % 10.74/2.38 1 & real_$greatereq(real_0, real_0) = 0 & real_$lesseq(real_very_small, % 10.74/2.38 real_very_large) = 0 & real_$lesseq(real_64/5, real_64/5) = 0 & % 10.74/2.38 real_$lesseq(real_64/5, real_0) = 1 & real_$lesseq(real_0, real_64/5) = 0 & % 10.74/2.38 real_$lesseq(real_0, real_0) = 0 & real_$less(real_very_small, % 10.74/2.38 real_very_large) = 0 & real_$less(real_very_small, real_64/5) = 0 & % 10.74/2.38 real_$less(real_very_small, real_0) = 0 & real_$less(real_64/5, % 10.74/2.38 real_very_large) = 0 & real_$less(real_64/5, real_64/5) = 1 & % 10.74/2.38 real_$less(real_64/5, real_0) = 1 & real_$less(real_0, real_very_large) = 0 & % 10.74/2.38 real_$less(real_0, real_64/5) = 0 & real_$less(real_0, real_0) = 1 & % 10.74/2.38 real_$greater(real_very_large, real_64/5) = 0 & real_$greater(real_very_large, % 10.74/2.38 real_0) = 0 & real_$greater(real_very_small, real_very_large) = 1 & % 10.74/2.38 real_$greater(real_64/5, real_very_small) = 0 & real_$greater(real_64/5, % 10.74/2.38 real_64/5) = 1 & real_$greater(real_64/5, real_0) = 0 & % 10.74/2.38 real_$greater(real_0, real_very_small) = 0 & real_$greater(real_0, real_64/5) % 10.74/2.38 = 1 & real_$greater(real_0, real_0) = 1 & ! [v0: $real] : ! [v1: $real] : ! % 10.74/2.38 [v2: $real] : ! [v3: $real] : ! [v4: $real] : ( ~ (real_$sum(v3, v0) = v4) | % 10.74/2.38 ~ (real_$sum(v2, v1) = v3) | ? [v5: $real] : (real_$sum(v2, v5) = v4 & % 10.74/2.38 real_$sum(v1, v0) = v5)) & ! [v0: $real] : ! [v1: $real] : ! [v2: % 10.74/2.38 $real] : ! [v3: $real] : (v3 = v1 | v0 = real_0 | ~ (real_$quotient(v2, % 10.74/2.38 v0) = v3) | ~ (real_$product(v1, v0) = v2)) & ! [v0: $real] : ! [v1: % 10.74/2.38 $real] : ! [v2: $real] : ! [v3: int] : (v3 = 0 | ~ (real_$lesseq(v2, v0) % 10.74/2.38 = v3) | ~ (real_$lesseq(v1, v0) = 0) | ? [v4: int] : ( ~ (v4 = 0) & % 10.74/2.38 real_$lesseq(v2, v1) = v4)) & ! [v0: $real] : ! [v1: $real] : ! [v2: % 10.74/2.38 $real] : ! [v3: int] : (v3 = 0 | ~ (real_$lesseq(v1, v0) = 0) | ~ % 10.74/2.38 (real_$less(v2, v0) = v3) | ? [v4: int] : ( ~ (v4 = 0) & real_$less(v2, v1) % 10.74/2.38 = v4)) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: $real] % 10.74/2.38 : ( ~ (real_$uminus(v0) = v2) | ~ (real_$sum(v1, v2) = v3) | % 10.74/2.38 real_$difference(v1, v0) = v3) & ! [v0: $real] : ! [v1: $real] : ! [v2: % 10.74/2.38 $real] : (v2 = real_0 | ~ (real_$uminus(v0) = v1) | ~ (real_$sum(v0, v1) = % 10.74/2.38 v2)) & ! [v0: $real] : ! [v1: $real] : ! [v2: int] : (v2 = 0 | ~ % 10.74/2.38 (real_$greatereq(v0, v1) = v2) | ? [v3: int] : ( ~ (v3 = 0) & % 10.74/2.38 real_$lesseq(v1, v0) = v3)) & ! [v0: $real] : ! [v1: $real] : ! [v2: % 10.74/2.38 int] : (v2 = 0 | ~ (real_$lesseq(v1, v0) = v2) | ( ~ (v1 = v0) & ? [v3: % 10.74/2.38 int] : ( ~ (v3 = 0) & real_$less(v1, v0) = v3))) & ! [v0: $real] : ! % 10.74/2.38 [v1: $real] : ! [v2: int] : (v2 = 0 | ~ (real_$greater(v0, v1) = v2) | ? % 10.74/2.38 [v3: int] : ( ~ (v3 = 0) & real_$less(v1, v0) = v3)) & ! [v0: $real] : ! % 10.74/2.38 [v1: $real] : ! [v2: $real] : ( ~ (real_$product(v0, v1) = v2) | % 10.74/2.38 real_$product(v1, v0) = v2) & ! [v0: $real] : ! [v1: $real] : ! [v2: % 10.74/2.38 $real] : ( ~ (real_$sum(v0, v1) = v2) | real_$sum(v1, v0) = v2) & ! [v0: % 10.74/2.38 $real] : ! [v1: $real] : ! [v2: $real] : ( ~ (real_$lesseq(v2, v1) = 0) | % 10.74/2.38 ~ (real_$less(v1, v0) = 0) | real_$less(v2, v0) = 0) & ! [v0: $real] : ! % 10.74/2.38 [v1: $real] : (v1 = v0 | ~ (real_$sum(v0, real_0) = v1)) & ! [v0: $real] : % 10.74/2.38 ! [v1: $real] : (v1 = v0 | ~ (real_$lesseq(v1, v0) = 0) | real_$less(v1, v0) % 10.74/2.38 = 0) & ! [v0: $real] : ! [v1: $real] : ( ~ (real_$uminus(v0) = v1) | % 10.74/2.38 real_$uminus(v1) = v0) & ! [v0: $real] : ! [v1: $real] : ( ~ % 10.74/2.38 (real_$greatereq(v0, v1) = 0) | real_$lesseq(v1, v0) = 0) & ! [v0: $real] : % 10.74/2.38 ! [v1: $real] : ( ~ (real_$greater(v0, v1) = 0) | real_$less(v1, v0) = 0) & % 10.74/2.38 ! [v0: $real] : (v0 = real_0 | ~ (real_$uminus(v0) = v0)) % 10.74/2.38 % 10.74/2.38 Those formulas are unsatisfiable: % 10.74/2.38 --------------------------------- % 10.74/2.38 % 10.74/2.38 Begin of proof % 10.74/2.38 | % 10.74/2.39 | ALPHA: (input) implies: % 10.74/2.39 | (1) real_$greater(real_64/5, real_very_small) = 0 % 10.74/2.39 | % 10.74/2.39 | GROUND_INST: instantiating (real_greater_problem_4) with real_very_small, % 10.74/2.39 | simplifying with (1) gives: % 10.74/2.39 | (2) $false % 10.74/2.39 | % 10.74/2.39 | CLOSE: (2) is inconsistent. % 10.74/2.39 | % 10.74/2.39 End of proof % 10.74/2.39 % SZS output end Proof for theBenchmark % 10.74/2.39 % 10.74/2.39 1784ms %------------------------------------------------------------------------------