%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV215+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 : n017.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:22 EDT 2023 % Result : Theorem 14.04s 2.71s % Output : Proof 17.73s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.05/0.10 % Problem : SWV215+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.05/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.31 % Computer : n017.cluster.edu % 0.09/0.31 % Model : x86_64 x86_64 % 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.31 % Memory : 8042.1875MB % 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.31 % CPULimit : 300 % 0.09/0.31 % WCLimit : 300 % 0.09/0.31 % DateTime : Tue Aug 29 08:18:13 EDT 2023 % 0.09/0.31 % CPUTime : % 0.16/0.59 ________ _____ % 0.16/0.59 ___ __ \_________(_)________________________________ % 0.16/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.16/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.16/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.16/0.59 % 0.16/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.16/0.59 (2023-06-19) % 0.16/0.59 % 0.16/0.59 (c) Philipp Rümmer, 2009-2023 % 0.16/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.16/0.59 Amanda Stjerna. % 0.16/0.59 Free software under BSD-3-Clause. % 0.16/0.59 % 0.16/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.16/0.59 % 0.16/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.16/0.61 Running up to 7 provers in parallel. % 0.16/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.16/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.16/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.16/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.16/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.16/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.16/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.15/1.56 Prover 4: Preprocessing ... % 5.15/1.56 Prover 1: Preprocessing ... % 5.97/1.62 Prover 6: Preprocessing ... % 5.97/1.62 Prover 5: Preprocessing ... % 5.97/1.62 Prover 2: Preprocessing ... % 5.97/1.62 Prover 3: Preprocessing ... % 6.03/1.63 Prover 0: Preprocessing ... % 12.47/2.65 Prover 3: Constructing countermodel ... % 12.47/2.65 Prover 5: Constructing countermodel ... % 13.89/2.70 Prover 5: proved (2071ms) % 13.89/2.70 Prover 3: proved (2075ms) % 14.04/2.71 % 14.04/2.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.04/2.71 % 14.04/2.71 % 14.04/2.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.04/2.71 % 14.04/2.71 Prover 6: Constructing countermodel ... % 14.04/2.71 Prover 6: stopped % 14.04/2.71 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 14.04/2.71 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.11/2.72 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 14.11/2.77 Prover 1: Warning: ignoring some quantifiers % 14.11/2.80 Prover 1: Constructing countermodel ... % 14.84/2.84 Prover 1: Found proof (size 1) % 14.84/2.84 Prover 1: proved (2213ms) % 14.84/2.85 Prover 4: Warning: ignoring some quantifiers % 15.41/2.92 Prover 4: Constructing countermodel ... % 15.41/2.92 Prover 4: stopped % 15.41/2.93 Prover 0: Constructing countermodel ... % 15.41/2.93 Prover 0: stopped % 15.41/2.95 Prover 2: Constructing countermodel ... % 15.41/2.95 Prover 2: stopped % 16.14/2.99 Prover 8: Preprocessing ... % 16.34/3.02 Prover 7: Preprocessing ... % 16.34/3.03 Prover 10: Preprocessing ... % 16.98/3.11 Prover 7: stopped % 16.98/3.11 Prover 10: stopped % 17.73/3.30 Prover 8: Warning: ignoring some quantifiers % 17.73/3.33 Prover 8: Constructing countermodel ... % 17.73/3.34 Prover 8: stopped % 17.73/3.34 % 17.73/3.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 17.73/3.34 % 17.73/3.34 % SZS output start Proof for theBenchmark % 17.73/3.35 Assumptions after simplification: % 17.73/3.35 --------------------------------- % 17.73/3.35 % 17.73/3.35 (quaternion_ds1_symm_0161) % 17.73/3.35 $false % 17.73/3.35 % 17.73/3.35 Further assumptions not needed in the proof: % 17.73/3.35 -------------------------------------------- % 17.73/3.36 const_array1_select, const_array2_select, defuse, finite_domain_0, % 17.73/3.36 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 17.73/3.36 finite_domain_5, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, gt_2_0, gt_2_1, % 17.73/3.36 gt_2_tptp_minus_1, gt_3_0, gt_3_1, gt_3_2, gt_3_tptp_minus_1, gt_400_0, % 17.73/3.36 gt_400_1, gt_400_2, gt_400_3, gt_400_4, gt_400_5, gt_400_tptp_minus_1, gt_4_0, % 17.73/3.36 gt_4_1, gt_4_2, gt_4_3, gt_4_tptp_minus_1, gt_5_0, gt_5_1, gt_5_2, gt_5_3, % 17.73/3.36 gt_5_4, gt_5_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq, leq_gt1, leq_gt2, % 17.73/3.36 leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ, % 17.73/3.36 lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv, % 17.73/3.36 matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans, % 17.73/3.36 matrix_symm_update_diagonal, pred_minus_1, pred_succ, reflexivity_leq, % 17.73/3.36 sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2, % 17.73/3.36 sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r, % 17.73/3.36 succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l, % 17.73/3.36 succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, successor_2, % 17.73/3.36 successor_3, successor_4, successor_5, sum_plus_base, sum_plus_base_float, % 17.73/3.36 totality, transitivity_gt, transitivity_leq, ttrue, uniform_int_rand_ranges_hi, % 17.73/3.36 uniform_int_rand_ranges_lo % 17.73/3.36 % 17.73/3.36 Those formulas are unsatisfiable: % 17.73/3.36 --------------------------------- % 17.73/3.36 % 17.73/3.36 Begin of proof % 17.73/3.36 | % 17.73/3.36 | CLOSE: (quaternion_ds1_symm_0161) is inconsistent. % 17.73/3.36 | % 17.73/3.36 End of proof % 17.73/3.36 % SZS output end Proof for theBenchmark % 17.73/3.36 % 17.73/3.36 2763ms %------------------------------------------------------------------------------