%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV088+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 : n025.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:54:51 EDT 2023 % Result : Theorem 12.08s 2.45s % Output : Proof 18.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.09 % Problem : SWV088+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.00/0.10 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.29 % Computer : n025.cluster.edu % 0.11/0.29 % Model : x86_64 x86_64 % 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.29 % Memory : 8042.1875MB % 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.29 % CPULimit : 300 % 0.11/0.29 % WCLimit : 300 % 0.11/0.29 % DateTime : Tue Aug 29 04:47:54 EDT 2023 % 0.11/0.30 % CPUTime : % 0.13/0.57 ________ _____ % 0.13/0.57 ___ __ \_________(_)________________________________ % 0.13/0.57 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.13/0.57 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.13/0.57 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.13/0.57 % 0.13/0.57 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.13/0.57 (2023-06-19) % 0.13/0.57 % 0.13/0.57 (c) Philipp Rümmer, 2009-2023 % 0.13/0.57 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.13/0.57 Amanda Stjerna. % 0.13/0.57 Free software under BSD-3-Clause. % 0.13/0.57 % 0.13/0.57 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.13/0.57 % 0.13/0.58 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.13/0.59 Running up to 7 provers in parallel. % 0.13/0.61 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.13/0.61 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.13/0.61 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.13/0.61 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.13/0.61 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.13/0.61 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.13/0.61 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 3.91/1.42 Prover 1: Preprocessing ... % 3.91/1.43 Prover 4: Preprocessing ... % 5.26/1.49 Prover 0: Preprocessing ... % 5.26/1.49 Prover 6: Preprocessing ... % 5.26/1.49 Prover 3: Preprocessing ... % 5.26/1.49 Prover 2: Preprocessing ... % 5.26/1.49 Prover 5: Preprocessing ... % 11.42/2.38 Prover 5: Constructing countermodel ... % 12.08/2.43 Prover 3: Constructing countermodel ... % 12.08/2.45 Prover 5: proved (1833ms) % 12.08/2.45 % 12.08/2.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.08/2.45 % 12.08/2.45 Prover 3: proved (1841ms) % 12.08/2.45 % 12.08/2.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.08/2.45 % 12.08/2.45 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 12.08/2.46 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.71/2.54 Prover 1: Warning: ignoring some quantifiers % 12.71/2.55 Prover 6: Constructing countermodel ... % 12.71/2.55 Prover 6: stopped % 12.71/2.56 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 13.60/2.67 Prover 1: Constructing countermodel ... % 13.60/2.69 Prover 8: Preprocessing ... % 13.60/2.69 Prover 7: Preprocessing ... % 14.33/2.84 Prover 10: Preprocessing ... % 14.33/2.88 Prover 0: Constructing countermodel ... % 14.33/2.88 Prover 0: stopped % 14.33/2.88 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 14.33/2.91 Prover 4: Warning: ignoring some quantifiers % 15.82/2.99 Prover 1: Found proof (size 5) % 15.82/2.99 Prover 1: proved (2385ms) % 16.55/3.04 Prover 11: Preprocessing ... % 16.55/3.05 Prover 2: Constructing countermodel ... % 16.55/3.05 Prover 2: stopped % 16.55/3.07 Prover 4: Constructing countermodel ... % 17.04/3.12 Prover 7: Warning: ignoring some quantifiers % 17.04/3.13 Prover 4: stopped % 17.53/3.17 Prover 10: Warning: ignoring some quantifiers % 17.53/3.17 Prover 11: stopped % 17.53/3.18 Prover 8: Warning: ignoring some quantifiers % 17.53/3.19 Prover 7: Constructing countermodel ... % 17.53/3.20 Prover 10: Constructing countermodel ... % 17.53/3.22 Prover 8: Constructing countermodel ... % 17.53/3.23 Prover 7: stopped % 17.53/3.24 Prover 10: stopped % 17.53/3.25 Prover 8: stopped % 17.53/3.25 % 17.53/3.25 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 17.53/3.25 % 17.53/3.26 % SZS output start Proof for theBenchmark % 18.17/3.26 Assumptions after simplification: % 18.17/3.26 --------------------------------- % 18.17/3.26 % 18.17/3.27 (cl5_nebula_array_0029) % 18.33/3.30 $i(n135300) & $i(n1) & $i(n0) & ? [v0: $i] : (minus(n135300, n1) = v0 & % 18.33/3.30 geq(v0, n0) = 0 & $i(v0) & ~ true) % 18.33/3.30 % 18.33/3.30 (ttrue) % 18.33/3.30 true % 18.33/3.30 % 18.33/3.30 Further assumptions not needed in the proof: % 18.33/3.30 -------------------------------------------- % 18.33/3.30 const_array1_select, const_array2_select, defuse, finite_domain_0, % 18.33/3.30 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 18.33/3.30 finite_domain_5, gt_0_tptp_minus_1, gt_135300_0, gt_135300_1, gt_135300_2, % 18.33/3.30 gt_135300_3, gt_135300_4, gt_135300_5, gt_135300_tptp_minus_1, gt_1_0, % 18.33/3.30 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, % 18.33/3.30 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, % 18.33/3.30 gt_5_1, gt_5_2, gt_5_3, gt_5_4, gt_5_tptp_minus_1, gt_succ, irreflexivity_gt, % 18.33/3.30 leq_geq, leq_gt1, leq_gt2, leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, % 18.33/3.30 leq_succ_gt_equiv, leq_succ_succ, lt_gt, matrix_symm_aba1, matrix_symm_aba2, % 18.33/3.30 matrix_symm_add, matrix_symm_inv, matrix_symm_joseph_update, matrix_symm_sub, % 18.33/3.30 matrix_symm_trans, matrix_symm_update_diagonal, pred_minus_1, pred_succ, % 18.33/3.30 reflexivity_leq, sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, % 18.33/3.30 sel3_update_2, sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, % 18.33/3.30 succ_plus_2_r, succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, % 18.33/3.31 succ_plus_5_l, succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, % 18.33/3.31 successor_2, successor_3, successor_4, successor_5, sum_plus_base, % 18.33/3.31 sum_plus_base_float, totality, transitivity_gt, transitivity_leq, % 18.33/3.31 uniform_int_rand_ranges_hi, uniform_int_rand_ranges_lo % 18.33/3.31 % 18.33/3.31 Those formulas are unsatisfiable: % 18.33/3.31 --------------------------------- % 18.33/3.31 % 18.33/3.31 Begin of proof % 18.33/3.31 | % 18.33/3.31 | ALPHA: (cl5_nebula_array_0029) implies: % 18.33/3.31 | (1) ? [v0: $i] : (minus(n135300, n1) = v0 & geq(v0, n0) = 0 & $i(v0) & ~ % 18.33/3.31 | true) % 18.33/3.31 | % 18.33/3.31 | DELTA: instantiating (1) with fresh symbol all_51_0 gives: % 18.33/3.31 | (2) minus(n135300, n1) = all_51_0 & geq(all_51_0, n0) = 0 & $i(all_51_0) & % 18.33/3.31 | ~ true % 18.33/3.31 | % 18.33/3.31 | ALPHA: (2) implies: % 18.33/3.31 | (3) ~ true % 18.33/3.31 | % 18.33/3.31 | PRED_UNIFY: (3), (ttrue) imply: % 18.33/3.31 | (4) $false % 18.33/3.32 | % 18.33/3.32 | CLOSE: (4) is inconsistent. % 18.33/3.32 | % 18.33/3.32 End of proof % 18.33/3.32 % SZS output end Proof for theBenchmark % 18.33/3.32 % 18.33/3.32 2740ms %------------------------------------------------------------------------------