%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : LCL643+1.005 : TPTP v9.3.1. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n031.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:27 PM UTC 2026 % Result : CounterSatisfiable 54.07s 8.18s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL643+1.005 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.08/0.35 % Computer : n031.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Sat Sep 5 10:29:54 UTC 2026 % 0.08/0.35 % CPUTime : % 0.13/0.37 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.74/0.70 ________ _____ % 0.74/0.70 ___ __ \_________(_)________________________________ % 0.74/0.70 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.74/0.70 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.74/0.70 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.74/0.70 % 0.74/0.70 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.74/0.70 (2023-06-19) % 0.74/0.70 % 0.74/0.70 (c) Philipp Rümmer, 2009-2023 % 0.74/0.70 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.74/0.70 Amanda Stjerna. % 0.74/0.70 Free software under BSD-3-Clause. % 0.74/0.70 % 0.74/0.70 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.74/0.70 % 0.74/0.70 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.74/0.72 Running up to 7 provers in parallel. % 0.74/0.73 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.74/0.73 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.74/0.73 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.74/0.73 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.74/0.73 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.74/0.73 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.74/0.73 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 6.67/1.62 Prover 4: Preprocessing ... % 6.67/1.68 Prover 1: Preprocessing ... % 7.44/1.76 Prover 3: Preprocessing ... % 7.44/1.76 Prover 6: Preprocessing ... % 7.44/1.76 Prover 2: Preprocessing ... % 7.44/1.77 Prover 5: Preprocessing ... % 8.23/1.83 Prover 0: Preprocessing ... % 13.78/2.54 Prover 5: Constructing countermodel ... % 13.78/2.56 Prover 2: Constructing countermodel ... % 16.93/2.99 Prover 6: Proving ... % 17.90/3.04 Prover 3: Constructing countermodel ... % 17.90/3.11 Prover 1: Constructing countermodel ... % 46.02/6.65 Prover 5: proven invalid (5924ms) % 46.02/6.66 Prover 2: stopped % 46.02/6.66 Prover 1: stopped % 46.02/6.66 Prover 6: stopped % 46.02/6.66 Prover 3: stopped % 53.41/8.09 Prover 4: Constructing countermodel ... % 53.41/8.11 Prover 4: stopped % 54.07/8.16 Prover 0: Proving ... % 54.07/8.18 Prover 0: stopped % 54.07/8.18 % 54.07/8.18 % SZS status CounterSatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 54.07/8.19 % 54.07/8.19 7484ms %------------------------------------------------------------------------------