TSTP Solution File: LCL954_19 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : LCL954_19 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 08:13:26 EDT 2023
% Result : Theorem 71.83s 10.85s
% Output : Proof 112.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.17 % Problem : LCL954_19 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.17 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.38 % Computer : n019.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8042.1875MB
% 0.12/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Fri Aug 25 07:28:43 EDT 2023
% 0.12/0.38 % CPUTime :
% 0.18/0.67 ________ _____
% 0.18/0.67 ___ __ \_________(_)________________________________
% 0.18/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.18/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.18/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.18/0.67
% 0.18/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.67 (2023-06-19)
% 0.18/0.67
% 0.18/0.67 (c) Philipp Rümmer, 2009-2023
% 0.18/0.67 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.67 Amanda Stjerna.
% 0.18/0.67 Free software under BSD-3-Clause.
% 0.18/0.67
% 0.18/0.67 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.67
% 0.18/0.67 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.18/0.68 Running up to 7 provers in parallel.
% 0.18/0.74 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.18/0.74 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.18/0.74 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.18/0.74 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.18/0.74 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.18/0.74 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.18/0.74 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 17.94/3.48 Prover 2: Preprocessing ...
% 17.94/3.48 Prover 5: Preprocessing ...
% 17.94/3.48 Prover 0: Preprocessing ...
% 17.94/3.50 Prover 4: Preprocessing ...
% 17.94/3.50 Prover 3: Preprocessing ...
% 17.94/3.52 Prover 1: Preprocessing ...
% 18.59/3.57 Prover 6: Preprocessing ...
% 48.99/7.77 Prover 5: Proving ...
% 58.58/9.24 Prover 6: Proving ...
% 58.58/9.27 Prover 1: Warning: ignoring some quantifiers
% 59.58/9.37 Prover 3: Warning: ignoring some quantifiers
% 59.58/9.41 Prover 3: Constructing countermodel ...
% 59.58/9.41 Prover 1: Constructing countermodel ...
% 71.05/10.67 Prover 2: Proving ...
% 71.83/10.85 Prover 3: proved (10147ms)
% 71.83/10.85
% 71.83/10.85 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 71.83/10.85
% 71.83/10.86 Prover 5: stopped
% 71.83/10.88 Prover 0: stopped
% 71.83/10.88 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 71.83/10.88 Prover 6: stopped
% 71.83/10.89 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 71.83/10.89 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 71.83/10.89 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 71.83/10.91 Prover 2: stopped
% 71.83/10.91 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 81.62/12.16 Prover 13: Preprocessing ...
% 82.88/12.37 Prover 8: Preprocessing ...
% 83.48/12.50 Prover 7: Preprocessing ...
% 83.48/12.54 Prover 10: Preprocessing ...
% 83.48/12.56 Prover 11: Preprocessing ...
% 88.64/13.27 Prover 7: Warning: ignoring some quantifiers
% 88.64/13.28 Prover 10: Warning: ignoring some quantifiers
% 88.64/13.32 Prover 13: Warning: ignoring some quantifiers
% 88.64/13.37 Prover 10: Constructing countermodel ...
% 88.64/13.37 Prover 7: Constructing countermodel ...
% 91.71/13.49 Prover 13: Constructing countermodel ...
% 94.89/13.94 Prover 10: Found proof (size 5)
% 94.89/13.94 Prover 10: proved (3057ms)
% 94.89/13.94 Prover 13: stopped
% 94.89/13.96 Prover 1: stopped
% 94.89/13.98 Prover 11: stopped
% 94.89/14.03 Prover 7: stopped
% 98.33/14.58 Prover 8: Warning: ignoring some quantifiers
% 98.33/14.63 Prover 8: Constructing countermodel ...
% 98.75/14.64 Prover 8: stopped
% 110.33/18.34 Prover 4: Warning: ignoring some quantifiers
% 111.68/18.58 Prover 4: Constructing countermodel ...
% 112.06/18.61 Prover 4: stopped
% 112.06/18.62
% 112.06/18.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 112.06/18.62
% 112.06/18.62 % SZS output start Proof for theBenchmark
% 112.06/18.63 Assumptions after simplification:
% 112.06/18.63 ---------------------------------
% 112.06/18.63
% 112.06/18.63 (verify)
% 112.06/18.65 $ki_world($ki_local_world) & ? [v0: $ki_world] : ? [v1: $ki_world] :
% 112.06/18.65 ($ki_world(v1) & $ki_world(v0) & $ki_accessible(v0, v1) &
% 112.06/18.65 $ki_accessible($ki_local_world, v0) & ~ true(v1) & ! [v2: $ki_world] : ( ~
% 112.06/18.65 $ki_world(v2) | ~ $ki_accessible(v0, v2) | true(v2)))
% 112.06/18.65
% 112.06/18.65 Further assumptions not needed in the proof:
% 112.06/18.65 --------------------------------------------
% 112.06/18.65 $ki_exists_in_world_$i_nonempty, a_select2_substitution_1,
% 112.06/18.65 a_select2_substitution_2, a_select3_substitution_1, a_select3_substitution_2,
% 112.06/18.65 a_select3_substitution_3, const_array1_select, const_array2_select, defuse,
% 112.06/18.65 dim_substitution_1, dim_substitution_2, finite_domain_0, finite_domain_1,
% 112.06/18.65 finite_domain_2, finite_domain_3, finite_domain_4, finite_domain_5,
% 112.06/18.65 geq_substitution_1, geq_substitution_2, gt_0_tptp_minus_1, gt_1_0,
% 112.06/18.65 gt_1_tptp_minus_1, gt_2_0, gt_2_1, gt_2_tptp_minus_1, gt_3_0, gt_3_1, gt_3_2,
% 112.06/18.65 gt_3_tptp_minus_1, gt_4_0, gt_4_1, gt_4_2, gt_4_3, gt_4_tptp_minus_1, gt_5_0,
% 112.06/18.65 gt_5_1, gt_5_2, gt_5_3, gt_5_4, gt_5_tptp_minus_1, gt_substitution_1,
% 112.06/18.65 gt_substitution_2, gt_succ, inv_substitution_1, irreflexivity_gt, leq_geq,
% 112.06/18.65 leq_gt1, leq_gt2, leq_gt_pred, leq_minus, leq_substitution_1,
% 112.06/18.65 leq_substitution_2, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ,
% 112.06/18.65 lt_gt, lt_substitution_1, lt_substitution_2, matrix_symm_aba1, matrix_symm_aba2,
% 112.06/18.65 matrix_symm_add, matrix_symm_inv, matrix_symm_joseph_update, matrix_symm_sub,
% 112.06/18.65 matrix_symm_trans, matrix_symm_update_diagonal, minus_substitution_1,
% 112.06/18.65 minus_substitution_2, mrel_reflexive, mrel_transitive, plus_substitution_1,
% 112.06/18.65 plus_substitution_2, pred_minus_1, pred_substitution_1, pred_succ, reflexivity,
% 112.06/18.65 reflexivity_leq, sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1,
% 112.06/18.65 sel3_update_2, sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l,
% 112.06/18.65 succ_plus_2_r, succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r,
% 112.06/18.65 succ_plus_5_l, succ_plus_5_r, succ_pred, succ_substitution_1, succ_tptp_minus_1,
% 112.06/18.65 successor_1, successor_2, successor_3, successor_4, successor_5, sum_plus_base,
% 112.06/18.65 sum_plus_base_float, sum_substitution_1, sum_substitution_2, sum_substitution_3,
% 112.06/18.65 symmetry, totality, tptp_const_array1_substitution_1,
% 112.06/18.65 tptp_const_array1_substitution_2, tptp_const_array2_substitution_1,
% 112.06/18.65 tptp_const_array2_substitution_2, tptp_const_array2_substitution_3,
% 112.06/18.65 tptp_madd_substitution_1, tptp_madd_substitution_2, tptp_mmul_substitution_1,
% 112.06/18.65 tptp_mmul_substitution_2, tptp_msub_substitution_1, tptp_msub_substitution_2,
% 112.06/18.65 tptp_update2_substitution_1, tptp_update2_substitution_2,
% 112.06/18.65 tptp_update2_substitution_3, tptp_update3_substitution_1,
% 112.06/18.65 tptp_update3_substitution_2, tptp_update3_substitution_3,
% 112.06/18.66 tptp_update3_substitution_4, trans_substitution_1, transitivity,
% 112.06/18.66 transitivity_gt, transitivity_leq, ttrue, uniform_int_rand_ranges_hi,
% 112.06/18.66 uniform_int_rand_ranges_lo, uniform_int_rnd_substitution_1,
% 112.06/18.66 uniform_int_rnd_substitution_2
% 112.06/18.66
% 112.06/18.66 Those formulas are unsatisfiable:
% 112.06/18.66 ---------------------------------
% 112.06/18.66
% 112.06/18.66 Begin of proof
% 112.06/18.66 |
% 112.06/18.66 | ALPHA: (verify) implies:
% 112.06/18.66 | (1) ? [v0: $ki_world] : ? [v1: $ki_world] : ($ki_world(v1) &
% 112.06/18.66 | $ki_world(v0) & $ki_accessible(v0, v1) &
% 112.06/18.66 | $ki_accessible($ki_local_world, v0) & ~ true(v1) & ! [v2:
% 112.06/18.66 | $ki_world] : ( ~ $ki_world(v2) | ~ $ki_accessible(v0, v2) |
% 112.06/18.66 | true(v2)))
% 112.06/18.66 |
% 112.06/18.66 | DELTA: instantiating (1) with fresh symbols all_145_0, all_145_1 gives:
% 112.06/18.66 | (2) $ki_world(all_145_0) & $ki_world(all_145_1) & $ki_accessible(all_145_1,
% 112.06/18.66 | all_145_0) & $ki_accessible($ki_local_world, all_145_1) & ~
% 112.06/18.66 | true(all_145_0) & ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~
% 112.06/18.66 | $ki_accessible(all_145_1, v0) | true(v0))
% 112.06/18.66 |
% 112.06/18.66 | ALPHA: (2) implies:
% 112.06/18.67 | (3) ~ true(all_145_0)
% 112.06/18.67 | (4) $ki_accessible(all_145_1, all_145_0)
% 112.06/18.67 | (5) $ki_world(all_145_0)
% 112.06/18.67 | (6) ! [v0: $ki_world] : ( ~ $ki_world(v0) | ~ $ki_accessible(all_145_1,
% 112.06/18.67 | v0) | true(v0))
% 112.06/18.67 |
% 112.06/18.67 | GROUND_INST: instantiating (6) with all_145_0, simplifying with (3), (4), (5)
% 112.06/18.67 | gives:
% 112.06/18.67 | (7) $false
% 112.06/18.67 |
% 112.06/18.67 | CLOSE: (7) is inconsistent.
% 112.06/18.67 |
% 112.06/18.67 End of proof
% 112.06/18.67 % SZS output end Proof for theBenchmark
% 112.06/18.67
% 112.06/18.67 18003ms
%------------------------------------------------------------------------------