%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV128+1 : TPTP v8.1.2. Bugfixed v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n032.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 22:55:02 EDT 2023 % Result : Theorem 11.24s 2.30s % Output : Proof 17.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SWV128+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.03/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.31 % Computer : n032.cluster.edu % 0.11/0.31 % Model : x86_64 x86_64 % 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.31 % Memory : 8042.1875MB % 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.31 % CPULimit : 300 % 0.11/0.31 % WCLimit : 300 % 0.11/0.31 % DateTime : Tue Aug 29 03:35:31 EDT 2023 % 0.11/0.32 % CPUTime : % 0.17/0.57 ________ _____ % 0.17/0.57 ___ __ \_________(_)________________________________ % 0.17/0.57 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.17/0.57 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.17/0.57 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.17/0.57 % 0.17/0.57 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.17/0.57 (2023-06-19) % 0.17/0.57 % 0.17/0.57 (c) Philipp Rümmer, 2009-2023 % 0.17/0.57 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.17/0.57 Amanda Stjerna. % 0.17/0.57 Free software under BSD-3-Clause. % 0.17/0.57 % 0.17/0.57 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.17/0.57 % 0.17/0.57 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.17/0.59 Running up to 7 provers in parallel. % 0.17/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.17/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.17/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.17/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.17/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.17/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.17/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.74/1.43 Prover 4: Preprocessing ... % 5.16/1.44 Prover 1: Preprocessing ... % 5.36/1.49 Prover 0: Preprocessing ... % 5.36/1.49 Prover 2: Preprocessing ... % 5.36/1.49 Prover 5: Preprocessing ... % 5.36/1.49 Prover 6: Preprocessing ... % 5.36/1.49 Prover 3: Preprocessing ... % 10.48/2.23 Prover 5: Constructing countermodel ... % 11.24/2.29 Prover 5: proved (1683ms) % 11.24/2.30 % 11.24/2.30 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.24/2.30 % 11.24/2.32 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.85/2.38 Prover 3: Constructing countermodel ... % 11.85/2.38 Prover 3: stopped % 11.85/2.38 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.33/2.43 Prover 1: Warning: ignoring some quantifiers % 12.33/2.43 Prover 6: Constructing countermodel ... % 12.33/2.43 Prover 6: stopped % 12.33/2.45 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 13.73/2.63 Prover 7: Preprocessing ... % 13.73/2.65 Prover 1: Constructing countermodel ... % 13.96/2.68 Prover 8: Preprocessing ... % 13.96/2.72 Prover 10: Preprocessing ... % 14.53/2.77 Prover 0: Constructing countermodel ... % 14.53/2.77 Prover 0: stopped % 14.53/2.77 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 14.82/2.77 Prover 4: Warning: ignoring some quantifiers % 15.28/2.85 Prover 2: Constructing countermodel ... % 15.28/2.85 Prover 2: stopped % 15.40/2.87 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 15.40/2.88 Prover 1: Found proof (size 5) % 15.40/2.88 Prover 1: proved (2278ms) % 15.40/2.90 Prover 11: Preprocessing ... % 15.87/2.93 Prover 4: Constructing countermodel ... % 15.87/2.96 Prover 13: Preprocessing ... % 16.17/3.02 Prover 4: stopped % 16.17/3.03 Prover 11: stopped % 16.71/3.05 Prover 7: Warning: ignoring some quantifiers % 16.71/3.05 Prover 13: stopped % 16.71/3.06 Prover 10: Warning: ignoring some quantifiers % 16.96/3.08 Prover 8: Warning: ignoring some quantifiers % 16.96/3.09 Prover 10: Constructing countermodel ... % 16.96/3.10 Prover 7: Constructing countermodel ... % 16.96/3.12 Prover 8: Constructing countermodel ... % 16.96/3.12 Prover 10: stopped % 16.96/3.12 Prover 7: stopped % 16.96/3.15 Prover 8: stopped % 16.96/3.15 % 16.96/3.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 16.96/3.15 % 16.96/3.15 % SZS output start Proof for theBenchmark % 16.96/3.16 Assumptions after simplification: % 16.96/3.16 --------------------------------- % 16.96/3.16 % 16.96/3.16 (thruster_inuse_0001) % 17.62/3.21 $i(z_defuse) & $i(xinit_mean_defuse) & $i(xinit_defuse) & $i(n_statevars) & % 17.62/3.21 $i(tr_defuse) & $i(n7) & $i(rho_defuse) & $i(n_steps) & $i(m_measvars) & % 17.62/3.21 $i(tvar_defuse) & $i(t_defuse) & $i(use) & $i(n1) & $i(n0) & ? [v0: $i] : ? % 17.62/3.21 [v1: $i] : ? [v2: $i] : (tvar_defuse = use & t_defuse = use & % 17.62/3.21 minus(n_statevars, n1) = v2 & minus(n_steps, n1) = v1 & minus(m_measvars, % 17.62/3.21 n1) = v0 & $i(v2) & $i(v1) & $i(v0) & ~ true & ! [v3: $i] : ! [v4: $i] % 17.62/3.21 : ( ~ (leq(v4, v1) = 0) | ~ (leq(v3, v0) = 0) | ~ $i(v4) | ~ $i(v3) | ? % 17.62/3.21 [v5: any] : ? [v6: any] : ? [v7: $i] : (a_select3(z_defuse, v3, v4) = v7 % 17.62/3.21 & leq(n0, v4) = v6 & leq(n0, v3) = v5 & $i(v7) & ( ~ (v6 = 0) | ~ (v5 = % 17.62/3.21 0) | v7 = use))) & ! [v3: $i] : ! [v4: $i] : ( ~ (leq(v4, v1) = 0) % 17.62/3.21 | ~ (leq(v3, v0) = 0) | ~ $i(v4) | ~ $i(v3) | ? [v5: any] : ? [v6: % 17.62/3.21 any] : ? [v7: $i] : (a_select3(rho_defuse, v3, v4) = v7 & leq(n0, v4) = % 17.62/3.21 v6 & leq(n0, v3) = v5 & $i(v7) & ( ~ (v6 = 0) | ~ (v5 = 0) | v7 = % 17.62/3.21 use))) & ! [v3: $i] : ! [v4: $i] : ( ~ (leq(v4, v1) = 0) | ~ % 17.62/3.21 (leq(v3, n7) = 0) | ~ $i(v4) | ~ $i(v3) | ? [v5: any] : ? [v6: any] : % 17.62/3.21 ? [v7: $i] : (a_select3(tr_defuse, v3, v4) = v7 & leq(n0, v4) = v6 & % 17.62/3.21 leq(n0, v3) = v5 & $i(v7) & ( ~ (v6 = 0) | ~ (v5 = 0) | v7 = use))) & % 17.62/3.21 ! [v3: $i] : ( ~ (leq(v3, v2) = 0) | ~ $i(v3) | ? [v4: any] : ? [v5: $i] % 17.62/3.21 : (a_select2(xinit_mean_defuse, v3) = v5 & leq(n0, v3) = v4 & $i(v5) & ( ~ % 17.62/3.21 (v4 = 0) | v5 = use))) & ! [v3: $i] : ( ~ (leq(v3, v2) = 0) | ~ % 17.62/3.21 $i(v3) | ? [v4: any] : ? [v5: $i] : (a_select2(xinit_defuse, v3) = v5 & % 17.62/3.21 leq(n0, v3) = v4 & $i(v5) & ( ~ (v4 = 0) | v5 = use)))) % 17.62/3.21 % 17.62/3.21 (ttrue) % 17.62/3.21 true % 17.62/3.21 % 17.62/3.21 Further assumptions not needed in the proof: % 17.62/3.21 -------------------------------------------- % 17.62/3.22 const_array1_select, const_array2_select, defuse, finite_domain_0, % 17.62/3.22 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 17.62/3.22 finite_domain_5, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, gt_2_0, gt_2_1, % 17.62/3.22 gt_2_tptp_minus_1, gt_3_0, gt_3_1, gt_3_2, gt_3_tptp_minus_1, gt_4_0, gt_4_1, % 17.62/3.22 gt_4_2, gt_4_3, gt_4_tptp_minus_1, gt_5_0, gt_5_1, gt_5_2, gt_5_3, gt_5_4, % 17.62/3.22 gt_5_tptp_minus_1, gt_7_0, gt_7_1, gt_7_2, gt_7_3, gt_7_4, gt_7_5, % 17.62/3.22 gt_7_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq, leq_gt1, leq_gt2, % 17.62/3.22 leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ, % 17.62/3.22 lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv, % 17.62/3.22 matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans, % 17.62/3.22 matrix_symm_update_diagonal, pred_minus_1, pred_succ, reflexivity_leq, % 17.62/3.22 sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2, % 17.62/3.22 sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r, % 17.62/3.22 succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l, % 17.62/3.22 succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, successor_2, % 17.62/3.22 successor_3, successor_4, successor_5, sum_plus_base, sum_plus_base_float, % 17.62/3.22 totality, transitivity_gt, transitivity_leq, uniform_int_rand_ranges_hi, % 17.62/3.22 uniform_int_rand_ranges_lo % 17.62/3.22 % 17.62/3.22 Those formulas are unsatisfiable: % 17.62/3.22 --------------------------------- % 17.62/3.22 % 17.62/3.22 Begin of proof % 17.62/3.22 | % 17.62/3.22 | ALPHA: (thruster_inuse_0001) implies: % 17.77/3.22 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (tvar_defuse = use & t_defuse % 17.77/3.22 | = use & minus(n_statevars, n1) = v2 & minus(n_steps, n1) = v1 & % 17.77/3.22 | minus(m_measvars, n1) = v0 & $i(v2) & $i(v1) & $i(v0) & ~ true & ! % 17.77/3.22 | [v3: $i] : ! [v4: $i] : ( ~ (leq(v4, v1) = 0) | ~ (leq(v3, v0) = 0) % 17.77/3.22 | | ~ $i(v4) | ~ $i(v3) | ? [v5: any] : ? [v6: any] : ? [v7: $i] % 17.77/3.22 | : (a_select3(z_defuse, v3, v4) = v7 & leq(n0, v4) = v6 & leq(n0, % 17.77/3.23 | v3) = v5 & $i(v7) & ( ~ (v6 = 0) | ~ (v5 = 0) | v7 = use))) & % 17.77/3.23 | ! [v3: $i] : ! [v4: $i] : ( ~ (leq(v4, v1) = 0) | ~ (leq(v3, v0) = % 17.77/3.23 | 0) | ~ $i(v4) | ~ $i(v3) | ? [v5: any] : ? [v6: any] : ? % 17.77/3.23 | [v7: $i] : (a_select3(rho_defuse, v3, v4) = v7 & leq(n0, v4) = v6 & % 17.77/3.23 | leq(n0, v3) = v5 & $i(v7) & ( ~ (v6 = 0) | ~ (v5 = 0) | v7 = % 17.77/3.23 | use))) & ! [v3: $i] : ! [v4: $i] : ( ~ (leq(v4, v1) = 0) | ~ % 17.77/3.23 | (leq(v3, n7) = 0) | ~ $i(v4) | ~ $i(v3) | ? [v5: any] : ? [v6: % 17.77/3.23 | any] : ? [v7: $i] : (a_select3(tr_defuse, v3, v4) = v7 & leq(n0, % 17.77/3.23 | v4) = v6 & leq(n0, v3) = v5 & $i(v7) & ( ~ (v6 = 0) | ~ (v5 = % 17.77/3.23 | 0) | v7 = use))) & ! [v3: $i] : ( ~ (leq(v3, v2) = 0) | ~ % 17.77/3.23 | $i(v3) | ? [v4: any] : ? [v5: $i] : (a_select2(xinit_mean_defuse, % 17.77/3.23 | v3) = v5 & leq(n0, v3) = v4 & $i(v5) & ( ~ (v4 = 0) | v5 = % 17.77/3.23 | use))) & ! [v3: $i] : ( ~ (leq(v3, v2) = 0) | ~ $i(v3) | ? % 17.77/3.23 | [v4: any] : ? [v5: $i] : (a_select2(xinit_defuse, v3) = v5 & % 17.77/3.23 | leq(n0, v3) = v4 & $i(v5) & ( ~ (v4 = 0) | v5 = use)))) % 17.77/3.23 | % 17.77/3.23 | DELTA: instantiating (1) with fresh symbols all_74_0, all_74_1, all_74_2 % 17.77/3.23 | gives: % 17.77/3.23 | (2) tvar_defuse = use & t_defuse = use & minus(n_statevars, n1) = all_74_0 % 17.77/3.23 | & minus(n_steps, n1) = all_74_1 & minus(m_measvars, n1) = all_74_2 & % 17.77/3.23 | $i(all_74_0) & $i(all_74_1) & $i(all_74_2) & ~ true & ! [v0: $i] : ! % 17.77/3.23 | [v1: $i] : ( ~ (leq(v1, all_74_1) = 0) | ~ (leq(v0, all_74_2) = 0) | % 17.77/3.23 | ~ $i(v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : ? [v4: $i] : % 17.77/3.23 | (a_select3(z_defuse, v0, v1) = v4 & leq(n0, v1) = v3 & leq(n0, v0) = % 17.77/3.23 | v2 & $i(v4) & ( ~ (v3 = 0) | ~ (v2 = 0) | v4 = use))) & ! [v0: % 17.77/3.23 | $i] : ! [v1: $i] : ( ~ (leq(v1, all_74_1) = 0) | ~ (leq(v0, % 17.77/3.23 | all_74_2) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: any] : ? [v3: % 17.77/3.23 | any] : ? [v4: $i] : (a_select3(rho_defuse, v0, v1) = v4 & leq(n0, % 17.77/3.23 | v1) = v3 & leq(n0, v0) = v2 & $i(v4) & ( ~ (v3 = 0) | ~ (v2 = 0) % 17.77/3.23 | | v4 = use))) & ! [v0: $i] : ! [v1: $i] : ( ~ (leq(v1, % 17.77/3.23 | all_74_1) = 0) | ~ (leq(v0, n7) = 0) | ~ $i(v1) | ~ $i(v0) | % 17.77/3.23 | ? [v2: any] : ? [v3: any] : ? [v4: $i] : (a_select3(tr_defuse, v0, % 17.77/3.23 | v1) = v4 & leq(n0, v1) = v3 & leq(n0, v0) = v2 & $i(v4) & ( ~ (v3 % 17.77/3.23 | = 0) | ~ (v2 = 0) | v4 = use))) & ! [v0: $i] : ( ~ (leq(v0, % 17.77/3.23 | all_74_0) = 0) | ~ $i(v0) | ? [v1: any] : ? [v2: $i] : % 17.77/3.23 | (a_select2(xinit_mean_defuse, v0) = v2 & leq(n0, v0) = v1 & $i(v2) & % 17.77/3.23 | ( ~ (v1 = 0) | v2 = use))) & ! [v0: $i] : ( ~ (leq(v0, all_74_0) = % 17.77/3.23 | 0) | ~ $i(v0) | ? [v1: any] : ? [v2: $i] : % 17.77/3.23 | (a_select2(xinit_defuse, v0) = v2 & leq(n0, v0) = v1 & $i(v2) & ( ~ % 17.77/3.23 | (v1 = 0) | v2 = use))) % 17.77/3.23 | % 17.77/3.23 | ALPHA: (2) implies: % 17.77/3.23 | (3) ~ true % 17.77/3.23 | % 17.77/3.23 | PRED_UNIFY: (3), (ttrue) imply: % 17.77/3.24 | (4) $false % 17.77/3.24 | % 17.77/3.24 | CLOSE: (4) is inconsistent. % 17.77/3.24 | % 17.77/3.24 End of proof % 17.77/3.24 % SZS output end Proof for theBenchmark % 17.77/3.24 % 17.77/3.24 2662ms %------------------------------------------------------------------------------