%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI451_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 : n032.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:48:05 EDT 2023 % Result : Theorem 4.72s 1.18s % Output : Proof 8.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.08 % Problem : ARI451_1 : TPTP v8.1.2. Released v5.0.0. % 0.00/0.09 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.08/0.27 % Computer : n032.cluster.edu % 0.08/0.27 % Model : x86_64 x86_64 % 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.27 % Memory : 8042.1875MB % 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.27 % CPULimit : 300 % 0.08/0.27 % WCLimit : 300 % 0.08/0.27 % DateTime : Tue Aug 29 18:03:02 EDT 2023 % 0.08/0.27 % CPUTime : % 0.12/0.45 ________ _____ % 0.12/0.45 ___ __ \_________(_)________________________________ % 0.12/0.45 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.12/0.45 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.12/0.45 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.12/0.45 % 0.12/0.45 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.12/0.45 (2023-06-19) % 0.12/0.45 % 0.12/0.45 (c) Philipp Rümmer, 2009-2023 % 0.12/0.45 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.12/0.45 Amanda Stjerna. % 0.12/0.45 Free software under BSD-3-Clause. % 0.12/0.45 % 0.12/0.45 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.12/0.45 % 0.12/0.45 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.12/0.46 Running up to 7 provers in parallel. % 0.12/0.47 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.12/0.47 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.12/0.47 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.12/0.47 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.12/0.47 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.12/0.47 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.12/0.47 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.78/0.71 Prover 1: Warning: Problem contains reals, using incomplete axiomatisation % 0.78/0.71 Prover 5: Warning: Problem contains reals, using incomplete axiomatisation % 0.78/0.71 Prover 4: Warning: Problem contains reals, using incomplete axiomatisation % 0.78/0.71 Prover 6: Warning: Problem contains reals, using incomplete axiomatisation % 0.78/0.71 Prover 2: Warning: Problem contains reals, using incomplete axiomatisation % 0.78/0.71 Prover 0: Warning: Problem contains reals, using incomplete axiomatisation % 0.78/0.71 Prover 3: Warning: Problem contains reals, using incomplete axiomatisation % 1.79/0.77 Prover 1: Preprocessing ... % 1.79/0.78 Prover 4: Preprocessing ... % 1.79/0.83 Prover 0: Preprocessing ... % 1.79/0.83 Prover 6: Preprocessing ... % 3.04/0.94 Prover 5: Preprocessing ... % 3.21/0.97 Prover 2: Preprocessing ... % 3.21/0.97 Prover 3: Preprocessing ... % 4.02/1.09 Prover 6: Constructing countermodel ... % 4.51/1.15 Prover 0: Constructing countermodel ... % 4.51/1.17 Prover 6: proved (698ms) % 4.51/1.17 % 4.72/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.72/1.18 % 4.72/1.18 Prover 0: proved (712ms) % 4.72/1.18 % 4.72/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.72/1.18 % 4.72/1.19 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.72/1.19 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.72/1.19 Prover 8: Warning: Problem contains reals, using incomplete axiomatisation % 4.72/1.20 Prover 7: Warning: Problem contains reals, using incomplete axiomatisation % 4.72/1.20 Prover 8: Preprocessing ... % 4.72/1.28 Prover 7: Preprocessing ... % 5.72/1.38 Prover 1: Constructing countermodel ... % 6.23/1.39 Prover 1: Found proof (size 1) % 6.23/1.39 Prover 1: proved (922ms) % 6.99/1.49 Prover 8: Warning: ignoring some quantifiers % 6.99/1.49 Prover 4: Constructing countermodel ... % 6.99/1.49 Prover 4: stopped % 6.99/1.49 Prover 8: Constructing countermodel ... % 6.99/1.49 Prover 8: stopped % 7.34/1.55 Prover 2: stopped % 7.34/1.57 Prover 7: stopped % 7.87/1.63 Prover 5: Constructing countermodel ... % 7.87/1.63 Prover 5: stopped % 7.87/1.66 Prover 3: Constructing countermodel ... % 7.87/1.66 Prover 3: stopped % 7.87/1.66 % 7.87/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.87/1.66 % 7.87/1.67 % SZS output start Proof for theBenchmark % 7.87/1.67 Assumptions after simplification: % 7.87/1.67 --------------------------------- % 7.87/1.67 % 7.87/1.67 (real_product_problem_16) % 7.87/1.68 $false % 7.87/1.68 % 7.87/1.68 Those formulas are unsatisfiable: % 7.87/1.68 --------------------------------- % 7.87/1.68 % 7.87/1.68 Begin of proof % 8.20/1.68 | % 8.20/1.68 | CLOSE: (real_product_problem_16) is inconsistent. % 8.20/1.68 | % 8.20/1.68 End of proof % 8.20/1.68 % SZS output end Proof for theBenchmark % 8.20/1.68 % 8.20/1.68 1230ms %------------------------------------------------------------------------------