%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : LCL648+1.001 : TPTP v9.3.1. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n018.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:29 PM UTC 2026 % Result : Theorem 3.65s 1.37s % Output : Proof 5.05s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL648+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.03 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.08/0.37 % Computer : n018.cluster.edu % 0.08/0.37 % Model : x86_64 x86_64 % 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.37 % Memory : 8046.5625MB % 0.08/0.37 % OS : Linux 6.8.0-71-generic % 0.08/0.37 % CPULimit : 300 % 0.08/0.37 % WCLimit : 300 % 0.08/0.37 % DateTime : Fri Sep 4 12:28:34 UTC 2026 % 0.08/0.37 % CPUTime : % 0.08/0.40 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.64/0.75 ________ _____ % 0.64/0.75 ___ __ \_________(_)________________________________ % 0.64/0.75 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.64/0.75 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.64/0.75 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.64/0.75 % 0.64/0.75 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.64/0.75 (2023-06-19) % 0.64/0.75 % 0.64/0.75 (c) Philipp Rümmer, 2009-2023 % 0.64/0.75 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.64/0.75 Amanda Stjerna. % 0.64/0.75 Free software under BSD-3-Clause. % 0.64/0.75 % 0.64/0.75 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.64/0.75 % 0.64/0.75 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.64/0.77 Running up to 7 provers in parallel. % 0.64/0.79 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.64/0.79 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.64/0.79 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.64/0.79 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.64/0.79 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.64/0.79 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.64/0.79 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.69/1.10 Prover 4: Preprocessing ... % 1.69/1.10 Prover 1: Preprocessing ... % 2.43/1.15 Prover 2: Preprocessing ... % 2.43/1.15 Prover 3: Preprocessing ... % 2.43/1.15 Prover 5: Preprocessing ... % 2.43/1.15 Prover 6: Preprocessing ... % 2.43/1.15 Prover 0: Preprocessing ... % 2.95/1.26 Prover 5: Constructing countermodel ... % 2.95/1.27 Prover 2: Constructing countermodel ... % 2.95/1.28 Prover 1: Constructing countermodel ... % 2.95/1.28 Prover 3: Constructing countermodel ... % 2.95/1.28 Prover 0: Proving ... % 2.95/1.28 Prover 6: Proving ... % 2.95/1.28 Prover 4: Constructing countermodel ... % 3.65/1.36 Prover 5: proved (574ms) % 3.65/1.36 Prover 2: proved (578ms) % 3.65/1.36 % 3.65/1.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.65/1.37 % 3.65/1.37 % 3.65/1.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.65/1.37 % 3.65/1.37 Prover 3: stopped % 3.65/1.37 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.65/1.37 Prover 6: stopped % 3.65/1.37 Prover 0: stopped % 3.65/1.38 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.65/1.38 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.65/1.38 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.65/1.38 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.65/1.39 Prover 8: Preprocessing ... % 3.65/1.40 Prover 13: Preprocessing ... % 3.65/1.40 Prover 10: Preprocessing ... % 3.65/1.40 Prover 7: Preprocessing ... % 4.41/1.41 Prover 11: Preprocessing ... % 4.41/1.41 Prover 10: Constructing countermodel ... % 4.41/1.42 Prover 7: Constructing countermodel ... % 4.41/1.43 Prover 13: Constructing countermodel ... % 4.41/1.45 Prover 10: Found proof (size 4) % 4.41/1.45 Prover 10: proved (81ms) % 4.41/1.45 Prover 13: stopped % 4.41/1.46 Prover 7: Found proof (size 4) % 4.41/1.46 Prover 7: proved (86ms) % 4.41/1.46 Prover 4: stopped % 4.41/1.46 Prover 1: stopped % 4.41/1.47 Prover 8: Warning: ignoring some quantifiers % 4.41/1.47 Prover 8: Constructing countermodel ... % 4.41/1.48 Prover 8: stopped % 4.41/1.50 Prover 11: Constructing countermodel ... % 5.05/1.50 Prover 11: stopped % 5.05/1.50 % 5.05/1.50 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.05/1.50 % 5.05/1.51 % SZS output start Proof for theBenchmark % 5.05/1.51 Assumptions after simplification: % 5.05/1.51 --------------------------------- % 5.05/1.51 % 5.05/1.51 (main) % 5.05/1.52 ? [v0: $i] : ? [v1: $i] : ($i(v1) & $i(v0) & p101(v1) & p201(v1) & r1(v0, % 5.05/1.52 v1) & ! [v2: $i] : ( ~ $i(v2) | ~ p101(v2) | ~ p201(v2) | ~ r1(v0, % 5.05/1.52 v2))) % 5.05/1.52 % 5.05/1.52 Those formulas are unsatisfiable: % 5.05/1.52 --------------------------------- % 5.05/1.52 % 5.05/1.52 Begin of proof % 5.05/1.52 | % 5.05/1.53 | DELTA: instantiating (main) with fresh symbols all_2_0, all_2_1 gives: % 5.05/1.53 | (1) $i(all_2_0) & $i(all_2_1) & p101(all_2_0) & p201(all_2_0) & r1(all_2_1, % 5.05/1.53 | all_2_0) & ! [v0: $i] : ( ~ $i(v0) | ~ p101(v0) | ~ p201(v0) | ~ % 5.05/1.53 | r1(all_2_1, v0)) % 5.05/1.53 | % 5.05/1.53 | ALPHA: (1) implies: % 5.05/1.54 | (2) r1(all_2_1, all_2_0) % 5.05/1.54 | (3) p201(all_2_0) % 5.05/1.54 | (4) p101(all_2_0) % 5.05/1.54 | (5) $i(all_2_0) % 5.05/1.54 | (6) ! [v0: $i] : ( ~ $i(v0) | ~ p101(v0) | ~ p201(v0) | ~ r1(all_2_1, % 5.05/1.54 | v0)) % 5.05/1.54 | % 5.05/1.54 | GROUND_INST: instantiating (6) with all_2_0, simplifying with (2), (3), (4), % 5.05/1.54 | (5) gives: % 5.05/1.54 | (7) $false % 5.05/1.54 | % 5.05/1.54 | CLOSE: (7) is inconsistent. % 5.05/1.54 | % 5.05/1.54 End of proof % 5.05/1.55 % SZS output end Proof for theBenchmark % 5.05/1.55 % 5.05/1.55 792ms %------------------------------------------------------------------------------