%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV413+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 : n016.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:14 EDT 2023 % Result : Theorem 6.45s 1.60s % Output : Proof 8.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWV413+1 : TPTP v8.1.2. Released v3.3.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n016.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 10:16:30 EDT 2023 % 0.12/0.34 % CPUTime : % 0.54/0.62 ________ _____ % 0.54/0.62 ___ __ \_________(_)________________________________ % 0.54/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.54/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.54/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.54/0.62 % 0.54/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.54/0.62 (2023-06-19) % 0.54/0.62 % 0.54/0.62 (c) Philipp Rümmer, 2009-2023 % 0.54/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.54/0.62 Amanda Stjerna. % 0.54/0.62 Free software under BSD-3-Clause. % 0.54/0.62 % 0.54/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.54/0.62 % 0.54/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.66/0.63 Running up to 7 provers in parallel. % 0.66/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.66/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.66/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.66/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.66/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.66/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.66/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.62/1.04 Prover 1: Preprocessing ... % 2.62/1.05 Prover 4: Preprocessing ... % 2.62/1.07 Prover 0: Preprocessing ... % 3.05/1.08 Prover 2: Preprocessing ... % 3.05/1.08 Prover 5: Preprocessing ... % 3.05/1.08 Prover 6: Preprocessing ... % 3.05/1.09 Prover 3: Preprocessing ... % 5.19/1.44 Prover 6: Proving ... % 5.19/1.44 Prover 5: Proving ... % 5.19/1.46 Prover 1: Constructing countermodel ... % 5.88/1.48 Prover 3: Constructing countermodel ... % 6.09/1.49 Prover 2: Proving ... % 6.09/1.51 Prover 0: Proving ... % 6.09/1.51 Prover 4: Constructing countermodel ... % 6.45/1.60 Prover 2: proved (960ms) % 6.45/1.60 % 6.45/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.45/1.60 % 6.45/1.60 Prover 5: proved (957ms) % 6.45/1.60 % 6.45/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.45/1.60 % 6.45/1.60 Prover 3: stopped % 6.45/1.60 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.45/1.60 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.45/1.60 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.45/1.61 Prover 6: stopped % 6.45/1.61 Prover 0: stopped % 7.05/1.62 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.05/1.62 Prover 1: gave up % 7.05/1.62 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.05/1.63 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 7.05/1.64 Prover 7: Preprocessing ... % 7.05/1.64 Prover 10: Preprocessing ... % 7.05/1.64 Prover 11: Preprocessing ... % 7.05/1.65 Prover 8: Preprocessing ... % 7.05/1.66 Prover 13: Preprocessing ... % 7.05/1.66 Prover 16: Preprocessing ... % 7.51/1.74 Prover 10: Warning: ignoring some quantifiers % 7.51/1.76 Prover 10: Constructing countermodel ... % 8.14/1.77 Prover 7: Warning: ignoring some quantifiers % 8.14/1.78 Prover 8: Warning: ignoring some quantifiers % 8.14/1.78 Prover 16: Warning: ignoring some quantifiers % 8.14/1.78 Prover 7: Constructing countermodel ... % 8.29/1.79 Prover 8: Constructing countermodel ... % 8.29/1.80 Prover 16: Constructing countermodel ... % 8.29/1.81 Prover 13: Warning: ignoring some quantifiers % 8.61/1.83 Prover 11: Constructing countermodel ... % 8.61/1.83 Prover 10: Found proof (size 5) % 8.61/1.83 Prover 10: proved (224ms) % 8.61/1.83 Prover 16: stopped % 8.61/1.83 Prover 8: stopped % 8.61/1.83 Prover 4: Found proof (size 42) % 8.61/1.83 Prover 4: proved (1192ms) % 8.61/1.83 Prover 7: Found proof (size 6) % 8.61/1.83 Prover 7: proved (230ms) % 8.61/1.83 Prover 11: stopped % 8.61/1.83 Prover 13: Constructing countermodel ... % 8.61/1.84 Prover 13: stopped % 8.61/1.84 % 8.61/1.84 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.61/1.84 % 8.61/1.84 % SZS output start Proof for theBenchmark % 8.61/1.85 Assumptions after simplification: % 8.61/1.85 --------------------------------- % 8.61/1.85 % 8.61/1.85 (l49_co) % 8.61/1.87 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 8.61/1.87 (update_slb(v0, v3) = v4 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 8.61/1.87 pair_in_list(v0, v1, v2) & strictly_less_than(v1, v3) & less_than(v3, v2) & % 8.61/1.87 ! [v5: $i] : ( ~ $i(v5) | ~ pair_in_list(v4, v1, v5) | ~ less_than(v3, % 8.61/1.87 v5))) % 8.61/1.87 % 8.61/1.87 (l49_li3637) % 8.61/1.87 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ % 8.61/1.87 (update_slb(v0, v3) = v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 8.61/1.87 ~ pair_in_list(v0, v1, v2) | ~ less_than(v3, v2) | pair_in_list(v4, v1, % 8.61/1.87 v2)) % 8.61/1.87 % 8.61/1.87 Further assumptions not needed in the proof: % 8.61/1.87 -------------------------------------------- % 8.61/1.87 ax18, ax19, ax20, ax21, ax22, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30, % 8.61/1.87 bottom_smallest, reflexivity, stricly_smaller_definition, totality, transitivity % 8.61/1.87 % 8.61/1.87 Those formulas are unsatisfiable: % 8.61/1.88 --------------------------------- % 8.61/1.88 % 8.61/1.88 Begin of proof % 8.61/1.88 | % 8.61/1.88 | DELTA: instantiating (l49_co) with fresh symbols all_22_0, all_22_1, all_22_2, % 8.61/1.88 | all_22_3, all_22_4 gives: % 8.61/1.88 | (1) update_slb(all_22_4, all_22_1) = all_22_0 & $i(all_22_0) & $i(all_22_1) % 8.61/1.88 | & $i(all_22_2) & $i(all_22_3) & $i(all_22_4) & pair_in_list(all_22_4, % 8.61/1.88 | all_22_3, all_22_2) & strictly_less_than(all_22_3, all_22_1) & % 8.61/1.88 | less_than(all_22_1, all_22_2) & ! [v0: $i] : ( ~ $i(v0) | ~ % 8.61/1.88 | pair_in_list(all_22_0, all_22_3, v0) | ~ less_than(all_22_1, v0)) % 8.61/1.88 | % 8.61/1.88 | ALPHA: (1) implies: % 8.61/1.88 | (2) less_than(all_22_1, all_22_2) % 8.61/1.88 | (3) pair_in_list(all_22_4, all_22_3, all_22_2) % 8.61/1.88 | (4) $i(all_22_4) % 8.61/1.88 | (5) $i(all_22_3) % 8.61/1.88 | (6) $i(all_22_2) % 8.61/1.88 | (7) $i(all_22_1) % 8.61/1.88 | (8) update_slb(all_22_4, all_22_1) = all_22_0 % 8.61/1.88 | (9) ! [v0: $i] : ( ~ $i(v0) | ~ pair_in_list(all_22_0, all_22_3, v0) | ~ % 8.61/1.88 | less_than(all_22_1, v0)) % 8.61/1.88 | % 8.61/1.88 | GROUND_INST: instantiating (l49_li3637) with all_22_4, all_22_3, all_22_2, % 8.61/1.88 | all_22_1, all_22_0, simplifying with (2), (3), (4), (5), (6), % 8.61/1.88 | (7), (8) gives: % 8.61/1.88 | (10) pair_in_list(all_22_0, all_22_3, all_22_2) % 8.61/1.88 | % 8.61/1.89 | GROUND_INST: instantiating (9) with all_22_2, simplifying with (2), (6), (10) % 8.61/1.89 | gives: % 8.61/1.89 | (11) $false % 8.61/1.89 | % 8.61/1.89 | CLOSE: (11) is inconsistent. % 8.61/1.89 | % 8.61/1.89 End of proof % 8.61/1.89 % SZS output end Proof for theBenchmark % 8.61/1.89 % 8.61/1.89 1267ms %------------------------------------------------------------------------------