%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV063+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 : n008.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:45 EDT 2023 % Result : Theorem 11.64s 2.45s % Output : Proof 15.09s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.15 % Problem : SWV063+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.00/0.16 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.38 % Computer : n008.cluster.edu % 0.15/0.38 % Model : x86_64 x86_64 % 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.38 % Memory : 8042.1875MB % 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.38 % CPULimit : 300 % 0.15/0.38 % WCLimit : 300 % 0.15/0.38 % DateTime : Tue Aug 29 08:33:02 EDT 2023 % 0.15/0.38 % CPUTime : % 0.24/0.67 ________ _____ % 0.24/0.67 ___ __ \_________(_)________________________________ % 0.24/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.24/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.24/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.24/0.67 % 0.24/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.24/0.67 (2023-06-19) % 0.24/0.67 % 0.24/0.67 (c) Philipp Rümmer, 2009-2023 % 0.24/0.67 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.24/0.67 Amanda Stjerna. % 0.24/0.67 Free software under BSD-3-Clause. % 0.24/0.67 % 0.24/0.67 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.24/0.67 % 0.24/0.67 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.24/0.68 Running up to 7 provers in parallel. % 0.24/0.70 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.24/0.70 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.24/0.70 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.24/0.70 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.24/0.70 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.24/0.70 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.24/0.70 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.81/1.45 Prover 4: Preprocessing ... % 3.81/1.51 Prover 1: Preprocessing ... % 4.94/1.56 Prover 6: Preprocessing ... % 4.94/1.56 Prover 5: Preprocessing ... % 4.94/1.56 Prover 3: Preprocessing ... % 4.94/1.56 Prover 2: Preprocessing ... % 4.94/1.57 Prover 0: Preprocessing ... % 11.00/2.41 Prover 6: Constructing countermodel ... % 11.00/2.41 Prover 3: Constructing countermodel ... % 11.44/2.45 Prover 6: proved (1748ms) % 11.44/2.45 Prover 3: proved (1749ms) % 11.44/2.45 % 11.64/2.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.64/2.45 % 11.64/2.46 % 11.64/2.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.64/2.46 % 11.64/2.47 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 11.64/2.47 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 11.64/2.49 Prover 1: Warning: ignoring some quantifiers % 12.16/2.56 Prover 1: Constructing countermodel ... % 12.16/2.57 Prover 1: Found proof (size 1) % 12.16/2.57 Prover 1: proved (1876ms) % 12.94/2.66 Prover 7: Preprocessing ... % 12.94/2.66 Prover 8: Preprocessing ... % 13.57/2.73 Prover 0: Constructing countermodel ... % 13.57/2.73 Prover 0: stopped % 13.79/2.76 Prover 2: Constructing countermodel ... % 13.79/2.77 Prover 2: stopped % 13.79/2.77 Prover 7: stopped % 13.79/2.78 Prover 4: Warning: ignoring some quantifiers % 13.79/2.83 Prover 4: Constructing countermodel ... % 13.79/2.83 Prover 4: stopped % 13.79/2.91 Prover 5: Proving ... % 13.79/2.91 Prover 5: stopped % 14.70/2.97 Prover 8: Warning: ignoring some quantifiers % 15.09/2.99 Prover 8: Constructing countermodel ... % 15.09/2.99 Prover 8: stopped % 15.09/2.99 % 15.09/2.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 15.09/2.99 % 15.09/2.99 % SZS output start Proof for theBenchmark % 15.09/3.00 Assumptions after simplification: % 15.09/3.00 --------------------------------- % 15.09/3.00 % 15.09/3.00 (cl5_nebula_array_0004) % 15.09/3.01 $false % 15.09/3.01 % 15.09/3.01 Further assumptions not needed in the proof: % 15.09/3.01 -------------------------------------------- % 15.09/3.01 const_array1_select, const_array2_select, defuse, finite_domain_0, % 15.09/3.01 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 15.09/3.01 finite_domain_5, gt_0_tptp_minus_1, gt_135300_0, gt_135300_1, gt_135300_2, % 15.09/3.01 gt_135300_3, gt_135300_4, gt_135300_5, gt_135300_tptp_minus_1, gt_1_0, % 15.09/3.01 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, % 15.09/3.01 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, % 15.09/3.01 gt_5_1, gt_5_2, gt_5_3, gt_5_4, gt_5_tptp_minus_1, gt_succ, irreflexivity_gt, % 15.09/3.01 leq_geq, leq_gt1, leq_gt2, leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, % 15.09/3.01 leq_succ_gt_equiv, leq_succ_succ, lt_gt, matrix_symm_aba1, matrix_symm_aba2, % 15.09/3.01 matrix_symm_add, matrix_symm_inv, matrix_symm_joseph_update, matrix_symm_sub, % 15.09/3.01 matrix_symm_trans, matrix_symm_update_diagonal, pred_minus_1, pred_succ, % 15.09/3.01 reflexivity_leq, sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, % 15.09/3.01 sel3_update_2, sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, % 15.09/3.01 succ_plus_2_r, succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, % 15.09/3.01 succ_plus_5_l, succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, % 15.09/3.01 successor_2, successor_3, successor_4, successor_5, sum_plus_base, % 15.09/3.01 sum_plus_base_float, totality, transitivity_gt, transitivity_leq, ttrue, % 15.09/3.01 uniform_int_rand_ranges_hi, uniform_int_rand_ranges_lo % 15.09/3.01 % 15.09/3.01 Those formulas are unsatisfiable: % 15.09/3.01 --------------------------------- % 15.09/3.01 % 15.09/3.01 Begin of proof % 15.09/3.01 | % 15.09/3.01 | CLOSE: (cl5_nebula_array_0004) is inconsistent. % 15.09/3.01 | % 15.09/3.01 End of proof % 15.09/3.01 % SZS output end Proof for theBenchmark % 15.09/3.01 % 15.09/3.01 2343ms %------------------------------------------------------------------------------