%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV402+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 : n014.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:11 EDT 2023 % Result : Theorem 5.34s 1.55s % Output : Proof 7.73s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SWV402+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.14/0.35 % Computer : n014.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Tue Aug 29 09:39:45 EDT 2023 % 0.14/0.35 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.67/1.06 Prover 4: Preprocessing ... % 2.67/1.06 Prover 1: Preprocessing ... % 2.67/1.09 Prover 2: Preprocessing ... % 2.67/1.09 Prover 3: Preprocessing ... % 2.67/1.09 Prover 6: Preprocessing ... % 2.67/1.09 Prover 5: Preprocessing ... % 2.67/1.10 Prover 0: Preprocessing ... % 5.34/1.43 Prover 6: Constructing countermodel ... % 5.34/1.45 Prover 1: Constructing countermodel ... % 5.34/1.45 Prover 3: Constructing countermodel ... % 5.34/1.48 Prover 5: Proving ... % 5.34/1.51 Prover 2: Proving ... % 5.34/1.53 Prover 4: Constructing countermodel ... % 5.34/1.55 Prover 0: Proving ... % 5.34/1.55 Prover 3: proved (915ms) % 5.34/1.55 % 5.34/1.55 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.34/1.55 % 5.34/1.56 Prover 6: proved (912ms) % 5.34/1.56 % 5.34/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.34/1.56 % 5.34/1.56 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.34/1.56 Prover 0: stopped % 5.34/1.56 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.34/1.57 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.34/1.57 Prover 2: proved (932ms) % 5.34/1.57 % 5.34/1.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.34/1.57 % 5.34/1.58 Prover 5: proved (929ms) % 5.34/1.58 % 5.34/1.59 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.34/1.59 % 6.66/1.59 Prover 1: Found proof (size 6) % 6.66/1.59 Prover 1: proved (938ms) % 6.66/1.59 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.66/1.59 Prover 7: Preprocessing ... % 6.66/1.59 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.66/1.61 Prover 4: stopped % 6.66/1.61 Prover 10: Preprocessing ... % 6.66/1.61 Prover 8: Preprocessing ... % 6.66/1.62 Prover 7: stopped % 6.87/1.62 Prover 11: Preprocessing ... % 6.93/1.63 Prover 13: Preprocessing ... % 6.93/1.64 Prover 10: stopped % 6.93/1.65 Prover 11: stopped % 6.93/1.66 Prover 13: stopped % 6.93/1.70 Prover 8: Warning: ignoring some quantifiers % 7.40/1.71 Prover 8: Constructing countermodel ... % 7.40/1.72 Prover 8: stopped % 7.40/1.72 % 7.40/1.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.40/1.72 % 7.40/1.72 % SZS output start Proof for theBenchmark % 7.40/1.72 Assumptions after simplification: % 7.40/1.72 --------------------------------- % 7.40/1.73 % 7.40/1.73 (ax22) % 7.40/1.76 $i(create_slb) & ! [v0: $i] : ! [v1: $i] : ( ~ (pair_in_list(create_slb, v0, % 7.40/1.76 v1) = 0) | ~ $i(v1) | ~ $i(v0)) % 7.40/1.76 % 7.40/1.76 (l38_co) % 7.40/1.77 $i(create_slb) & ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? % 7.40/1.77 [v4: $i] : ? [v5: int] : ( ~ (v5 = 0) & update_slb(create_slb, v3) = v4 & % 7.40/1.77 pair_in_list(v4, v1, v3) = v5 & pair_in_list(create_slb, v1, v2) = 0 & % 7.40/1.77 strictly_less_than(v2, v3) = 0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 7.40/1.77 % 7.40/1.77 Further assumptions not needed in the proof: % 7.40/1.77 -------------------------------------------- % 7.40/1.77 ax18, ax19, ax20, ax21, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30, % 7.40/1.77 bottom_smallest, reflexivity, stricly_smaller_definition, totality, transitivity % 7.40/1.77 % 7.40/1.77 Those formulas are unsatisfiable: % 7.40/1.77 --------------------------------- % 7.40/1.77 % 7.40/1.77 Begin of proof % 7.40/1.77 | % 7.40/1.77 | ALPHA: (ax22) implies: % 7.40/1.77 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (pair_in_list(create_slb, v0, v1) = 0) % 7.40/1.77 | | ~ $i(v1) | ~ $i(v0)) % 7.40/1.77 | % 7.40/1.77 | ALPHA: (l38_co) implies: % 7.73/1.78 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 7.73/1.78 | ? [v5: int] : ( ~ (v5 = 0) & update_slb(create_slb, v3) = v4 & % 7.73/1.78 | pair_in_list(v4, v1, v3) = v5 & pair_in_list(create_slb, v1, v2) = 0 % 7.73/1.78 | & strictly_less_than(v2, v3) = 0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) % 7.73/1.78 | & $i(v0)) % 7.73/1.78 | % 7.73/1.78 | DELTA: instantiating (2) with fresh symbols all_23_0, all_23_1, all_23_2, % 7.73/1.78 | all_23_3, all_23_4, all_23_5 gives: % 7.73/1.78 | (3) ~ (all_23_0 = 0) & update_slb(create_slb, all_23_2) = all_23_1 & % 7.73/1.78 | pair_in_list(all_23_1, all_23_4, all_23_2) = all_23_0 & % 7.73/1.78 | pair_in_list(create_slb, all_23_4, all_23_3) = 0 & % 7.73/1.78 | strictly_less_than(all_23_3, all_23_2) = 0 & $i(all_23_1) & % 7.73/1.78 | $i(all_23_2) & $i(all_23_3) & $i(all_23_4) & $i(all_23_5) % 7.73/1.78 | % 7.73/1.78 | ALPHA: (3) implies: % 7.73/1.78 | (4) $i(all_23_4) % 7.73/1.78 | (5) $i(all_23_3) % 7.73/1.78 | (6) pair_in_list(create_slb, all_23_4, all_23_3) = 0 % 7.73/1.78 | % 7.73/1.79 | GROUND_INST: instantiating (1) with all_23_4, all_23_3, simplifying with (4), % 7.73/1.79 | (5), (6) gives: % 7.73/1.79 | (7) $false % 7.73/1.79 | % 7.73/1.79 | CLOSE: (7) is inconsistent. % 7.73/1.79 | % 7.73/1.79 End of proof % 7.73/1.79 % SZS output end Proof for theBenchmark % 7.73/1.79 % 7.73/1.79 1171ms %------------------------------------------------------------------------------