%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV222+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 : n013.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:24 EDT 2023 % Result : Theorem 11.41s 2.21s % Output : Proof 14.00s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV222+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.07/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n013.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Tue Aug 29 05:42:46 EDT 2023 % 0.13/0.33 % CPUTime : % 0.18/0.59 ________ _____ % 0.18/0.59 ___ __ \_________(_)________________________________ % 0.18/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.18/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.18/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.18/0.59 % 0.18/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.18/0.59 (2023-06-19) % 0.18/0.59 % 0.18/0.59 (c) Philipp Rümmer, 2009-2023 % 0.18/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.59 Amanda Stjerna. % 0.18/0.59 Free software under BSD-3-Clause. % 0.18/0.59 % 0.18/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.59 % 0.18/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.18/0.60 Running up to 7 provers in parallel. % 0.18/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.40/1.33 Prover 4: Preprocessing ... % 4.84/1.36 Prover 1: Preprocessing ... % 4.84/1.37 Prover 5: Preprocessing ... % 4.84/1.37 Prover 2: Preprocessing ... % 4.84/1.38 Prover 3: Preprocessing ... % 4.84/1.38 Prover 0: Preprocessing ... % 4.84/1.38 Prover 6: Preprocessing ... % 10.96/2.19 Prover 3: Constructing countermodel ... % 10.96/2.19 Prover 5: Constructing countermodel ... % 10.96/2.21 Prover 6: Constructing countermodel ... % 11.41/2.21 Prover 5: proved (1596ms) % 11.41/2.21 Prover 3: proved (1599ms) % 11.41/2.21 % 11.41/2.21 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.41/2.21 % 11.41/2.21 % 11.41/2.21 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.41/2.21 % 11.41/2.22 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.41/2.22 Prover 1: Warning: ignoring some quantifiers % 11.41/2.22 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.41/2.23 Prover 6: stopped % 11.41/2.25 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 11.41/2.25 Prover 1: Constructing countermodel ... % 11.74/2.26 Prover 1: Found proof (size 1) % 11.74/2.26 Prover 1: proved (1650ms) % 11.74/2.32 Prover 4: Warning: ignoring some quantifiers % 11.74/2.34 Prover 0: Constructing countermodel ... % 11.74/2.34 Prover 0: stopped % 12.41/2.37 Prover 2: Constructing countermodel ... % 12.41/2.37 Prover 2: stopped % 12.41/2.38 Prover 10: Preprocessing ... % 12.41/2.38 Prover 4: Constructing countermodel ... % 12.41/2.38 Prover 4: stopped % 12.41/2.38 Prover 7: Preprocessing ... % 12.74/2.41 Prover 8: Preprocessing ... % 13.12/2.45 Prover 10: stopped % 13.12/2.46 Prover 7: stopped % 13.78/2.60 Prover 8: Warning: ignoring some quantifiers % 14.00/2.62 Prover 8: Constructing countermodel ... % 14.00/2.62 Prover 8: stopped % 14.00/2.62 % 14.00/2.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.00/2.62 % 14.00/2.62 % SZS output start Proof for theBenchmark % 14.00/2.62 Assumptions after simplification: % 14.00/2.62 --------------------------------- % 14.00/2.62 % 14.00/2.62 (quaternion_ds1_symm_0441) % 14.00/2.63 $false % 14.00/2.63 % 14.00/2.63 Further assumptions not needed in the proof: % 14.00/2.63 -------------------------------------------- % 14.00/2.63 const_array1_select, const_array2_select, defuse, finite_domain_0, % 14.00/2.63 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 14.00/2.63 finite_domain_5, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, gt_2_0, gt_2_1, % 14.00/2.63 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, % 14.00/2.63 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, % 14.00/2.63 gt_5_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq, leq_gt1, leq_gt2, % 14.00/2.63 leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ, % 14.00/2.63 lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv, % 14.00/2.63 matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans, % 14.00/2.63 matrix_symm_update_diagonal, pred_minus_1, pred_succ, reflexivity_leq, % 14.00/2.63 sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2, % 14.00/2.63 sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r, % 14.00/2.63 succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l, % 14.00/2.63 succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, successor_2, % 14.00/2.63 successor_3, successor_4, successor_5, sum_plus_base, sum_plus_base_float, % 14.00/2.63 totality, transitivity_gt, transitivity_leq, ttrue, uniform_int_rand_ranges_hi, % 14.00/2.63 uniform_int_rand_ranges_lo % 14.00/2.63 % 14.00/2.63 Those formulas are unsatisfiable: % 14.00/2.63 --------------------------------- % 14.00/2.63 % 14.00/2.63 Begin of proof % 14.00/2.63 | % 14.00/2.63 | CLOSE: (quaternion_ds1_symm_0441) is inconsistent. % 14.00/2.63 | % 14.00/2.63 End of proof % 14.00/2.63 % SZS output end Proof for theBenchmark % 14.00/2.63 % 14.00/2.63 2039ms %------------------------------------------------------------------------------