%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT104+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 : n010.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.05s 2.76s % Output : Proof 17.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT104+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.35 % Computer : n010.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 14:40:11 UTC 2026 % 0.09/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.69/0.71 ________ _____ % 0.69/0.71 ___ __ \_________(_)________________________________ % 0.69/0.71 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.69/0.71 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.69/0.71 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.69/0.71 % 0.69/0.71 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.69/0.71 (2023-06-19) % 0.69/0.71 % 0.69/0.71 (c) Philipp Rümmer, 2009-2023 % 0.69/0.71 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.69/0.71 Amanda Stjerna. % 0.69/0.71 Free software under BSD-3-Clause. % 0.69/0.71 % 0.69/0.71 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.69/0.71 % 0.69/0.71 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.69/0.73 Running up to 7 provers in parallel. % 0.69/0.74 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.69/0.74 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.69/0.74 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.69/0.74 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.69/0.74 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.69/0.74 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.69/0.74 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.66/1.55 Prover 4: Preprocessing ... % 4.66/1.59 Prover 1: Preprocessing ... % 5.42/1.65 Prover 3: Preprocessing ... % 5.42/1.65 Prover 6: Preprocessing ... % 5.42/1.65 Prover 5: Preprocessing ... % 5.42/1.67 Prover 2: Preprocessing ... % 5.42/1.68 Prover 0: Preprocessing ... % 11.68/2.43 Prover 5: Proving ... % 12.47/2.58 Prover 1: Constructing countermodel ... % 12.47/2.58 Prover 2: Proving ... % 13.26/2.62 Prover 6: Proving ... % 14.05/2.72 Prover 3: Constructing countermodel ... % 14.05/2.74 Prover 6: proved (2003ms) % 14.05/2.75 % 14.05/2.76 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 14.05/2.76 % 14.05/2.76 Prover 2: stopped % 14.05/2.76 Prover 5: stopped % 14.05/2.77 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 14.05/2.77 Prover 3: stopped % 14.05/2.77 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 14.05/2.77 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.05/2.77 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 14.85/2.81 Prover 4: Constructing countermodel ... % 14.85/2.82 Prover 1: Found proof (size 3) % 14.85/2.82 Prover 1: proved (2079ms) % 14.85/2.86 Prover 4: stopped % 15.57/2.90 Prover 0: Proving ... % 15.57/2.90 Prover 0: stopped % 15.57/2.93 Prover 10: Preprocessing ... % 15.57/2.95 Prover 8: Preprocessing ... % 15.57/2.96 Prover 7: Preprocessing ... % 15.57/2.97 Prover 11: Preprocessing ... % 15.57/3.00 Prover 10: stopped % 16.61/3.07 Prover 7: stopped % 16.61/3.13 Prover 11: stopped % 17.24/3.15 Prover 8: Warning: ignoring some quantifiers % 17.24/3.16 Prover 8: Constructing countermodel ... % 17.24/3.17 Prover 8: stopped % 17.24/3.17 % 17.24/3.18 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 17.24/3.18 % 17.24/3.18 % SZS output start Proof for theBenchmark % 17.24/3.19 Assumptions after simplification: % 17.24/3.19 --------------------------------- % 17.24/3.19 % 17.24/3.19 (contradiction) % 17.52/3.24 less(v0, v0) = 0 & $i(v0) % 17.52/3.24 % 17.52/3.24 (irreflexive) % 17.52/3.24 ! [v0: $i] : ( ~ (less(v0, v0) = 0) | ~ $i(v0)) % 17.52/3.24 % 17.52/3.24 Further assumptions not needed in the proof: % 17.52/3.24 -------------------------------------------- % 17.52/3.24 axis_compatible_def, axis_conflict_def, axis_subsumes_def, box_compatible, % 17.52/3.24 box_conflict, box_unknown, box_verdict_total, compatible_is_verdict, % 17.52/3.24 conflict_is_verdict, distinct, in_closed, in_lopen, in_open, in_ropen, % 17.52/3.24 leq_antisym, leq_def, leq_less_trans, leq_trans, less_implies_leq, % 17.52/3.24 less_leq_trans, nonempty_eq, nonempty_gt, nonempty_gteq, nonempty_lt, % 17.52/3.24 nonempty_lteq, op_enum, op_eq_is_op, op_gt_is_op, op_gteq_is_op, op_lt_is_op, % 17.52/3.24 op_lteq_is_op, ops_distinct_1, ops_distinct_10, ops_distinct_2, ops_distinct_3, % 17.52/3.24 ops_distinct_4, ops_distinct_5, ops_distinct_6, ops_distinct_7, ops_distinct_8, % 17.52/3.24 ops_distinct_9, ord_v0_v1200, transitive, trichotomy, unknown_is_verdict, % 17.52/3.24 val_v0, val_v1200, verdict_enum, verdicts_distinct_cf_cp, % 17.52/3.24 verdicts_distinct_cf_un, verdicts_distinct_cp_un, wf_eq, wf_gt, wf_gteq, wf_lt, % 17.52/3.24 wf_lteq % 17.52/3.24 % 17.52/3.24 Those formulas are unsatisfiable: % 17.52/3.24 --------------------------------- % 17.52/3.24 % 17.52/3.24 Begin of proof % 17.52/3.25 | % 17.52/3.25 | ALPHA: (contradiction) implies: % 17.52/3.25 | (1) $i(v0) % 17.52/3.25 | (2) less(v0, v0) = 0 % 17.52/3.25 | % 17.52/3.26 | GROUND_INST: instantiating (irreflexive) with v0, simplifying with (1), (2) % 17.52/3.26 | gives: % 17.52/3.26 | (3) $false % 17.52/3.26 | % 17.52/3.26 | CLOSE: (3) is inconsistent. % 17.52/3.26 | % 17.52/3.26 End of proof % 17.52/3.26 % SZS output end Proof for theBenchmark % 17.52/3.26 % 17.52/3.26 2547ms %------------------------------------------------------------------------------