%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV386+1 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n019.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:56:07 EDT 2023 % Result : Theorem 10.24s 2.20s % Output : Proof 12.07s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWV386+1 : TPTP v8.1.2. Released v3.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n019.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Tue Aug 29 08:13:13 EDT 2023 % 0.12/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.00/1.21 Prover 4: Preprocessing ... % 3.00/1.21 Prover 1: Preprocessing ... % 3.61/1.24 Prover 6: Preprocessing ... % 3.61/1.24 Prover 2: Preprocessing ... % 3.61/1.24 Prover 5: Preprocessing ... % 3.61/1.24 Prover 0: Preprocessing ... % 3.61/1.24 Prover 3: Preprocessing ... % 7.90/1.87 Prover 1: Warning: ignoring some quantifiers % 8.53/1.93 Prover 3: Warning: ignoring some quantifiers % 8.53/1.97 Prover 6: Proving ... % 8.53/1.98 Prover 3: Constructing countermodel ... % 8.92/1.98 Prover 5: Proving ... % 8.92/1.98 Prover 1: Constructing countermodel ... % 8.92/2.00 Prover 4: Constructing countermodel ... % 8.92/2.03 Prover 0: Proving ... % 8.92/2.08 Prover 2: Proving ... % 10.24/2.19 Prover 3: proved (1549ms) % 10.24/2.20 % 10.24/2.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.24/2.20 % 10.24/2.20 Prover 0: proved (1574ms) % 10.24/2.20 % 10.24/2.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.24/2.20 % 10.24/2.20 Prover 2: proved (1574ms) % 10.24/2.20 % 10.24/2.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.24/2.20 % 10.24/2.20 Prover 6: stopped % 10.24/2.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 10.24/2.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 10.24/2.20 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 10.24/2.20 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 10.24/2.20 Prover 5: stopped % 10.24/2.20 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.60/2.23 Prover 4: Found proof (size 14) % 10.60/2.23 Prover 4: proved (1604ms) % 10.60/2.24 Prover 1: Found proof (size 16) % 10.60/2.24 Prover 1: proved (1612ms) % 10.71/2.26 Prover 8: Preprocessing ... % 10.71/2.27 Prover 11: Preprocessing ... % 10.71/2.27 Prover 7: Preprocessing ... % 10.71/2.27 Prover 10: Preprocessing ... % 10.71/2.27 Prover 13: Preprocessing ... % 10.71/2.31 Prover 7: stopped % 11.22/2.32 Prover 11: stopped % 11.22/2.32 Prover 10: stopped % 11.22/2.33 Prover 13: stopped % 11.49/2.39 Prover 8: Warning: ignoring some quantifiers % 11.49/2.40 Prover 8: Constructing countermodel ... % 11.49/2.41 Prover 8: stopped % 11.49/2.42 % 11.49/2.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.49/2.42 % 11.49/2.42 % SZS output start Proof for theBenchmark % 11.49/2.43 Assumptions after simplification: % 11.49/2.43 --------------------------------- % 11.49/2.43 % 11.49/2.43 (l22_co) % 11.91/2.46 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ? [v5: % 11.91/2.46 $i] : ? [v6: $i] : ( ~ (v4 = 0) & ok(v6) = 0 & triple(v0, v1, v2) = v3 & % 11.91/2.46 check_cpq(v6) = 0 & check_cpq(v3) = v4 & insert_cpq(v3, v5) = v6 & $i(v6) & % 11.91/2.46 $i(v5) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 11.91/2.46 % 11.91/2.46 (l22_l26) % 11.91/2.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 11.91/2.46 $i] : ( ~ (triple(v0, v1, v2) = v3) | ~ (insert_cpq(v3, v4) = v5) | ~ % 11.91/2.46 $i(v4) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v6: int] : ((v6 = 0 & % 11.91/2.47 check_cpq(v3) = 0) | ( ~ (v6 = 0) & check_cpq(v5) = v6))) % 11.91/2.47 % 11.91/2.47 (function-axioms) % 11.91/2.48 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 % 11.91/2.48 | ~ (triple(v4, v3, v2) = v1) | ~ (triple(v4, v3, v2) = v0)) & ! [v0: % 11.91/2.48 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 11.91/2.48 : ! [v4: $i] : (v1 = v0 | ~ (pair_in_list(v4, v3, v2) = v1) | ~ % 11.91/2.48 (pair_in_list(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 11.91/2.48 ! [v3: $i] : (v1 = v0 | ~ (remove_pqp(v3, v2) = v1) | ~ (remove_pqp(v3, v2) % 11.91/2.48 = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 % 11.91/2.48 | ~ (insert_pqp(v3, v2) = v1) | ~ (insert_pqp(v3, v2) = v0)) & ! [v0: % 11.91/2.48 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 11.91/2.48 : (v1 = v0 | ~ (contains_cpq(v3, v2) = v1) | ~ (contains_cpq(v3, v2) = v0)) % 11.91/2.48 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.91/2.48 (remove_cpq(v3, v2) = v1) | ~ (remove_cpq(v3, v2) = v0)) & ! [v0: $i] : ! % 11.91/2.48 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_cpq(v3, v2) = v1) % 11.91/2.48 | ~ (insert_cpq(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.91/2.48 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (succ_cpq(v3, % 11.91/2.48 v2) = v1) | ~ (succ_cpq(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 11.91/2.48 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (update_slb(v3, v2) = v1) | ~ % 11.91/2.48 (update_slb(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 11.91/2.48 [v3: $i] : (v1 = v0 | ~ (lookup_slb(v3, v2) = v1) | ~ (lookup_slb(v3, v2) = % 11.91/2.48 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 11.91/2.48 ~ (remove_slb(v3, v2) = v1) | ~ (remove_slb(v3, v2) = v0)) & ! [v0: % 11.91/2.48 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 11.91/2.48 : (v1 = v0 | ~ (contains_slb(v3, v2) = v1) | ~ (contains_slb(v3, v2) = v0)) % 11.91/2.48 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.91/2.48 (pair(v3, v2) = v1) | ~ (pair(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : % 11.91/2.48 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (insert_slb(v3, v2) = v1) | ~ % 11.91/2.48 (insert_slb(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.91/2.48 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.91/2.48 (strictly_less_than(v3, v2) = v1) | ~ (strictly_less_than(v3, v2) = v0)) & % 11.91/2.48 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 11.91/2.48 $i] : (v1 = v0 | ~ (less_than(v3, v2) = v1) | ~ (less_than(v3, v2) = v0)) % 11.91/2.48 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 11.91/2.48 (removemin_cpq_res(v2) = v1) | ~ (removemin_cpq_res(v2) = v0)) & ! [v0: % 11.91/2.48 $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_res(v2) = v1) | % 11.91/2.48 ~ (findmin_cpq_res(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 11.91/2.48 (v1 = v0 | ~ (findmin_pqp_res(v2) = v1) | ~ (findmin_pqp_res(v2) = v0)) & ! % 11.91/2.48 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 % 11.91/2.48 | ~ (ok(v2) = v1) | ~ (ok(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 11.91/2.48 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (check_cpq(v2) = v1) | % 11.91/2.48 ~ (check_cpq(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 11.91/2.48 | ~ (removemin_cpq_eff(v2) = v1) | ~ (removemin_cpq_eff(v2) = v0)) & ! % 11.91/2.48 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (findmin_cpq_eff(v2) = % 11.91/2.48 v1) | ~ (findmin_cpq_eff(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 11.91/2.48 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (isnonempty_slb(v2) = % 11.91/2.48 v1) | ~ (isnonempty_slb(v2) = v0)) % 11.91/2.48 % 11.91/2.48 Further assumptions not needed in the proof: % 11.91/2.48 -------------------------------------------- % 11.91/2.48 ax18, ax19, ax20, ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30, % 11.91/2.48 ax31, ax32, ax33, ax34, ax35, ax36, ax37, ax38, ax39, ax40, ax41, ax42, ax43, % 11.91/2.48 ax44, ax45, ax46, ax47, ax48, ax49, ax50, ax51, ax52, ax53, bottom_smallest, % 11.91/2.48 reflexivity, stricly_smaller_definition, totality, transitivity % 11.91/2.48 % 11.91/2.48 Those formulas are unsatisfiable: % 11.91/2.48 --------------------------------- % 11.91/2.48 % 11.91/2.48 Begin of proof % 11.91/2.48 | % 12.07/2.48 | ALPHA: (function-axioms) implies: % 12.07/2.48 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 12.07/2.48 | (v1 = v0 | ~ (check_cpq(v2) = v1) | ~ (check_cpq(v2) = v0)) % 12.07/2.48 | % 12.07/2.48 | DELTA: instantiating (l22_co) with fresh symbols all_47_0, all_47_1, all_47_2, % 12.07/2.48 | all_47_3, all_47_4, all_47_5, all_47_6 gives: % 12.07/2.48 | (2) ~ (all_47_2 = 0) & ok(all_47_0) = 0 & triple(all_47_6, all_47_5, % 12.07/2.48 | all_47_4) = all_47_3 & check_cpq(all_47_0) = 0 & check_cpq(all_47_3) % 12.07/2.48 | = all_47_2 & insert_cpq(all_47_3, all_47_1) = all_47_0 & $i(all_47_0) & % 12.07/2.48 | $i(all_47_1) & $i(all_47_3) & $i(all_47_4) & $i(all_47_5) & % 12.07/2.48 | $i(all_47_6) % 12.07/2.48 | % 12.07/2.48 | ALPHA: (2) implies: % 12.07/2.48 | (3) ~ (all_47_2 = 0) % 12.07/2.48 | (4) $i(all_47_6) % 12.07/2.48 | (5) $i(all_47_5) % 12.07/2.48 | (6) $i(all_47_4) % 12.07/2.48 | (7) $i(all_47_1) % 12.07/2.49 | (8) insert_cpq(all_47_3, all_47_1) = all_47_0 % 12.07/2.49 | (9) check_cpq(all_47_3) = all_47_2 % 12.07/2.49 | (10) check_cpq(all_47_0) = 0 % 12.07/2.49 | (11) triple(all_47_6, all_47_5, all_47_4) = all_47_3 % 12.07/2.49 | % 12.07/2.49 | GROUND_INST: instantiating (l22_l26) with all_47_6, all_47_5, all_47_4, % 12.07/2.49 | all_47_3, all_47_1, all_47_0, simplifying with (4), (5), (6), % 12.07/2.49 | (7), (8), (11) gives: % 12.07/2.49 | (12) ? [v0: int] : ((v0 = 0 & check_cpq(all_47_3) = 0) | ( ~ (v0 = 0) & % 12.07/2.49 | check_cpq(all_47_0) = v0)) % 12.07/2.49 | % 12.07/2.49 | DELTA: instantiating (12) with fresh symbol all_54_0 gives: % 12.07/2.49 | (13) (all_54_0 = 0 & check_cpq(all_47_3) = 0) | ( ~ (all_54_0 = 0) & % 12.07/2.49 | check_cpq(all_47_0) = all_54_0) % 12.07/2.49 | % 12.07/2.49 | BETA: splitting (13) gives: % 12.07/2.49 | % 12.07/2.49 | Case 1: % 12.07/2.49 | | % 12.07/2.49 | | (14) all_54_0 = 0 & check_cpq(all_47_3) = 0 % 12.07/2.49 | | % 12.07/2.49 | | ALPHA: (14) implies: % 12.07/2.49 | | (15) check_cpq(all_47_3) = 0 % 12.07/2.49 | | % 12.07/2.49 | | GROUND_INST: instantiating (1) with all_47_2, 0, all_47_3, simplifying with % 12.07/2.49 | | (9), (15) gives: % 12.07/2.49 | | (16) all_47_2 = 0 % 12.07/2.49 | | % 12.07/2.49 | | REDUCE: (3), (16) imply: % 12.07/2.49 | | (17) $false % 12.07/2.49 | | % 12.07/2.49 | | CLOSE: (17) is inconsistent. % 12.07/2.49 | | % 12.07/2.49 | Case 2: % 12.07/2.49 | | % 12.07/2.49 | | (18) ~ (all_54_0 = 0) & check_cpq(all_47_0) = all_54_0 % 12.07/2.49 | | % 12.07/2.49 | | ALPHA: (18) implies: % 12.07/2.49 | | (19) ~ (all_54_0 = 0) % 12.07/2.49 | | (20) check_cpq(all_47_0) = all_54_0 % 12.07/2.49 | | % 12.07/2.49 | | GROUND_INST: instantiating (1) with 0, all_54_0, all_47_0, simplifying with % 12.07/2.49 | | (10), (20) gives: % 12.07/2.49 | | (21) all_54_0 = 0 % 12.07/2.49 | | % 12.07/2.49 | | REDUCE: (19), (21) imply: % 12.07/2.49 | | (22) $false % 12.07/2.49 | | % 12.07/2.49 | | CLOSE: (22) is inconsistent. % 12.07/2.49 | | % 12.07/2.49 | End of split % 12.07/2.49 | % 12.07/2.49 End of proof % 12.07/2.49 % SZS output end Proof for theBenchmark % 12.07/2.49 % 12.07/2.49 1887ms %------------------------------------------------------------------------------