%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI369_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 : n011.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:47 EDT 2023 % Result : Theorem 5.86s 1.49s % Output : Proof 7.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : ARI369_1 : TPTP v8.1.2. Released v5.0.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n011.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Tue Aug 29 17:56:26 EDT 2023 % 0.14/0.35 % CPUTime : % 0.20/0.63 ________ _____ % 0.20/0.63 ___ __ \_________(_)________________________________ % 0.20/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.63 % 0.20/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.63 (2023-06-19) % 0.20/0.63 % 0.20/0.63 (c) Philipp Rümmer, 2009-2023 % 0.20/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.63 Amanda Stjerna. % 0.20/0.63 Free software under BSD-3-Clause. % 0.20/0.63 % 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.63 % 0.20/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.64 Running up to 7 provers in parallel. % 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 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 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 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 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.70/0.91 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation % 1.70/0.91 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation % 1.70/0.91 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation % 1.70/0.91 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation % 1.70/0.91 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation % 1.70/0.91 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation % 1.70/0.91 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation % 2.17/0.99 Prover 4: Preprocessing ... % 2.17/0.99 Prover 1: Preprocessing ... % 2.17/1.03 Prover 6: Preprocessing ... % 2.17/1.03 Prover 5: Preprocessing ... % 2.17/1.03 Prover 0: Preprocessing ... % 2.17/1.03 Prover 2: Preprocessing ... % 2.17/1.03 Prover 3: Preprocessing ... % 4.39/1.37 Prover 6: Proving ... % 4.39/1.39 Prover 5: Proving ... % 4.39/1.40 Prover 1: Constructing countermodel ... % 4.39/1.40 Prover 2: Proving ... % 4.39/1.41 Prover 3: Constructing countermodel ... % 4.39/1.44 Prover 0: Proving ... % 5.21/1.46 Prover 4: Constructing countermodel ... % 5.86/1.49 Prover 5: proved (842ms) % 5.86/1.49 % 5.86/1.49 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.86/1.49 % 5.86/1.50 Prover 6: stopped % 5.86/1.50 Prover 2: stopped % 5.86/1.50 Prover 0: stopped % 5.86/1.50 Prover 3: stopped % 5.86/1.50 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.86/1.50 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.86/1.50 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.86/1.50 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.86/1.50 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.86/1.50 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation % 5.86/1.50 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation % 5.86/1.50 Prover 11: Warning: Problem contains reals, using incomplete axiomatisation % 5.86/1.50 Prover 13: Warning: Problem contains reals, using incomplete axiomatisation % 5.86/1.51 Prover 8: Preprocessing ... % 5.86/1.51 Prover 7: Preprocessing ... % 5.86/1.51 Prover 13: Preprocessing ... % 5.86/1.51 Prover 10: Warning: Problem contains reals, using incomplete axiomatisation % 5.86/1.51 Prover 11: Preprocessing ... % 5.86/1.52 Prover 10: Preprocessing ... % 6.15/1.55 Prover 4: Found proof (size 3) % 6.15/1.55 Prover 4: proved (904ms) % 6.15/1.55 Prover 1: Found proof (size 3) % 6.15/1.55 Prover 1: proved (908ms) % 6.15/1.59 Prover 10: Warning: ignoring some quantifiers % 6.15/1.59 Prover 10: Constructing countermodel ... % 6.15/1.59 Prover 7: Warning: ignoring some quantifiers % 6.15/1.60 Prover 7: Constructing countermodel ... % 6.15/1.60 Prover 10: stopped % 6.15/1.61 Prover 7: stopped % 6.15/1.61 Prover 8: Warning: ignoring some quantifiers % 6.15/1.61 Prover 13: Warning: ignoring some quantifiers % 6.75/1.61 Prover 13: Constructing countermodel ... % 6.75/1.62 Prover 8: Constructing countermodel ... % 6.75/1.62 Prover 13: stopped % 6.75/1.62 Prover 8: stopped % 6.75/1.66 Prover 11: Constructing countermodel ... % 6.75/1.66 Prover 11: stopped % 6.75/1.67 % 6.75/1.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.75/1.67 % 6.75/1.67 % SZS output start Proof for theBenchmark % 6.75/1.67 Assumptions after simplification: % 6.75/1.67 --------------------------------- % 6.75/1.67 % 6.75/1.67 (real_lesseq_problem_12) % 7.11/1.69 ! [v0: $real] : ~ (real_$lesseq(v0, real_0) = 0) % 7.11/1.69 % 7.11/1.69 (input) % 7.11/1.72 ~ (real_very_large = real_very_small) & ~ (real_very_large = real_0) & ~ % 7.11/1.72 (real_very_small = real_0) & real_$is_int(real_0) = 0 & real_$is_rat(real_0) = % 7.11/1.72 0 & real_$floor(real_0) = real_0 & real_$ceiling(real_0) = real_0 & % 7.11/1.72 real_$truncate(real_0) = real_0 & real_$round(real_0) = real_0 & % 7.11/1.72 real_$to_int(real_0) = 0 & real_$to_rat(real_0) = rat_0 & % 7.11/1.72 real_$to_real(real_0) = real_0 & int_$to_real(0) = real_0 & % 7.11/1.72 real_$product(real_0, real_0) = real_0 & real_$difference(real_0, real_0) = % 7.11/1.72 real_0 & real_$uminus(real_0) = real_0 & real_$sum(real_0, real_0) = real_0 & % 7.11/1.72 real_$greatereq(real_very_small, real_very_large) = 1 & % 7.11/1.72 real_$greatereq(real_0, real_0) = 0 & real_$greater(real_very_large, real_0) = % 7.11/1.72 0 & real_$greater(real_very_small, real_very_large) = 1 & % 7.11/1.72 real_$greater(real_0, real_very_small) = 0 & real_$greater(real_0, real_0) = 1 % 7.11/1.72 & real_$less(real_very_small, real_very_large) = 0 & % 7.11/1.72 real_$less(real_very_small, real_0) = 0 & real_$less(real_0, real_very_large) % 7.11/1.72 = 0 & real_$less(real_0, real_0) = 1 & real_$lesseq(real_very_small, % 7.11/1.72 real_very_large) = 0 & real_$lesseq(real_0, real_0) = 0 & ! [v0: $real] : % 7.11/1.72 ! [v1: $real] : ! [v2: $real] : ! [v3: $real] : ! [v4: $real] : ( ~ % 7.11/1.72 (real_$sum(v3, v0) = v4) | ~ (real_$sum(v2, v1) = v3) | ? [v5: $real] : % 7.11/1.72 (real_$sum(v2, v5) = v4 & real_$sum(v1, v0) = v5)) & ! [v0: $real] : ! % 7.11/1.72 [v1: $real] : ! [v2: $real] : ! [v3: $real] : ! [v4: $real] : ( ~ % 7.11/1.72 (real_$sum(v2, v3) = v4) | ~ (real_$sum(v1, v0) = v3) | ? [v5: $real] : % 7.11/1.72 (real_$sum(v5, v0) = v4 & real_$sum(v2, v1) = v5)) & ! [v0: $real] : ! % 7.11/1.72 [v1: $real] : ! [v2: $real] : ! [v3: int] : (v3 = 0 | ~ (real_$less(v2, v1) % 7.11/1.72 = 0) | ~ (real_$less(v2, v0) = v3) | ? [v4: int] : ( ~ (v4 = 0) & % 7.11/1.72 real_$lesseq(v1, v0) = v4)) & ! [v0: $real] : ! [v1: $real] : ! [v2: % 7.11/1.72 $real] : ! [v3: int] : (v3 = 0 | ~ (real_$less(v2, v0) = v3) | ~ % 7.11/1.72 (real_$less(v1, v0) = 0) | ? [v4: int] : ( ~ (v4 = 0) & real_$lesseq(v2, % 7.11/1.72 v1) = v4)) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: % 7.11/1.72 int] : (v3 = 0 | ~ (real_$less(v2, v0) = v3) | ~ (real_$lesseq(v2, v1) = % 7.11/1.72 0) | ? [v4: int] : ( ~ (v4 = 0) & real_$less(v1, v0) = v4)) & ! [v0: % 7.11/1.72 $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: int] : (v3 = 0 | ~ % 7.11/1.72 (real_$less(v2, v0) = v3) | ~ (real_$lesseq(v1, v0) = 0) | ? [v4: int] : ( % 7.11/1.72 ~ (v4 = 0) & real_$less(v2, v1) = v4)) & ! [v0: $real] : ! [v1: $real] : % 7.11/1.72 ! [v2: $real] : ! [v3: int] : (v3 = 0 | ~ (real_$lesseq(v2, v1) = 0) | ~ % 7.11/1.72 (real_$lesseq(v2, v0) = v3) | ? [v4: int] : ( ~ (v4 = 0) & real_$lesseq(v1, % 7.11/1.73 v0) = v4)) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: % 7.11/1.73 int] : (v3 = 0 | ~ (real_$lesseq(v2, v0) = v3) | ~ (real_$lesseq(v1, v0) = % 7.11/1.73 0) | ? [v4: int] : ( ~ (v4 = 0) & real_$lesseq(v2, v1) = v4)) & ! [v0: % 7.11/1.73 $real] : ! [v1: $real] : ! [v2: $real] : ! [v3: $real] : ( ~ % 7.11/1.73 (real_$uminus(v0) = v2) | ~ (real_$sum(v1, v2) = v3) | real_$difference(v1, % 7.11/1.73 v0) = v3) & ! [v0: $real] : ! [v1: $real] : ! [v2: int] : (v2 = 0 | v1 % 7.11/1.73 = v0 | ~ (real_$less(v1, v0) = v2) | ? [v3: int] : ( ~ (v3 = 0) & % 7.11/1.73 real_$lesseq(v1, v0) = v3)) & ! [v0: $real] : ! [v1: $real] : ! [v2: % 7.11/1.73 int] : (v2 = 0 | ~ (real_$greatereq(v0, v1) = v2) | ? [v3: int] : ( ~ (v3 % 7.11/1.73 = 0) & real_$lesseq(v1, v0) = v3)) & ! [v0: $real] : ! [v1: $real] : % 7.11/1.73 ! [v2: int] : (v2 = 0 | ~ (real_$greater(v0, v1) = v2) | ? [v3: int] : ( ~ % 7.11/1.73 (v3 = 0) & real_$less(v1, v0) = v3)) & ! [v0: $real] : ! [v1: $real] : % 7.11/1.73 ! [v2: int] : (v2 = 0 | ~ (real_$less(v1, v0) = v2) | ? [v3: int] : ( ~ (v3 % 7.11/1.73 = 0) & real_$greater(v0, v1) = v3)) & ! [v0: $real] : ! [v1: $real] : % 7.11/1.73 ! [v2: int] : (v2 = 0 | ~ (real_$lesseq(v1, v0) = v2) | ? [v3: int] : ( ~ % 7.11/1.73 (v3 = 0) & real_$greatereq(v0, v1) = v3)) & ! [v0: $real] : ! [v1: % 7.11/1.73 $real] : ! [v2: int] : (v2 = 0 | ~ (real_$lesseq(v1, v0) = v2) | ? [v3: % 7.11/1.73 int] : ( ~ (v3 = 0) & real_$less(v1, v0) = v3)) & ! [v0: $real] : ! [v1: % 7.11/1.73 $real] : ! [v2: $real] : (v0 = real_0 | ~ (real_$product(v1, v0) = v2) | % 7.11/1.73 real_$quotient(v2, v0) = v1) & ! [v0: $real] : ! [v1: $real] : ! [v2: % 7.11/1.73 $real] : ( ~ (real_$product(v1, v0) = v2) | real_$product(v0, v1) = v2) & ! % 7.11/1.73 [v0: $real] : ! [v1: $real] : ! [v2: $real] : ( ~ (real_$product(v0, v1) = % 7.11/1.73 v2) | real_$product(v1, v0) = v2) & ! [v0: $real] : ! [v1: $real] : ! % 7.11/1.73 [v2: $real] : ( ~ (real_$difference(v1, v0) = v2) | ? [v3: $real] : % 7.11/1.73 (real_$uminus(v0) = v3 & real_$sum(v1, v3) = v2)) & ! [v0: $real] : ! [v1: % 7.11/1.73 $real] : ! [v2: $real] : ( ~ (real_$sum(v1, v0) = v2) | real_$sum(v0, v1) = % 7.11/1.73 v2) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ( ~ (real_$sum(v0, % 7.11/1.73 v1) = v2) | real_$sum(v1, v0) = v2) & ! [v0: $real] : ! [v1: $real] : % 7.11/1.73 ! [v2: $real] : ( ~ (real_$less(v2, v1) = 0) | ~ (real_$lesseq(v1, v0) = 0) | % 7.11/1.73 real_$less(v2, v0) = 0) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : % 7.11/1.73 ( ~ (real_$less(v1, v0) = 0) | ~ (real_$lesseq(v2, v1) = 0) | real_$less(v2, % 7.11/1.73 v0) = 0) & ! [v0: $real] : ! [v1: $real] : ! [v2: $real] : ( ~ % 7.11/1.73 (real_$lesseq(v2, v1) = 0) | ~ (real_$lesseq(v1, v0) = 0) | % 7.11/1.73 real_$lesseq(v2, v0) = 0) & ! [v0: $real] : ! [v1: $real] : (v1 = v0 | ~ % 7.11/1.73 (real_$sum(v0, real_0) = v1)) & ! [v0: $real] : ! [v1: $real] : (v1 = v0 | % 7.11/1.73 ~ (real_$lesseq(v1, v0) = 0) | real_$less(v1, v0) = 0) & ! [v0: $real] : % 7.11/1.73 ! [v1: int] : (v1 = 0 | ~ (real_$lesseq(v0, v0) = v1)) & ! [v0: $real] : ! % 7.11/1.73 [v1: $real] : ( ~ (real_$uminus(v0) = v1) | real_$uminus(v1) = v0) & ! [v0: % 7.11/1.73 $real] : ! [v1: $real] : ( ~ (real_$uminus(v0) = v1) | real_$sum(v0, v1) = % 7.11/1.73 real_0) & ! [v0: $real] : ! [v1: $real] : ( ~ (real_$greatereq(v0, v1) = % 7.11/1.73 0) | real_$lesseq(v1, v0) = 0) & ! [v0: $real] : ! [v1: $real] : ( ~ % 7.11/1.73 (real_$greater(v0, v1) = 0) | real_$less(v1, v0) = 0) & ! [v0: $real] : ! % 7.11/1.73 [v1: $real] : ( ~ (real_$less(v1, v0) = 0) | real_$greater(v0, v1) = 0) & ! % 7.11/1.73 [v0: $real] : ! [v1: $real] : ( ~ (real_$less(v1, v0) = 0) | real_$lesseq(v1, % 7.11/1.73 v0) = 0) & ! [v0: $real] : ! [v1: MultipleValueBool] : ( ~ % 7.11/1.73 (real_$less(v0, v0) = v1) | real_$lesseq(v0, v0) = 0) & ! [v0: $real] : ! % 7.11/1.73 [v1: $real] : ( ~ (real_$lesseq(v1, v0) = 0) | real_$greatereq(v0, v1) = 0) & % 7.11/1.73 ! [v0: $real] : (v0 = real_0 | ~ (real_$uminus(v0) = v0)) % 7.11/1.73 % 7.11/1.73 Those formulas are unsatisfiable: % 7.11/1.73 --------------------------------- % 7.11/1.73 % 7.11/1.73 Begin of proof % 7.11/1.73 | % 7.11/1.73 | ALPHA: (input) implies: % 7.11/1.73 | (1) real_$lesseq(real_0, real_0) = 0 % 7.11/1.73 | % 7.11/1.73 | GROUND_INST: instantiating (real_lesseq_problem_12) with real_0, simplifying % 7.11/1.73 | with (1) gives: % 7.11/1.73 | (2) $false % 7.11/1.73 | % 7.11/1.73 | CLOSE: (2) is inconsistent. % 7.11/1.73 | % 7.11/1.73 End of proof % 7.11/1.73 % SZS output end Proof for theBenchmark % 7.11/1.73 % 7.11/1.73 1105ms %------------------------------------------------------------------------------