%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWW751_1 : TPTP v8.1.2. Released v7.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n007.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 : Fri Sep 1 00:51:16 EDT 2023 % Result : Unsatisfiable 29.64s 4.75s % Output : Proof 41.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWW751_1 : TPTP v8.1.2. Released v7.0.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n007.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Sun Aug 27 19:11:42 EDT 2023 % 0.13/0.34 % 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/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 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 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 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 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 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 % 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 % 15.87/2.94 Prover 3: Preprocessing ... % 15.87/2.94 Prover 5: Preprocessing ... % 15.87/2.95 Prover 0: Preprocessing ... % 15.87/2.95 Prover 1: Preprocessing ... % 15.87/2.96 Prover 6: Preprocessing ... % 15.87/2.96 Prover 2: Preprocessing ... % 17.61/3.14 Prover 4: Preprocessing ... % 29.64/4.72 Prover 0: Constructing countermodel ... % 29.64/4.72 Prover 3: Constructing countermodel ... % 29.64/4.73 Prover 6: Constructing countermodel ... % 29.64/4.75 Prover 3: proved (4112ms) % 29.64/4.75 Prover 6: proved (4097ms) % 29.64/4.75 % 29.64/4.75 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 29.64/4.75 % 29.64/4.76 % 29.64/4.76 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 29.64/4.76 % 29.64/4.78 Prover 0: stopped % 29.64/4.78 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 29.64/4.78 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 29.64/4.78 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 30.83/4.94 Prover 1: Warning: ignoring some quantifiers % 30.83/4.96 Prover 2: Constructing countermodel ... % 30.83/4.96 Prover 1: Constructing countermodel ... % 30.83/4.96 Prover 2: stopped % 31.58/4.98 Prover 1: Found proof (size 1) % 31.58/4.98 Prover 1: proved (4337ms) % 31.58/4.98 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 31.58/4.98 Prover 4: Warning: ignoring some quantifiers % 31.72/4.99 Prover 4: Constructing countermodel ... % 31.72/4.99 Prover 4: stopped % 35.91/5.55 Prover 5: Constructing countermodel ... % 35.91/5.55 Prover 5: stopped % 37.90/5.87 Prover 10: Preprocessing ... % 37.90/5.87 Prover 7: Preprocessing ... % 38.61/5.97 Prover 11: Preprocessing ... % 38.97/6.00 Prover 8: Preprocessing ... % 39.36/6.08 Prover 10: stopped % 39.36/6.10 Prover 7: stopped % 39.72/6.12 Prover 11: stopped % 41.41/6.46 Prover 8: Warning: ignoring some quantifiers % 41.41/6.47 Prover 8: Constructing countermodel ... % 41.41/6.48 Prover 8: stopped % 41.41/6.48 % 41.41/6.48 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 41.41/6.48 % 41.41/6.48 % SZS output start Proof for theBenchmark % 41.41/6.49 Assumptions after simplification: % 41.41/6.49 --------------------------------- % 41.41/6.49 % 41.41/6.49 (formula_3) % 41.41/6.49 $false % 41.41/6.49 % 41.41/6.49 Further assumptions not needed in the proof: % 41.41/6.49 -------------------------------------------- % 41.41/6.49 formula_1, formula_2 % 41.41/6.49 % 41.41/6.49 Those formulas are unsatisfiable: % 41.41/6.49 --------------------------------- % 41.41/6.49 % 41.41/6.49 Begin of proof % 41.41/6.50 | % 41.41/6.50 | CLOSE: (formula_3) is inconsistent. % 41.41/6.50 | % 41.41/6.50 End of proof % 41.41/6.50 % SZS output end Proof for theBenchmark % 41.41/6.50 % 41.41/6.50 5886ms %------------------------------------------------------------------------------