%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI382_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 : n031.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:50 EDT 2023 % Result : Theorem 5.39s 1.45s % Output : Proof 6.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.01/0.13 % Problem : ARI382_1 : TPTP v8.1.2. Released v5.0.0. % 0.01/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n031.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 19:16:26 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.59 ________ _____ % 0.20/0.59 ___ __ \_________(_)________________________________ % 0.20/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.59 % 0.20/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.59 (2023-06-19) % 0.20/0.59 % 0.20/0.59 (c) Philipp Rümmer, 2009-2023 % 0.20/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.59 Amanda Stjerna. % 0.20/0.59 Free software under BSD-3-Clause. % 0.20/0.59 % 0.20/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.59 % 0.20/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.60/0.60 Running up to 7 provers in parallel. % 0.60/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.60/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.60/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.60/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.60/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.60/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.60/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.58/0.87 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.87 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.87 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.87 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.87 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.87 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation % 1.58/0.87 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation % 2.13/0.96 Prover 1: Preprocessing ... % 2.13/0.96 Prover 4: Preprocessing ... % 2.40/1.00 Prover 2: Preprocessing ... % 2.40/1.00 Prover 6: Preprocessing ... % 2.40/1.00 Prover 5: Preprocessing ... % 2.40/1.00 Prover 0: Preprocessing ... % 2.40/1.00 Prover 3: Preprocessing ... % 4.75/1.35 Prover 1: Constructing countermodel ... % 4.75/1.35 Prover 6: Proving ... % 4.75/1.36 Prover 5: Proving ... % 4.75/1.36 Prover 3: Constructing countermodel ... % 4.75/1.38 Prover 2: Proving ... % 4.75/1.39 Prover 0: Proving ... % 5.39/1.45 Prover 4: Constructing countermodel ... % 5.39/1.45 Prover 2: proved (840ms) % 5.39/1.45 % 5.39/1.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.39/1.45 % 5.39/1.45 Prover 5: proved (839ms) % 5.39/1.45 % 5.39/1.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.39/1.45 % 5.39/1.46 Prover 3: stopped % 5.39/1.46 Prover 0: stopped % 5.39/1.46 Prover 6: stopped % 5.39/1.46 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.39/1.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.39/1.46 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.39/1.46 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.39/1.46 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.39/1.46 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation % 5.39/1.47 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation % 5.39/1.47 Prover 11: Warning: Problem contains reals, using incomplete axiomatisation % 5.39/1.47 Prover 10: Warning: Problem contains reals, using incomplete axiomatisation % 5.39/1.47 Prover 13: Warning: Problem contains reals, using incomplete axiomatisation % 5.39/1.47 Prover 1: Found proof (size 3) % 5.39/1.47 Prover 1: proved (858ms) % 5.39/1.47 Prover 8: Preprocessing ... % 5.39/1.47 Prover 4: stopped % 5.39/1.47 Prover 7: Preprocessing ... % 5.39/1.47 Prover 10: Preprocessing ... % 5.39/1.48 Prover 11: Preprocessing ... % 5.39/1.48 Prover 13: Preprocessing ... % 5.95/1.49 Prover 10: stopped % 5.95/1.50 Prover 7: stopped % 5.95/1.50 Prover 13: stopped % 5.95/1.51 Prover 11: stopped % 5.95/1.55 Prover 8: Warning: ignoring some quantifiers % 5.95/1.56 Prover 8: Constructing countermodel ... % 5.95/1.57 Prover 8: stopped % 5.95/1.57 % 5.95/1.57 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.95/1.57 % 5.95/1.57 % SZS output start Proof for theBenchmark % 5.95/1.57 Assumptions after simplification: % 5.95/1.57 --------------------------------- % 5.95/1.57 % 5.95/1.57 (real_greater_problem_11) % 6.53/1.60 ! [v0: $real] : ~ (real_$greater(real_0, v0) = 0) % 6.53/1.60 % 6.53/1.60 (input) % 6.64/1.62 ~ (real_very_large = real_very_small) & ~ (real_very_large = real_0) & ~ % 6.64/1.62 (real_very_small = real_0) & real_$is_int(real_0) = 0 & real_$is_rat(real_0) = % 6.64/1.62 0 & real_$floor(real_0) = real_0 & real_$ceiling(real_0) = real_0 & % 6.64/1.62 real_$truncate(real_0) = real_0 & real_$round(real_0) = real_0 & % 6.64/1.62 real_$to_int(real_0) = 0 & real_$to_rat(real_0) = rat_0 & % 6.64/1.62 real_$to_real(real_0) = real_0 & int_$to_real(0) = real_0 & % 6.64/1.62 real_$product(real_0, real_0) = real_0 & real_$difference(real_0, real_0) = % 6.64/1.62 real_0 & real_$uminus(real_0) = real_0 & real_$sum(real_0, real_0) = real_0 & % 6.64/1.62 real_$greatereq(real_very_small, real_very_large) = 1 & % 6.64/1.62 real_$greatereq(real_0, real_0) = 0 & real_$lesseq(real_very_small, % 6.64/1.62 real_very_large) = 0 & real_$lesseq(real_0, real_0) = 0 & % 6.64/1.62 real_$less(real_very_small, real_very_large) = 0 & real_$less(real_very_small, % 6.64/1.62 real_0) = 0 & real_$less(real_0, real_very_large) = 0 & real_$less(real_0, % 6.64/1.62 real_0) = 1 & real_$greater(real_very_large, real_0) = 0 & % 6.64/1.62 real_$greater(real_very_small, real_very_large) = 1 & real_$greater(real_0, % 6.64/1.62 real_very_small) = 0 & real_$greater(real_0, real_0) = 1 & ! [v0: $real] : % 6.64/1.62 ! [v1: $real] : ! [v2: $real] : ! [v3: $real] : ! [v4: $real] : ( ~ % 6.64/1.62 (real_$sum(v3, v0) = v4) | ~ (real_$sum(v2, v1) = v3) | ? [v5: $real] : % 6.64/1.62 (real_$sum(v2, v5) = v4 & real_$sum(v1, v0) = v5)) & ! [v0: $real] : ! % 6.64/1.62 [v1: $real] : ! [v2: $real] : ! [v3: $real] : (v3 = v1 | v0 = real_0 | ~ % 6.64/1.62 (real_$quotient(v2, v0) = v3) | ~ (real_$product(v1, v0) = v2)) & ! [v0: % 6.64/1.62 $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: int] : (v3 = 0 | ~ % 6.64/1.62 (real_$lesseq(v2, v0) = v3) | ~ (real_$lesseq(v1, v0) = 0) | ? [v4: int] : % 6.64/1.62 ( ~ (v4 = 0) & real_$lesseq(v2, v1) = v4)) & ! [v0: $real] : ! [v1: $real] % 6.64/1.62 : ! [v2: $real] : ! [v3: int] : (v3 = 0 | ~ (real_$lesseq(v1, v0) = 0) | ~ % 6.64/1.62 (real_$less(v2, v0) = v3) | ? [v4: int] : ( ~ (v4 = 0) & real_$less(v2, v1) % 6.64/1.62 = v4)) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: $real] % 6.64/1.62 : ( ~ (real_$uminus(v0) = v2) | ~ (real_$sum(v1, v2) = v3) | % 6.64/1.62 real_$difference(v1, v0) = v3) & ! [v0: $real] : ! [v1: $real] : ! [v2: % 6.64/1.62 $real] : (v2 = real_0 | ~ (real_$uminus(v0) = v1) | ~ (real_$sum(v0, v1) = % 6.64/1.62 v2)) & ! [v0: $real] : ! [v1: $real] : ! [v2: int] : (v2 = 0 | ~ % 6.64/1.62 (real_$greatereq(v0, v1) = v2) | ? [v3: int] : ( ~ (v3 = 0) & % 6.64/1.62 real_$lesseq(v1, v0) = v3)) & ! [v0: $real] : ! [v1: $real] : ! [v2: % 6.64/1.62 int] : (v2 = 0 | ~ (real_$lesseq(v1, v0) = v2) | ( ~ (v1 = v0) & ? [v3: % 6.64/1.62 int] : ( ~ (v3 = 0) & real_$less(v1, v0) = v3))) & ! [v0: $real] : ! % 6.64/1.62 [v1: $real] : ! [v2: int] : (v2 = 0 | ~ (real_$greater(v0, v1) = v2) | ? % 6.64/1.62 [v3: int] : ( ~ (v3 = 0) & real_$less(v1, v0) = v3)) & ! [v0: $real] : ! % 6.64/1.62 [v1: $real] : ! [v2: $real] : ( ~ (real_$product(v0, v1) = v2) | % 6.64/1.62 real_$product(v1, v0) = v2) & ! [v0: $real] : ! [v1: $real] : ! [v2: % 6.64/1.62 $real] : ( ~ (real_$sum(v0, v1) = v2) | real_$sum(v1, v0) = v2) & ! [v0: % 6.64/1.62 $real] : ! [v1: $real] : ! [v2: $real] : ( ~ (real_$lesseq(v2, v1) = 0) | % 6.64/1.62 ~ (real_$less(v1, v0) = 0) | real_$less(v2, v0) = 0) & ! [v0: $real] : ! % 6.64/1.62 [v1: $real] : (v1 = v0 | ~ (real_$sum(v0, real_0) = v1)) & ! [v0: $real] : % 6.64/1.62 ! [v1: $real] : (v1 = v0 | ~ (real_$lesseq(v1, v0) = 0) | real_$less(v1, v0) % 6.64/1.62 = 0) & ! [v0: $real] : ! [v1: $real] : ( ~ (real_$uminus(v0) = v1) | % 6.64/1.62 real_$uminus(v1) = v0) & ! [v0: $real] : ! [v1: $real] : ( ~ % 6.64/1.62 (real_$greatereq(v0, v1) = 0) | real_$lesseq(v1, v0) = 0) & ! [v0: $real] : % 6.64/1.62 ! [v1: $real] : ( ~ (real_$greater(v0, v1) = 0) | real_$less(v1, v0) = 0) & % 6.64/1.62 ! [v0: $real] : (v0 = real_0 | ~ (real_$uminus(v0) = v0)) % 6.64/1.62 % 6.64/1.62 Those formulas are unsatisfiable: % 6.64/1.62 --------------------------------- % 6.64/1.62 % 6.64/1.62 Begin of proof % 6.64/1.62 | % 6.64/1.62 | ALPHA: (input) implies: % 6.64/1.62 | (1) real_$greater(real_0, real_very_small) = 0 % 6.64/1.62 | % 6.64/1.63 | GROUND_INST: instantiating (real_greater_problem_11) with real_very_small, % 6.64/1.63 | simplifying with (1) gives: % 6.64/1.63 | (2) $false % 6.64/1.63 | % 6.64/1.63 | CLOSE: (2) is inconsistent. % 6.64/1.63 | % 6.64/1.63 End of proof % 6.64/1.63 % SZS output end Proof for theBenchmark % 6.64/1.63 % 6.64/1.63 1035ms %------------------------------------------------------------------------------