%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : LCL644+1.015 : TPTP v9.3.1. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n020.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 12:54:28 PM UTC 2026 % Result : Theorem 15.86s 2.90s % Output : Proof 25.00s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL644+1.015 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.36 % Computer : n020.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Sat Sep 5 23:04:42 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.38 OpenJDK 64-Bit Server VM warning: Options -Xverify:none and -noverify were deprecated in JDK 13 and will likely be removed in a future release. % 0.67/0.72 ________ _____ % 0.67/0.72 ___ __ \_________(_)________________________________ % 0.67/0.72 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.67/0.72 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.67/0.72 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.67/0.72 % 0.67/0.72 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.67/0.72 (2023-06-19) % 0.67/0.72 % 0.67/0.72 (c) Philipp Rümmer, 2009-2023 % 0.67/0.72 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.67/0.72 Amanda Stjerna. % 0.67/0.72 Free software under BSD-3-Clause. % 0.67/0.72 % 0.67/0.72 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.67/0.72 % 0.67/0.72 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.67/0.74 Running up to 7 provers in parallel. % 0.67/0.75 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.67/0.75 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.67/0.75 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.67/0.75 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.67/0.75 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.67/0.75 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.67/0.75 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 9.74/2.05 Prover 1: Preprocessing ... % 9.74/2.06 Prover 5: Preprocessing ... % 9.74/2.06 Prover 6: Preprocessing ... % 9.74/2.07 Prover 3: Preprocessing ... % 9.74/2.07 Prover 0: Preprocessing ... % 9.74/2.07 Prover 2: Preprocessing ... % 9.74/2.10 Prover 4: Preprocessing ... % 15.08/2.77 Prover 5: Constructing countermodel ... % 15.86/2.88 Prover 5: proved (2128ms) % 15.86/2.88 % 15.86/2.90 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 15.86/2.90 % 16.64/2.91 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 16.64/2.92 Prover 2: Constructing countermodel ... % 16.64/2.92 Prover 2: stopped % 16.64/2.92 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 17.89/3.13 Prover 8: Preprocessing ... % 17.89/3.15 Prover 0: stopped % 17.89/3.16 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 20.51/3.49 Prover 6: Constructing countermodel ... % 20.51/3.49 Prover 6: stopped % 21.26/3.50 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 21.26/3.52 Prover 7: Preprocessing ... % 22.06/3.64 Prover 1: Constructing countermodel ... % 22.06/3.65 Prover 1: Found proof (size 1) % 22.06/3.65 Prover 1: proved (2896ms) % 22.06/3.68 Prover 7: stopped % 22.84/3.72 Prover 3: Constructing countermodel ... % 22.84/3.72 Prover 3: stopped % 22.84/3.76 Prover 10: Preprocessing ... % 23.56/3.84 Prover 10: stopped % 24.23/3.92 Prover 11: Preprocessing ... % 24.23/3.93 Prover 8: Warning: ignoring some quantifiers % 24.23/3.93 Prover 8: Constructing countermodel ... % 24.23/3.93 Prover 8: stopped % 25.00/4.06 Prover 4: Constructing countermodel ... % 25.00/4.06 Prover 4: stopped % 25.00/4.07 Prover 11: stopped % 25.00/4.07 % 25.00/4.07 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 25.00/4.07 % 25.00/4.08 % SZS output start Proof for theBenchmark % 25.00/4.08 Assumptions after simplification: % 25.00/4.08 --------------------------------- % 25.00/4.08 % 25.00/4.08 (main) % 25.00/4.09 $false % 25.00/4.09 % 25.00/4.09 Those formulas are unsatisfiable: % 25.00/4.09 --------------------------------- % 25.00/4.09 % 25.00/4.09 Begin of proof % 25.00/4.09 | % 25.00/4.09 | CLOSE: (main) is inconsistent. % 25.00/4.09 | % 25.00/4.09 End of proof % 25.00/4.09 % SZS output end Proof for theBenchmark % 25.00/4.09 % 25.00/4.09 3371ms %------------------------------------------------------------------------------