%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT075+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 : n017.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:29 AM UTC 2026 % Result : Theorem 12.52s 2.54s % Output : Proof 13.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT075+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.10/0.36 % Computer : n017.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Mon Sep 7 14:06:09 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/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.71 ________ _____ % 0.67/0.71 ___ __ \_________(_)________________________________ % 0.67/0.71 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.67/0.71 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.67/0.71 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.67/0.71 % 0.67/0.71 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.67/0.71 (2023-06-19) % 0.67/0.71 % 0.67/0.71 (c) Philipp Rümmer, 2009-2023 % 0.67/0.71 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.67/0.71 Amanda Stjerna. % 0.67/0.71 Free software under BSD-3-Clause. % 0.67/0.71 % 0.67/0.71 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.67/0.71 % 0.67/0.71 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.67/0.73 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 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 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 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 % 3.96/1.45 Prover 1: Preprocessing ... % 3.96/1.47 Prover 4: Preprocessing ... % 4.71/1.51 Prover 2: Preprocessing ... % 4.71/1.51 Prover 3: Preprocessing ... % 4.71/1.51 Prover 5: Preprocessing ... % 4.71/1.52 Prover 0: Preprocessing ... % 4.71/1.52 Prover 6: Preprocessing ... % 9.15/2.16 Prover 2: Proving ... % 9.15/2.16 Prover 5: Proving ... % 10.94/2.30 Prover 1: Constructing countermodel ... % 10.94/2.31 Prover 6: Proving ... % 10.94/2.33 Prover 3: Constructing countermodel ... % 11.72/2.47 Prover 4: Constructing countermodel ... % 11.72/2.48 Prover 0: Proving ... % 12.52/2.51 Prover 1: Found proof (size 9) % 12.52/2.52 Prover 1: proved (1772ms) % 12.52/2.52 Prover 2: stopped % 12.52/2.52 Prover 5: stopped % 12.52/2.52 Prover 0: stopped % 12.52/2.52 Prover 6: stopped % 12.52/2.52 Prover 3: stopped % 12.52/2.53 Prover 4: stopped % 12.52/2.53 % 12.52/2.54 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.52/2.54 % 12.52/2.54 % SZS output start Proof for theBenchmark % 12.52/2.55 Assumptions after simplification: % 12.52/2.55 --------------------------------- % 12.52/2.55 % 12.52/2.55 (in_open) % 13.06/2.61 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 13.06/2.61 (in_open(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: % 13.06/2.61 any] : ? [v5: any] : (less(v1, v0) = v4 & less(v0, v2) = v5 & ( ~ (v5 = % 13.06/2.61 0) | ~ (v4 = 0)))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 13.06/2.61 (in_open(v0, v1, v2) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (less(v1, % 13.06/2.61 v0) = 0 & less(v0, v2) = 0)) % 13.06/2.61 % 13.06/2.61 (irreflexive) % 13.06/2.61 ! [v0: $i] : ( ~ (less(v0, v0) = 0) | ~ $i(v0)) % 13.06/2.61 % 13.06/2.61 (less_leq_trans) % 13.06/2.61 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (leq(v1, v2) = 0) | ~ (less(v0, % 13.06/2.61 v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | less(v0, v2) = 0) % 13.06/2.61 % 13.06/2.62 (odrl302) % 13.06/2.62 $i(v600) & $i(v0) & ? [v0: $i] : (in_open(v0, v0, v600) = 0 & leq(v600, v0) = % 13.06/2.62 0 & $i(v0)) % 13.06/2.62 % 13.06/2.62 Further assumptions not needed in the proof: % 13.06/2.62 -------------------------------------------- % 13.06/2.62 axis_compatible_def, axis_conflict_def, axis_subsumes_def, box_compatible, % 13.06/2.62 box_conflict, box_unknown, box_verdict_total, compatible_is_verdict, % 13.06/2.62 conflict_is_verdict, distinct, in_closed, in_lopen, in_ropen, leq_antisym, % 13.06/2.62 leq_def, leq_less_trans, leq_trans, less_implies_leq, ord_v0_v600, transitive, % 13.06/2.62 trichotomy, unknown_is_verdict, val_v0, val_v600, verdict_enum, % 13.06/2.62 verdicts_distinct_cf_cp, verdicts_distinct_cf_un, verdicts_distinct_cp_un % 13.06/2.62 % 13.06/2.62 Those formulas are unsatisfiable: % 13.06/2.62 --------------------------------- % 13.06/2.62 % 13.06/2.62 Begin of proof % 13.06/2.62 | % 13.06/2.62 | ALPHA: (in_open) implies: % 13.06/2.63 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (in_open(v0, v1, v2) = 0) % 13.06/2.63 | | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (less(v1, v0) = 0 & less(v0, % 13.06/2.63 | v2) = 0)) % 13.06/2.63 | % 13.06/2.63 | ALPHA: (odrl302) implies: % 13.06/2.63 | (2) $i(v0) % 13.06/2.63 | (3) $i(v600) % 13.06/2.63 | (4) ? [v0: $i] : (in_open(v0, v0, v600) = 0 & leq(v600, v0) = 0 & $i(v0)) % 13.06/2.63 | % 13.06/2.64 | DELTA: instantiating (4) with fresh symbol all_25_0 gives: % 13.06/2.64 | (5) in_open(all_25_0, v0, v600) = 0 & leq(v600, all_25_0) = 0 & % 13.06/2.64 | $i(all_25_0) % 13.06/2.64 | % 13.06/2.64 | ALPHA: (5) implies: % 13.06/2.64 | (6) $i(all_25_0) % 13.06/2.64 | (7) leq(v600, all_25_0) = 0 % 13.06/2.64 | (8) in_open(all_25_0, v0, v600) = 0 % 13.06/2.64 | % 13.06/2.64 | GROUND_INST: instantiating (1) with all_25_0, v0, v600, simplifying with (2), % 13.06/2.64 | (3), (6), (8) gives: % 13.06/2.64 | (9) less(all_25_0, v600) = 0 & less(v0, all_25_0) = 0 % 13.06/2.64 | % 13.06/2.64 | ALPHA: (9) implies: % 13.06/2.64 | (10) less(all_25_0, v600) = 0 % 13.06/2.64 | % 13.06/2.65 | GROUND_INST: instantiating (less_leq_trans) with all_25_0, v600, all_25_0, % 13.06/2.65 | simplifying with (3), (6), (7), (10) gives: % 13.06/2.65 | (11) less(all_25_0, all_25_0) = 0 % 13.06/2.65 | % 13.06/2.65 | GROUND_INST: instantiating (irreflexive) with all_25_0, simplifying with (6), % 13.06/2.65 | (11) gives: % 13.06/2.65 | (12) $false % 13.06/2.65 | % 13.06/2.65 | CLOSE: (12) is inconsistent. % 13.06/2.65 | % 13.06/2.65 End of proof % 13.06/2.65 % SZS output end Proof for theBenchmark % 13.06/2.65 % 13.06/2.65 1936ms %------------------------------------------------------------------------------