%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : ARI282_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 : n010.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:33 EDT 2023 % Result : Theorem 7.77s 1.83s % Output : Proof 13.97s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.13 % Problem : ARI282_1 : TPTP v8.1.2. Released v5.0.0. % 0.09/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.10/0.33 % Computer : n010.cluster.edu % 0.10/0.33 % Model : x86_64 x86_64 % 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.33 % Memory : 8042.1875MB % 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.33 % CPULimit : 300 % 0.10/0.33 % WCLimit : 300 % 0.10/0.33 % DateTime : Tue Aug 29 17:53:33 EDT 2023 % 0.10/0.33 % CPUTime : % 0.15/0.58 ________ _____ % 0.15/0.58 ___ __ \_________(_)________________________________ % 0.15/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.15/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.15/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.15/0.58 % 0.15/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.15/0.58 (2023-06-19) % 0.15/0.58 % 0.15/0.58 (c) Philipp Rümmer, 2009-2023 % 0.15/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.15/0.58 Amanda Stjerna. % 0.15/0.58 Free software under BSD-3-Clause. % 0.15/0.58 % 0.15/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.15/0.58 % 0.15/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.15/0.60 Running up to 7 provers in parallel. % 0.15/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.15/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.15/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.15/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.15/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.15/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.15/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.39/0.86 Prover 5: Warning: Problem contains rationals, using incomplete axiomatisation % 1.39/0.86 Prover 1: Warning: Problem contains rationals, using incomplete axiomatisation % 1.39/0.87 Prover 6: Warning: Problem contains rationals, using incomplete axiomatisation % 1.39/0.87 Prover 4: Warning: Problem contains rationals, using incomplete axiomatisation % 1.39/0.87 Prover 0: Warning: Problem contains rationals, using incomplete axiomatisation % 1.39/0.87 Prover 3: Warning: Problem contains rationals, using incomplete axiomatisation % 1.39/0.87 Prover 2: Warning: Problem contains rationals, using incomplete axiomatisation % 2.12/1.00 Prover 1: Preprocessing ... % 2.12/1.00 Prover 4: Preprocessing ... % 2.65/1.09 Prover 6: Preprocessing ... % 2.65/1.09 Prover 0: Preprocessing ... % 3.40/1.29 Prover 3: Preprocessing ... % 3.40/1.30 Prover 5: Preprocessing ... % 3.40/1.30 Prover 2: Preprocessing ... % 7.77/1.76 Prover 6: Constructing countermodel ... % 7.77/1.77 Prover 0: Constructing countermodel ... % 7.77/1.79 Prover 1: Constructing countermodel ... % 7.77/1.83 Prover 6: proved (1206ms) % 7.77/1.83 % 7.77/1.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.77/1.83 % 7.77/1.83 Prover 0: proved (1221ms) % 8.43/1.83 % 8.43/1.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.43/1.83 % 8.43/1.83 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.43/1.83 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.43/1.83 Prover 1: Found proof (size 1) % 8.43/1.83 Prover 1: proved (1229ms) % 8.43/1.84 Prover 8: Warning: Problem contains rationals, using incomplete axiomatisation % 8.43/1.84 Prover 7: Warning: Problem contains rationals, using incomplete axiomatisation % 8.43/1.85 Prover 8: Preprocessing ... % 8.43/1.86 Prover 4: Constructing countermodel ... % 8.43/1.86 Prover 4: stopped % 8.43/1.95 Prover 7: Preprocessing ... % 10.38/2.12 Prover 8: Warning: ignoring some quantifiers % 10.38/2.12 Prover 2: stopped % 10.38/2.13 Prover 8: Constructing countermodel ... % 10.38/2.13 Prover 8: stopped % 11.58/2.29 Prover 7: stopped % 12.54/2.58 Prover 5: Constructing countermodel ... % 12.54/2.58 Prover 5: stopped % 13.97/2.80 Prover 3: Constructing countermodel ... % 13.97/2.80 Prover 3: stopped % 13.97/2.80 % 13.97/2.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 13.97/2.80 % 13.97/2.80 % SZS output start Proof for theBenchmark % 13.97/2.81 Assumptions after simplification: % 13.97/2.81 --------------------------------- % 13.97/2.81 % 13.97/2.81 (rat_difference_problem_10) % 13.97/2.81 $false % 13.97/2.81 % 13.97/2.81 Those formulas are unsatisfiable: % 13.97/2.81 --------------------------------- % 13.97/2.81 % 13.97/2.81 Begin of proof % 13.97/2.81 | % 13.97/2.81 | CLOSE: (rat_difference_problem_10) is inconsistent. % 13.97/2.81 | % 13.97/2.81 End of proof % 13.97/2.81 % SZS output end Proof for theBenchmark % 13.97/2.81 % 13.97/2.81 2232ms %------------------------------------------------------------------------------