%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT102+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 : n002.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:31 AM UTC 2026 % Result : Unsatisfiable 14.55s 2.50s % Output : Proof 16.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT102+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.03 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.08/0.35 % Computer : n002.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 : Mon Sep 7 14:40:52 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.31/0.57 ________ _____ % 0.31/0.57 ___ __ \_________(_)________________________________ % 0.31/0.57 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.31/0.57 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.31/0.57 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.31/0.57 % 0.31/0.57 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.31/0.57 (2023-06-19) % 0.31/0.57 % 0.31/0.57 (c) Philipp Rümmer, 2009-2023 % 0.31/0.57 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.31/0.57 Amanda Stjerna. % 0.31/0.57 Free software under BSD-3-Clause. % 0.31/0.57 % 0.31/0.57 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.31/0.57 % 0.31/0.57 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.31/0.58 Running up to 7 provers in parallel. % 0.63/0.60 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.63/0.60 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.63/0.60 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.63/0.60 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.63/0.60 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.63/0.60 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.63/0.60 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.36/1.24 Prover 1: Preprocessing ... % 4.36/1.25 Prover 4: Preprocessing ... % 4.36/1.29 Prover 3: Preprocessing ... % 4.36/1.29 Prover 6: Preprocessing ... % 4.36/1.30 Prover 2: Preprocessing ... % 4.36/1.30 Prover 5: Preprocessing ... % 4.36/1.30 Prover 0: Preprocessing ... % 9.83/1.96 Prover 5: Proving ... % 9.83/1.97 Prover 2: Proving ... % 9.83/1.98 Prover 3: Constructing countermodel ... % 10.84/2.05 Prover 1: Constructing countermodel ... % 10.84/2.08 Prover 6: Proving ... % 11.67/2.15 Prover 3: gave up % 11.67/2.15 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.67/2.16 Prover 6: gave up % 11.67/2.17 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.67/2.17 Prover 1: gave up % 11.67/2.17 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 12.17/2.25 Prover 8: Preprocessing ... % 12.17/2.26 Prover 0: Proving ... % 12.17/2.28 Prover 4: Constructing countermodel ... % 12.96/2.30 Prover 7: Preprocessing ... % 12.96/2.31 Prover 9: Preprocessing ... % 13.76/2.49 Prover 2: proved (1899ms) % 13.76/2.49 % 14.55/2.50 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 14.55/2.50 % 14.55/2.50 Prover 0: stopped % 14.55/2.50 Prover 5: stopped % 14.55/2.51 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.55/2.51 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 14.55/2.51 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 14.55/2.53 Prover 7: Warning: ignoring some quantifiers % 14.55/2.53 Prover 8: Warning: ignoring some quantifiers % 14.55/2.57 Prover 7: Constructing countermodel ... % 14.55/2.57 Prover 8: Constructing countermodel ... % 15.35/2.62 Prover 10: Preprocessing ... % 15.35/2.62 Prover 13: Preprocessing ... % 15.35/2.65 Prover 4: Found proof (size 5) % 15.35/2.65 Prover 4: proved (2061ms) % 15.35/2.65 Prover 7: stopped % 15.35/2.65 Prover 13: stopped % 15.35/2.66 Prover 10: stopped % 15.35/2.66 Prover 8: stopped % 15.35/2.67 Prover 11: Preprocessing ... % 16.06/2.75 Prover 11: stopped % 16.06/2.76 Prover 9: Constructing countermodel ... % 16.06/2.78 Prover 9: stopped % 16.06/2.78 % 16.06/2.78 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 16.06/2.78 % 16.06/2.78 % SZS output start Proof for theBenchmark % 16.06/2.79 Assumptions after simplification: % 16.06/2.79 --------------------------------- % 16.06/2.79 % 16.06/2.79 (contradiction) % 16.61/2.84 less(v700, v600) = 0 & less(v600, v700) = 0 & $i(v700) & $i(v600) % 16.61/2.84 % 16.61/2.84 (irreflexive) % 16.61/2.84 ! [v0: $i] : ( ~ (less(v0, v0) = 0) | ~ $i(v0)) % 16.61/2.84 % 16.61/2.84 (transitive) % 16.61/2.85 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 16.61/2.85 (less(v1, v2) = 0) | ~ (less(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ % 16.61/2.85 $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & less(v0, v1) = v4)) & ! [v0: $i] : % 16.61/2.85 ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (less(v0, v2) = v3) | % 16.61/2.85 ~ (less(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: int] : ( % 16.61/2.85 ~ (v4 = 0) & less(v1, v2) = v4)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] % 16.61/2.85 : ( ~ (less(v1, v2) = 0) | ~ (less(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ % 16.61/2.85 $i(v0) | less(v0, v2) = 0) % 16.61/2.85 % 16.61/2.85 Further assumptions not needed in the proof: % 16.61/2.85 -------------------------------------------- % 16.61/2.85 axis_compatible_def, axis_conflict_def, axis_subsumes_def, box_compatible, % 16.61/2.85 box_conflict, box_unknown, box_verdict_total, compatible_is_verdict, % 16.61/2.85 conflict_is_verdict, distinct, in_closed, in_lopen, in_open, in_ropen, % 16.61/2.85 leq_antisym, leq_def, leq_less_trans, leq_trans, less_implies_leq, % 16.61/2.85 less_leq_trans, ord_v0_v600, ord_v600_v700, trichotomy, unknown_is_verdict, % 16.61/2.85 val_v0, val_v600, val_v700, verdict_enum, verdicts_distinct_cf_cp, % 16.61/2.85 verdicts_distinct_cf_un, verdicts_distinct_cp_un % 16.61/2.85 % 16.61/2.85 Those formulas are unsatisfiable: % 16.61/2.85 --------------------------------- % 16.61/2.85 % 16.61/2.85 Begin of proof % 16.61/2.85 | % 16.61/2.86 | ALPHA: (transitive) implies: % 16.61/2.86 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (less(v1, v2) = 0) | ~ % 16.61/2.86 | (less(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | less(v0, v2) % 16.61/2.86 | = 0) % 16.61/2.86 | % 16.61/2.86 | ALPHA: (contradiction) implies: % 16.61/2.86 | (2) $i(v600) % 16.61/2.86 | (3) $i(v700) % 16.61/2.86 | (4) less(v600, v700) = 0 % 16.61/2.86 | (5) less(v700, v600) = 0 % 16.61/2.86 | % 16.61/2.87 | GROUND_INST: instantiating (1) with v700, v600, v700, simplifying with (2), % 16.61/2.87 | (3), (4), (5) gives: % 16.61/2.87 | (6) less(v700, v700) = 0 % 16.61/2.87 | % 16.61/2.87 | GROUND_INST: instantiating (irreflexive) with v700, simplifying with (3), (6) % 16.61/2.87 | gives: % 16.61/2.87 | (7) $false % 16.61/2.87 | % 16.61/2.87 | CLOSE: (7) is inconsistent. % 16.61/2.87 | % 16.61/2.87 End of proof % 16.61/2.88 % SZS output end Proof for theBenchmark % 16.61/2.88 % 16.61/2.88 2305ms %------------------------------------------------------------------------------