%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT087+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 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 : Tue Sep 8 06:17:30 AM UTC 2026 % Result : Theorem 13.56s 2.43s % Output : Proof 17.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT087+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.36 % Computer : n031.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 : Mon Sep 7 14:23:56 UTC 2026 % 0.09/0.36 % CPUTime : % 0.14/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.47/0.60 ________ _____ % 0.47/0.60 ___ __ \_________(_)________________________________ % 0.47/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.47/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.47/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.47/0.60 % 0.47/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.47/0.60 (2023-06-19) % 0.47/0.60 % 0.47/0.60 (c) Philipp Rümmer, 2009-2023 % 0.47/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.47/0.60 Amanda Stjerna. % 0.47/0.60 Free software under BSD-3-Clause. % 0.47/0.60 % 0.47/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.47/0.60 % 0.47/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.47/0.62 Running up to 7 provers in parallel. % 0.47/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.47/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.47/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.47/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.47/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.47/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.47/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.69/1.20 Prover 4: Preprocessing ... % 4.15/1.21 Prover 1: Preprocessing ... % 4.15/1.26 Prover 6: Preprocessing ... % 4.15/1.26 Prover 5: Preprocessing ... % 4.15/1.26 Prover 3: Preprocessing ... % 4.15/1.26 Prover 0: Preprocessing ... % 4.15/1.26 Prover 2: Preprocessing ... % 8.84/1.85 Prover 5: Proving ... % 8.84/1.87 Prover 2: Proving ... % 9.62/1.97 Prover 6: Proving ... % 9.62/2.03 Prover 3: Constructing countermodel ... % 10.71/2.06 Prover 1: Constructing countermodel ... % 11.48/2.15 Prover 0: Proving ... % 11.48/2.17 Prover 3: gave up % 11.48/2.18 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.48/2.18 Prover 1: gave up % 11.48/2.18 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.99/2.22 Prover 4: Constructing countermodel ... % 12.76/2.32 Prover 7: Preprocessing ... % 12.76/2.33 Prover 8: Preprocessing ... % 13.56/2.43 Prover 5: proved (1805ms) % 13.56/2.43 % 13.56/2.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.56/2.43 % 13.56/2.43 Prover 2: proved (1806ms) % 13.56/2.43 % 13.56/2.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 13.56/2.44 % 13.56/2.44 Prover 0: stopped % 13.56/2.44 Prover 6: stopped % 13.56/2.44 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 13.56/2.44 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 13.56/2.44 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 13.56/2.44 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 14.35/2.54 Prover 7: Warning: ignoring some quantifiers % 14.35/2.54 Prover 10: Preprocessing ... % 14.35/2.54 Prover 13: Preprocessing ... % 14.35/2.56 Prover 7: Constructing countermodel ... % 15.14/2.61 Prover 11: Preprocessing ... % 15.14/2.63 Prover 4: gave up % 15.14/2.63 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 15.14/2.63 Prover 16: Preprocessing ... % 15.14/2.69 Prover 7: Found proof (size 10) % 15.14/2.69 Prover 7: proved (518ms) % 15.95/2.70 Prover 19: Preprocessing ... % 15.95/2.72 Prover 10: Warning: ignoring some quantifiers % 15.95/2.72 Prover 11: stopped % 15.95/2.74 Prover 10: Constructing countermodel ... % 15.95/2.76 Prover 16: stopped % 15.95/2.76 Prover 10: stopped % 15.95/2.78 Prover 13: Warning: ignoring some quantifiers % 16.68/2.80 Prover 8: Warning: ignoring some quantifiers % 16.68/2.80 Prover 13: Constructing countermodel ... % 16.68/2.82 Prover 8: Constructing countermodel ... % 16.68/2.82 Prover 13: stopped % 16.68/2.84 Prover 8: stopped % 17.25/3.00 Prover 19: Warning: ignoring some quantifiers % 17.25/3.03 Prover 19: Constructing countermodel ... % 17.88/3.05 Prover 19: stopped % 17.88/3.05 % 17.88/3.05 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 17.88/3.05 % 17.88/3.05 % SZS output start Proof for theBenchmark % 17.88/3.06 Assumptions after simplification: % 17.88/3.06 --------------------------------- % 17.88/3.06 % 17.88/3.06 (distinct) % 17.88/3.07 ~ (v600 = v200) & ~ (v600 = v0) & ~ (v200 = v0) & $i(v600) & $i(v200) & % 17.88/3.07 $i(v0) % 17.88/3.07 % 17.88/3.07 (in_lopen) % 17.88/3.08 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 17.88/3.08 ~ in_lopen(v0, v1, v2) | leq(v0, v2)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 17.88/3.08 $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ in_lopen(v0, v1, v2) | % 17.88/3.08 less(v1, v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ % 17.88/3.08 $i(v1) | ~ $i(v0) | ~ leq(v0, v2) | ~ less(v1, v0) | in_lopen(v0, v1, % 17.88/3.08 v2)) % 17.88/3.08 % 17.88/3.08 (leq_def) % 17.88/3.09 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ $i(v1) | ~ $i(v0) | ~ leq(v0, v1) % 17.88/3.09 | less(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 17.88/3.09 less(v0, v1) | leq(v0, v1)) & ? [v0: $i] : ( ~ $i(v0) | leq(v0, v0)) % 17.88/3.09 % 17.88/3.09 (odrl500) % 17.88/3.09 $i(v600) & $i(v0) & ! [v0: $i] : ( ~ $i(v0) | ~ in_lopen(v0, v0, v600)) % 17.88/3.09 % 17.88/3.09 (ord_v0_v200) % 17.88/3.09 $i(v200) & $i(v0) & less(v0, v200) % 17.88/3.09 % 17.88/3.09 (ord_v200_v600) % 17.88/3.09 $i(v600) & $i(v200) & less(v200, v600) % 17.88/3.09 % 17.88/3.09 Further assumptions not needed in the proof: % 17.88/3.09 -------------------------------------------- % 17.88/3.09 axis_compatible_def, axis_conflict_def, axis_subsumes_def, box_compatible, % 17.88/3.09 box_conflict, box_unknown, box_verdict_total, compatible_is_verdict, % 17.88/3.09 conflict_is_verdict, in_closed, in_open, in_ropen, irreflexive, leq_antisym, % 17.88/3.09 leq_less_trans, leq_trans, less_implies_leq, less_leq_trans, ord_v0_v600, % 17.88/3.09 transitive, trichotomy, unknown_is_verdict, val_v0, val_v200, val_v600, % 17.88/3.09 verdict_enum, verdicts_distinct_cf_cp, verdicts_distinct_cf_un, % 17.88/3.09 verdicts_distinct_cp_un % 17.88/3.09 % 17.88/3.09 Those formulas are unsatisfiable: % 17.88/3.09 --------------------------------- % 17.88/3.09 % 17.88/3.09 Begin of proof % 17.88/3.10 | % 17.88/3.10 | ALPHA: (leq_def) implies: % 17.88/3.10 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ less(v0, v1) | % 17.88/3.10 | leq(v0, v1)) % 17.88/3.10 | % 17.88/3.10 | ALPHA: (in_lopen) implies: % 17.88/3.10 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 17.88/3.10 | $i(v0) | ~ leq(v0, v2) | ~ less(v1, v0) | in_lopen(v0, v1, v2)) % 17.88/3.10 | % 17.88/3.10 | ALPHA: (ord_v0_v200) implies: % 17.88/3.10 | (3) less(v0, v200) % 17.88/3.10 | % 17.88/3.10 | ALPHA: (ord_v200_v600) implies: % 17.88/3.10 | (4) less(v200, v600) % 17.88/3.10 | % 17.88/3.10 | ALPHA: (distinct) implies: % 17.88/3.10 | (5) $i(v200) % 17.88/3.10 | % 17.88/3.10 | ALPHA: (odrl500) implies: % 17.88/3.11 | (6) $i(v0) % 17.88/3.11 | (7) $i(v600) % 17.88/3.11 | (8) ! [v0: $i] : ( ~ $i(v0) | ~ in_lopen(v0, v0, v600)) % 17.88/3.11 | % 17.88/3.11 | GROUND_INST: instantiating (1) with v200, v600, simplifying with (4), (5), (7) % 17.88/3.11 | gives: % 17.88/3.11 | (9) leq(v200, v600) % 17.88/3.11 | % 17.88/3.11 | GROUND_INST: instantiating (2) with v200, v0, v600, simplifying with (3), (5), % 17.88/3.11 | (6), (7), (9) gives: % 17.88/3.12 | (10) in_lopen(v200, v0, v600) % 17.88/3.12 | % 17.88/3.12 | GROUND_INST: instantiating (8) with v200, simplifying with (5), (10) gives: % 17.88/3.12 | (11) $false % 17.88/3.12 | % 17.88/3.12 | CLOSE: (11) is inconsistent. % 17.88/3.12 | % 17.88/3.12 End of proof % 17.88/3.12 % SZS output end Proof for theBenchmark % 17.88/3.12 % 17.88/3.12 2513ms %------------------------------------------------------------------------------