%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV119+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 : n018.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:00 EDT 2023 % Result : Theorem 10.30s 2.10s % Output : Proof 14.65s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SWV119+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n018.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Tue Aug 29 09:55:33 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.62 Running up to 7 provers in parallel. % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.00/1.26 Prover 1: Preprocessing ... % 4.00/1.26 Prover 4: Preprocessing ... % 4.00/1.31 Prover 5: Preprocessing ... % 4.00/1.31 Prover 0: Preprocessing ... % 4.00/1.31 Prover 3: Preprocessing ... % 4.00/1.31 Prover 2: Preprocessing ... % 4.00/1.31 Prover 6: Preprocessing ... % 9.50/2.06 Prover 5: Constructing countermodel ... % 10.30/2.10 Prover 5: proved (1460ms) % 10.30/2.10 % 10.30/2.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.30/2.10 % 10.30/2.11 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 10.30/2.13 Prover 3: Constructing countermodel ... % 10.30/2.13 Prover 3: stopped % 10.30/2.13 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 10.84/2.14 Prover 6: Constructing countermodel ... % 10.84/2.14 Prover 6: stopped % 10.84/2.15 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.07/2.17 Prover 1: Warning: ignoring some quantifiers % 11.76/2.26 Prover 1: Constructing countermodel ... % 11.76/2.29 Prover 7: Preprocessing ... % 11.76/2.29 Prover 8: Preprocessing ... % 11.76/2.32 Prover 4: Warning: ignoring some quantifiers % 11.76/2.32 Prover 10: Preprocessing ... % 12.28/2.34 Prover 2: Constructing countermodel ... % 12.28/2.34 Prover 2: stopped % 12.28/2.34 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 12.57/2.38 Prover 0: Constructing countermodel ... % 12.57/2.39 Prover 0: stopped % 12.57/2.40 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 12.57/2.41 Prover 1: Found proof (size 5) % 12.57/2.41 Prover 1: proved (1778ms) % 12.57/2.43 Prover 7: stopped % 13.11/2.44 Prover 4: Constructing countermodel ... % 13.11/2.45 Prover 11: Preprocessing ... % 13.11/2.45 Prover 10: stopped % 13.36/2.47 Prover 13: Preprocessing ... % 13.36/2.48 Prover 4: stopped % 13.80/2.57 Prover 11: stopped % 13.80/2.60 Prover 13: stopped % 14.15/2.62 Prover 8: Warning: ignoring some quantifiers % 14.15/2.64 Prover 8: Constructing countermodel ... % 14.15/2.66 Prover 8: stopped % 14.15/2.66 % 14.15/2.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 14.15/2.66 % 14.15/2.67 % SZS output start Proof for theBenchmark % 14.15/2.67 Assumptions after simplification: % 14.15/2.67 --------------------------------- % 14.15/2.67 % 14.15/2.67 (quaternion_ds1_symm_0012) % 14.65/2.70 $i(sigma) & $i(n6) & $i(pv49) & $i(n1) & $i(n0) & ? [v0: $i] : ? [v1: $i] : % 14.65/2.70 (minus(n6, n1) = v0 & a_select2(sigma, pv49) = v1 & lt(n0, v1) = 0 & leq(pv49, % 14.65/2.70 v0) = 0 & leq(n0, pv49) = 0 & $i(v1) & $i(v0) & ~ true) % 14.65/2.70 % 14.65/2.70 (ttrue) % 14.65/2.70 true % 14.65/2.70 % 14.65/2.70 Further assumptions not needed in the proof: % 14.65/2.70 -------------------------------------------- % 14.65/2.70 const_array1_select, const_array2_select, defuse, finite_domain_0, % 14.65/2.70 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 14.65/2.70 finite_domain_5, finite_domain_6, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, % 14.65/2.70 gt_2_0, gt_2_1, gt_2_tptp_minus_1, gt_3_0, gt_3_1, gt_3_2, gt_3_tptp_minus_1, % 14.65/2.70 gt_4_0, gt_4_1, gt_4_2, gt_4_3, gt_4_tptp_minus_1, gt_5_0, gt_5_1, gt_5_2, % 14.65/2.70 gt_5_3, gt_5_4, gt_5_tptp_minus_1, gt_6_0, gt_6_1, gt_6_2, gt_6_3, gt_6_4, % 14.65/2.70 gt_6_5, gt_6_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq, leq_gt1, leq_gt2, % 14.65/2.70 leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ, % 14.65/2.70 lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv, % 14.65/2.70 matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans, % 14.65/2.70 matrix_symm_update_diagonal, pred_minus_1, pred_succ, reflexivity_leq, % 14.65/2.70 sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2, % 14.65/2.70 sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r, % 14.65/2.70 succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l, % 14.65/2.70 succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, successor_2, % 14.65/2.70 successor_3, successor_4, successor_5, successor_6, sum_plus_base, % 14.65/2.70 sum_plus_base_float, totality, transitivity_gt, transitivity_leq, % 14.65/2.70 uniform_int_rand_ranges_hi, uniform_int_rand_ranges_lo % 14.65/2.70 % 14.65/2.70 Those formulas are unsatisfiable: % 14.65/2.70 --------------------------------- % 14.65/2.70 % 14.65/2.70 Begin of proof % 14.65/2.70 | % 14.65/2.70 | ALPHA: (quaternion_ds1_symm_0012) implies: % 14.65/2.70 | (1) ? [v0: $i] : ? [v1: $i] : (minus(n6, n1) = v0 & a_select2(sigma, % 14.65/2.70 | pv49) = v1 & lt(n0, v1) = 0 & leq(pv49, v0) = 0 & leq(n0, pv49) = 0 % 14.65/2.70 | & $i(v1) & $i(v0) & ~ true) % 14.65/2.70 | % 14.65/2.71 | DELTA: instantiating (1) with fresh symbols all_56_0, all_56_1 gives: % 14.65/2.71 | (2) minus(n6, n1) = all_56_1 & a_select2(sigma, pv49) = all_56_0 & lt(n0, % 14.65/2.71 | all_56_0) = 0 & leq(pv49, all_56_1) = 0 & leq(n0, pv49) = 0 & % 14.65/2.71 | $i(all_56_0) & $i(all_56_1) & ~ true % 14.65/2.71 | % 14.65/2.71 | ALPHA: (2) implies: % 14.65/2.71 | (3) ~ true % 14.65/2.71 | % 14.65/2.71 | PRED_UNIFY: (3), (ttrue) imply: % 14.65/2.71 | (4) $false % 14.65/2.71 | % 14.65/2.71 | CLOSE: (4) is inconsistent. % 14.65/2.71 | % 14.65/2.71 End of proof % 14.65/2.71 % SZS output end Proof for theBenchmark % 14.65/2.71 % 14.65/2.71 2097ms %------------------------------------------------------------------------------