%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV107+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 : n022.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:56 EDT 2023 % Result : Theorem 12.79s 2.48s % Output : Proof 16.63s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SWV107+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n022.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Tue Aug 29 04:39:08 EDT 2023 % 0.13/0.35 % CPUTime : % 0.45/0.62 ________ _____ % 0.45/0.62 ___ __ \_________(_)________________________________ % 0.45/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.45/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.45/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.45/0.62 % 0.45/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.45/0.62 (2023-06-19) % 0.45/0.62 % 0.45/0.62 (c) Philipp Rümmer, 2009-2023 % 0.45/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.45/0.62 Amanda Stjerna. % 0.45/0.62 Free software under BSD-3-Clause. % 0.45/0.62 % 0.45/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.45/0.62 % 0.45/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.45/0.63 Running up to 7 provers in parallel. % 0.45/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.45/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.45/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.45/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.45/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.45/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.45/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.61/1.48 Prover 1: Preprocessing ... % 5.68/1.50 Prover 4: Preprocessing ... % 5.81/1.53 Prover 0: Preprocessing ... % 5.81/1.53 Prover 6: Preprocessing ... % 5.81/1.53 Prover 3: Preprocessing ... % 5.81/1.53 Prover 5: Preprocessing ... % 5.81/1.53 Prover 2: Preprocessing ... % 12.32/2.44 Prover 5: Constructing countermodel ... % 12.79/2.48 Prover 5: proved (1835ms) % 12.79/2.48 % 12.79/2.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.79/2.48 % 12.79/2.48 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 12.79/2.54 Prover 3: Constructing countermodel ... % 12.79/2.54 Prover 3: stopped % 12.79/2.54 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 13.50/2.56 Prover 6: Constructing countermodel ... % 13.50/2.56 Prover 6: stopped % 13.50/2.56 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.20/2.65 Prover 7: Preprocessing ... % 14.20/2.66 Prover 1: Warning: ignoring some quantifiers % 14.66/2.70 Prover 0: Constructing countermodel ... % 14.66/2.70 Prover 10: Preprocessing ... % 14.66/2.71 Prover 0: stopped % 14.66/2.71 Prover 4: Warning: ignoring some quantifiers % 14.66/2.71 Prover 8: Preprocessing ... % 14.66/2.72 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 15.06/2.76 Prover 1: Constructing countermodel ... % 15.06/2.77 Prover 2: Constructing countermodel ... % 15.06/2.77 Prover 2: stopped % 15.06/2.79 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 15.06/2.81 Prover 4: Constructing countermodel ... % 15.06/2.84 Prover 11: Preprocessing ... % 15.79/2.87 Prover 13: Preprocessing ... % 16.11/2.90 Prover 1: Found proof (size 5) % 16.11/2.90 Prover 1: proved (2269ms) % 16.11/2.91 Prover 4: stopped % 16.11/2.91 Prover 10: Warning: ignoring some quantifiers % 16.11/2.93 Prover 7: Warning: ignoring some quantifiers % 16.48/2.94 Prover 10: Constructing countermodel ... % 16.48/2.95 Prover 11: stopped % 16.48/2.96 Prover 8: Warning: ignoring some quantifiers % 16.48/2.97 Prover 10: stopped % 16.48/2.97 Prover 7: Constructing countermodel ... % 16.48/2.97 Prover 13: stopped % 16.48/2.99 Prover 8: Constructing countermodel ... % 16.48/2.99 Prover 7: stopped % 16.63/3.01 Prover 8: stopped % 16.63/3.01 % 16.63/3.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 16.63/3.01 % 16.63/3.01 % SZS output start Proof for theBenchmark % 16.63/3.02 Assumptions after simplification: % 16.63/3.02 --------------------------------- % 16.63/3.02 % 16.63/3.02 (quaternion_ds1_inuse_0019) % 16.63/3.04 $i(n999) & $i(n6) & $i(n3) & $i(n2) & $i(n1) & $i(n0) & ? [v0: $i] : ? [v1: % 16.63/3.04 $i] : ? [v2: $i] : (minus(n999, n1) = v2 & minus(n6, n1) = v1 & minus(n3, % 16.63/3.04 n1) = v0 & geq(v2, n0) = 0 & geq(v1, n0) = 0 & geq(v0, n0) = 0 & geq(n2, % 16.63/3.04 n0) = 0 & $i(v2) & $i(v1) & $i(v0) & ~ true) % 16.63/3.04 % 16.63/3.04 (ttrue) % 16.63/3.04 true % 16.63/3.04 % 16.63/3.04 Further assumptions not needed in the proof: % 16.63/3.04 -------------------------------------------- % 16.63/3.04 const_array1_select, const_array2_select, defuse, finite_domain_0, % 16.63/3.04 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 16.63/3.04 finite_domain_5, finite_domain_6, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, % 16.63/3.04 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, % 16.63/3.04 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, % 16.63/3.04 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, % 16.63/3.04 gt_6_5, gt_6_tptp_minus_1, gt_999_0, gt_999_1, gt_999_2, gt_999_3, gt_999_4, % 16.63/3.04 gt_999_5, gt_999_6, gt_999_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq, % 16.63/3.04 leq_gt1, leq_gt2, leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, % 16.63/3.04 leq_succ_gt_equiv, leq_succ_succ, lt_gt, matrix_symm_aba1, matrix_symm_aba2, % 16.63/3.04 matrix_symm_add, matrix_symm_inv, matrix_symm_joseph_update, matrix_symm_sub, % 16.63/3.04 matrix_symm_trans, matrix_symm_update_diagonal, pred_minus_1, pred_succ, % 16.63/3.04 reflexivity_leq, sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, % 16.63/3.04 sel3_update_2, sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, % 16.63/3.04 succ_plus_2_r, succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, % 16.63/3.04 succ_plus_5_l, succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, % 16.63/3.05 successor_2, successor_3, successor_4, successor_5, successor_6, sum_plus_base, % 16.63/3.05 sum_plus_base_float, totality, transitivity_gt, transitivity_leq, % 16.63/3.05 uniform_int_rand_ranges_hi, uniform_int_rand_ranges_lo % 16.63/3.05 % 16.63/3.05 Those formulas are unsatisfiable: % 16.63/3.05 --------------------------------- % 16.63/3.05 % 16.63/3.05 Begin of proof % 16.63/3.05 | % 16.63/3.05 | ALPHA: (quaternion_ds1_inuse_0019) implies: % 16.63/3.05 | (1) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (minus(n999, n1) = v2 & % 16.63/3.05 | minus(n6, n1) = v1 & minus(n3, n1) = v0 & geq(v2, n0) = 0 & geq(v1, % 16.63/3.05 | n0) = 0 & geq(v0, n0) = 0 & geq(n2, n0) = 0 & $i(v2) & $i(v1) & % 16.63/3.05 | $i(v0) & ~ true) % 16.63/3.05 | % 16.63/3.05 | DELTA: instantiating (1) with fresh symbols all_60_0, all_60_1, all_60_2 % 16.63/3.05 | gives: % 16.63/3.05 | (2) minus(n999, n1) = all_60_0 & minus(n6, n1) = all_60_1 & minus(n3, n1) = % 16.63/3.05 | all_60_2 & geq(all_60_0, n0) = 0 & geq(all_60_1, n0) = 0 & % 16.63/3.05 | geq(all_60_2, n0) = 0 & geq(n2, n0) = 0 & $i(all_60_0) & $i(all_60_1) & % 16.63/3.05 | $i(all_60_2) & ~ true % 16.63/3.05 | % 16.63/3.05 | ALPHA: (2) implies: % 16.63/3.05 | (3) ~ true % 16.63/3.05 | % 16.63/3.05 | PRED_UNIFY: (3), (ttrue) imply: % 16.63/3.05 | (4) $false % 16.63/3.05 | % 16.63/3.05 | CLOSE: (4) is inconsistent. % 16.63/3.05 | % 16.63/3.05 End of proof % 16.63/3.05 % SZS output end Proof for theBenchmark % 16.63/3.05 % 16.63/3.05 2437ms %------------------------------------------------------------------------------