%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV060+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 : n031.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 8.85s 2.04s % Output : Proof 13.11s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SWV060+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.35 % Computer : n031.cluster.edu % 0.12/0.35 % Model : x86_64 x86_64 % 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.35 % Memory : 8042.1875MB % 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.35 % CPULimit : 300 % 0.12/0.35 % WCLimit : 300 % 0.12/0.35 % DateTime : Tue Aug 29 10:48:11 EDT 2023 % 0.12/0.35 % CPUTime : % 0.20/0.59 ________ _____ % 0.20/0.59 ___ __ \_________(_)________________________________ % 0.20/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.59 % 0.20/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.59 (2023-06-19) % 0.20/0.59 % 0.20/0.59 (c) Philipp Rümmer, 2009-2023 % 0.20/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.59 Amanda Stjerna. % 0.20/0.59 Free software under BSD-3-Clause. % 0.20/0.59 % 0.20/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.59 % 0.20/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.24/1.35 Prover 4: Preprocessing ... % 4.24/1.35 Prover 1: Preprocessing ... % 4.24/1.39 Prover 2: Preprocessing ... % 4.24/1.39 Prover 3: Preprocessing ... % 4.24/1.39 Prover 0: Preprocessing ... % 4.24/1.39 Prover 5: Preprocessing ... % 4.24/1.39 Prover 6: Preprocessing ... % 8.85/2.01 Prover 3: Constructing countermodel ... % 8.85/2.02 Prover 6: Constructing countermodel ... % 8.85/2.04 Prover 6: proved (1420ms) % 8.85/2.04 Prover 3: proved (1422ms) % 8.85/2.04 % 8.85/2.04 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.85/2.04 % 8.85/2.04 % 8.85/2.04 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.85/2.04 % 8.85/2.07 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.85/2.07 Prover 5: Constructing countermodel ... % 8.85/2.07 Prover 5: stopped % 9.61/2.08 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.61/2.08 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.61/2.11 Prover 0: Constructing countermodel ... % 9.61/2.11 Prover 0: stopped % 9.61/2.13 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 10.37/2.16 Prover 2: Constructing countermodel ... % 10.37/2.16 Prover 2: stopped % 10.37/2.17 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.37/2.19 Prover 7: Preprocessing ... % 10.37/2.23 Prover 1: Warning: ignoring some quantifiers % 11.14/2.28 Prover 10: Preprocessing ... % 11.56/2.30 Prover 8: Preprocessing ... % 11.56/2.31 Prover 13: Preprocessing ... % 11.56/2.32 Prover 1: Constructing countermodel ... % 11.56/2.32 Prover 1: Found proof (size 1) % 11.56/2.32 Prover 1: proved (1709ms) % 11.56/2.32 Prover 4: Warning: ignoring some quantifiers % 11.56/2.32 Prover 7: stopped % 11.56/2.34 Prover 11: Preprocessing ... % 11.99/2.36 Prover 4: Constructing countermodel ... % 11.99/2.36 Prover 4: stopped % 11.99/2.39 Prover 10: stopped % 11.99/2.41 Prover 13: stopped % 12.67/2.45 Prover 11: stopped % 12.89/2.52 Prover 8: Warning: ignoring some quantifiers % 12.89/2.54 Prover 8: Constructing countermodel ... % 12.89/2.54 Prover 8: stopped % 12.89/2.54 % 12.89/2.54 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.89/2.54 % 13.11/2.54 % SZS output start Proof for theBenchmark % 13.11/2.55 Assumptions after simplification: % 13.11/2.55 --------------------------------- % 13.11/2.55 % 13.11/2.55 (cl5_nebula_array_0001) % 13.11/2.55 $false % 13.11/2.55 % 13.11/2.55 Further assumptions not needed in the proof: % 13.11/2.55 -------------------------------------------- % 13.11/2.55 const_array1_select, const_array2_select, defuse, finite_domain_0, % 13.11/2.55 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 13.11/2.55 finite_domain_5, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, gt_2_0, gt_2_1, % 13.11/2.55 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, % 13.11/2.55 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, % 13.11/2.55 gt_5_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq, leq_gt1, leq_gt2, % 13.11/2.55 leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ, % 13.11/2.55 lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv, % 13.11/2.55 matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans, % 13.11/2.55 matrix_symm_update_diagonal, pred_minus_1, pred_succ, reflexivity_leq, % 13.11/2.55 sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2, % 13.11/2.55 sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r, % 13.11/2.55 succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l, % 13.11/2.55 succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, successor_2, % 13.11/2.55 successor_3, successor_4, successor_5, sum_plus_base, sum_plus_base_float, % 13.11/2.55 totality, transitivity_gt, transitivity_leq, ttrue, uniform_int_rand_ranges_hi, % 13.11/2.55 uniform_int_rand_ranges_lo % 13.11/2.55 % 13.11/2.55 Those formulas are unsatisfiable: % 13.11/2.55 --------------------------------- % 13.11/2.55 % 13.11/2.55 Begin of proof % 13.11/2.56 | % 13.11/2.56 | CLOSE: (cl5_nebula_array_0001) is inconsistent. % 13.11/2.56 | % 13.11/2.56 End of proof % 13.11/2.56 % SZS output end Proof for theBenchmark % 13.11/2.56 % 13.11/2.56 1961ms %------------------------------------------------------------------------------