%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI293_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 : n018.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:36 EDT 2023 % Result : Theorem 9.36s 2.01s % Output : Proof 9.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : ARI293_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.13/0.35 % Computer : n018.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 18:41:18 EDT 2023 % 0.13/0.35 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/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.91 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.47/0.91 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.47/0.91 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 1.47/0.91 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 1.47/0.91 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 1.47/0.91 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 1.47/0.91 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 2.32/1.00 Prover 4: Preprocessing ... % 2.32/1.00 Prover 1: Preprocessing ... % 2.55/1.04 Prover 0: Preprocessing ... % 2.55/1.04 Prover 6: Preprocessing ... % 2.55/1.11 Prover 5: Preprocessing ... % 2.55/1.12 Prover 2: Preprocessing ... % 2.55/1.12 Prover 3: Preprocessing ... % 5.82/1.55 Prover 6: Proving ... % 5.82/1.56 Prover 1: Constructing countermodel ... % 6.61/1.59 Prover 4: Constructing countermodel ... % 6.73/1.65 Prover 0: Proving ... % 7.49/1.76 Prover 1: Found proof (size 3) % 7.49/1.77 Prover 4: Found proof (size 3) % 7.49/1.77 Prover 1: proved (1127ms) % 7.49/1.77 Prover 4: proved (1131ms) % 7.49/1.78 Prover 0: stopped % 7.49/1.78 Prover 6: stopped % 8.77/1.89 Prover 3: Constructing countermodel ... % 8.77/1.90 Prover 3: stopped % 8.77/1.91 Prover 2: Proving ... % 8.77/1.91 Prover 2: stopped % 9.36/2.01 Prover 5: Proving ... % 9.36/2.01 Prover 5: stopped % 9.36/2.01 % 9.36/2.01 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 9.36/2.01 % 9.36/2.01 % SZS output start Proof for theBenchmark % 9.36/2.01 Assumptions after simplification: % 9.36/2.01 --------------------------------- % 9.36/2.01 % 9.36/2.02 (rat_product_problem_10) % 9.36/2.04 ! [v0: $rat] : ~ (rat_$product(v0, rat_11/2) = rat_121/4) % 9.36/2.04 % 9.36/2.04 (input) % 9.36/2.07 ~ (rat_very_large = rat_very_small) & ~ (rat_very_large = rat_121/4) & ~ % 9.36/2.07 (rat_very_large = rat_11/2) & ~ (rat_very_large = rat_0) & ~ (rat_very_small % 9.36/2.07 = rat_121/4) & ~ (rat_very_small = rat_11/2) & ~ (rat_very_small = rat_0) % 9.36/2.07 & ~ (rat_121/4 = rat_11/2) & ~ (rat_121/4 = rat_0) & ~ (rat_11/2 = rat_0) & % 9.36/2.07 rat_$is_int(rat_121/4) = 1 & rat_$is_int(rat_11/2) = 1 & rat_$is_int(rat_0) = % 9.36/2.07 0 & rat_$is_rat(rat_121/4) = 0 & rat_$is_rat(rat_11/2) = 0 & % 9.36/2.07 rat_$is_rat(rat_0) = 0 & rat_$floor(rat_0) = rat_0 & rat_$ceiling(rat_0) = % 9.36/2.07 rat_0 & rat_$truncate(rat_0) = rat_0 & rat_$round(rat_0) = rat_0 & % 9.36/2.07 rat_$to_int(rat_121/4) = 30 & rat_$to_int(rat_11/2) = 5 & rat_$to_int(rat_0) = % 9.36/2.07 0 & rat_$to_rat(rat_121/4) = rat_121/4 & rat_$to_rat(rat_11/2) = rat_11/2 & % 9.36/2.07 rat_$to_rat(rat_0) = rat_0 & rat_$to_real(rat_121/4) = real_121/4 & % 9.36/2.07 rat_$to_real(rat_11/2) = real_11/2 & rat_$to_real(rat_0) = real_0 & % 9.36/2.07 int_$to_rat(0) = rat_0 & rat_$quotient(rat_121/4, rat_11/2) = rat_11/2 & % 9.36/2.07 rat_$quotient(rat_0, rat_121/4) = rat_0 & rat_$quotient(rat_0, rat_11/2) = % 9.36/2.07 rat_0 & rat_$difference(rat_121/4, rat_121/4) = rat_0 & % 9.36/2.07 rat_$difference(rat_121/4, rat_0) = rat_121/4 & rat_$difference(rat_11/2, % 9.36/2.07 rat_11/2) = rat_0 & rat_$difference(rat_11/2, rat_0) = rat_11/2 & % 9.36/2.07 rat_$difference(rat_0, rat_0) = rat_0 & rat_$uminus(rat_0) = rat_0 & % 9.36/2.07 rat_$sum(rat_121/4, rat_0) = rat_121/4 & rat_$sum(rat_11/2, rat_0) = rat_11/2 % 9.36/2.07 & rat_$sum(rat_0, rat_121/4) = rat_121/4 & rat_$sum(rat_0, rat_11/2) = % 9.36/2.07 rat_11/2 & rat_$sum(rat_0, rat_0) = rat_0 & rat_$greatereq(rat_very_small, % 9.36/2.07 rat_very_large) = 1 & rat_$greatereq(rat_121/4, rat_121/4) = 0 & % 9.36/2.07 rat_$greatereq(rat_121/4, rat_11/2) = 0 & rat_$greatereq(rat_121/4, rat_0) = 0 % 9.36/2.07 & rat_$greatereq(rat_11/2, rat_121/4) = 1 & rat_$greatereq(rat_11/2, rat_11/2) % 9.36/2.07 = 0 & rat_$greatereq(rat_11/2, rat_0) = 0 & rat_$greatereq(rat_0, rat_121/4) = % 9.36/2.07 1 & rat_$greatereq(rat_0, rat_11/2) = 1 & rat_$greatereq(rat_0, rat_0) = 0 & % 9.36/2.07 rat_$lesseq(rat_very_small, rat_very_large) = 0 & rat_$lesseq(rat_121/4, % 9.36/2.07 rat_121/4) = 0 & rat_$lesseq(rat_121/4, rat_11/2) = 1 & % 9.36/2.07 rat_$lesseq(rat_121/4, rat_0) = 1 & rat_$lesseq(rat_11/2, rat_121/4) = 0 & % 9.36/2.07 rat_$lesseq(rat_11/2, rat_11/2) = 0 & rat_$lesseq(rat_11/2, rat_0) = 1 & % 9.36/2.07 rat_$lesseq(rat_0, rat_121/4) = 0 & rat_$lesseq(rat_0, rat_11/2) = 0 & % 9.36/2.07 rat_$lesseq(rat_0, rat_0) = 0 & rat_$greater(rat_very_large, rat_121/4) = 0 & % 9.36/2.07 rat_$greater(rat_very_large, rat_11/2) = 0 & rat_$greater(rat_very_large, % 9.36/2.07 rat_0) = 0 & rat_$greater(rat_very_small, rat_very_large) = 1 & % 9.36/2.07 rat_$greater(rat_121/4, rat_very_small) = 0 & rat_$greater(rat_121/4, % 9.36/2.07 rat_121/4) = 1 & rat_$greater(rat_121/4, rat_11/2) = 0 & % 9.36/2.07 rat_$greater(rat_121/4, rat_0) = 0 & rat_$greater(rat_11/2, rat_very_small) = % 9.36/2.07 0 & rat_$greater(rat_11/2, rat_121/4) = 1 & rat_$greater(rat_11/2, rat_11/2) = % 9.36/2.07 1 & rat_$greater(rat_11/2, rat_0) = 0 & rat_$greater(rat_0, rat_very_small) = % 9.36/2.08 0 & rat_$greater(rat_0, rat_121/4) = 1 & rat_$greater(rat_0, rat_11/2) = 1 & % 9.36/2.08 rat_$greater(rat_0, rat_0) = 1 & rat_$less(rat_very_small, rat_very_large) = 0 % 9.36/2.08 & rat_$less(rat_very_small, rat_121/4) = 0 & rat_$less(rat_very_small, % 9.36/2.08 rat_11/2) = 0 & rat_$less(rat_very_small, rat_0) = 0 & rat_$less(rat_121/4, % 9.36/2.08 rat_very_large) = 0 & rat_$less(rat_121/4, rat_121/4) = 1 & % 9.36/2.08 rat_$less(rat_121/4, rat_11/2) = 1 & rat_$less(rat_121/4, rat_0) = 1 & % 9.36/2.08 rat_$less(rat_11/2, rat_very_large) = 0 & rat_$less(rat_11/2, rat_121/4) = 0 & % 9.36/2.08 rat_$less(rat_11/2, rat_11/2) = 1 & rat_$less(rat_11/2, rat_0) = 1 & % 9.36/2.08 rat_$less(rat_0, rat_very_large) = 0 & rat_$less(rat_0, rat_121/4) = 0 & % 9.36/2.08 rat_$less(rat_0, rat_11/2) = 0 & rat_$less(rat_0, rat_0) = 1 & % 9.36/2.08 rat_$product(rat_121/4, rat_0) = rat_0 & rat_$product(rat_11/2, rat_11/2) = % 9.36/2.08 rat_121/4 & rat_$product(rat_11/2, rat_0) = rat_0 & rat_$product(rat_0, % 9.36/2.08 rat_121/4) = rat_0 & rat_$product(rat_0, rat_11/2) = rat_0 & % 9.36/2.08 rat_$product(rat_0, rat_0) = rat_0 & ! [v0: $rat] : ! [v1: $rat] : ! [v2: % 9.36/2.08 $rat] : ! [v3: $rat] : ! [v4: $rat] : ( ~ (rat_$sum(v3, v0) = v4) | ~ % 9.36/2.08 (rat_$sum(v2, v1) = v3) | ? [v5: $rat] : (rat_$sum(v2, v5) = v4 & % 9.36/2.08 rat_$sum(v1, v0) = v5)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : % 9.36/2.08 ! [v3: $rat] : (v3 = v1 | v0 = rat_0 | ~ (rat_$quotient(v2, v0) = v3) | ~ % 9.36/2.08 (rat_$product(v1, v0) = v2)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] % 9.36/2.08 : ! [v3: int] : (v3 = 0 | ~ (rat_$lesseq(v2, v0) = v3) | ~ (rat_$lesseq(v1, % 9.36/2.08 v0) = 0) | ? [v4: int] : ( ~ (v4 = 0) & rat_$lesseq(v2, v1) = v4)) & ! % 9.36/2.08 [v0: $rat] : ! [v1: $rat] : ! [v2: $rat] : ! [v3: int] : (v3 = 0 | ~ % 9.36/2.08 (rat_$lesseq(v1, v0) = 0) | ~ (rat_$less(v2, v0) = v3) | ? [v4: int] : ( ~ % 9.36/2.08 (v4 = 0) & rat_$less(v2, v1) = v4)) & ! [v0: $rat] : ! [v1: $rat] : ! % 9.36/2.08 [v2: $rat] : ! [v3: $rat] : ( ~ (rat_$uminus(v0) = v2) | ~ (rat_$sum(v1, v2) % 9.36/2.08 = v3) | rat_$difference(v1, v0) = v3) & ! [v0: $rat] : ! [v1: $rat] : ! % 9.36/2.08 [v2: $rat] : (v2 = rat_0 | ~ (rat_$uminus(v0) = v1) | ~ (rat_$sum(v0, v1) = % 9.36/2.08 v2)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: int] : (v2 = 0 | ~ % 9.36/2.08 (rat_$greatereq(v0, v1) = v2) | ? [v3: int] : ( ~ (v3 = 0) & % 9.36/2.08 rat_$lesseq(v1, v0) = v3)) & ! [v0: $rat] : ! [v1: $rat] : ! [v2: int] % 9.36/2.08 : (v2 = 0 | ~ (rat_$lesseq(v1, v0) = v2) | ( ~ (v1 = v0) & ? [v3: int] : ( ~ % 9.36/2.08 (v3 = 0) & rat_$less(v1, v0) = v3))) & ! [v0: $rat] : ! [v1: $rat] : % 9.36/2.08 ! [v2: int] : (v2 = 0 | ~ (rat_$greater(v0, v1) = v2) | ? [v3: int] : ( ~ % 9.36/2.08 (v3 = 0) & rat_$less(v1, v0) = v3)) & ! [v0: $rat] : ! [v1: $rat] : ! % 9.36/2.08 [v2: $rat] : ( ~ (rat_$sum(v0, v1) = v2) | rat_$sum(v1, v0) = v2) & ! [v0: % 9.36/2.08 $rat] : ! [v1: $rat] : ! [v2: $rat] : ( ~ (rat_$lesseq(v2, v1) = 0) | ~ % 9.36/2.08 (rat_$less(v1, v0) = 0) | rat_$less(v2, v0) = 0) & ! [v0: $rat] : ! [v1: % 9.36/2.08 $rat] : ! [v2: $rat] : ( ~ (rat_$product(v0, v1) = v2) | rat_$product(v1, % 9.36/2.08 v0) = v2) & ! [v0: $rat] : ! [v1: $rat] : (v1 = v0 | ~ (rat_$sum(v0, % 9.36/2.08 rat_0) = v1)) & ! [v0: $rat] : ! [v1: $rat] : (v1 = v0 | ~ % 9.36/2.08 (rat_$lesseq(v1, v0) = 0) | rat_$less(v1, v0) = 0) & ! [v0: $rat] : ! [v1: % 9.36/2.08 $rat] : ( ~ (rat_$uminus(v0) = v1) | rat_$uminus(v1) = v0) & ! [v0: $rat] : % 9.36/2.08 ! [v1: $rat] : ( ~ (rat_$greatereq(v0, v1) = 0) | rat_$lesseq(v1, v0) = 0) & % 9.36/2.08 ! [v0: $rat] : ! [v1: $rat] : ( ~ (rat_$greater(v0, v1) = 0) | rat_$less(v1, % 9.36/2.08 v0) = 0) & ! [v0: $rat] : (v0 = rat_0 | ~ (rat_$uminus(v0) = v0)) % 9.36/2.08 % 9.36/2.08 Those formulas are unsatisfiable: % 9.36/2.08 --------------------------------- % 9.36/2.08 % 9.36/2.08 Begin of proof % 9.36/2.08 | % 9.36/2.08 | ALPHA: (input) implies: % 9.36/2.08 | (1) rat_$product(rat_11/2, rat_11/2) = rat_121/4 % 9.36/2.08 | % 9.36/2.08 | GROUND_INST: instantiating (rat_product_problem_10) with rat_11/2, simplifying % 9.36/2.08 | with (1) gives: % 9.36/2.08 | (2) $false % 9.36/2.08 | % 9.36/2.08 | CLOSE: (2) is inconsistent. % 9.36/2.08 | % 9.36/2.08 End of proof % 9.61/2.08 % SZS output end Proof for theBenchmark % 9.61/2.08 % 9.61/2.08 1470ms %------------------------------------------------------------------------------